./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe015_power.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/protection/safe015_power.oepc.yml/witness.yml --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version bcb38a6f
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe015_power.oepc.i ./goblint.2024-05-21_14-57-05.files/protection/safe015_power.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m
[2024-06-03 20:09:14,737 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-06-03 20:09:14,813 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-03 20:09:14,819 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-06-03 20:09:14,819 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-03 20:09:14,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-03 20:09:14,840 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-03 20:09:14,841 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-03 20:09:14,841 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-03 20:09:14,842 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-06-03 20:09:14,842 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-03 20:09:14,842 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-03 20:09:14,843 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-03 20:09:14,843 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-06-03 20:09:14,844 INFO L153 SettingsManager]: * Use SBE=true
[2024-06-03 20:09:14,844 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-03 20:09:14,844 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-06-03 20:09:14,845 INFO L153 SettingsManager]: * sizeof long=4
[2024-06-03 20:09:14,845 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-06-03 20:09:14,845 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-06-03 20:09:14,846 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-06-03 20:09:14,846 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-06-03 20:09:14,846 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-03 20:09:14,847 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-06-03 20:09:14,847 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-06-03 20:09:14,847 INFO L153 SettingsManager]: * sizeof long double=12
[2024-06-03 20:09:14,848 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-06-03 20:09:14,848 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-06-03 20:09:14,848 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-03 20:09:14,848 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-06-03 20:09:14,849 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-06-03 20:09:14,849 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-06-03 20:09:14,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-03 20:09:14,849 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-03 20:09:14,850 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-06-03 20:09:14,850 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-03 20:09:14,850 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-06-03 20:09:14,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-03 20:09:14,850 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-03 20:09:14,851 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-03 20:09:14,851 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-03 20:09:14,851 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-06-03 20:09:14,851 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-03 20:09:14,852 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-03 20:09:15,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-03 20:09:15,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-03 20:09:15,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-03 20:09:15,154 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-06-03 20:09:15,154 INFO L274 PluginConnector]: CDTParser initialized
[2024-06-03 20:09:15,155 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe015_power.oepc.i
[2024-06-03 20:09:16,272 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-06-03 20:09:16,540 INFO L384 CDTParser]: Found 1 translation units.
[2024-06-03 20:09:16,541 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe015_power.oepc.i
[2024-06-03 20:09:16,555 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af6f45a41/9fcde475f5974e008ad0879ecc8e472a/FLAG00bb2463e
[2024-06-03 20:09:16,568 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af6f45a41/9fcde475f5974e008ad0879ecc8e472a
[2024-06-03 20:09:16,572 INFO L270 PluginConnector]: Initializing Witness Parser...
[2024-06-03 20:09:16,573 INFO L274 PluginConnector]: Witness Parser initialized
[2024-06-03 20:09:16,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/protection/safe015_power.oepc.yml/witness.yml
[2024-06-03 20:09:16,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-03 20:09:16,810 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-03 20:09:16,812 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-03 20:09:16,812 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-03 20:09:16,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-03 20:09:16,818 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 08:09:16" (1/2) ...
[2024-06-03 20:09:16,819 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71b03966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:09:16, skipping insertion in model container
[2024-06-03 20:09:16,819 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 08:09:16" (1/2) ...
[2024-06-03 20:09:16,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@28d52cc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:09:16, skipping insertion in model container
[2024-06-03 20:09:16,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:09:16" (2/2) ...
[2024-06-03 20:09:16,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71b03966 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:09:16, skipping insertion in model container
[2024-06-03 20:09:16,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:09:16" (2/2) ...
[2024-06-03 20:09:16,822 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-03 20:09:16,975 INFO L95 edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-03 20:09:16,977 INFO L97 edCorrectnessWitness]: Location invariant before [L874-L874] (((((((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 2) && x$w_buff0 <= 127) && ((x$w_buff0 == 0 || x$w_buff0 == 1) || x$w_buff0 == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$mem_tmp && x$mem_tmp <= 2) && x$mem_tmp <= 127) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 2) && *__unbuffered_p2_EAX$read_delayed_var <= 127) && __unbuffered_p2_EAX$read_delayed_var == & x) && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2))))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 2) && x$w_buff1 <= 127) && ((x$w_buff1 == 0 || x$w_buff1 == 1) || x$w_buff1 == 2)))) && (! multithreaded || x$flush_delayed == (_Bool)0)
[2024-06-03 20:09:16,977 INFO L97 edCorrectnessWitness]: Location invariant before [L877-L877] (((((((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 2) && x$w_buff0 <= 127) && ((x$w_buff0 == 0 || x$w_buff0 == 1) || x$w_buff0 == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$mem_tmp && x$mem_tmp <= 2) && x$mem_tmp <= 127) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 2) && *__unbuffered_p2_EAX$read_delayed_var <= 127) && __unbuffered_p2_EAX$read_delayed_var == & x) && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2))))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 2) && x$w_buff1 <= 127) && ((x$w_buff1 == 0 || x$w_buff1 == 1) || x$w_buff1 == 2)))) && (! multithreaded || x$flush_delayed == (_Bool)0)
[2024-06-03 20:09:16,977 INFO L97 edCorrectnessWitness]: Location invariant before [L876-L876] (((((((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 2) && x$w_buff0 <= 127) && ((x$w_buff0 == 0 || x$w_buff0 == 1) || x$w_buff0 == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$mem_tmp && x$mem_tmp <= 2) && x$mem_tmp <= 127) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 2) && *__unbuffered_p2_EAX$read_delayed_var <= 127) && __unbuffered_p2_EAX$read_delayed_var == & x) && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2))))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 2) && x$w_buff1 <= 127) && ((x$w_buff1 == 0 || x$w_buff1 == 1) || x$w_buff1 == 2)))) && (! multithreaded || x$flush_delayed == (_Bool)0)
[2024-06-03 20:09:16,977 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-03 20:09:16,978 INFO L106 edCorrectnessWitness]: ghost_update [L872-L872] multithreaded = 1;
[2024-06-03 20:09:17,024 INFO L177 MainTranslator]: Built tables and reachable declarations
[2024-06-03 20:09:17,396 INFO L207 PostProcessor]: Analyzing one entry point: main
[2024-06-03 20:09:17,413 INFO L202 MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-03 20:09:17,576 INFO L207 PostProcessor]: Analyzing one entry point: main
[2024-06-03 20:09:17,619 INFO L206 MainTranslator]: Completed translation
[2024-06-03 20:09:17,619 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:09:17 WrapperNode
[2024-06-03 20:09:17,620 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-03 20:09:17,621 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-03 20:09:17,621 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-03 20:09:17,621 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-03 20:09:17,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:09:17" (1/1) ...
[2024-06-03 20:09:17,649 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:09:17" (1/1) ...
[2024-06-03 20:09:17,698 INFO L138 Inliner]: procedures = 175, calls = 111, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 338
[2024-06-03 20:09:17,698 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-03 20:09:17,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-03 20:09:17,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-03 20:09:17,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-06-03 20:09:17,734 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:09:17" (1/1) ...
[2024-06-03 20:09:17,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:09:17" (1/1) ...
[2024-06-03 20:09:17,739 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:09:17" (1/1) ...
[2024-06-03 20:09:17,790 INFO L175 MemorySlicer]: Split 66 memory accesses to 2 slices as follows [2, 64]. 97 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 9 writes are split as follows [0, 9].
[2024-06-03 20:09:17,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:09:17" (1/1) ...
[2024-06-03 20:09:17,801 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:09:17" (1/1) ...
[2024-06-03 20:09:17,818 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:09:17" (1/1) ...
[2024-06-03 20:09:17,834 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:09:17" (1/1) ...
[2024-06-03 20:09:17,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:09:17" (1/1) ...
[2024-06-03 20:09:17,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:09:17" (1/1) ...
[2024-06-03 20:09:17,854 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-03 20:09:17,866 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-03 20:09:17,866 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-06-03 20:09:17,866 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-06-03 20:09:17,867 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:09:17" (1/1) ...
[2024-06-03 20:09:17,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-03 20:09:17,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-03 20:09:17,894 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-03 20:09:17,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-03 20:09:17,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0
[2024-06-03 20:09:17,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1
[2024-06-03 20:09:17,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0
[2024-06-03 20:09:17,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1
[2024-06-03 20:09:17,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-03 20:09:17,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-03 20:09:17,932 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-06-03 20:09:17,932 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-06-03 20:09:17,932 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-06-03 20:09:17,933 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-06-03 20:09:17,933 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2024-06-03 20:09:17,933 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2024-06-03 20:09:17,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-03 20:09:17,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1
[2024-06-03 20:09:17,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-03 20:09:17,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-03 20:09:17,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-03 20:09:17,938 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-03 20:09:18,120 INFO L244 CfgBuilder]: Building ICFG
[2024-06-03 20:09:18,124 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-03 20:09:18,779 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-03 20:09:18,779 INFO L293 CfgBuilder]: Performing block encoding
[2024-06-03 20:09:19,454 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-03 20:09:19,455 INFO L320 CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-03 20:09:19,455 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 08:09:19 BoogieIcfgContainer
[2024-06-03 20:09:19,455 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-03 20:09:19,458 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-03 20:09:19,459 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-06-03 20:09:19,461 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-06-03 20:09:19,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 08:09:16" (1/4) ...
[2024-06-03 20:09:19,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7adec54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 08:09:19, skipping insertion in model container
[2024-06-03 20:09:19,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:09:16" (2/4) ...
[2024-06-03 20:09:19,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7adec54 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 08:09:19, skipping insertion in model container
[2024-06-03 20:09:19,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:09:17" (3/4) ...
[2024-06-03 20:09:19,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7adec54 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 08:09:19, skipping insertion in model container
[2024-06-03 20:09:19,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 08:09:19" (4/4) ...
[2024-06-03 20:09:19,464 INFO L112 eAbstractionObserver]: Analyzing ICFG safe015_power.oepc.i
[2024-06-03 20:09:19,483 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-03 20:09:19,483 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-03 20:09:19,483 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-03 20:09:19,563 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-03 20:09:19,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow
[2024-06-03 20:09:19,624 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events.
[2024-06-03 20:09:19,624 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-03 20:09:19,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place.
[2024-06-03 20:09:19,626 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow
[2024-06-03 20:09:19,629 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow
[2024-06-03 20:09:19,637 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-03 20:09:19,643 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;@4dfc6351, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-03 20:09:19,643 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-03 20:09:19,648 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-03 20:09:19,648 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-03 20:09:19,648 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-03 20:09:19,648 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-03 20:09:19,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-03 20:09:19,649 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 20:09:19,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 20:09:19,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1037568440, now seen corresponding path program 1 times
[2024-06-03 20:09:19,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 20:09:19,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412460851]
[2024-06-03 20:09:19,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 20:09:19,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 20:09:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 20:09:22,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 20:09:22,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 20:09:22,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412460851]
[2024-06-03 20:09:22,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412460851] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 20:09:22,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 20:09:22,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-03 20:09:22,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94040700]
[2024-06-03 20:09:22,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 20:09:22,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-03 20:09:22,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 20:09:22,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-03 20:09:22,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-06-03 20:09:22,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 20:09:22,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:09:22,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 20:09:22,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 20:09:22,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 20:09:22,800 INFO L124 PetriNetUnfolderBase]: 871/1364 cut-off events.
[2024-06-03 20:09:22,800 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES.
[2024-06-03 20:09:22,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2784 conditions, 1364 events. 871/1364 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6209 event pairs, 498 based on Foata normal form. 0/1359 useless extension candidates. Maximal degree in co-relation 2769. Up to 1333 conditions per place.
[2024-06-03 20:09:22,813 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 30 selfloop transitions, 7 changer transitions 0/44 dead transitions.
[2024-06-03 20:09:22,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 177 flow
[2024-06-03 20:09:22,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-06-03 20:09:22,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-03 20:09:22,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions.
[2024-06-03 20:09:22,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143
[2024-06-03 20:09:22,827 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 4 states and 78 transitions.
[2024-06-03 20:09:22,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 177 flow
[2024-06-03 20:09:22,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-03 20:09:22,834 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 119 flow
[2024-06-03 20:09:22,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=45, PETRI_TRANSITIONS=39}
[2024-06-03 20:09:22,839 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places.
[2024-06-03 20:09:22,839 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 119 flow
[2024-06-03 20:09:22,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:09:22,840 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-03 20:09:22,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 20:09:22,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-03 20:09:22,841 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 20:09:22,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 20:09:22,842 INFO L85 PathProgramCache]: Analyzing trace with hash -670787353, now seen corresponding path program 1 times
[2024-06-03 20:09:22,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 20:09:22,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867331605]
[2024-06-03 20:09:22,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 20:09:22,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 20:09:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 20:09:24,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 20:09:24,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 20:09:24,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867331605]
[2024-06-03 20:09:24,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867331605] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 20:09:24,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 20:09:24,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-03 20:09:24,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643050798]
[2024-06-03 20:09:24,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 20:09:24,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-03 20:09:24,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 20:09:24,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-03 20:09:24,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-06-03 20:09:24,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 20:09:24,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:09:24,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 20:09:24,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 20:09:24,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 20:09:25,568 INFO L124 PetriNetUnfolderBase]: 873/1366 cut-off events.
[2024-06-03 20:09:25,568 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES.
[2024-06-03 20:09:25,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3052 conditions, 1366 events. 873/1366 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6355 event pairs, 316 based on Foata normal form. 0/1361 useless extension candidates. Maximal degree in co-relation 3036. Up to 1301 conditions per place.
[2024-06-03 20:09:25,579 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 35 selfloop transitions, 14 changer transitions 0/56 dead transitions.
[2024-06-03 20:09:25,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 56 transitions, 267 flow
[2024-06-03 20:09:25,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-06-03 20:09:25,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 20:09:25,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions.
[2024-06-03 20:09:25,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713
[2024-06-03 20:09:25,583 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 119 flow. Second operand 5 states and 96 transitions.
[2024-06-03 20:09:25,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 56 transitions, 267 flow
[2024-06-03 20:09:25,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 56 transitions, 267 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-06-03 20:09:25,588 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 199 flow
[2024-06-03 20:09:25,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=51, PETRI_TRANSITIONS=47}
[2024-06-03 20:09:25,591 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places.
[2024-06-03 20:09:25,591 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 199 flow
[2024-06-03 20:09:25,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:09:25,592 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-03 20:09:25,592 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 20:09:25,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-03 20:09:25,598 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 20:09:25,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 20:09:25,599 INFO L85 PathProgramCache]: Analyzing trace with hash -670578103, now seen corresponding path program 2 times
[2024-06-03 20:09:25,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 20:09:25,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692266955]
[2024-06-03 20:09:25,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 20:09:25,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 20:09:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 20:09:27,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 20:09:27,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 20:09:27,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692266955]
[2024-06-03 20:09:27,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692266955] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 20:09:27,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 20:09:27,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-03 20:09:27,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083644944]
[2024-06-03 20:09:27,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 20:09:27,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-03 20:09:27,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 20:09:27,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-03 20:09:27,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-06-03 20:09:27,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 20:09:27,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:09:27,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 20:09:27,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 20:09:27,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 20:09:27,904 INFO L124 PetriNetUnfolderBase]: 871/1364 cut-off events.
[2024-06-03 20:09:27,904 INFO L125 PetriNetUnfolderBase]: For 535/539 co-relation queries the response was YES.
[2024-06-03 20:09:27,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3326 conditions, 1364 events. 871/1364 cut-off events. For 535/539 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6174 event pairs, 351 based on Foata normal form. 4/1368 useless extension candidates. Maximal degree in co-relation 3306. Up to 1300 conditions per place.
[2024-06-03 20:09:27,914 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 40 selfloop transitions, 12 changer transitions 0/59 dead transitions.
[2024-06-03 20:09:27,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 335 flow
[2024-06-03 20:09:27,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-06-03 20:09:27,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 20:09:27,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions.
[2024-06-03 20:09:27,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096
[2024-06-03 20:09:27,919 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 199 flow. Second operand 5 states and 101 transitions.
[2024-06-03 20:09:27,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 335 flow
[2024-06-03 20:09:27,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 59 transitions, 327 flow, removed 4 selfloop flow, removed 0 redundant places.
[2024-06-03 20:09:27,925 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 220 flow
[2024-06-03 20:09:27,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=220, PETRI_PLACES=56, PETRI_TRANSITIONS=47}
[2024-06-03 20:09:27,927 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places.
[2024-06-03 20:09:27,927 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 220 flow
[2024-06-03 20:09:27,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:09:27,927 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-03 20:09:27,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 20:09:27,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-03 20:09:27,928 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 20:09:27,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 20:09:27,929 INFO L85 PathProgramCache]: Analyzing trace with hash 679379807, now seen corresponding path program 1 times
[2024-06-03 20:09:27,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 20:09:27,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043662951]
[2024-06-03 20:09:27,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 20:09:27,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 20:09:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 20:09:29,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 20:09:29,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 20:09:29,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043662951]
[2024-06-03 20:09:29,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043662951] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 20:09:29,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 20:09:29,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-03 20:09:29,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028294218]
[2024-06-03 20:09:29,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 20:09:29,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-03 20:09:29,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 20:09:29,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-03 20:09:29,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-03 20:09:29,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 20:09:29,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:09:29,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 20:09:29,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 20:09:29,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 20:09:30,571 INFO L124 PetriNetUnfolderBase]: 917/1435 cut-off events.
[2024-06-03 20:09:30,571 INFO L125 PetriNetUnfolderBase]: For 460/464 co-relation queries the response was YES.
[2024-06-03 20:09:30,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3422 conditions, 1435 events. 917/1435 cut-off events. For 460/464 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6628 event pairs, 499 based on Foata normal form. 0/1406 useless extension candidates. Maximal degree in co-relation 3399. Up to 1406 conditions per place.
[2024-06-03 20:09:30,581 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 37 selfloop transitions, 10 changer transitions 0/54 dead transitions.
[2024-06-03 20:09:30,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 54 transitions, 345 flow
[2024-06-03 20:09:30,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-06-03 20:09:30,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 20:09:30,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions.
[2024-06-03 20:09:30,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4238095238095238
[2024-06-03 20:09:30,584 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 220 flow. Second operand 5 states and 89 transitions.
[2024-06-03 20:09:30,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 54 transitions, 345 flow
[2024-06-03 20:09:30,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 307 flow, removed 4 selfloop flow, removed 4 redundant places.
[2024-06-03 20:09:30,589 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 240 flow
[2024-06-03 20:09:30,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=240, PETRI_PLACES=58, PETRI_TRANSITIONS=51}
[2024-06-03 20:09:30,591 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 15 predicate places.
[2024-06-03 20:09:30,591 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 240 flow
[2024-06-03 20:09:30,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:09:30,592 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-03 20:09:30,592 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 20:09:30,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-03 20:09:30,593 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 20:09:30,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 20:09:30,594 INFO L85 PathProgramCache]: Analyzing trace with hash 49583520, now seen corresponding path program 1 times
[2024-06-03 20:09:30,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 20:09:30,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330243839]
[2024-06-03 20:09:30,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 20:09:30,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 20:09:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 20:09:32,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 20:09:32,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 20:09:32,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330243839]
[2024-06-03 20:09:32,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330243839] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 20:09:32,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 20:09:32,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 20:09:32,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486901939]
[2024-06-03 20:09:32,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 20:09:32,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 20:09:32,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 20:09:32,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 20:09:32,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-03 20:09:32,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 20:09:32,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 240 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:09:32,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 20:09:32,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 20:09:32,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 20:09:33,799 INFO L124 PetriNetUnfolderBase]: 921/1443 cut-off events.
[2024-06-03 20:09:33,800 INFO L125 PetriNetUnfolderBase]: For 473/479 co-relation queries the response was YES.
[2024-06-03 20:09:33,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3496 conditions, 1443 events. 921/1443 cut-off events. For 473/479 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6658 event pairs, 383 based on Foata normal form. 0/1414 useless extension candidates. Maximal degree in co-relation 3471. Up to 1373 conditions per place.
[2024-06-03 20:09:33,811 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 41 selfloop transitions, 17 changer transitions 0/65 dead transitions.
[2024-06-03 20:09:33,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 65 transitions, 408 flow
[2024-06-03 20:09:33,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-06-03 20:09:33,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 20:09:33,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions.
[2024-06-03 20:09:33,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44841269841269843
[2024-06-03 20:09:33,816 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 240 flow. Second operand 6 states and 113 transitions.
[2024-06-03 20:09:33,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 65 transitions, 408 flow
[2024-06-03 20:09:33,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 65 transitions, 399 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-06-03 20:09:33,818 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 305 flow
[2024-06-03 20:09:33,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=305, PETRI_PLACES=63, PETRI_TRANSITIONS=55}
[2024-06-03 20:09:33,819 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places.
[2024-06-03 20:09:33,819 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 305 flow
[2024-06-03 20:09:33,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:09:33,820 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-03 20:09:33,820 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 20:09:33,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-03 20:09:33,820 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 20:09:33,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 20:09:33,820 INFO L85 PathProgramCache]: Analyzing trace with hash 49017150, now seen corresponding path program 2 times
[2024-06-03 20:09:33,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 20:09:33,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113563748]
[2024-06-03 20:09:33,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 20:09:33,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 20:09:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 20:09:35,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 20:09:35,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 20:09:35,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113563748]
[2024-06-03 20:09:35,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113563748] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 20:09:35,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 20:09:35,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 20:09:35,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002173150]
[2024-06-03 20:09:35,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 20:09:35,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 20:09:35,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 20:09:35,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 20:09:35,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-03 20:09:35,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 20:09:35,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 305 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:09:35,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 20:09:35,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 20:09:35,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 20:09:36,833 INFO L124 PetriNetUnfolderBase]: 917/1437 cut-off events.
[2024-06-03 20:09:36,833 INFO L125 PetriNetUnfolderBase]: For 725/731 co-relation queries the response was YES.
[2024-06-03 20:09:36,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3622 conditions, 1437 events. 917/1437 cut-off events. For 725/731 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6673 event pairs, 346 based on Foata normal form. 2/1410 useless extension candidates. Maximal degree in co-relation 3594. Up to 1370 conditions per place.
[2024-06-03 20:09:36,842 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 37 selfloop transitions, 20 changer transitions 0/64 dead transitions.
[2024-06-03 20:09:36,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 64 transitions, 459 flow
[2024-06-03 20:09:36,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-06-03 20:09:36,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 20:09:36,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions.
[2024-06-03 20:09:36,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4246031746031746
[2024-06-03 20:09:36,844 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 305 flow. Second operand 6 states and 107 transitions.
[2024-06-03 20:09:36,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 64 transitions, 459 flow
[2024-06-03 20:09:36,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 433 flow, removed 2 selfloop flow, removed 3 redundant places.
[2024-06-03 20:09:36,849 INFO L231 Difference]: Finished difference. Result has 66 places, 58 transitions, 351 flow
[2024-06-03 20:09:36,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=351, PETRI_PLACES=66, PETRI_TRANSITIONS=58}
[2024-06-03 20:09:36,852 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places.
[2024-06-03 20:09:36,852 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 58 transitions, 351 flow
[2024-06-03 20:09:36,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:09:36,852 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-03 20:09:36,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 20:09:36,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-03 20:09:36,853 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 20:09:36,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 20:09:36,853 INFO L85 PathProgramCache]: Analyzing trace with hash 49024094, now seen corresponding path program 1 times
[2024-06-03 20:09:36,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 20:09:36,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477627222]
[2024-06-03 20:09:36,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 20:09:36,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 20:09:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 20:09:38,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 20:09:38,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 20:09:38,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477627222]
[2024-06-03 20:09:38,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477627222] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 20:09:38,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 20:09:38,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 20:09:38,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707523011]
[2024-06-03 20:09:38,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 20:09:38,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 20:09:38,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 20:09:38,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 20:09:38,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-03 20:09:38,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 20:09:38,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 58 transitions, 351 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:09:38,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 20:09:38,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 20:09:38,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 20:09:39,657 INFO L124 PetriNetUnfolderBase]: 919/1440 cut-off events.
[2024-06-03 20:09:39,658 INFO L125 PetriNetUnfolderBase]: For 833/839 co-relation queries the response was YES.
[2024-06-03 20:09:39,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3697 conditions, 1440 events. 919/1440 cut-off events. For 833/839 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6647 event pairs, 472 based on Foata normal form. 2/1415 useless extension candidates. Maximal degree in co-relation 3668. Up to 1408 conditions per place.
[2024-06-03 20:09:39,668 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 44 selfloop transitions, 13 changer transitions 0/64 dead transitions.
[2024-06-03 20:09:39,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 64 transitions, 489 flow
[2024-06-03 20:09:39,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-06-03 20:09:39,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 20:09:39,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions.
[2024-06-03 20:09:39,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477
[2024-06-03 20:09:39,670 INFO L175 Difference]: Start difference. First operand has 66 places, 58 transitions, 351 flow. Second operand 6 states and 102 transitions.
[2024-06-03 20:09:39,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 64 transitions, 489 flow
[2024-06-03 20:09:39,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 64 transitions, 462 flow, removed 2 selfloop flow, removed 3 redundant places.
[2024-06-03 20:09:39,674 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 376 flow
[2024-06-03 20:09:39,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=69, PETRI_TRANSITIONS=61}
[2024-06-03 20:09:39,675 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places.
[2024-06-03 20:09:39,675 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 376 flow
[2024-06-03 20:09:39,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:09:39,676 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-03 20:09:39,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 20:09:39,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-03 20:09:39,676 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 20:09:39,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 20:09:39,677 INFO L85 PathProgramCache]: Analyzing trace with hash 49798784, now seen corresponding path program 2 times
[2024-06-03 20:09:39,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 20:09:39,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446912534]
[2024-06-03 20:09:39,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 20:09:39,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 20:09:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 20:09:41,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 20:09:41,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 20:09:41,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446912534]
[2024-06-03 20:09:41,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446912534] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 20:09:41,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 20:09:41,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 20:09:41,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109361775]
[2024-06-03 20:09:41,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 20:09:41,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 20:09:41,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 20:09:41,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 20:09:41,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-03 20:09:41,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 20:09:41,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 376 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:09:41,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 20:09:41,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 20:09:41,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 20:09:42,366 INFO L124 PetriNetUnfolderBase]: 917/1437 cut-off events.
[2024-06-03 20:09:42,366 INFO L125 PetriNetUnfolderBase]: For 1194/1198 co-relation queries the response was YES.
[2024-06-03 20:09:42,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3893 conditions, 1437 events. 917/1437 cut-off events. For 1194/1198 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6545 event pairs, 462 based on Foata normal form. 0/1411 useless extension candidates. Maximal degree in co-relation 3862. Up to 1396 conditions per place.
[2024-06-03 20:09:42,377 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 49 selfloop transitions, 17 changer transitions 0/73 dead transitions.
[2024-06-03 20:09:42,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 73 transitions, 564 flow
[2024-06-03 20:09:42,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-06-03 20:09:42,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 20:09:42,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions.
[2024-06-03 20:09:42,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4246031746031746
[2024-06-03 20:09:42,379 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 376 flow. Second operand 6 states and 107 transitions.
[2024-06-03 20:09:42,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 73 transitions, 564 flow
[2024-06-03 20:09:42,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 73 transitions, 534 flow, removed 4 selfloop flow, removed 4 redundant places.
[2024-06-03 20:09:42,383 INFO L231 Difference]: Finished difference. Result has 72 places, 68 transitions, 445 flow
[2024-06-03 20:09:42,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=445, PETRI_PLACES=72, PETRI_TRANSITIONS=68}
[2024-06-03 20:09:42,386 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places.
[2024-06-03 20:09:42,386 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 68 transitions, 445 flow
[2024-06-03 20:09:42,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:09:42,387 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-03 20:09:42,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 20:09:42,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-03 20:09:42,388 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 20:09:42,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 20:09:42,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1529056731, now seen corresponding path program 1 times
[2024-06-03 20:09:42,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 20:09:42,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520518638]
[2024-06-03 20:09:42,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 20:09:42,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 20:09:42,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 20:09:45,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 20:09:45,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 20:09:45,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520518638]
[2024-06-03 20:09:45,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520518638] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 20:09:45,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 20:09:45,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 20:09:45,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855907916]
[2024-06-03 20:09:45,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 20:09:45,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 20:09:45,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 20:09:45,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 20:09:45,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-03 20:09:45,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 20:09:45,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 68 transitions, 445 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:09:45,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 20:09:45,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 20:09:45,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 20:09:45,806 INFO L124 PetriNetUnfolderBase]: 892/1411 cut-off events.
[2024-06-03 20:09:45,806 INFO L125 PetriNetUnfolderBase]: For 2127/2277 co-relation queries the response was YES.
[2024-06-03 20:09:45,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4051 conditions, 1411 events. 892/1411 cut-off events. For 2127/2277 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6557 event pairs, 316 based on Foata normal form. 6/1410 useless extension candidates. Maximal degree in co-relation 4018. Up to 1335 conditions per place.
[2024-06-03 20:09:45,817 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 48 selfloop transitions, 22 changer transitions 0/77 dead transitions.
[2024-06-03 20:09:45,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 77 transitions, 615 flow
[2024-06-03 20:09:45,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-06-03 20:09:45,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 20:09:45,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions.
[2024-06-03 20:09:45,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4013605442176871
[2024-06-03 20:09:45,819 INFO L175 Difference]: Start difference. First operand has 72 places, 68 transitions, 445 flow. Second operand 7 states and 118 transitions.
[2024-06-03 20:09:45,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 77 transitions, 615 flow
[2024-06-03 20:09:45,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 77 transitions, 575 flow, removed 12 selfloop flow, removed 3 redundant places.
[2024-06-03 20:09:45,825 INFO L231 Difference]: Finished difference. Result has 77 places, 71 transitions, 474 flow
[2024-06-03 20:09:45,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=474, PETRI_PLACES=77, PETRI_TRANSITIONS=71}
[2024-06-03 20:09:45,827 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places.
[2024-06-03 20:09:45,827 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 71 transitions, 474 flow
[2024-06-03 20:09:45,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:09:45,827 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-03 20:09:45,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 20:09:45,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-03 20:09:45,828 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 20:09:45,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 20:09:45,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1519748805, now seen corresponding path program 1 times
[2024-06-03 20:09:45,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 20:09:45,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125368738]
[2024-06-03 20:09:45,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 20:09:45,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 20:09:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 20:09:45,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 20:09:45,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 20:09:45,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125368738]
[2024-06-03 20:09:45,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125368738] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 20:09:45,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 20:09:45,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-03 20:09:45,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568485983]
[2024-06-03 20:09:45,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 20:09:45,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-03 20:09:45,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 20:09:45,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-03 20:09:45,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-03 20:09:45,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 42
[2024-06-03 20:09:45,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 71 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:09:45,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 20:09:45,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 42
[2024-06-03 20:09:45,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 20:09:46,163 INFO L124 PetriNetUnfolderBase]: 413/842 cut-off events.
[2024-06-03 20:09:46,163 INFO L125 PetriNetUnfolderBase]: For 1212/1281 co-relation queries the response was YES.
[2024-06-03 20:09:46,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2216 conditions, 842 events. 413/842 cut-off events. For 1212/1281 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4846 event pairs, 193 based on Foata normal form. 53/869 useless extension candidates. Maximal degree in co-relation 2182. Up to 486 conditions per place.
[2024-06-03 20:09:46,173 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 42 selfloop transitions, 12 changer transitions 0/78 dead transitions.
[2024-06-03 20:09:46,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 78 transitions, 607 flow
[2024-06-03 20:09:46,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-06-03 20:09:46,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-03 20:09:46,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions.
[2024-06-03 20:09:46,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.626984126984127
[2024-06-03 20:09:46,175 INFO L175 Difference]: Start difference. First operand has 77 places, 71 transitions, 474 flow. Second operand 3 states and 79 transitions.
[2024-06-03 20:09:46,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 78 transitions, 607 flow
[2024-06-03 20:09:46,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 78 transitions, 563 flow, removed 2 selfloop flow, removed 4 redundant places.
[2024-06-03 20:09:46,179 INFO L231 Difference]: Finished difference. Result has 76 places, 72 transitions, 469 flow
[2024-06-03 20:09:46,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=469, PETRI_PLACES=76, PETRI_TRANSITIONS=72}
[2024-06-03 20:09:46,181 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places.
[2024-06-03 20:09:46,181 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 72 transitions, 469 flow
[2024-06-03 20:09:46,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:09:46,181 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-03 20:09:46,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 20:09:46,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-03 20:09:46,182 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 20:09:46,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 20:09:46,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1519073850, now seen corresponding path program 1 times
[2024-06-03 20:09:46,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 20:09:46,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324664992]
[2024-06-03 20:09:46,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 20:09:46,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 20:09:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 20:09:48,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 20:09:48,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 20:09:48,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324664992]
[2024-06-03 20:09:48,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324664992] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 20:09:48,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 20:09:48,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-03 20:09:48,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589921843]
[2024-06-03 20:09:48,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 20:09:48,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-03 20:09:48,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 20:09:48,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-03 20:09:48,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-03 20:09:48,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 20:09:48,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 72 transitions, 469 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:09:48,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 20:09:48,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 20:09:48,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 20:09:49,104 INFO L124 PetriNetUnfolderBase]: 1459/2249 cut-off events.
[2024-06-03 20:09:49,104 INFO L125 PetriNetUnfolderBase]: For 3616/3748 co-relation queries the response was YES.
[2024-06-03 20:09:49,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6771 conditions, 2249 events. 1459/2249 cut-off events. For 3616/3748 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 11375 event pairs, 1048 based on Foata normal form. 1/2247 useless extension candidates. Maximal degree in co-relation 6737. Up to 2211 conditions per place.
[2024-06-03 20:09:49,118 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 59 selfloop transitions, 12 changer transitions 0/78 dead transitions.
[2024-06-03 20:09:49,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 78 transitions, 654 flow
[2024-06-03 20:09:49,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-06-03 20:09:49,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 20:09:49,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions.
[2024-06-03 20:09:49,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-03 20:09:49,119 INFO L175 Difference]: Start difference. First operand has 76 places, 72 transitions, 469 flow. Second operand 5 states and 90 transitions.
[2024-06-03 20:09:49,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 78 transitions, 654 flow
[2024-06-03 20:09:49,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 78 transitions, 637 flow, removed 2 selfloop flow, removed 1 redundant places.
[2024-06-03 20:09:49,129 INFO L231 Difference]: Finished difference. Result has 81 places, 76 transitions, 527 flow
[2024-06-03 20:09:49,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=527, PETRI_PLACES=81, PETRI_TRANSITIONS=76}
[2024-06-03 20:09:49,129 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places.
[2024-06-03 20:09:49,130 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 76 transitions, 527 flow
[2024-06-03 20:09:49,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:09:49,130 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-03 20:09:49,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 20:09:49,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-03 20:09:49,130 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 20:09:49,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 20:09:49,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1297210701, now seen corresponding path program 2 times
[2024-06-03 20:09:49,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 20:09:49,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776588849]
[2024-06-03 20:09:49,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 20:09:49,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 20:09:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 20:09:51,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 20:09:51,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 20:09:51,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776588849]
[2024-06-03 20:09:51,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776588849] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 20:09:51,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 20:09:51,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 20:09:51,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97334052]
[2024-06-03 20:09:51,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 20:09:51,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 20:09:51,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 20:09:51,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 20:09:51,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-06-03 20:09:51,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 20:09:51,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 76 transitions, 527 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:09:51,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 20:09:51,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 20:09:51,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 20:09:52,539 INFO L124 PetriNetUnfolderBase]: 947/1529 cut-off events.
[2024-06-03 20:09:52,539 INFO L125 PetriNetUnfolderBase]: For 2549/2679 co-relation queries the response was YES.
[2024-06-03 20:09:52,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4865 conditions, 1529 events. 947/1529 cut-off events. For 2549/2679 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7450 event pairs, 344 based on Foata normal form. 2/1528 useless extension candidates. Maximal degree in co-relation 4827. Up to 1445 conditions per place.
[2024-06-03 20:09:52,551 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 62 selfloop transitions, 29 changer transitions 0/98 dead transitions.
[2024-06-03 20:09:52,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 98 transitions, 847 flow
[2024-06-03 20:09:52,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-06-03 20:09:52,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 20:09:52,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions.
[2024-06-03 20:09:52,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445578231292517
[2024-06-03 20:09:52,554 INFO L175 Difference]: Start difference. First operand has 81 places, 76 transitions, 527 flow. Second operand 7 states and 131 transitions.
[2024-06-03 20:09:52,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 98 transitions, 847 flow
[2024-06-03 20:09:52,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 98 transitions, 835 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-06-03 20:09:52,560 INFO L231 Difference]: Finished difference. Result has 89 places, 85 transitions, 689 flow
[2024-06-03 20:09:52,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=689, PETRI_PLACES=89, PETRI_TRANSITIONS=85}
[2024-06-03 20:09:52,561 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 46 predicate places.
[2024-06-03 20:09:52,561 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 85 transitions, 689 flow
[2024-06-03 20:09:52,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:09:52,561 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-03 20:09:52,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 20:09:52,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-03 20:09:52,562 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 20:09:52,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 20:09:52,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1555815801, now seen corresponding path program 3 times
[2024-06-03 20:09:52,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 20:09:52,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661976949]
[2024-06-03 20:09:52,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 20:09:52,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 20:09:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 20:09:54,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 20:09:54,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 20:09:54,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661976949]
[2024-06-03 20:09:54,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661976949] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 20:09:54,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 20:09:54,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 20:09:54,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439662050]
[2024-06-03 20:09:54,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 20:09:54,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 20:09:54,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 20:09:54,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 20:09:54,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-03 20:09:54,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 20:09:54,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 85 transitions, 689 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:09:54,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 20:09:54,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 20:09:54,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 20:09:55,530 INFO L124 PetriNetUnfolderBase]: 948/1531 cut-off events.
[2024-06-03 20:09:55,531 INFO L125 PetriNetUnfolderBase]: For 3052/3182 co-relation queries the response was YES.
[2024-06-03 20:09:55,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5028 conditions, 1531 events. 948/1531 cut-off events. For 3052/3182 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7469 event pairs, 347 based on Foata normal form. 2/1530 useless extension candidates. Maximal degree in co-relation 4986. Up to 1448 conditions per place.
[2024-06-03 20:09:55,538 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 56 selfloop transitions, 31 changer transitions 0/94 dead transitions.
[2024-06-03 20:09:55,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 94 transitions, 914 flow
[2024-06-03 20:09:55,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-06-03 20:09:55,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 20:09:55,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions.
[2024-06-03 20:09:55,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42517006802721086
[2024-06-03 20:09:55,540 INFO L175 Difference]: Start difference. First operand has 89 places, 85 transitions, 689 flow. Second operand 7 states and 125 transitions.
[2024-06-03 20:09:55,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 94 transitions, 914 flow
[2024-06-03 20:09:55,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 94 transitions, 872 flow, removed 6 selfloop flow, removed 2 redundant places.
[2024-06-03 20:09:55,547 INFO L231 Difference]: Finished difference. Result has 95 places, 88 transitions, 752 flow
[2024-06-03 20:09:55,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=752, PETRI_PLACES=95, PETRI_TRANSITIONS=88}
[2024-06-03 20:09:55,548 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 52 predicate places.
[2024-06-03 20:09:55,548 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 88 transitions, 752 flow
[2024-06-03 20:09:55,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:09:55,548 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-03 20:09:55,548 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 20:09:55,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-03 20:09:55,549 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 20:09:55,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 20:09:55,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1297199541, now seen corresponding path program 4 times
[2024-06-03 20:09:55,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 20:09:55,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835023991]
[2024-06-03 20:09:55,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 20:09:55,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 20:09:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 20:09:57,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 20:09:57,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 20:09:57,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835023991]
[2024-06-03 20:09:57,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835023991] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 20:09:57,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 20:09:57,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 20:09:57,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423041443]
[2024-06-03 20:09:57,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 20:09:57,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 20:09:57,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 20:09:57,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 20:09:57,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-06-03 20:09:57,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 20:09:57,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 88 transitions, 752 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:09:57,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 20:09:57,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 20:09:57,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 20:09:58,605 INFO L124 PetriNetUnfolderBase]: 946/1531 cut-off events.
[2024-06-03 20:09:58,606 INFO L125 PetriNetUnfolderBase]: For 3052/3191 co-relation queries the response was YES.
[2024-06-03 20:09:58,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4975 conditions, 1531 events. 946/1531 cut-off events. For 3052/3191 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7470 event pairs, 265 based on Foata normal form. 2/1530 useless extension candidates. Maximal degree in co-relation 4931. Up to 1408 conditions per place.
[2024-06-03 20:09:58,614 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 68 selfloop transitions, 31 changer transitions 0/106 dead transitions.
[2024-06-03 20:09:58,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 106 transitions, 1033 flow
[2024-06-03 20:09:58,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-06-03 20:09:58,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 20:09:58,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions.
[2024-06-03 20:09:58,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45918367346938777
[2024-06-03 20:09:58,616 INFO L175 Difference]: Start difference. First operand has 95 places, 88 transitions, 752 flow. Second operand 7 states and 135 transitions.
[2024-06-03 20:09:58,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 106 transitions, 1033 flow
[2024-06-03 20:09:58,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 106 transitions, 947 flow, removed 7 selfloop flow, removed 7 redundant places.
[2024-06-03 20:09:58,623 INFO L231 Difference]: Finished difference. Result has 94 places, 89 transitions, 742 flow
[2024-06-03 20:09:58,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=742, PETRI_PLACES=94, PETRI_TRANSITIONS=89}
[2024-06-03 20:09:58,624 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 51 predicate places.
[2024-06-03 20:09:58,624 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 89 transitions, 742 flow
[2024-06-03 20:09:58,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:09:58,625 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-03 20:09:58,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 20:09:58,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-03 20:09:58,625 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 20:09:58,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 20:09:58,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1382945161, now seen corresponding path program 1 times
[2024-06-03 20:09:58,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 20:09:58,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811827574]
[2024-06-03 20:09:58,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 20:09:58,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 20:09:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 20:10:00,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 20:10:00,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 20:10:00,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811827574]
[2024-06-03 20:10:00,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811827574] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 20:10:00,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 20:10:00,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 20:10:00,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213091537]
[2024-06-03 20:10:00,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 20:10:00,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 20:10:00,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 20:10:00,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 20:10:00,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 20:10:00,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 20:10:00,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 89 transitions, 742 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:10:00,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 20:10:00,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 20:10:00,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 20:10:01,369 INFO L124 PetriNetUnfolderBase]: 995/1616 cut-off events.
[2024-06-03 20:10:01,370 INFO L125 PetriNetUnfolderBase]: For 3170/3172 co-relation queries the response was YES.
[2024-06-03 20:10:01,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5416 conditions, 1616 events. 995/1616 cut-off events. For 3170/3172 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8008 event pairs, 340 based on Foata normal form. 0/1593 useless extension candidates. Maximal degree in co-relation 5374. Up to 1525 conditions per place.
[2024-06-03 20:10:01,380 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 79 selfloop transitions, 26 changer transitions 0/111 dead transitions.
[2024-06-03 20:10:01,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 111 transitions, 1091 flow
[2024-06-03 20:10:01,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-06-03 20:10:01,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 20:10:01,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions.
[2024-06-03 20:10:01,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4421768707482993
[2024-06-03 20:10:01,382 INFO L175 Difference]: Start difference. First operand has 94 places, 89 transitions, 742 flow. Second operand 7 states and 130 transitions.
[2024-06-03 20:10:01,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 111 transitions, 1091 flow
[2024-06-03 20:10:01,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 111 transitions, 1005 flow, removed 8 selfloop flow, removed 8 redundant places.
[2024-06-03 20:10:01,392 INFO L231 Difference]: Finished difference. Result has 94 places, 97 transitions, 795 flow
[2024-06-03 20:10:01,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=795, PETRI_PLACES=94, PETRI_TRANSITIONS=97}
[2024-06-03 20:10:01,393 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 51 predicate places.
[2024-06-03 20:10:01,393 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 97 transitions, 795 flow
[2024-06-03 20:10:01,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:10:01,393 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-03 20:10:01,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 20:10:01,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-03 20:10:01,394 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 20:10:01,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 20:10:01,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1267028783, now seen corresponding path program 2 times
[2024-06-03 20:10:01,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 20:10:01,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616368262]
[2024-06-03 20:10:01,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 20:10:01,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 20:10:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 20:10:03,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 20:10:03,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 20:10:03,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616368262]
[2024-06-03 20:10:03,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616368262] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 20:10:03,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 20:10:03,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 20:10:03,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488505638]
[2024-06-03 20:10:03,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 20:10:03,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 20:10:03,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 20:10:03,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 20:10:03,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 20:10:03,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 20:10:03,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 97 transitions, 795 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:10:03,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 20:10:03,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 20:10:03,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 20:10:04,086 INFO L124 PetriNetUnfolderBase]: 996/1618 cut-off events.
[2024-06-03 20:10:04,086 INFO L125 PetriNetUnfolderBase]: For 3885/3887 co-relation queries the response was YES.
[2024-06-03 20:10:04,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5695 conditions, 1618 events. 996/1618 cut-off events. For 3885/3887 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8037 event pairs, 345 based on Foata normal form. 0/1595 useless extension candidates. Maximal degree in co-relation 5653. Up to 1551 conditions per place.
[2024-06-03 20:10:04,097 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 79 selfloop transitions, 23 changer transitions 0/108 dead transitions.
[2024-06-03 20:10:04,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 108 transitions, 1068 flow
[2024-06-03 20:10:04,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-06-03 20:10:04,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 20:10:04,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions.
[2024-06-03 20:10:04,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41496598639455784
[2024-06-03 20:10:04,099 INFO L175 Difference]: Start difference. First operand has 94 places, 97 transitions, 795 flow. Second operand 7 states and 122 transitions.
[2024-06-03 20:10:04,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 108 transitions, 1068 flow
[2024-06-03 20:10:04,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 108 transitions, 1010 flow, removed 17 selfloop flow, removed 3 redundant places.
[2024-06-03 20:10:04,108 INFO L231 Difference]: Finished difference. Result has 100 places, 102 transitions, 856 flow
[2024-06-03 20:10:04,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=856, PETRI_PLACES=100, PETRI_TRANSITIONS=102}
[2024-06-03 20:10:04,109 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places.
[2024-06-03 20:10:04,109 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 102 transitions, 856 flow
[2024-06-03 20:10:04,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:10:04,109 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-03 20:10:04,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 20:10:04,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-03 20:10:04,110 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 20:10:04,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 20:10:04,110 INFO L85 PathProgramCache]: Analyzing trace with hash -139100547, now seen corresponding path program 3 times
[2024-06-03 20:10:04,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 20:10:04,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588536239]
[2024-06-03 20:10:04,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 20:10:04,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 20:10:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 20:10:06,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 20:10:06,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 20:10:06,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588536239]
[2024-06-03 20:10:06,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588536239] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 20:10:06,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 20:10:06,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 20:10:06,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44882790]
[2024-06-03 20:10:06,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 20:10:06,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 20:10:06,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 20:10:06,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 20:10:06,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-03 20:10:06,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 20:10:06,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 102 transitions, 856 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:10:06,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 20:10:06,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 20:10:06,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 20:10:06,898 INFO L124 PetriNetUnfolderBase]: 995/1615 cut-off events.
[2024-06-03 20:10:06,898 INFO L125 PetriNetUnfolderBase]: For 4090/4092 co-relation queries the response was YES.
[2024-06-03 20:10:06,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5778 conditions, 1615 events. 995/1615 cut-off events. For 4090/4092 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7997 event pairs, 349 based on Foata normal form. 2/1595 useless extension candidates. Maximal degree in co-relation 5732. Up to 1549 conditions per place.
[2024-06-03 20:10:06,910 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 79 selfloop transitions, 24 changer transitions 0/109 dead transitions.
[2024-06-03 20:10:06,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 109 transitions, 1115 flow
[2024-06-03 20:10:06,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-06-03 20:10:06,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 20:10:06,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions.
[2024-06-03 20:10:06,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3945578231292517
[2024-06-03 20:10:06,912 INFO L175 Difference]: Start difference. First operand has 100 places, 102 transitions, 856 flow. Second operand 7 states and 116 transitions.
[2024-06-03 20:10:06,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 109 transitions, 1115 flow
[2024-06-03 20:10:06,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 109 transitions, 1058 flow, removed 8 selfloop flow, removed 4 redundant places.
[2024-06-03 20:10:06,922 INFO L231 Difference]: Finished difference. Result has 104 places, 106 transitions, 903 flow
[2024-06-03 20:10:06,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=903, PETRI_PLACES=104, PETRI_TRANSITIONS=106}
[2024-06-03 20:10:06,922 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 61 predicate places.
[2024-06-03 20:10:06,922 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 106 transitions, 903 flow
[2024-06-03 20:10:06,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:10:06,923 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-03 20:10:06,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 20:10:06,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-03 20:10:06,923 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 20:10:06,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 20:10:06,924 INFO L85 PathProgramCache]: Analyzing trace with hash -132434307, now seen corresponding path program 4 times
[2024-06-03 20:10:06,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 20:10:06,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864012361]
[2024-06-03 20:10:06,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 20:10:06,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 20:10:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 20:10:08,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 20:10:08,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 20:10:08,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864012361]
[2024-06-03 20:10:08,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864012361] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 20:10:08,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 20:10:08,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 20:10:08,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678370871]
[2024-06-03 20:10:08,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 20:10:08,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 20:10:08,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 20:10:08,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 20:10:08,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-03 20:10:08,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 20:10:08,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 106 transitions, 903 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:10:08,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 20:10:08,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 20:10:08,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 20:10:09,367 INFO L124 PetriNetUnfolderBase]: 996/1617 cut-off events.
[2024-06-03 20:10:09,368 INFO L125 PetriNetUnfolderBase]: For 4276/4276 co-relation queries the response was YES.
[2024-06-03 20:10:09,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5867 conditions, 1617 events. 996/1617 cut-off events. For 4276/4276 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8034 event pairs, 348 based on Foata normal form. 0/1595 useless extension candidates. Maximal degree in co-relation 5819. Up to 1548 conditions per place.
[2024-06-03 20:10:09,378 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 76 selfloop transitions, 29 changer transitions 0/111 dead transitions.
[2024-06-03 20:10:09,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 111 transitions, 1151 flow
[2024-06-03 20:10:09,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-06-03 20:10:09,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 20:10:09,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions.
[2024-06-03 20:10:09,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3945578231292517
[2024-06-03 20:10:09,380 INFO L175 Difference]: Start difference. First operand has 104 places, 106 transitions, 903 flow. Second operand 7 states and 116 transitions.
[2024-06-03 20:10:09,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 111 transitions, 1151 flow
[2024-06-03 20:10:09,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 111 transitions, 1105 flow, removed 10 selfloop flow, removed 3 redundant places.
[2024-06-03 20:10:09,390 INFO L231 Difference]: Finished difference. Result has 108 places, 108 transitions, 950 flow
[2024-06-03 20:10:09,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=857, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=950, PETRI_PLACES=108, PETRI_TRANSITIONS=108}
[2024-06-03 20:10:09,391 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 65 predicate places.
[2024-06-03 20:10:09,391 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 108 transitions, 950 flow
[2024-06-03 20:10:09,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:10:09,391 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-03 20:10:09,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 20:10:09,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-03 20:10:09,392 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 20:10:09,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 20:10:09,392 INFO L85 PathProgramCache]: Analyzing trace with hash 612609153, now seen corresponding path program 5 times
[2024-06-03 20:10:09,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 20:10:09,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271844988]
[2024-06-03 20:10:09,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 20:10:09,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 20:10:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 20:10:11,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 20:10:11,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 20:10:11,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271844988]
[2024-06-03 20:10:11,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271844988] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 20:10:11,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 20:10:11,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 20:10:11,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809408446]
[2024-06-03 20:10:11,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 20:10:11,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 20:10:11,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 20:10:11,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 20:10:11,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-03 20:10:11,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 20:10:11,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 108 transitions, 950 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:10:11,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 20:10:11,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 20:10:11,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 20:10:12,280 INFO L124 PetriNetUnfolderBase]: 999/1622 cut-off events.
[2024-06-03 20:10:12,280 INFO L125 PetriNetUnfolderBase]: For 4781/4783 co-relation queries the response was YES.
[2024-06-03 20:10:12,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5981 conditions, 1622 events. 999/1622 cut-off events. For 4781/4783 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8037 event pairs, 316 based on Foata normal form. 0/1600 useless extension candidates. Maximal degree in co-relation 5931. Up to 1495 conditions per place.
[2024-06-03 20:10:12,289 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 90 selfloop transitions, 34 changer transitions 0/130 dead transitions.
[2024-06-03 20:10:12,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 130 transitions, 1418 flow
[2024-06-03 20:10:12,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-06-03 20:10:12,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 20:10:12,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions.
[2024-06-03 20:10:12,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445578231292517
[2024-06-03 20:10:12,293 INFO L175 Difference]: Start difference. First operand has 108 places, 108 transitions, 950 flow. Second operand 7 states and 131 transitions.
[2024-06-03 20:10:12,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 130 transitions, 1418 flow
[2024-06-03 20:10:12,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 130 transitions, 1343 flow, removed 10 selfloop flow, removed 5 redundant places.
[2024-06-03 20:10:12,304 INFO L231 Difference]: Finished difference. Result has 111 places, 116 transitions, 1052 flow
[2024-06-03 20:10:12,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1052, PETRI_PLACES=111, PETRI_TRANSITIONS=116}
[2024-06-03 20:10:12,305 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 68 predicate places.
[2024-06-03 20:10:12,305 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 116 transitions, 1052 flow
[2024-06-03 20:10:12,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:10:12,305 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-03 20:10:12,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 20:10:12,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-03 20:10:12,306 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 20:10:12,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 20:10:12,306 INFO L85 PathProgramCache]: Analyzing trace with hash 612042783, now seen corresponding path program 6 times
[2024-06-03 20:10:12,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 20:10:12,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710642981]
[2024-06-03 20:10:12,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 20:10:12,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 20:10:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 20:10:14,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 20:10:14,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 20:10:14,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710642981]
[2024-06-03 20:10:14,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710642981] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 20:10:14,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 20:10:14,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 20:10:14,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923963499]
[2024-06-03 20:10:14,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 20:10:14,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 20:10:14,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 20:10:14,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 20:10:14,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-03 20:10:14,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 20:10:14,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 116 transitions, 1052 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:10:14,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 20:10:14,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 20:10:14,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 20:10:15,244 INFO L124 PetriNetUnfolderBase]: 1000/1624 cut-off events.
[2024-06-03 20:10:15,245 INFO L125 PetriNetUnfolderBase]: For 5944/5944 co-relation queries the response was YES.
[2024-06-03 20:10:15,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6311 conditions, 1624 events. 1000/1624 cut-off events. For 5944/5944 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8055 event pairs, 317 based on Foata normal form. 0/1603 useless extension candidates. Maximal degree in co-relation 6259. Up to 1497 conditions per place.
[2024-06-03 20:10:15,253 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 84 selfloop transitions, 39 changer transitions 0/129 dead transitions.
[2024-06-03 20:10:15,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 129 transitions, 1436 flow
[2024-06-03 20:10:15,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-06-03 20:10:15,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 20:10:15,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions.
[2024-06-03 20:10:15,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43197278911564624
[2024-06-03 20:10:15,254 INFO L175 Difference]: Start difference. First operand has 111 places, 116 transitions, 1052 flow. Second operand 7 states and 127 transitions.
[2024-06-03 20:10:15,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 129 transitions, 1436 flow
[2024-06-03 20:10:15,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 129 transitions, 1323 flow, removed 31 selfloop flow, removed 4 redundant places.
[2024-06-03 20:10:15,267 INFO L231 Difference]: Finished difference. Result has 114 places, 119 transitions, 1069 flow
[2024-06-03 20:10:15,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=947, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1069, PETRI_PLACES=114, PETRI_TRANSITIONS=119}
[2024-06-03 20:10:15,267 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 71 predicate places.
[2024-06-03 20:10:15,267 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 119 transitions, 1069 flow
[2024-06-03 20:10:15,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:10:15,268 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-03 20:10:15,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 20:10:15,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-03 20:10:15,268 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 20:10:15,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 20:10:15,269 INFO L85 PathProgramCache]: Analyzing trace with hash -476306215, now seen corresponding path program 1 times
[2024-06-03 20:10:15,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 20:10:15,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905110366]
[2024-06-03 20:10:15,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 20:10:15,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 20:10:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 20:10:16,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 20:10:16,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 20:10:16,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905110366]
[2024-06-03 20:10:16,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905110366] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 20:10:16,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 20:10:16,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 20:10:16,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057502611]
[2024-06-03 20:10:16,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 20:10:16,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 20:10:16,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 20:10:16,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 20:10:16,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-03 20:10:16,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 20:10:16,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 119 transitions, 1069 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:10:16,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 20:10:16,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 20:10:16,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 20:10:17,940 INFO L124 PetriNetUnfolderBase]: 1501/2338 cut-off events.
[2024-06-03 20:10:17,940 INFO L125 PetriNetUnfolderBase]: For 8004/8264 co-relation queries the response was YES.
[2024-06-03 20:10:17,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8370 conditions, 2338 events. 1501/2338 cut-off events. For 8004/8264 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11829 event pairs, 839 based on Foata normal form. 2/2339 useless extension candidates. Maximal degree in co-relation 8317. Up to 2246 conditions per place.
[2024-06-03 20:10:17,953 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 94 selfloop transitions, 31 changer transitions 0/131 dead transitions.
[2024-06-03 20:10:17,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 131 transitions, 1430 flow
[2024-06-03 20:10:17,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-06-03 20:10:17,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 20:10:17,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions.
[2024-06-03 20:10:17,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44841269841269843
[2024-06-03 20:10:17,954 INFO L175 Difference]: Start difference. First operand has 114 places, 119 transitions, 1069 flow. Second operand 6 states and 113 transitions.
[2024-06-03 20:10:17,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 131 transitions, 1430 flow
[2024-06-03 20:10:17,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 131 transitions, 1357 flow, removed 8 selfloop flow, removed 4 redundant places.
[2024-06-03 20:10:17,967 INFO L231 Difference]: Finished difference. Result has 117 places, 125 transitions, 1165 flow
[2024-06-03 20:10:17,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1001, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1165, PETRI_PLACES=117, PETRI_TRANSITIONS=125}
[2024-06-03 20:10:17,967 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 74 predicate places.
[2024-06-03 20:10:17,967 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 125 transitions, 1165 flow
[2024-06-03 20:10:17,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:10:17,968 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-03 20:10:17,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 20:10:17,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-03 20:10:17,968 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 20:10:17,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 20:10:17,969 INFO L85 PathProgramCache]: Analyzing trace with hash -458866855, now seen corresponding path program 2 times
[2024-06-03 20:10:17,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 20:10:17,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885484804]
[2024-06-03 20:10:17,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 20:10:17,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 20:10:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 20:10:19,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 20:10:19,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 20:10:19,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885484804]
[2024-06-03 20:10:19,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885484804] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 20:10:19,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 20:10:19,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 20:10:19,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500813888]
[2024-06-03 20:10:19,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 20:10:19,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 20:10:19,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 20:10:19,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 20:10:19,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-03 20:10:19,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 20:10:19,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 125 transitions, 1165 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:10:19,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 20:10:19,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 20:10:19,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 20:10:20,653 INFO L124 PetriNetUnfolderBase]: 1495/2329 cut-off events.
[2024-06-03 20:10:20,653 INFO L125 PetriNetUnfolderBase]: For 8372/8597 co-relation queries the response was YES.
[2024-06-03 20:10:20,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8746 conditions, 2329 events. 1495/2329 cut-off events. For 8372/8597 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11754 event pairs, 834 based on Foata normal form. 2/2328 useless extension candidates. Maximal degree in co-relation 8691. Up to 2241 conditions per place.
[2024-06-03 20:10:20,664 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 94 selfloop transitions, 34 changer transitions 0/134 dead transitions.
[2024-06-03 20:10:20,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 134 transitions, 1539 flow
[2024-06-03 20:10:20,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-06-03 20:10:20,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 20:10:20,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions.
[2024-06-03 20:10:20,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-03 20:10:20,666 INFO L175 Difference]: Start difference. First operand has 117 places, 125 transitions, 1165 flow. Second operand 6 states and 108 transitions.
[2024-06-03 20:10:20,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 134 transitions, 1539 flow
[2024-06-03 20:10:20,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 134 transitions, 1495 flow, removed 1 selfloop flow, removed 3 redundant places.
[2024-06-03 20:10:20,677 INFO L231 Difference]: Finished difference. Result has 120 places, 130 transitions, 1281 flow
[2024-06-03 20:10:20,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1126, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1281, PETRI_PLACES=120, PETRI_TRANSITIONS=130}
[2024-06-03 20:10:20,678 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 77 predicate places.
[2024-06-03 20:10:20,678 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 130 transitions, 1281 flow
[2024-06-03 20:10:20,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:10:20,678 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-03 20:10:20,678 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 20:10:20,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-03 20:10:20,678 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 20:10:20,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 20:10:20,679 INFO L85 PathProgramCache]: Analyzing trace with hash -457668581, now seen corresponding path program 1 times
[2024-06-03 20:10:20,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 20:10:20,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510349550]
[2024-06-03 20:10:20,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 20:10:20,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 20:10:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 20:10:22,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 20:10:22,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 20:10:22,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510349550]
[2024-06-03 20:10:22,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510349550] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 20:10:22,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 20:10:22,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 20:10:22,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431645573]
[2024-06-03 20:10:22,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 20:10:22,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 20:10:22,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 20:10:22,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 20:10:22,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-03 20:10:22,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 20:10:22,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 130 transitions, 1281 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:10:22,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 20:10:22,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 20:10:22,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 20:10:23,193 INFO L124 PetriNetUnfolderBase]: 1496/2332 cut-off events.
[2024-06-03 20:10:23,194 INFO L125 PetriNetUnfolderBase]: For 9057/9252 co-relation queries the response was YES.
[2024-06-03 20:10:23,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8998 conditions, 2332 events. 1496/2332 cut-off events. For 9057/9252 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11802 event pairs, 835 based on Foata normal form. 1/2332 useless extension candidates. Maximal degree in co-relation 8942. Up to 2270 conditions per place.
[2024-06-03 20:10:23,210 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 113 selfloop transitions, 18 changer transitions 0/137 dead transitions.
[2024-06-03 20:10:23,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 137 transitions, 1587 flow
[2024-06-03 20:10:23,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-06-03 20:10:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 20:10:23,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions.
[2024-06-03 20:10:23,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064
[2024-06-03 20:10:23,213 INFO L175 Difference]: Start difference. First operand has 120 places, 130 transitions, 1281 flow. Second operand 6 states and 106 transitions.
[2024-06-03 20:10:23,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 137 transitions, 1587 flow
[2024-06-03 20:10:23,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 137 transitions, 1545 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-03 20:10:23,228 INFO L231 Difference]: Finished difference. Result has 124 places, 133 transitions, 1314 flow
[2024-06-03 20:10:23,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1239, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1314, PETRI_PLACES=124, PETRI_TRANSITIONS=133}
[2024-06-03 20:10:23,229 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 81 predicate places.
[2024-06-03 20:10:23,229 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 133 transitions, 1314 flow
[2024-06-03 20:10:23,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:10:23,229 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-03 20:10:23,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 20:10:23,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-03 20:10:23,230 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 20:10:23,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 20:10:23,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1023805589, now seen corresponding path program 2 times
[2024-06-03 20:10:23,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 20:10:23,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545390989]
[2024-06-03 20:10:23,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 20:10:23,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 20:10:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 20:10:24,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 20:10:24,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 20:10:24,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545390989]
[2024-06-03 20:10:24,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545390989] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 20:10:24,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 20:10:24,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 20:10:24,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965893707]
[2024-06-03 20:10:24,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 20:10:24,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 20:10:24,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 20:10:24,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 20:10:24,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-03 20:10:24,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 20:10:24,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 133 transitions, 1314 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:10:24,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 20:10:24,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 20:10:24,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 20:10:25,727 INFO L124 PetriNetUnfolderBase]: 1494/2329 cut-off events.
[2024-06-03 20:10:25,727 INFO L125 PetriNetUnfolderBase]: For 10716/10911 co-relation queries the response was YES.
[2024-06-03 20:10:25,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9417 conditions, 2329 events. 1494/2329 cut-off events. For 10716/10911 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11741 event pairs, 808 based on Foata normal form. 1/2329 useless extension candidates. Maximal degree in co-relation 9358. Up to 2277 conditions per place.
[2024-06-03 20:10:25,740 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 117 selfloop transitions, 14 changer transitions 0/137 dead transitions.
[2024-06-03 20:10:25,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 137 transitions, 1608 flow
[2024-06-03 20:10:25,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-06-03 20:10:25,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 20:10:25,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions.
[2024-06-03 20:10:25,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477
[2024-06-03 20:10:25,741 INFO L175 Difference]: Start difference. First operand has 124 places, 133 transitions, 1314 flow. Second operand 6 states and 102 transitions.
[2024-06-03 20:10:25,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 137 transitions, 1608 flow
[2024-06-03 20:10:25,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 137 transitions, 1575 flow, removed 3 selfloop flow, removed 3 redundant places.
[2024-06-03 20:10:25,752 INFO L231 Difference]: Finished difference. Result has 127 places, 135 transitions, 1342 flow
[2024-06-03 20:10:25,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1283, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1342, PETRI_PLACES=127, PETRI_TRANSITIONS=135}
[2024-06-03 20:10:25,753 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 84 predicate places.
[2024-06-03 20:10:25,753 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 135 transitions, 1342 flow
[2024-06-03 20:10:25,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 20:10:25,754 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-03 20:10:25,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 20:10:25,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-03 20:10:25,754 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 20:10:25,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 20:10:25,755 INFO L85 PathProgramCache]: Analyzing trace with hash -458853959, now seen corresponding path program 1 times
[2024-06-03 20:10:25,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 20:10:25,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168395910]
[2024-06-03 20:10:25,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 20:10:25,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 20:10:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-06-03 20:10:25,786 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-06-03 20:10:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-06-03 20:10:25,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-06-03 20:10:25,864 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2024-06-03 20:10:25,865 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 6 remaining)
[2024-06-03 20:10:25,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 6 remaining)
[2024-06-03 20:10:25,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 6 remaining)
[2024-06-03 20:10:25,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining)
[2024-06-03 20:10:25,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining)
[2024-06-03 20:10:25,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining)
[2024-06-03 20:10:25,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-03 20:10:25,869 INFO L445 BasicCegarLoop]: Path program histogram: [6, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1]
[2024-06-03 20:10:25,875 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-06-03 20:10:25,875 INFO L179 ceAbstractionStarter]: Computing trace abstraction results
[2024-06-03 20:10:25,932 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,933 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,933 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,933 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,933 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,933 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,934 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,934 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,934 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,934 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,934 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,934 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,940 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,940 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,940 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,940 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,940 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,940 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,940 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,941 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,941 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,941 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,941 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,941 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,942 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,943 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,943 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,943 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,943 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,943 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,943 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,943 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,943 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,943 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,943 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,943 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
[2024-06-03 20:10:25,946 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back.
[2024-06-03 20:10:25,960 INFO L507 ceAbstractionStarter]: Automizer considered 3 witness invariants
[2024-06-03 20:10:25,964 INFO L508 ceAbstractionStarter]: WitnessConsidered=3
[2024-06-03 20:10:25,965 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.06 08:10:25 BasicIcfg
[2024-06-03 20:10:25,965 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-06-03 20:10:25,966 INFO L158 Benchmark]: Toolchain (without parser) took 69156.33ms. Allocated memory was 184.5MB in the beginning and 931.1MB in the end (delta: 746.6MB). Free memory was 139.7MB in the beginning and 675.3MB in the end (delta: -535.5MB). Peak memory consumption was 210.2MB. Max. memory is 16.1GB.
[2024-06-03 20:10:25,966 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 184.5MB. Free memory was 154.2MB in the beginning and 154.1MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-06-03 20:10:25,966 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 184.5MB. Free memory is still 152.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-06-03 20:10:25,966 INFO L158 Benchmark]: CACSL2BoogieTranslator took 807.81ms. Allocated memory is still 184.5MB. Free memory was 139.7MB in the beginning and 86.7MB in the end (delta: 53.1MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB.
[2024-06-03 20:10:25,967 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.83ms. Allocated memory is still 184.5MB. Free memory was 86.7MB in the beginning and 82.3MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-06-03 20:10:25,967 INFO L158 Benchmark]: Boogie Preprocessor took 161.29ms. Allocated memory is still 184.5MB. Free memory was 82.3MB in the beginning and 144.5MB in the end (delta: -62.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2024-06-03 20:10:25,968 INFO L158 Benchmark]: RCFGBuilder took 1589.27ms. Allocated memory was 184.5MB in the beginning and 243.3MB in the end (delta: 58.7MB). Free memory was 144.5MB in the beginning and 140.1MB in the end (delta: 4.3MB). Peak memory consumption was 117.3MB. Max. memory is 16.1GB.
[2024-06-03 20:10:25,968 INFO L158 Benchmark]: TraceAbstraction took 66506.82ms. Allocated memory was 243.3MB in the beginning and 931.1MB in the end (delta: 687.9MB). Free memory was 139.1MB in the beginning and 675.3MB in the end (delta: -536.2MB). Peak memory consumption was 150.6MB. Max. memory is 16.1GB.
[2024-06-03 20:10:25,969 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.19ms. Allocated memory is still 184.5MB. Free memory was 154.2MB in the beginning and 154.1MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB.
* Witness Parser took 0.16ms. Allocated memory is still 184.5MB. Free memory is still 152.2MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 807.81ms. Allocated memory is still 184.5MB. Free memory was 139.7MB in the beginning and 86.7MB in the end (delta: 53.1MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 77.83ms. Allocated memory is still 184.5MB. Free memory was 86.7MB in the beginning and 82.3MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 161.29ms. Allocated memory is still 184.5MB. Free memory was 82.3MB in the beginning and 144.5MB in the end (delta: -62.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
* RCFGBuilder took 1589.27ms. Allocated memory was 184.5MB in the beginning and 243.3MB in the end (delta: 58.7MB). Free memory was 144.5MB in the beginning and 140.1MB in the end (delta: 4.3MB). Peak memory consumption was 117.3MB. Max. memory is 16.1GB.
* TraceAbstraction took 66506.82ms. Allocated memory was 243.3MB in the beginning and 931.1MB in the end (delta: 687.9MB). Free memory was 139.1MB in the beginning and 675.3MB in the end (delta: -536.2MB). Peak memory consumption was 150.6MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Invalid location (Location is no CACSLLocation)
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: The program execution was not completely translated back.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- CounterExampleResult [Line: 877]: invariant of correctness witness can be violated
invariant of correctness witness can be violated
We found a FailurePath:
[L1] 0 //@ ghost int multithreaded = 0;
[L710] 0 int __unbuffered_cnt = 0;
[L712] 0 int __unbuffered_p0_EAX = 0;
[L714] 0 int __unbuffered_p2_EAX = 0;
[L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed;
[L716] 0 int __unbuffered_p2_EAX$mem_tmp;
[L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0;
[L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1;
[L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2;
[L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3;
[L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0;
[L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1;
[L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2;
[L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3;
[L725] 0 _Bool __unbuffered_p2_EAX$read_delayed;
[L726] 0 int *__unbuffered_p2_EAX$read_delayed_var;
[L727] 0 int __unbuffered_p2_EAX$w_buff0;
[L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used;
[L729] 0 int __unbuffered_p2_EAX$w_buff1;
[L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used;
[L731] 0 _Bool main$tmp_guard0;
[L732] 0 _Bool main$tmp_guard1;
[L734] 0 int x = 0;
[L734] 0 int x = 0;
[L735] 0 _Bool x$flush_delayed;
[L736] 0 int x$mem_tmp;
[L737] 0 _Bool x$r_buff0_thd0;
[L738] 0 _Bool x$r_buff0_thd1;
[L739] 0 _Bool x$r_buff0_thd2;
[L740] 0 _Bool x$r_buff0_thd3;
[L741] 0 _Bool x$r_buff1_thd0;
[L742] 0 _Bool x$r_buff1_thd1;
[L743] 0 _Bool x$r_buff1_thd2;
[L744] 0 _Bool x$r_buff1_thd3;
[L745] 0 _Bool x$read_delayed;
[L746] 0 int *x$read_delayed_var;
[L747] 0 int x$w_buff0;
[L748] 0 _Bool x$w_buff0_used;
[L749] 0 int x$w_buff1;
[L750] 0 _Bool x$w_buff1_used;
[L752] 0 int y = 0;
[L753] 0 _Bool weak$$choice0;
[L754] 0 _Bool weak$$choice1;
[L755] 0 _Bool weak$$choice2;
[L871] 0 pthread_t t2121;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0]
[L872] 0 //@ ghost multithreaded = 1;
[L872] FCALL, FORK 0 pthread_create(&t2121, ((void *)0), P0, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2121=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0]
[L873] 0 pthread_t t2122;
[L874] 0 //@ assert ((((((((((((((((((((((((((((((((!multithreaded || (x$r_buff0_thd0 == (_Bool) 0)) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$w_buff0) && (x$w_buff0 <= 2)) && (x$w_buff0 <= 127)) && (((x$w_buff0 == 0) || (x$w_buff0 == 1)) || (x$w_buff0 == 2))))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$mem_tmp) && (x$mem_tmp <= 2)) && (x$mem_tmp <= 127)) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && (((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1)) || (__unbuffered_p2_EAX == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || (((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 2)) && (*__unbuffered_p2_EAX$read_delayed_var <= 127)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && (((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)) || (*__unbuffered_p2_EAX$read_delayed_var == 2)))))) && (!multithreaded || ((((0 <= y) && (y <= 2)) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$w_buff1) && (x$w_buff1 <= 2)) && (x$w_buff1 <= 127)) && (((x$w_buff1 == 0) || (x$w_buff1 == 1)) || (x$w_buff1 == 2))))) && (!multithreaded || (x$flush_delayed == (_Bool) 0)));
[L874] 0 x
[L874] 0 x
[L874] 0 x
[L874] 0 x
[L874] 0 x
[L874] 0 x
[L874] 0 __unbuffered_p2_EAX$read_delayed_var
[L874] 0 __unbuffered_p2_EAX$read_delayed_var
[L874] 0 __unbuffered_p2_EAX$read_delayed_var
[L874] 0 __unbuffered_p2_EAX$read_delayed_var
[L874] 0 __unbuffered_p2_EAX$read_delayed_var
[L874] 0 __unbuffered_p2_EAX$read_delayed_var
[L874] FCALL, FORK 0 pthread_create(&t2122, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2121=-2, t2122=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0]
[L874] 0 x
[L874] 0 x
[L874] 0 x
[L874] 0 x
[L874] 0 x
[L874] 0 x
[L874] 0 __unbuffered_p2_EAX$read_delayed_var
[L874] 0 __unbuffered_p2_EAX$read_delayed_var
[L874] 0 __unbuffered_p2_EAX$read_delayed_var
[L874] 0 __unbuffered_p2_EAX$read_delayed_var
[L874] 0 __unbuffered_p2_EAX$read_delayed_var
[L874] 0 __unbuffered_p2_EAX$read_delayed_var
[L875] 0 pthread_t t2123;
[L876] 0 //@ assert ((((((((((((((((((((((((((((((((!multithreaded || (x$r_buff0_thd0 == (_Bool) 0)) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$w_buff0) && (x$w_buff0 <= 2)) && (x$w_buff0 <= 127)) && (((x$w_buff0 == 0) || (x$w_buff0 == 1)) || (x$w_buff0 == 2))))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$mem_tmp) && (x$mem_tmp <= 2)) && (x$mem_tmp <= 127)) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && (((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1)) || (__unbuffered_p2_EAX == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || (((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 2)) && (*__unbuffered_p2_EAX$read_delayed_var <= 127)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && (((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)) || (*__unbuffered_p2_EAX$read_delayed_var == 2)))))) && (!multithreaded || ((((0 <= y) && (y <= 2)) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$w_buff1) && (x$w_buff1 <= 2)) && (x$w_buff1 <= 127)) && (((x$w_buff1 == 0) || (x$w_buff1 == 1)) || (x$w_buff1 == 2))))) && (!multithreaded || (x$flush_delayed == (_Bool) 0)));
[L876] 0 x
[L876] 0 x
[L876] 0 x
[L876] 0 x
[L876] 0 x
[L876] 0 x
[L876] 0 __unbuffered_p2_EAX$read_delayed_var
[L876] 0 __unbuffered_p2_EAX$read_delayed_var
[L876] 0 __unbuffered_p2_EAX$read_delayed_var
[L876] 0 __unbuffered_p2_EAX$read_delayed_var
[L876] 0 __unbuffered_p2_EAX$read_delayed_var
[L876] 0 __unbuffered_p2_EAX$read_delayed_var
[L876] FCALL, FORK 0 pthread_create(&t2123, ((void *)0), P2, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2121=-2, t2122=-1, t2123=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0]
[L876] 0 x
[L876] 0 x
[L876] 0 x
[L876] 0 x
[L876] 0 x
[L876] 0 x
[L876] 0 __unbuffered_p2_EAX$read_delayed_var
[L876] 0 __unbuffered_p2_EAX$read_delayed_var
[L876] 0 __unbuffered_p2_EAX$read_delayed_var
[L876] 0 __unbuffered_p2_EAX$read_delayed_var
[L876] 0 __unbuffered_p2_EAX$read_delayed_var
[L876] 0 __unbuffered_p2_EAX$read_delayed_var
[L827] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L828] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L829] 3 x$flush_delayed = weak$$choice2
[L830] EXPR 3 \read(x)
[L830] 3 x$mem_tmp = x
[L831] 3 weak$$choice1 = __VERIFIER_nondet_bool()
[L832] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))))
[L832] EXPR 3 \read(x)
[L832] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))))
[L832] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))))
[L833] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0))))
[L834] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1))))
[L835] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0))))
[L836] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))))
[L837] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))))
[L838] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))))
[L839] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1
[L840] 3 __unbuffered_p2_EAX$read_delayed_var = &x
[L841] EXPR 3 \read(x)
[L841] 3 __unbuffered_p2_EAX = x
[L842] EXPR 3 x$flush_delayed ? x$mem_tmp : x
[L842] EXPR 3 x$flush_delayed ? x$mem_tmp : x
[L842] 3 x = x$flush_delayed ? x$mem_tmp : x
[L843] 3 x$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0]
[L877] 0 //@ assert ((((((((((((((((((((((((((((((((!multithreaded || (x$r_buff0_thd0 == (_Bool) 0)) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$w_buff0) && (x$w_buff0 <= 2)) && (x$w_buff0 <= 127)) && (((x$w_buff0 == 0) || (x$w_buff0 == 1)) || (x$w_buff0 == 2))))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$mem_tmp) && (x$mem_tmp <= 2)) && (x$mem_tmp <= 127)) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && (((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1)) || (__unbuffered_p2_EAX == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || (((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 2)) && (*__unbuffered_p2_EAX$read_delayed_var <= 127)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && (((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)) || (*__unbuffered_p2_EAX$read_delayed_var == 2)))))) && (!multithreaded || ((((0 <= y) && (y <= 2)) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$w_buff1) && (x$w_buff1 <= 2)) && (x$w_buff1 <= 127)) && (((x$w_buff1 == 0) || (x$w_buff1 == 1)) || (x$w_buff1 == 2))))) && (!multithreaded || (x$flush_delayed == (_Bool) 0)));
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2121=-2, t2122=-1, t2123=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0]
- UnprovableResult [Line: 874]: Unable to prove that invariant of correctness witness holds
Unable to prove that invariant of correctness witness holds
Reason: Not analyzed.
- UnprovableResult [Line: 876]: Unable to prove that invariant of correctness witness holds
Unable to prove that invariant of correctness witness holds
Reason: Not analyzed.
- UnprovableResult [Line: 872]: 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: 876]: 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: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 7 procedures, 68 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 66.3s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 21.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 877 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 710 mSDsluCounter, 205 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 147 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4374 IncrementalHoareTripleChecker+Invalid, 4447 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 58 mSDtfsCounter, 4374 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 19.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1342occurred in iteration=24, InterpolantAutomatonStates: 145, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 44.2s InterpolantComputationTime, 295 NumberOfCodeBlocks, 295 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 257 ConstructedInterpolants, 0 QuantifiedInterpolants, 27872 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-06-03 20:10:26,015 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