./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe006_power.opt-thin000_power.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/protection/safe006_power.opt-thin000_power.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe006_power.opt-thin000_power.opt.i ./goblint.2024-06-19_11-23-25.files/protection/safe006_power.opt-thin000_power.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 18:50:55,088 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 18:50:55,139 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 18:50:55,148 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 18:50:55,148 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 18:50:55,178 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 18:50:55,179 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 18:50:55,179 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 18:50:55,180 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 18:50:55,183 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 18:50:55,183 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 18:50:55,183 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 18:50:55,184 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 18:50:55,185 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 18:50:55,185 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 18:50:55,185 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 18:50:55,186 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 18:50:55,186 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 18:50:55,186 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 18:50:55,186 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 18:50:55,187 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 18:50:55,188 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 18:50:55,188 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 18:50:55,188 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 18:50:55,188 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 18:50:55,189 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 18:50:55,189 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 18:50:55,189 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 18:50:55,189 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 18:50:55,190 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 18:50:55,190 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 18:50:55,191 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 18:50:55,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:50:55,191 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 18:50:55,191 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 18:50:55,191 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 18:50:55,192 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 18:50:55,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 18:50:55,192 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 18:50:55,192 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 18:50:55,192 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 18:50:55,193 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 18:50:55,193 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 18:50:55,193 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-27 18:50:55,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 18:50:55,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 18:50:55,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 18:50:55,522 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 18:50:55,523 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 18:50:55,524 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/protection/safe006_power.opt-thin000_power.opt.yml/witness.yml [2024-06-27 18:50:55,656 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 18:50:55,657 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 18:50:55,658 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2024-06-27 18:50:56,759 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 18:50:56,927 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 18:50:56,927 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2024-06-27 18:50:56,947 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64b25f07c/02cfeb6145904ff8aa3aaef7343165af/FLAG04d175fa9 [2024-06-27 18:50:56,961 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64b25f07c/02cfeb6145904ff8aa3aaef7343165af [2024-06-27 18:50:56,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 18:50:56,963 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 18:50:56,965 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 18:50:56,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 18:50:56,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 18:50:56,970 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:50:55" (1/2) ... [2024-06-27 18:50:56,971 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a01df49 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:50:56, skipping insertion in model container [2024-06-27 18:50:56,971 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:50:55" (1/2) ... [2024-06-27 18:50:56,972 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@42dfebb9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:50:56, skipping insertion in model container [2024-06-27 18:50:56,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:50:56" (2/2) ... [2024-06-27 18:50:56,973 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a01df49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:50:56, skipping insertion in model container [2024-06-27 18:50:56,973 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:50:56" (2/2) ... [2024-06-27 18:50:56,974 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 18:50:57,060 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 18:50:57,061 INFO L97 edCorrectnessWitness]: Location invariant before [L829-L829] (((((((((((((((((((((((((((! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 1)) && (! multithreaded || __unbuffered_p1_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || __unbuffered_p1_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p1_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p1_EAX$w_buff0 == 0)) && (! multithreaded || (__unbuffered_p1_EAX$read_delayed_var == 0 || (__unbuffered_p1_EAX$read_delayed_var == & x && (*__unbuffered_p1_EAX$read_delayed_var == 0 || *__unbuffered_p1_EAX$read_delayed_var == 1))))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (x$mem_tmp == 0 || x$mem_tmp == 1))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 1))) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || __unbuffered_p1_EAX$mem_tmp == 0) [2024-06-27 18:50:57,061 INFO L97 edCorrectnessWitness]: Location invariant before [L828-L828] (((((((((((((((((((((((((((! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 1)) && (! multithreaded || __unbuffered_p1_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || __unbuffered_p1_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p1_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p1_EAX$w_buff0 == 0)) && (! multithreaded || (__unbuffered_p1_EAX$read_delayed_var == 0 || (__unbuffered_p1_EAX$read_delayed_var == & x && (*__unbuffered_p1_EAX$read_delayed_var == 0 || *__unbuffered_p1_EAX$read_delayed_var == 1))))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (x$mem_tmp == 0 || x$mem_tmp == 1))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 1))) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || __unbuffered_p1_EAX$mem_tmp == 0) [2024-06-27 18:50:57,062 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 18:50:57,062 INFO L106 edCorrectnessWitness]: ghost_update [L826-L826] multithreaded = 1; [2024-06-27 18:50:57,104 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 18:50:57,257 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_power.opt-thin000_power.opt.i[969,982] [2024-06-27 18:50:57,437 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:50:57,450 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 18:50:57,480 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_power.opt-thin000_power.opt.i[969,982] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 18:50:57,567 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:50:57,593 INFO L206 MainTranslator]: Completed translation [2024-06-27 18:50:57,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:50:57 WrapperNode [2024-06-27 18:50:57,594 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 18:50:57,595 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 18:50:57,595 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 18:50:57,595 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 18:50:57,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:50:57" (1/1) ... [2024-06-27 18:50:57,612 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:50:57" (1/1) ... [2024-06-27 18:50:57,642 INFO L138 Inliner]: procedures = 174, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 187 [2024-06-27 18:50:57,647 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 18:50:57,648 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 18:50:57,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 18:50:57,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 18:50:57,656 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:50:57" (1/1) ... [2024-06-27 18:50:57,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:50:57" (1/1) ... [2024-06-27 18:50:57,675 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:50:57" (1/1) ... [2024-06-27 18:50:57,696 INFO L175 MemorySlicer]: Split 26 memory accesses to 2 slices as follows [2, 24]. 92 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-06-27 18:50:57,697 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:50:57" (1/1) ... [2024-06-27 18:50:57,697 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:50:57" (1/1) ... [2024-06-27 18:50:57,705 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:50:57" (1/1) ... [2024-06-27 18:50:57,707 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:50:57" (1/1) ... [2024-06-27 18:50:57,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:50:57" (1/1) ... [2024-06-27 18:50:57,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:50:57" (1/1) ... [2024-06-27 18:50:57,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 18:50:57,714 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 18:50:57,714 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 18:50:57,714 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 18:50:57,715 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:50:57" (1/1) ... [2024-06-27 18:50:57,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:50:57,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:50:57,742 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-27 18:50:57,800 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-27 18:50:57,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 18:50:57,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 18:50:57,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 18:50:57,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 18:50:57,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 18:50:57,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 18:50:57,813 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 18:50:57,813 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 18:50:57,814 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 18:50:57,814 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 18:50:57,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 18:50:57,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 18:50:57,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 18:50:57,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 18:50:57,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 18:50:57,818 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 18:50:57,937 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 18:50:57,939 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 18:50:58,285 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 18:50:58,286 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 18:50:58,593 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 18:50:58,594 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 18:50:58,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 06:50:58 BoogieIcfgContainer [2024-06-27 18:50:58,595 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 18:50:58,597 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 18:50:58,597 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 18:50:58,599 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 18:50:58,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:50:55" (1/4) ... [2024-06-27 18:50:58,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@477a2567 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 06:50:58, skipping insertion in model container [2024-06-27 18:50:58,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 06:50:56" (2/4) ... [2024-06-27 18:50:58,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@477a2567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 06:50:58, skipping insertion in model container [2024-06-27 18:50:58,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:50:57" (3/4) ... [2024-06-27 18:50:58,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@477a2567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 06:50:58, skipping insertion in model container [2024-06-27 18:50:58,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 06:50:58" (4/4) ... [2024-06-27 18:50:58,602 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.opt-thin000_power.opt.i [2024-06-27 18:50:58,615 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 18:50:58,616 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-27 18:50:58,616 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 18:50:58,658 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 18:50:58,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 80 flow [2024-06-27 18:50:58,726 INFO L124 PetriNetUnfolderBase]: 1/34 cut-off events. [2024-06-27 18:50:58,726 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 18:50:58,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 34 events. 1/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2024-06-27 18:50:58,731 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 36 transitions, 80 flow [2024-06-27 18:50:58,734 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 34 transitions, 74 flow [2024-06-27 18:50:58,747 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 18:50:58,757 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;@76bedabc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 18:50:58,757 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-27 18:50:58,762 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 18:50:58,762 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-27 18:50:58,762 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 18:50:58,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:50:58,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 18:50:58,764 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:50:58,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:50:58,768 INFO L85 PathProgramCache]: Analyzing trace with hash 656668286, now seen corresponding path program 1 times [2024-06-27 18:50:58,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:50:58,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763702786] [2024-06-27 18:50:58,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:50:58,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:50:58,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:50:59,871 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-27 18:50:59,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:50:59,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763702786] [2024-06-27 18:50:59,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763702786] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:50:59,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:50:59,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 18:50:59,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323579886] [2024-06-27 18:50:59,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:50:59,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 18:50:59,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:50:59,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 18:50:59,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 18:50:59,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 18:50:59,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-27 18:50:59,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:50:59,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 18:50:59,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:00,251 INFO L124 PetriNetUnfolderBase]: 585/1086 cut-off events. [2024-06-27 18:51:00,251 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-06-27 18:51:00,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2078 conditions, 1086 events. 585/1086 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5709 event pairs, 281 based on Foata normal form. 36/980 useless extension candidates. Maximal degree in co-relation 2067. Up to 964 conditions per place. [2024-06-27 18:51:00,261 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 34 selfloop transitions, 5 changer transitions 0/46 dead transitions. [2024-06-27 18:51:00,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 179 flow [2024-06-27 18:51:00,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 18:51:00,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 18:51:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2024-06-27 18:51:00,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2024-06-27 18:51:00,273 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 74 flow. Second operand 3 states and 69 transitions. [2024-06-27 18:51:00,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 179 flow [2024-06-27 18:51:00,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 46 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 18:51:00,278 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 105 flow [2024-06-27 18:51:00,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2024-06-27 18:51:00,283 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2024-06-27 18:51:00,284 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 105 flow [2024-06-27 18:51:00,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-27 18:51:00,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:00,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-27 18:51:00,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 18:51:00,285 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:51:00,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:00,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1118107945, now seen corresponding path program 1 times [2024-06-27 18:51:00,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:00,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583554028] [2024-06-27 18:51:00,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:00,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:00,329 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-27 18:51:00,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:00,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583554028] [2024-06-27 18:51:00,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583554028] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:00,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:00,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 18:51:00,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061811811] [2024-06-27 18:51:00,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:00,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 18:51:00,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:00,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 18:51:00,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 18:51:00,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-27 18:51:00,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 105 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-27 18:51:00,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:00,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-27 18:51:00,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:00,470 INFO L124 PetriNetUnfolderBase]: 237/516 cut-off events. [2024-06-27 18:51:00,471 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2024-06-27 18:51:00,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1080 conditions, 516 events. 237/516 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2786 event pairs, 129 based on Foata normal form. 0/491 useless extension candidates. Maximal degree in co-relation 1068. Up to 347 conditions per place. [2024-06-27 18:51:00,473 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 36 selfloop transitions, 3 changer transitions 2/51 dead transitions. [2024-06-27 18:51:00,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 218 flow [2024-06-27 18:51:00,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 18:51:00,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 18:51:00,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-06-27 18:51:00,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2024-06-27 18:51:00,475 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 105 flow. Second operand 3 states and 75 transitions. [2024-06-27 18:51:00,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 218 flow [2024-06-27 18:51:00,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 18:51:00,476 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 96 flow [2024-06-27 18:51:00,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2024-06-27 18:51:00,477 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2024-06-27 18:51:00,477 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 96 flow [2024-06-27 18:51:00,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-27 18:51:00,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:00,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:00,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 18:51:00,478 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:51:00,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:00,478 INFO L85 PathProgramCache]: Analyzing trace with hash -759902374, now seen corresponding path program 1 times [2024-06-27 18:51:00,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:00,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528418914] [2024-06-27 18:51:00,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:00,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:01,415 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-27 18:51:01,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:01,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528418914] [2024-06-27 18:51:01,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528418914] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:01,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:01,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 18:51:01,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649538541] [2024-06-27 18:51:01,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:01,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 18:51:01,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:01,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 18:51:01,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 18:51:01,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-06-27 18:51:01,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 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-27 18:51:01,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:01,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-06-27 18:51:01,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:01,685 INFO L124 PetriNetUnfolderBase]: 523/985 cut-off events. [2024-06-27 18:51:01,685 INFO L125 PetriNetUnfolderBase]: For 211/214 co-relation queries the response was YES. [2024-06-27 18:51:01,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2117 conditions, 985 events. 523/985 cut-off events. For 211/214 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4816 event pairs, 216 based on Foata normal form. 4/950 useless extension candidates. Maximal degree in co-relation 2104. Up to 829 conditions per place. [2024-06-27 18:51:01,689 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 45 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2024-06-27 18:51:01,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 58 transitions, 262 flow [2024-06-27 18:51:01,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 18:51:01,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 18:51:01,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2024-06-27 18:51:01,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5763888888888888 [2024-06-27 18:51:01,691 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 96 flow. Second operand 4 states and 83 transitions. [2024-06-27 18:51:01,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 58 transitions, 262 flow [2024-06-27 18:51:01,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 58 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 18:51:01,692 INFO L231 Difference]: Finished difference. Result has 43 places, 40 transitions, 148 flow [2024-06-27 18:51:01,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=43, PETRI_TRANSITIONS=40} [2024-06-27 18:51:01,693 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2024-06-27 18:51:01,693 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 40 transitions, 148 flow [2024-06-27 18:51:01,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 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-27 18:51:01,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:01,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:01,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 18:51:01,694 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:51:01,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:01,695 INFO L85 PathProgramCache]: Analyzing trace with hash -2082135938, now seen corresponding path program 1 times [2024-06-27 18:51:01,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:01,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178513504] [2024-06-27 18:51:01,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:01,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:02,936 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-27 18:51:02,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:02,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178513504] [2024-06-27 18:51:02,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178513504] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:02,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:02,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:51:02,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446667704] [2024-06-27 18:51:02,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:02,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 18:51:02,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:02,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 18:51:02,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 18:51:02,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-06-27 18:51:02,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 148 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-27 18:51:02,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:02,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-06-27 18:51:02,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:03,227 INFO L124 PetriNetUnfolderBase]: 522/983 cut-off events. [2024-06-27 18:51:03,228 INFO L125 PetriNetUnfolderBase]: For 381/390 co-relation queries the response was YES. [2024-06-27 18:51:03,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2321 conditions, 983 events. 522/983 cut-off events. For 381/390 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4800 event pairs, 162 based on Foata normal form. 8/952 useless extension candidates. Maximal degree in co-relation 2306. Up to 808 conditions per place. [2024-06-27 18:51:03,232 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 54 selfloop transitions, 10 changer transitions 0/70 dead transitions. [2024-06-27 18:51:03,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 70 transitions, 354 flow [2024-06-27 18:51:03,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:51:03,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:51:03,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2024-06-27 18:51:03,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5722222222222222 [2024-06-27 18:51:03,234 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 148 flow. Second operand 5 states and 103 transitions. [2024-06-27 18:51:03,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 70 transitions, 354 flow [2024-06-27 18:51:03,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 344 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-27 18:51:03,236 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 186 flow [2024-06-27 18:51:03,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2024-06-27 18:51:03,237 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2024-06-27 18:51:03,237 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 186 flow [2024-06-27 18:51:03,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-27 18:51:03,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:03,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:03,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 18:51:03,238 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:51:03,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:03,239 INFO L85 PathProgramCache]: Analyzing trace with hash -121703431, now seen corresponding path program 1 times [2024-06-27 18:51:03,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:03,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546265892] [2024-06-27 18:51:03,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:03,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:04,664 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-27 18:51:04,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:04,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546265892] [2024-06-27 18:51:04,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546265892] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:04,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:04,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:51:04,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809617883] [2024-06-27 18:51:04,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:04,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:51:04,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:04,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:51:04,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:51:04,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-06-27 18:51:04,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 186 flow. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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-27 18:51:04,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:04,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-06-27 18:51:04,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:05,028 INFO L124 PetriNetUnfolderBase]: 521/980 cut-off events. [2024-06-27 18:51:05,029 INFO L125 PetriNetUnfolderBase]: For 710/719 co-relation queries the response was YES. [2024-06-27 18:51:05,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2491 conditions, 980 events. 521/980 cut-off events. For 710/719 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4795 event pairs, 104 based on Foata normal form. 10/951 useless extension candidates. Maximal degree in co-relation 2474. Up to 767 conditions per place. [2024-06-27 18:51:05,035 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 59 selfloop transitions, 12 changer transitions 0/77 dead transitions. [2024-06-27 18:51:05,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 77 transitions, 414 flow [2024-06-27 18:51:05,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:51:05,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:51:05,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2024-06-27 18:51:05,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5462962962962963 [2024-06-27 18:51:05,039 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 186 flow. Second operand 6 states and 118 transitions. [2024-06-27 18:51:05,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 77 transitions, 414 flow [2024-06-27 18:51:05,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 77 transitions, 390 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-27 18:51:05,084 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 203 flow [2024-06-27 18:51:05,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=203, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2024-06-27 18:51:05,090 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2024-06-27 18:51:05,090 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 203 flow [2024-06-27 18:51:05,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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-27 18:51:05,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:05,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:05,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 18:51:05,091 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:51:05,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:05,092 INFO L85 PathProgramCache]: Analyzing trace with hash 147754526, now seen corresponding path program 1 times [2024-06-27 18:51:05,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:05,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505899087] [2024-06-27 18:51:05,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:05,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:06,597 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-27 18:51:06,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:06,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505899087] [2024-06-27 18:51:06,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505899087] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:06,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:06,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:51:06,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740337536] [2024-06-27 18:51:06,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:06,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 18:51:06,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:06,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 18:51:06,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 18:51:06,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-06-27 18:51:06,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 203 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-27 18:51:06,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:06,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-06-27 18:51:06,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:07,125 INFO L124 PetriNetUnfolderBase]: 424/795 cut-off events. [2024-06-27 18:51:07,125 INFO L125 PetriNetUnfolderBase]: For 882/882 co-relation queries the response was YES. [2024-06-27 18:51:07,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2177 conditions, 795 events. 424/795 cut-off events. For 882/882 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3772 event pairs, 121 based on Foata normal form. 1/767 useless extension candidates. Maximal degree in co-relation 2158. Up to 686 conditions per place. [2024-06-27 18:51:07,129 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 48 selfloop transitions, 10 changer transitions 0/64 dead transitions. [2024-06-27 18:51:07,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 64 transitions, 383 flow [2024-06-27 18:51:07,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:51:07,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:51:07,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2024-06-27 18:51:07,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2024-06-27 18:51:07,131 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 203 flow. Second operand 5 states and 87 transitions. [2024-06-27 18:51:07,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 64 transitions, 383 flow [2024-06-27 18:51:07,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 64 transitions, 350 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-27 18:51:07,135 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 230 flow [2024-06-27 18:51:07,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2024-06-27 18:51:07,138 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2024-06-27 18:51:07,138 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 230 flow [2024-06-27 18:51:07,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-27 18:51:07,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:07,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:07,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 18:51:07,139 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:51:07,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:07,139 INFO L85 PathProgramCache]: Analyzing trace with hash 285424761, now seen corresponding path program 1 times [2024-06-27 18:51:07,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:07,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963030226] [2024-06-27 18:51:07,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:07,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:09,078 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-27 18:51:09,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:09,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963030226] [2024-06-27 18:51:09,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963030226] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:09,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:09,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:51:09,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326653401] [2024-06-27 18:51:09,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:09,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:51:09,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:09,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:51:09,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:51:09,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:51:09,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 230 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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-27 18:51:09,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:09,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:51:09,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:09,770 INFO L124 PetriNetUnfolderBase]: 513/958 cut-off events. [2024-06-27 18:51:09,771 INFO L125 PetriNetUnfolderBase]: For 1213/1213 co-relation queries the response was YES. [2024-06-27 18:51:09,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2662 conditions, 958 events. 513/958 cut-off events. For 1213/1213 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4586 event pairs, 135 based on Foata normal form. 2/925 useless extension candidates. Maximal degree in co-relation 2640. Up to 799 conditions per place. [2024-06-27 18:51:09,775 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 67 selfloop transitions, 10 changer transitions 0/82 dead transitions. [2024-06-27 18:51:09,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 82 transitions, 509 flow [2024-06-27 18:51:09,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:51:09,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:51:09,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2024-06-27 18:51:09,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-06-27 18:51:09,777 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 230 flow. Second operand 6 states and 100 transitions. [2024-06-27 18:51:09,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 82 transitions, 509 flow [2024-06-27 18:51:09,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 82 transitions, 495 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-06-27 18:51:09,780 INFO L231 Difference]: Finished difference. Result has 58 places, 56 transitions, 310 flow [2024-06-27 18:51:09,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=310, PETRI_PLACES=58, PETRI_TRANSITIONS=56} [2024-06-27 18:51:09,781 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2024-06-27 18:51:09,782 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 56 transitions, 310 flow [2024-06-27 18:51:09,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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-27 18:51:09,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:09,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:09,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 18:51:09,782 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:51:09,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:09,783 INFO L85 PathProgramCache]: Analyzing trace with hash -791704994, now seen corresponding path program 1 times [2024-06-27 18:51:09,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:09,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055751060] [2024-06-27 18:51:09,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:09,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:11,661 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-27 18:51:11,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:11,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055751060] [2024-06-27 18:51:11,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055751060] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:11,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:11,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:51:11,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827057973] [2024-06-27 18:51:11,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:11,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:51:11,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:11,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:51:11,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:51:11,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:51:11,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 56 transitions, 310 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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-27 18:51:11,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:11,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:51:11,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:12,239 INFO L124 PetriNetUnfolderBase]: 531/999 cut-off events. [2024-06-27 18:51:12,239 INFO L125 PetriNetUnfolderBase]: For 1500/1512 co-relation queries the response was YES. [2024-06-27 18:51:12,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2982 conditions, 999 events. 531/999 cut-off events. For 1500/1512 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4891 event pairs, 152 based on Foata normal form. 9/968 useless extension candidates. Maximal degree in co-relation 2955. Up to 823 conditions per place. [2024-06-27 18:51:12,244 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 69 selfloop transitions, 12 changer transitions 0/86 dead transitions. [2024-06-27 18:51:12,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 86 transitions, 567 flow [2024-06-27 18:51:12,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:51:12,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:51:12,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-27 18:51:12,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-27 18:51:12,247 INFO L175 Difference]: Start difference. First operand has 58 places, 56 transitions, 310 flow. Second operand 6 states and 102 transitions. [2024-06-27 18:51:12,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 86 transitions, 567 flow [2024-06-27 18:51:12,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 86 transitions, 565 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 18:51:12,252 INFO L231 Difference]: Finished difference. Result has 64 places, 60 transitions, 373 flow [2024-06-27 18:51:12,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=373, PETRI_PLACES=64, PETRI_TRANSITIONS=60} [2024-06-27 18:51:12,252 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 24 predicate places. [2024-06-27 18:51:12,253 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 60 transitions, 373 flow [2024-06-27 18:51:12,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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-27 18:51:12,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:12,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:12,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 18:51:12,253 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:51:12,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:12,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1738327522, now seen corresponding path program 2 times [2024-06-27 18:51:12,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:12,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083808047] [2024-06-27 18:51:12,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:12,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:13,748 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-27 18:51:13,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:13,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083808047] [2024-06-27 18:51:13,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083808047] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:13,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:13,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:51:13,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414073611] [2024-06-27 18:51:13,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:13,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:51:13,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:13,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:51:13,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:51:13,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:51:13,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 60 transitions, 373 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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-27 18:51:13,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:13,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:51:13,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:14,245 INFO L124 PetriNetUnfolderBase]: 534/977 cut-off events. [2024-06-27 18:51:14,245 INFO L125 PetriNetUnfolderBase]: For 2043/2058 co-relation queries the response was YES. [2024-06-27 18:51:14,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3189 conditions, 977 events. 534/977 cut-off events. For 2043/2058 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4662 event pairs, 132 based on Foata normal form. 11/957 useless extension candidates. Maximal degree in co-relation 3158. Up to 801 conditions per place. [2024-06-27 18:51:14,250 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 64 selfloop transitions, 16 changer transitions 0/85 dead transitions. [2024-06-27 18:51:14,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 85 transitions, 613 flow [2024-06-27 18:51:14,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:51:14,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:51:14,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-06-27 18:51:14,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4675925925925926 [2024-06-27 18:51:14,251 INFO L175 Difference]: Start difference. First operand has 64 places, 60 transitions, 373 flow. Second operand 6 states and 101 transitions. [2024-06-27 18:51:14,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 85 transitions, 613 flow [2024-06-27 18:51:14,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 85 transitions, 596 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-06-27 18:51:14,255 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 409 flow [2024-06-27 18:51:14,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=409, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2024-06-27 18:51:14,256 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 28 predicate places. [2024-06-27 18:51:14,256 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 409 flow [2024-06-27 18:51:14,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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-27 18:51:14,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:14,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:14,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 18:51:14,257 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:51:14,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:14,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1738327336, now seen corresponding path program 1 times [2024-06-27 18:51:14,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:14,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680770887] [2024-06-27 18:51:14,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:14,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:15,622 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-27 18:51:15,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:15,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680770887] [2024-06-27 18:51:15,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680770887] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:15,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:15,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:51:15,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257336760] [2024-06-27 18:51:15,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:15,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:51:15,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:15,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:51:15,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:51:15,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:51:15,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 409 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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-27 18:51:15,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:15,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:51:15,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:16,362 INFO L124 PetriNetUnfolderBase]: 564/1023 cut-off events. [2024-06-27 18:51:16,362 INFO L125 PetriNetUnfolderBase]: For 2499/2514 co-relation queries the response was YES. [2024-06-27 18:51:16,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3498 conditions, 1023 events. 564/1023 cut-off events. For 2499/2514 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4828 event pairs, 130 based on Foata normal form. 12/1004 useless extension candidates. Maximal degree in co-relation 3465. Up to 802 conditions per place. [2024-06-27 18:51:16,368 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 65 selfloop transitions, 18 changer transitions 0/88 dead transitions. [2024-06-27 18:51:16,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 88 transitions, 655 flow [2024-06-27 18:51:16,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:51:16,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:51:16,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2024-06-27 18:51:16,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47685185185185186 [2024-06-27 18:51:16,369 INFO L175 Difference]: Start difference. First operand has 68 places, 62 transitions, 409 flow. Second operand 6 states and 103 transitions. [2024-06-27 18:51:16,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 88 transitions, 655 flow [2024-06-27 18:51:16,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 88 transitions, 620 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-27 18:51:16,374 INFO L231 Difference]: Finished difference. Result has 70 places, 64 transitions, 432 flow [2024-06-27 18:51:16,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=432, PETRI_PLACES=70, PETRI_TRANSITIONS=64} [2024-06-27 18:51:16,375 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 30 predicate places. [2024-06-27 18:51:16,375 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 64 transitions, 432 flow [2024-06-27 18:51:16,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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-27 18:51:16,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:16,375 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:16,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 18:51:16,375 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:51:16,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:16,376 INFO L85 PathProgramCache]: Analyzing trace with hash 272426104, now seen corresponding path program 2 times [2024-06-27 18:51:16,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:16,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485489948] [2024-06-27 18:51:16,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:16,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:16,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:18,089 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-27 18:51:18,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:18,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485489948] [2024-06-27 18:51:18,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485489948] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:18,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:18,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:51:18,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715835961] [2024-06-27 18:51:18,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:18,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:51:18,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:18,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:51:18,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:51:18,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:51:18,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 64 transitions, 432 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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-27 18:51:18,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:18,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:51:18,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:18,783 INFO L124 PetriNetUnfolderBase]: 560/1017 cut-off events. [2024-06-27 18:51:18,783 INFO L125 PetriNetUnfolderBase]: For 2750/2765 co-relation queries the response was YES. [2024-06-27 18:51:18,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3631 conditions, 1017 events. 560/1017 cut-off events. For 2750/2765 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4832 event pairs, 130 based on Foata normal form. 12/998 useless extension candidates. Maximal degree in co-relation 3597. Up to 758 conditions per place. [2024-06-27 18:51:18,788 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 73 selfloop transitions, 20 changer transitions 0/98 dead transitions. [2024-06-27 18:51:18,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 98 transitions, 728 flow [2024-06-27 18:51:18,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:51:18,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:51:18,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-27 18:51:18,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-27 18:51:18,790 INFO L175 Difference]: Start difference. First operand has 70 places, 64 transitions, 432 flow. Second operand 7 states and 120 transitions. [2024-06-27 18:51:18,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 98 transitions, 728 flow [2024-06-27 18:51:18,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 98 transitions, 690 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-27 18:51:18,796 INFO L231 Difference]: Finished difference. Result has 73 places, 66 transitions, 457 flow [2024-06-27 18:51:18,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=457, PETRI_PLACES=73, PETRI_TRANSITIONS=66} [2024-06-27 18:51:18,796 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 33 predicate places. [2024-06-27 18:51:18,797 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 66 transitions, 457 flow [2024-06-27 18:51:18,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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-27 18:51:18,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:18,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:18,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 18:51:18,797 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:51:18,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:18,798 INFO L85 PathProgramCache]: Analyzing trace with hash 272436024, now seen corresponding path program 1 times [2024-06-27 18:51:18,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:18,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104697991] [2024-06-27 18:51:18,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:18,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:20,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:51:20,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:20,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104697991] [2024-06-27 18:51:20,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104697991] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:20,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:20,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:51:20,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075617189] [2024-06-27 18:51:20,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:20,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:51:20,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:20,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:51:20,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:51:20,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:51:20,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 66 transitions, 457 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:20,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:20,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:51:20,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:21,642 INFO L124 PetriNetUnfolderBase]: 557/1029 cut-off events. [2024-06-27 18:51:21,642 INFO L125 PetriNetUnfolderBase]: For 2791/2791 co-relation queries the response was YES. [2024-06-27 18:51:21,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3677 conditions, 1029 events. 557/1029 cut-off events. For 2791/2791 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4938 event pairs, 133 based on Foata normal form. 2/995 useless extension candidates. Maximal degree in co-relation 3642. Up to 837 conditions per place. [2024-06-27 18:51:21,647 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 84 selfloop transitions, 11 changer transitions 0/100 dead transitions. [2024-06-27 18:51:21,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 100 transitions, 752 flow [2024-06-27 18:51:21,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:51:21,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:51:21,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2024-06-27 18:51:21,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45634920634920634 [2024-06-27 18:51:21,649 INFO L175 Difference]: Start difference. First operand has 73 places, 66 transitions, 457 flow. Second operand 7 states and 115 transitions. [2024-06-27 18:51:21,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 100 transitions, 752 flow [2024-06-27 18:51:21,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 100 transitions, 709 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-27 18:51:21,657 INFO L231 Difference]: Finished difference. Result has 75 places, 66 transitions, 440 flow [2024-06-27 18:51:21,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=440, PETRI_PLACES=75, PETRI_TRANSITIONS=66} [2024-06-27 18:51:21,658 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 35 predicate places. [2024-06-27 18:51:21,658 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 66 transitions, 440 flow [2024-06-27 18:51:21,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:21,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:21,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:21,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 18:51:21,659 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:51:21,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:21,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1226860348, now seen corresponding path program 1 times [2024-06-27 18:51:21,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:21,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615083944] [2024-06-27 18:51:21,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:21,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:23,518 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-27 18:51:23,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:23,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615083944] [2024-06-27 18:51:23,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615083944] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:23,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:23,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:51:23,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018834697] [2024-06-27 18:51:23,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:23,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:51:23,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:23,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:51:23,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:51:23,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:51:23,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 66 transitions, 440 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:23,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:23,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:51:23,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:24,130 INFO L124 PetriNetUnfolderBase]: 589/1064 cut-off events. [2024-06-27 18:51:24,130 INFO L125 PetriNetUnfolderBase]: For 3097/3112 co-relation queries the response was YES. [2024-06-27 18:51:24,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3815 conditions, 1064 events. 589/1064 cut-off events. For 3097/3112 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5135 event pairs, 121 based on Foata normal form. 11/1043 useless extension candidates. Maximal degree in co-relation 3779. Up to 801 conditions per place. [2024-06-27 18:51:24,136 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 86 selfloop transitions, 23 changer transitions 0/114 dead transitions. [2024-06-27 18:51:24,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 114 transitions, 866 flow [2024-06-27 18:51:24,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:51:24,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:51:24,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-27 18:51:24,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-06-27 18:51:24,138 INFO L175 Difference]: Start difference. First operand has 75 places, 66 transitions, 440 flow. Second operand 7 states and 128 transitions. [2024-06-27 18:51:24,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 114 transitions, 866 flow [2024-06-27 18:51:24,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 114 transitions, 839 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-27 18:51:24,145 INFO L231 Difference]: Finished difference. Result has 77 places, 73 transitions, 545 flow [2024-06-27 18:51:24,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=545, PETRI_PLACES=77, PETRI_TRANSITIONS=73} [2024-06-27 18:51:24,146 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 37 predicate places. [2024-06-27 18:51:24,146 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 73 transitions, 545 flow [2024-06-27 18:51:24,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:24,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:24,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:24,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 18:51:24,147 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:51:24,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:24,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1942704192, now seen corresponding path program 2 times [2024-06-27 18:51:24,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:24,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723377548] [2024-06-27 18:51:24,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:24,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:26,220 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-27 18:51:26,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:26,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723377548] [2024-06-27 18:51:26,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723377548] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:26,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:26,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:51:26,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632997850] [2024-06-27 18:51:26,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:26,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:51:26,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:26,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:51:26,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:51:26,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:51:26,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 73 transitions, 545 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:26,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:26,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:51:26,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:26,739 INFO L124 PetriNetUnfolderBase]: 592/1105 cut-off events. [2024-06-27 18:51:26,740 INFO L125 PetriNetUnfolderBase]: For 3719/3734 co-relation queries the response was YES. [2024-06-27 18:51:26,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4073 conditions, 1105 events. 592/1105 cut-off events. For 3719/3734 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5519 event pairs, 169 based on Foata normal form. 11/1072 useless extension candidates. Maximal degree in co-relation 4036. Up to 902 conditions per place. [2024-06-27 18:51:26,751 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 83 selfloop transitions, 13 changer transitions 0/101 dead transitions. [2024-06-27 18:51:26,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 101 transitions, 823 flow [2024-06-27 18:51:26,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:51:26,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:51:26,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2024-06-27 18:51:26,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47685185185185186 [2024-06-27 18:51:26,753 INFO L175 Difference]: Start difference. First operand has 77 places, 73 transitions, 545 flow. Second operand 6 states and 103 transitions. [2024-06-27 18:51:26,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 101 transitions, 823 flow [2024-06-27 18:51:26,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 101 transitions, 788 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-27 18:51:26,765 INFO L231 Difference]: Finished difference. Result has 80 places, 75 transitions, 563 flow [2024-06-27 18:51:26,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=563, PETRI_PLACES=80, PETRI_TRANSITIONS=75} [2024-06-27 18:51:26,765 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 40 predicate places. [2024-06-27 18:51:26,766 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 75 transitions, 563 flow [2024-06-27 18:51:26,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:26,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:26,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:26,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 18:51:26,766 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:51:26,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:26,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1942704347, now seen corresponding path program 1 times [2024-06-27 18:51:26,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:26,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302331813] [2024-06-27 18:51:26,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:26,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:28,644 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-27 18:51:28,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:28,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302331813] [2024-06-27 18:51:28,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302331813] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:28,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:28,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:51:28,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938917186] [2024-06-27 18:51:28,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:28,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:51:28,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:28,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:51:28,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:51:28,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:51:28,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 75 transitions, 563 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:28,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:28,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:51:28,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:29,204 INFO L124 PetriNetUnfolderBase]: 622/1151 cut-off events. [2024-06-27 18:51:29,204 INFO L125 PetriNetUnfolderBase]: For 4291/4306 co-relation queries the response was YES. [2024-06-27 18:51:29,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4356 conditions, 1151 events. 622/1151 cut-off events. For 4291/4306 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5749 event pairs, 174 based on Foata normal form. 12/1119 useless extension candidates. Maximal degree in co-relation 4318. Up to 933 conditions per place. [2024-06-27 18:51:29,216 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 92 selfloop transitions, 14 changer transitions 0/111 dead transitions. [2024-06-27 18:51:29,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 111 transitions, 887 flow [2024-06-27 18:51:29,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:51:29,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:51:29,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-27 18:51:29,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-27 18:51:29,217 INFO L175 Difference]: Start difference. First operand has 80 places, 75 transitions, 563 flow. Second operand 7 states and 119 transitions. [2024-06-27 18:51:29,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 111 transitions, 887 flow [2024-06-27 18:51:29,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 111 transitions, 858 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-27 18:51:29,226 INFO L231 Difference]: Finished difference. Result has 83 places, 77 transitions, 587 flow [2024-06-27 18:51:29,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=587, PETRI_PLACES=83, PETRI_TRANSITIONS=77} [2024-06-27 18:51:29,227 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 43 predicate places. [2024-06-27 18:51:29,227 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 77 transitions, 587 flow [2024-06-27 18:51:29,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:29,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:29,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:29,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 18:51:29,228 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:51:29,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:29,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1946428997, now seen corresponding path program 2 times [2024-06-27 18:51:29,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:29,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650470055] [2024-06-27 18:51:29,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:29,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:30,887 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-27 18:51:30,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:30,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650470055] [2024-06-27 18:51:30,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650470055] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:30,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:30,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:51:30,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816612009] [2024-06-27 18:51:30,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:30,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:51:30,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:30,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:51:30,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:51:30,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:51:30,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 77 transitions, 587 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:30,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:30,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:51:30,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:31,936 INFO L124 PetriNetUnfolderBase]: 699/1247 cut-off events. [2024-06-27 18:51:31,936 INFO L125 PetriNetUnfolderBase]: For 5449/5464 co-relation queries the response was YES. [2024-06-27 18:51:31,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5016 conditions, 1247 events. 699/1247 cut-off events. For 5449/5464 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6150 event pairs, 132 based on Foata normal form. 12/1224 useless extension candidates. Maximal degree in co-relation 4977. Up to 916 conditions per place. [2024-06-27 18:51:31,942 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 95 selfloop transitions, 24 changer transitions 0/124 dead transitions. [2024-06-27 18:51:31,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 124 transitions, 1025 flow [2024-06-27 18:51:31,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:51:31,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:51:31,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-27 18:51:31,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4826388888888889 [2024-06-27 18:51:31,944 INFO L175 Difference]: Start difference. First operand has 83 places, 77 transitions, 587 flow. Second operand 8 states and 139 transitions. [2024-06-27 18:51:31,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 124 transitions, 1025 flow [2024-06-27 18:51:31,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 124 transitions, 990 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-27 18:51:31,953 INFO L231 Difference]: Finished difference. Result has 87 places, 83 transitions, 668 flow [2024-06-27 18:51:31,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=668, PETRI_PLACES=87, PETRI_TRANSITIONS=83} [2024-06-27 18:51:31,954 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 47 predicate places. [2024-06-27 18:51:31,954 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 83 transitions, 668 flow [2024-06-27 18:51:31,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:31,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:31,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:31,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 18:51:31,955 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:51:31,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:31,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1946423417, now seen corresponding path program 3 times [2024-06-27 18:51:31,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:31,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593730089] [2024-06-27 18:51:31,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:31,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:33,845 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-27 18:51:33,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:33,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593730089] [2024-06-27 18:51:33,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593730089] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:33,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:33,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:51:33,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036851939] [2024-06-27 18:51:33,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:33,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:51:33,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:33,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:51:33,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:51:33,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:51:33,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 83 transitions, 668 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:33,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:33,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:51:33,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:35,005 INFO L124 PetriNetUnfolderBase]: 764/1346 cut-off events. [2024-06-27 18:51:35,006 INFO L125 PetriNetUnfolderBase]: For 7164/7179 co-relation queries the response was YES. [2024-06-27 18:51:35,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5920 conditions, 1346 events. 764/1346 cut-off events. For 7164/7179 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6671 event pairs, 128 based on Foata normal form. 12/1325 useless extension candidates. Maximal degree in co-relation 5879. Up to 894 conditions per place. [2024-06-27 18:51:35,013 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 103 selfloop transitions, 38 changer transitions 0/146 dead transitions. [2024-06-27 18:51:35,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 146 transitions, 1260 flow [2024-06-27 18:51:35,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:51:35,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:51:35,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-27 18:51:35,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 18:51:35,015 INFO L175 Difference]: Start difference. First operand has 87 places, 83 transitions, 668 flow. Second operand 9 states and 162 transitions. [2024-06-27 18:51:35,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 146 transitions, 1260 flow [2024-06-27 18:51:35,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 146 transitions, 1209 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-27 18:51:35,029 INFO L231 Difference]: Finished difference. Result has 93 places, 93 transitions, 837 flow [2024-06-27 18:51:35,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=837, PETRI_PLACES=93, PETRI_TRANSITIONS=93} [2024-06-27 18:51:35,030 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 53 predicate places. [2024-06-27 18:51:35,030 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 93 transitions, 837 flow [2024-06-27 18:51:35,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:35,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:35,030 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:35,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 18:51:35,031 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:51:35,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:35,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1946423262, now seen corresponding path program 3 times [2024-06-27 18:51:35,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:35,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747121848] [2024-06-27 18:51:35,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:35,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:36,684 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-27 18:51:36,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:36,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747121848] [2024-06-27 18:51:36,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747121848] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:36,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:36,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:51:36,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208589317] [2024-06-27 18:51:36,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:36,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:51:36,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:36,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:51:36,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:51:36,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:51:36,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 93 transitions, 837 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:36,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:36,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:51:36,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:37,487 INFO L124 PetriNetUnfolderBase]: 773/1429 cut-off events. [2024-06-27 18:51:37,487 INFO L125 PetriNetUnfolderBase]: For 8407/8425 co-relation queries the response was YES. [2024-06-27 18:51:37,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6570 conditions, 1429 events. 773/1429 cut-off events. For 8407/8425 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7511 event pairs, 200 based on Foata normal form. 13/1386 useless extension candidates. Maximal degree in co-relation 6526. Up to 1187 conditions per place. [2024-06-27 18:51:37,518 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 107 selfloop transitions, 24 changer transitions 0/136 dead transitions. [2024-06-27 18:51:37,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 136 transitions, 1367 flow [2024-06-27 18:51:37,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:51:37,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:51:37,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2024-06-27 18:51:37,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2024-06-27 18:51:37,520 INFO L175 Difference]: Start difference. First operand has 93 places, 93 transitions, 837 flow. Second operand 8 states and 124 transitions. [2024-06-27 18:51:37,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 136 transitions, 1367 flow [2024-06-27 18:51:37,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 136 transitions, 1263 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-27 18:51:37,536 INFO L231 Difference]: Finished difference. Result has 96 places, 110 transitions, 1009 flow [2024-06-27 18:51:37,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1009, PETRI_PLACES=96, PETRI_TRANSITIONS=110} [2024-06-27 18:51:37,536 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 56 predicate places. [2024-06-27 18:51:37,536 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 110 transitions, 1009 flow [2024-06-27 18:51:37,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:37,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:37,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:37,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 18:51:37,537 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:51:37,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:37,537 INFO L85 PathProgramCache]: Analyzing trace with hash -944728379, now seen corresponding path program 4 times [2024-06-27 18:51:37,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:37,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772991352] [2024-06-27 18:51:37,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:37,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:39,518 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-27 18:51:39,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:39,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772991352] [2024-06-27 18:51:39,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772991352] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:39,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:39,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:51:39,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699009729] [2024-06-27 18:51:39,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:39,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:51:39,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:39,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:51:39,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:51:39,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:51:39,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 110 transitions, 1009 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:39,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:39,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:51:39,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:40,485 INFO L124 PetriNetUnfolderBase]: 822/1504 cut-off events. [2024-06-27 18:51:40,485 INFO L125 PetriNetUnfolderBase]: For 8834/8852 co-relation queries the response was YES. [2024-06-27 18:51:40,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6928 conditions, 1504 events. 822/1504 cut-off events. For 8834/8852 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7928 event pairs, 148 based on Foata normal form. 15/1465 useless extension candidates. Maximal degree in co-relation 6882. Up to 1020 conditions per place. [2024-06-27 18:51:40,494 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 123 selfloop transitions, 43 changer transitions 0/171 dead transitions. [2024-06-27 18:51:40,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 171 transitions, 1707 flow [2024-06-27 18:51:40,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:51:40,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:51:40,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-06-27 18:51:40,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46111111111111114 [2024-06-27 18:51:40,495 INFO L175 Difference]: Start difference. First operand has 96 places, 110 transitions, 1009 flow. Second operand 10 states and 166 transitions. [2024-06-27 18:51:40,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 171 transitions, 1707 flow [2024-06-27 18:51:40,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 171 transitions, 1641 flow, removed 29 selfloop flow, removed 2 redundant places. [2024-06-27 18:51:40,513 INFO L231 Difference]: Finished difference. Result has 106 places, 120 transitions, 1191 flow [2024-06-27 18:51:40,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1191, PETRI_PLACES=106, PETRI_TRANSITIONS=120} [2024-06-27 18:51:40,513 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 66 predicate places. [2024-06-27 18:51:40,513 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 120 transitions, 1191 flow [2024-06-27 18:51:40,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:40,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:40,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:40,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 18:51:40,514 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:51:40,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:40,515 INFO L85 PathProgramCache]: Analyzing trace with hash 91432475, now seen corresponding path program 1 times [2024-06-27 18:51:40,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:40,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381746932] [2024-06-27 18:51:40,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:40,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:42,336 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-27 18:51:42,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:42,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381746932] [2024-06-27 18:51:42,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381746932] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:42,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:42,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:51:42,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972605436] [2024-06-27 18:51:42,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:42,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:51:42,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:42,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:51:42,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:51:42,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:51:42,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 120 transitions, 1191 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:42,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:42,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:51:42,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:43,128 INFO L124 PetriNetUnfolderBase]: 881/1618 cut-off events. [2024-06-27 18:51:43,128 INFO L125 PetriNetUnfolderBase]: For 10868/10886 co-relation queries the response was YES. [2024-06-27 18:51:43,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7931 conditions, 1618 events. 881/1618 cut-off events. For 10868/10886 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8927 event pairs, 156 based on Foata normal form. 14/1574 useless extension candidates. Maximal degree in co-relation 7881. Up to 1248 conditions per place. [2024-06-27 18:51:43,139 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 147 selfloop transitions, 21 changer transitions 0/173 dead transitions. [2024-06-27 18:51:43,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 173 transitions, 1793 flow [2024-06-27 18:51:43,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:51:43,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:51:43,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-27 18:51:43,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4895833333333333 [2024-06-27 18:51:43,141 INFO L175 Difference]: Start difference. First operand has 106 places, 120 transitions, 1191 flow. Second operand 8 states and 141 transitions. [2024-06-27 18:51:43,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 173 transitions, 1793 flow [2024-06-27 18:51:43,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 173 transitions, 1706 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-06-27 18:51:43,166 INFO L231 Difference]: Finished difference. Result has 111 places, 126 transitions, 1226 flow [2024-06-27 18:51:43,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1104, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1226, PETRI_PLACES=111, PETRI_TRANSITIONS=126} [2024-06-27 18:51:43,167 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 71 predicate places. [2024-06-27 18:51:43,167 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 126 transitions, 1226 flow [2024-06-27 18:51:43,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:43,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:43,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:43,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 18:51:43,168 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:51:43,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:43,168 INFO L85 PathProgramCache]: Analyzing trace with hash 91493049, now seen corresponding path program 1 times [2024-06-27 18:51:43,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:43,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035814755] [2024-06-27 18:51:43,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:43,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:44,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-27 18:51:44,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:44,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035814755] [2024-06-27 18:51:44,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035814755] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:44,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:44,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:51:44,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985444880] [2024-06-27 18:51:44,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:44,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:51:44,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:44,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:51:44,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:51:44,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:51:44,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 126 transitions, 1226 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:44,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:44,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:51:44,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:45,956 INFO L124 PetriNetUnfolderBase]: 945/1701 cut-off events. [2024-06-27 18:51:45,957 INFO L125 PetriNetUnfolderBase]: For 11365/11383 co-relation queries the response was YES. [2024-06-27 18:51:45,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8432 conditions, 1701 events. 945/1701 cut-off events. For 11365/11383 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9250 event pairs, 145 based on Foata normal form. 14/1662 useless extension candidates. Maximal degree in co-relation 8378. Up to 1090 conditions per place. [2024-06-27 18:51:45,977 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 131 selfloop transitions, 53 changer transitions 0/189 dead transitions. [2024-06-27 18:51:45,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 189 transitions, 1944 flow [2024-06-27 18:51:45,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:51:45,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:51:45,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-06-27 18:51:45,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5154320987654321 [2024-06-27 18:51:45,979 INFO L175 Difference]: Start difference. First operand has 111 places, 126 transitions, 1226 flow. Second operand 9 states and 167 transitions. [2024-06-27 18:51:45,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 189 transitions, 1944 flow [2024-06-27 18:51:46,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 189 transitions, 1914 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-27 18:51:46,005 INFO L231 Difference]: Finished difference. Result has 117 places, 130 transitions, 1356 flow [2024-06-27 18:51:46,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1196, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1356, PETRI_PLACES=117, PETRI_TRANSITIONS=130} [2024-06-27 18:51:46,006 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 77 predicate places. [2024-06-27 18:51:46,006 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 130 transitions, 1356 flow [2024-06-27 18:51:46,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:46,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:46,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:46,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 18:51:46,007 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:51:46,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:46,007 INFO L85 PathProgramCache]: Analyzing trace with hash 91492925, now seen corresponding path program 2 times [2024-06-27 18:51:46,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:46,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99367024] [2024-06-27 18:51:46,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:46,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:47,812 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-27 18:51:47,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:47,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99367024] [2024-06-27 18:51:47,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99367024] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:47,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:47,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:51:47,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111758092] [2024-06-27 18:51:47,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:47,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:51:47,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:47,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:51:47,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:51:47,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:51:47,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 130 transitions, 1356 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:47,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:47,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:51:47,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:48,610 INFO L124 PetriNetUnfolderBase]: 949/1754 cut-off events. [2024-06-27 18:51:48,610 INFO L125 PetriNetUnfolderBase]: For 12768/12786 co-relation queries the response was YES. [2024-06-27 18:51:48,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8818 conditions, 1754 events. 949/1754 cut-off events. For 12768/12786 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9829 event pairs, 213 based on Foata normal form. 14/1700 useless extension candidates. Maximal degree in co-relation 8762. Up to 1324 conditions per place. [2024-06-27 18:51:48,621 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 128 selfloop transitions, 45 changer transitions 0/178 dead transitions. [2024-06-27 18:51:48,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 178 transitions, 1909 flow [2024-06-27 18:51:48,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:51:48,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:51:48,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-27 18:51:48,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4965277777777778 [2024-06-27 18:51:48,623 INFO L175 Difference]: Start difference. First operand has 117 places, 130 transitions, 1356 flow. Second operand 8 states and 143 transitions. [2024-06-27 18:51:48,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 178 transitions, 1909 flow [2024-06-27 18:51:48,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 178 transitions, 1825 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-27 18:51:48,650 INFO L231 Difference]: Finished difference. Result has 120 places, 131 transitions, 1382 flow [2024-06-27 18:51:48,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1272, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1382, PETRI_PLACES=120, PETRI_TRANSITIONS=131} [2024-06-27 18:51:48,651 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 80 predicate places. [2024-06-27 18:51:48,651 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 131 transitions, 1382 flow [2024-06-27 18:51:48,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:48,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:48,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:48,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 18:51:48,652 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:51:48,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:48,652 INFO L85 PathProgramCache]: Analyzing trace with hash 94289559, now seen corresponding path program 2 times [2024-06-27 18:51:48,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:48,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509181308] [2024-06-27 18:51:48,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:48,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:51,370 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-27 18:51:51,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:51,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509181308] [2024-06-27 18:51:51,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509181308] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:51,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:51,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:51:51,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537891771] [2024-06-27 18:51:51,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:51,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:51:51,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:51,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:51:51,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:51:51,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:51:51,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 131 transitions, 1382 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:51,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:51,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:51:51,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:52,306 INFO L124 PetriNetUnfolderBase]: 979/1773 cut-off events. [2024-06-27 18:51:52,306 INFO L125 PetriNetUnfolderBase]: For 12882/12900 co-relation queries the response was YES. [2024-06-27 18:51:52,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9099 conditions, 1773 events. 979/1773 cut-off events. For 12882/12900 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9847 event pairs, 218 based on Foata normal form. 14/1728 useless extension candidates. Maximal degree in co-relation 9041. Up to 1449 conditions per place. [2024-06-27 18:51:52,367 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 155 selfloop transitions, 21 changer transitions 0/181 dead transitions. [2024-06-27 18:51:52,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 181 transitions, 1961 flow [2024-06-27 18:51:52,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:51:52,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:51:52,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-06-27 18:51:52,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2024-06-27 18:51:52,377 INFO L175 Difference]: Start difference. First operand has 120 places, 131 transitions, 1382 flow. Second operand 9 states and 152 transitions. [2024-06-27 18:51:52,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 181 transitions, 1961 flow [2024-06-27 18:51:52,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 181 transitions, 1867 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-27 18:51:52,404 INFO L231 Difference]: Finished difference. Result has 123 places, 133 transitions, 1366 flow [2024-06-27 18:51:52,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1366, PETRI_PLACES=123, PETRI_TRANSITIONS=133} [2024-06-27 18:51:52,405 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 83 predicate places. [2024-06-27 18:51:52,405 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 133 transitions, 1366 flow [2024-06-27 18:51:52,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:52,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:52,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:52,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 18:51:52,406 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:51:52,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:52,407 INFO L85 PathProgramCache]: Analyzing trace with hash 94289435, now seen corresponding path program 3 times [2024-06-27 18:51:52,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:52,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047211465] [2024-06-27 18:51:52,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:52,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:54,706 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-27 18:51:54,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:54,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047211465] [2024-06-27 18:51:54,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047211465] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:54,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:54,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:51:54,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783671801] [2024-06-27 18:51:54,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:54,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:51:54,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:54,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:51:54,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:51:54,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:51:54,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 133 transitions, 1366 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:54,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:54,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:51:54,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:55,345 INFO L124 PetriNetUnfolderBase]: 1001/1823 cut-off events. [2024-06-27 18:51:55,346 INFO L125 PetriNetUnfolderBase]: For 14062/14080 co-relation queries the response was YES. [2024-06-27 18:51:55,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9350 conditions, 1823 events. 1001/1823 cut-off events. For 14062/14080 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10291 event pairs, 228 based on Foata normal form. 14/1774 useless extension candidates. Maximal degree in co-relation 9291. Up to 1533 conditions per place. [2024-06-27 18:51:55,357 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 151 selfloop transitions, 18 changer transitions 0/174 dead transitions. [2024-06-27 18:51:55,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 174 transitions, 1871 flow [2024-06-27 18:51:55,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:51:55,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:51:55,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-27 18:51:55,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4652777777777778 [2024-06-27 18:51:55,385 INFO L175 Difference]: Start difference. First operand has 123 places, 133 transitions, 1366 flow. Second operand 8 states and 134 transitions. [2024-06-27 18:51:55,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 174 transitions, 1871 flow [2024-06-27 18:51:55,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 174 transitions, 1803 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-27 18:51:55,415 INFO L231 Difference]: Finished difference. Result has 123 places, 134 transitions, 1354 flow [2024-06-27 18:51:55,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1354, PETRI_PLACES=123, PETRI_TRANSITIONS=134} [2024-06-27 18:51:55,416 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 83 predicate places. [2024-06-27 18:51:55,416 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 134 transitions, 1354 flow [2024-06-27 18:51:55,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:55,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:55,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:55,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 18:51:55,417 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:51:55,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:55,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1066855895, now seen corresponding path program 1 times [2024-06-27 18:51:55,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:55,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693413311] [2024-06-27 18:51:55,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:55,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:57,384 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-27 18:51:57,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:57,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693413311] [2024-06-27 18:51:57,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693413311] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:57,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:57,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:51:57,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521284982] [2024-06-27 18:51:57,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:57,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:51:57,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:57,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:51:57,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:51:57,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:51:57,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 134 transitions, 1354 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:57,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:57,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:51:57,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:58,310 INFO L124 PetriNetUnfolderBase]: 1023/1882 cut-off events. [2024-06-27 18:51:58,310 INFO L125 PetriNetUnfolderBase]: For 14522/14540 co-relation queries the response was YES. [2024-06-27 18:51:58,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9461 conditions, 1882 events. 1023/1882 cut-off events. For 14522/14540 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10675 event pairs, 180 based on Foata normal form. 14/1826 useless extension candidates. Maximal degree in co-relation 9402. Up to 1479 conditions per place. [2024-06-27 18:51:58,322 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 133 selfloop transitions, 27 changer transitions 0/165 dead transitions. [2024-06-27 18:51:58,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 165 transitions, 1803 flow [2024-06-27 18:51:58,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:51:58,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:51:58,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-27 18:51:58,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-27 18:51:58,324 INFO L175 Difference]: Start difference. First operand has 123 places, 134 transitions, 1354 flow. Second operand 7 states and 119 transitions. [2024-06-27 18:51:58,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 165 transitions, 1803 flow [2024-06-27 18:51:58,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 165 transitions, 1757 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-27 18:51:58,353 INFO L231 Difference]: Finished difference. Result has 124 places, 135 transitions, 1381 flow [2024-06-27 18:51:58,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1308, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1381, PETRI_PLACES=124, PETRI_TRANSITIONS=135} [2024-06-27 18:51:58,354 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 84 predicate places. [2024-06-27 18:51:58,354 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 135 transitions, 1381 flow [2024-06-27 18:51:58,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:58,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:58,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:58,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 18:51:58,355 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:51:58,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:58,355 INFO L85 PathProgramCache]: Analyzing trace with hash 209585379, now seen corresponding path program 3 times [2024-06-27 18:51:58,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:58,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195196319] [2024-06-27 18:51:58,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:58,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:00,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-27 18:52:00,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:00,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195196319] [2024-06-27 18:52:00,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195196319] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:00,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:00,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:52:00,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078685667] [2024-06-27 18:52:00,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:00,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:52:00,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:00,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:52:00,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:52:00,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:52:00,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 135 transitions, 1381 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:00,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:00,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:52:00,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:01,103 INFO L124 PetriNetUnfolderBase]: 1069/1945 cut-off events. [2024-06-27 18:52:01,104 INFO L125 PetriNetUnfolderBase]: For 15309/15327 co-relation queries the response was YES. [2024-06-27 18:52:01,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9924 conditions, 1945 events. 1069/1945 cut-off events. For 15309/15327 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11082 event pairs, 209 based on Foata normal form. 14/1891 useless extension candidates. Maximal degree in co-relation 9864. Up to 1553 conditions per place. [2024-06-27 18:52:01,115 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 164 selfloop transitions, 39 changer transitions 0/208 dead transitions. [2024-06-27 18:52:01,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 208 transitions, 2286 flow [2024-06-27 18:52:01,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:52:01,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:52:01,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 163 transitions. [2024-06-27 18:52:01,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4527777777777778 [2024-06-27 18:52:01,117 INFO L175 Difference]: Start difference. First operand has 124 places, 135 transitions, 1381 flow. Second operand 10 states and 163 transitions. [2024-06-27 18:52:01,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 208 transitions, 2286 flow [2024-06-27 18:52:01,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 208 transitions, 2213 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-27 18:52:01,152 INFO L231 Difference]: Finished difference. Result has 132 places, 162 transitions, 1778 flow [2024-06-27 18:52:01,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1323, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1778, PETRI_PLACES=132, PETRI_TRANSITIONS=162} [2024-06-27 18:52:01,152 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 92 predicate places. [2024-06-27 18:52:01,153 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 162 transitions, 1778 flow [2024-06-27 18:52:01,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:01,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:01,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:01,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 18:52:01,153 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:52:01,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:01,154 INFO L85 PathProgramCache]: Analyzing trace with hash 209580729, now seen corresponding path program 4 times [2024-06-27 18:52:01,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:01,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339895556] [2024-06-27 18:52:01,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:01,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:03,107 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-27 18:52:03,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:03,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339895556] [2024-06-27 18:52:03,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339895556] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:03,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:03,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:52:03,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838679325] [2024-06-27 18:52:03,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:03,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:52:03,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:03,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:52:03,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:52:03,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:52:03,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 162 transitions, 1778 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:03,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:03,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:52:03,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:04,156 INFO L124 PetriNetUnfolderBase]: 1126/2057 cut-off events. [2024-06-27 18:52:04,156 INFO L125 PetriNetUnfolderBase]: For 17334/17352 co-relation queries the response was YES. [2024-06-27 18:52:04,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11005 conditions, 2057 events. 1126/2057 cut-off events. For 17334/17352 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 11874 event pairs, 202 based on Foata normal form. 14/1996 useless extension candidates. Maximal degree in co-relation 10941. Up to 1464 conditions per place. [2024-06-27 18:52:04,170 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 153 selfloop transitions, 69 changer transitions 0/227 dead transitions. [2024-06-27 18:52:04,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 227 transitions, 2719 flow [2024-06-27 18:52:04,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:52:04,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:52:04,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-06-27 18:52:04,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845679012345679 [2024-06-27 18:52:04,171 INFO L175 Difference]: Start difference. First operand has 132 places, 162 transitions, 1778 flow. Second operand 9 states and 157 transitions. [2024-06-27 18:52:04,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 227 transitions, 2719 flow [2024-06-27 18:52:04,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 227 transitions, 2625 flow, removed 40 selfloop flow, removed 3 redundant places. [2024-06-27 18:52:04,212 INFO L231 Difference]: Finished difference. Result has 140 places, 179 transitions, 2138 flow [2024-06-27 18:52:04,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1684, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2138, PETRI_PLACES=140, PETRI_TRANSITIONS=179} [2024-06-27 18:52:04,213 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 100 predicate places. [2024-06-27 18:52:04,213 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 179 transitions, 2138 flow [2024-06-27 18:52:04,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:04,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:04,214 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:04,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 18:52:04,214 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:52:04,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:04,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1066848951, now seen corresponding path program 5 times [2024-06-27 18:52:04,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:04,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327289616] [2024-06-27 18:52:04,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:04,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:06,113 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-27 18:52:06,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:06,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327289616] [2024-06-27 18:52:06,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327289616] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:06,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:06,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:52:06,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251472958] [2024-06-27 18:52:06,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:06,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:52:06,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:06,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:52:06,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:52:06,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:52:06,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 179 transitions, 2138 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:06,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:06,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:52:06,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:07,291 INFO L124 PetriNetUnfolderBase]: 1173/2150 cut-off events. [2024-06-27 18:52:07,292 INFO L125 PetriNetUnfolderBase]: For 20938/20956 co-relation queries the response was YES. [2024-06-27 18:52:07,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12116 conditions, 2150 events. 1173/2150 cut-off events. For 20938/20956 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 12557 event pairs, 179 based on Foata normal form. 14/2085 useless extension candidates. Maximal degree in co-relation 12048. Up to 1496 conditions per place. [2024-06-27 18:52:07,307 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 168 selfloop transitions, 77 changer transitions 0/250 dead transitions. [2024-06-27 18:52:07,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 250 transitions, 3183 flow [2024-06-27 18:52:07,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:52:07,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:52:07,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-27 18:52:07,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 18:52:07,310 INFO L175 Difference]: Start difference. First operand has 140 places, 179 transitions, 2138 flow. Second operand 9 states and 162 transitions. [2024-06-27 18:52:07,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 250 transitions, 3183 flow [2024-06-27 18:52:07,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 250 transitions, 2994 flow, removed 72 selfloop flow, removed 4 redundant places. [2024-06-27 18:52:07,375 INFO L231 Difference]: Finished difference. Result has 146 places, 200 transitions, 2478 flow [2024-06-27 18:52:07,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1991, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2478, PETRI_PLACES=146, PETRI_TRANSITIONS=200} [2024-06-27 18:52:07,376 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 106 predicate places. [2024-06-27 18:52:07,376 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 200 transitions, 2478 flow [2024-06-27 18:52:07,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:07,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:07,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:07,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 18:52:07,377 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:52:07,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:07,377 INFO L85 PathProgramCache]: Analyzing trace with hash 209580605, now seen corresponding path program 4 times [2024-06-27 18:52:07,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:07,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998857098] [2024-06-27 18:52:07,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:07,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:52:09,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:09,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998857098] [2024-06-27 18:52:09,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998857098] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:09,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:09,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:52:09,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021333070] [2024-06-27 18:52:09,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:09,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:52:09,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:09,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:52:09,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:52:09,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:52:09,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 200 transitions, 2478 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:09,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:09,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:52:09,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:10,215 INFO L124 PetriNetUnfolderBase]: 1173/2129 cut-off events. [2024-06-27 18:52:10,216 INFO L125 PetriNetUnfolderBase]: For 22004/22025 co-relation queries the response was YES. [2024-06-27 18:52:10,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12536 conditions, 2129 events. 1173/2129 cut-off events. For 22004/22025 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12388 event pairs, 225 based on Foata normal form. 16/2073 useless extension candidates. Maximal degree in co-relation 12465. Up to 1814 conditions per place. [2024-06-27 18:52:10,234 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 194 selfloop transitions, 33 changer transitions 0/232 dead transitions. [2024-06-27 18:52:10,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 232 transitions, 3071 flow [2024-06-27 18:52:10,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:52:10,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:52:10,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 139 transitions. [2024-06-27 18:52:10,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42901234567901236 [2024-06-27 18:52:10,236 INFO L175 Difference]: Start difference. First operand has 146 places, 200 transitions, 2478 flow. Second operand 9 states and 139 transitions. [2024-06-27 18:52:10,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 232 transitions, 3071 flow [2024-06-27 18:52:10,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 232 transitions, 2996 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-27 18:52:10,301 INFO L231 Difference]: Finished difference. Result has 151 places, 202 transitions, 2516 flow [2024-06-27 18:52:10,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2403, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2516, PETRI_PLACES=151, PETRI_TRANSITIONS=202} [2024-06-27 18:52:10,304 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 111 predicate places. [2024-06-27 18:52:10,304 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 202 transitions, 2516 flow [2024-06-27 18:52:10,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:10,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:10,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:10,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 18:52:10,305 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:52:10,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:10,305 INFO L85 PathProgramCache]: Analyzing trace with hash 787723063, now seen corresponding path program 2 times [2024-06-27 18:52:10,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:10,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527681463] [2024-06-27 18:52:10,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:10,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:12,567 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-27 18:52:12,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:12,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527681463] [2024-06-27 18:52:12,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527681463] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:12,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:12,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:52:12,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691894805] [2024-06-27 18:52:12,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:12,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:52:12,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:12,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:52:12,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:52:12,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:52:12,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 202 transitions, 2516 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:12,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:12,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:52:12,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:13,537 INFO L124 PetriNetUnfolderBase]: 1195/2194 cut-off events. [2024-06-27 18:52:13,537 INFO L125 PetriNetUnfolderBase]: For 23771/23792 co-relation queries the response was YES. [2024-06-27 18:52:13,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12869 conditions, 2194 events. 1195/2194 cut-off events. For 23771/23792 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 12882 event pairs, 176 based on Foata normal form. 16/2129 useless extension candidates. Maximal degree in co-relation 12796. Up to 1637 conditions per place. [2024-06-27 18:52:13,552 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 202 selfloop transitions, 35 changer transitions 0/242 dead transitions. [2024-06-27 18:52:13,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 242 transitions, 3270 flow [2024-06-27 18:52:13,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:52:13,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:52:13,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-27 18:52:13,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46875 [2024-06-27 18:52:13,554 INFO L175 Difference]: Start difference. First operand has 151 places, 202 transitions, 2516 flow. Second operand 8 states and 135 transitions. [2024-06-27 18:52:13,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 242 transitions, 3270 flow [2024-06-27 18:52:13,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 242 transitions, 3173 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-27 18:52:13,611 INFO L231 Difference]: Finished difference. Result has 152 places, 203 transitions, 2509 flow [2024-06-27 18:52:13,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2419, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2509, PETRI_PLACES=152, PETRI_TRANSITIONS=203} [2024-06-27 18:52:13,612 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 112 predicate places. [2024-06-27 18:52:13,612 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 203 transitions, 2509 flow [2024-06-27 18:52:13,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:13,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:13,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:13,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 18:52:13,612 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:52:13,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:13,613 INFO L85 PathProgramCache]: Analyzing trace with hash 787396633, now seen corresponding path program 3 times [2024-06-27 18:52:13,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:13,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582182664] [2024-06-27 18:52:13,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:13,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:15,766 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-27 18:52:15,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:15,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582182664] [2024-06-27 18:52:15,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582182664] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:15,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:15,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:52:15,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444293019] [2024-06-27 18:52:15,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:15,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:52:15,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:15,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:52:15,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:52:15,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:52:15,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 203 transitions, 2509 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:15,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:15,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:52:15,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:16,840 INFO L124 PetriNetUnfolderBase]: 1192/2195 cut-off events. [2024-06-27 18:52:16,841 INFO L125 PetriNetUnfolderBase]: For 23817/23838 co-relation queries the response was YES. [2024-06-27 18:52:16,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12825 conditions, 2195 events. 1192/2195 cut-off events. For 23817/23838 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 12935 event pairs, 203 based on Foata normal form. 16/2128 useless extension candidates. Maximal degree in co-relation 12751. Up to 1735 conditions per place. [2024-06-27 18:52:16,857 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 201 selfloop transitions, 35 changer transitions 0/241 dead transitions. [2024-06-27 18:52:16,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 241 transitions, 3203 flow [2024-06-27 18:52:16,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:52:16,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:52:16,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-27 18:52:16,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-27 18:52:16,859 INFO L175 Difference]: Start difference. First operand has 152 places, 203 transitions, 2509 flow. Second operand 8 states and 136 transitions. [2024-06-27 18:52:16,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 241 transitions, 3203 flow [2024-06-27 18:52:16,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 241 transitions, 3133 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-27 18:52:16,919 INFO L231 Difference]: Finished difference. Result has 155 places, 203 transitions, 2513 flow [2024-06-27 18:52:16,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2439, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2513, PETRI_PLACES=155, PETRI_TRANSITIONS=203} [2024-06-27 18:52:16,919 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 115 predicate places. [2024-06-27 18:52:16,920 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 203 transitions, 2513 flow [2024-06-27 18:52:16,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:16,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:16,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:16,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 18:52:16,920 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:52:16,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:16,921 INFO L85 PathProgramCache]: Analyzing trace with hash -191469001, now seen corresponding path program 6 times [2024-06-27 18:52:16,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:16,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132228138] [2024-06-27 18:52:16,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:16,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:18,862 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-27 18:52:18,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:18,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132228138] [2024-06-27 18:52:18,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132228138] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:18,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:18,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:52:18,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910311557] [2024-06-27 18:52:18,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:18,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:52:18,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:18,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:52:18,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:52:18,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:52:18,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 203 transitions, 2513 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:18,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:18,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:52:18,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:20,177 INFO L124 PetriNetUnfolderBase]: 1209/2195 cut-off events. [2024-06-27 18:52:20,178 INFO L125 PetriNetUnfolderBase]: For 23763/23784 co-relation queries the response was YES. [2024-06-27 18:52:20,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12947 conditions, 2195 events. 1209/2195 cut-off events. For 23763/23784 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 12854 event pairs, 206 based on Foata normal form. 16/2137 useless extension candidates. Maximal degree in co-relation 12872. Up to 1602 conditions per place. [2024-06-27 18:52:20,194 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 194 selfloop transitions, 90 changer transitions 0/289 dead transitions. [2024-06-27 18:52:20,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 289 transitions, 3836 flow [2024-06-27 18:52:20,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 18:52:20,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 18:52:20,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 196 transitions. [2024-06-27 18:52:20,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4537037037037037 [2024-06-27 18:52:20,196 INFO L175 Difference]: Start difference. First operand has 155 places, 203 transitions, 2513 flow. Second operand 12 states and 196 transitions. [2024-06-27 18:52:20,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 289 transitions, 3836 flow [2024-06-27 18:52:20,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 289 transitions, 3740 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-27 18:52:20,264 INFO L231 Difference]: Finished difference. Result has 163 places, 239 transitions, 3255 flow [2024-06-27 18:52:20,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2435, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3255, PETRI_PLACES=163, PETRI_TRANSITIONS=239} [2024-06-27 18:52:20,265 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 123 predicate places. [2024-06-27 18:52:20,266 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 239 transitions, 3255 flow [2024-06-27 18:52:20,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:20,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:20,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:20,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 18:52:20,266 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:52:20,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:20,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1691084870, now seen corresponding path program 1 times [2024-06-27 18:52:20,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:20,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989115524] [2024-06-27 18:52:20,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:20,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:20,332 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-27 18:52:20,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:20,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989115524] [2024-06-27 18:52:20,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989115524] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:20,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:20,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 18:52:20,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458350426] [2024-06-27 18:52:20,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:20,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 18:52:20,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:20,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 18:52:20,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 18:52:20,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 18:52:20,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 239 transitions, 3255 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-27 18:52:20,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:20,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 18:52:20,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:20,601 INFO L124 PetriNetUnfolderBase]: 603/1185 cut-off events. [2024-06-27 18:52:20,601 INFO L125 PetriNetUnfolderBase]: For 20464/20506 co-relation queries the response was YES. [2024-06-27 18:52:20,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7316 conditions, 1185 events. 603/1185 cut-off events. For 20464/20506 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6515 event pairs, 131 based on Foata normal form. 88/1224 useless extension candidates. Maximal degree in co-relation 7238. Up to 428 conditions per place. [2024-06-27 18:52:20,611 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 83 selfloop transitions, 27 changer transitions 0/133 dead transitions. [2024-06-27 18:52:20,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 133 transitions, 1867 flow [2024-06-27 18:52:20,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 18:52:20,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 18:52:20,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2024-06-27 18:52:20,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5902777777777778 [2024-06-27 18:52:20,612 INFO L175 Difference]: Start difference. First operand has 163 places, 239 transitions, 3255 flow. Second operand 4 states and 85 transitions. [2024-06-27 18:52:20,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 133 transitions, 1867 flow [2024-06-27 18:52:20,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 133 transitions, 1514 flow, removed 44 selfloop flow, removed 35 redundant places. [2024-06-27 18:52:20,654 INFO L231 Difference]: Finished difference. Result has 131 places, 112 transitions, 1174 flow [2024-06-27 18:52:20,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1174, PETRI_PLACES=131, PETRI_TRANSITIONS=112} [2024-06-27 18:52:20,655 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 91 predicate places. [2024-06-27 18:52:20,655 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 112 transitions, 1174 flow [2024-06-27 18:52:20,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-27 18:52:20,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:20,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:20,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 18:52:20,656 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:52:20,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:20,656 INFO L85 PathProgramCache]: Analyzing trace with hash 2017250948, now seen corresponding path program 1 times [2024-06-27 18:52:20,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:20,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080094758] [2024-06-27 18:52:20,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:20,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:22,802 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-27 18:52:22,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:22,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080094758] [2024-06-27 18:52:22,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080094758] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:22,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:22,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:52:22,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810300190] [2024-06-27 18:52:22,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:22,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:52:22,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:22,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:52:22,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:52:22,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:52:22,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 112 transitions, 1174 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:22,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:22,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:52:22,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:23,855 INFO L124 PetriNetUnfolderBase]: 908/1745 cut-off events. [2024-06-27 18:52:23,856 INFO L125 PetriNetUnfolderBase]: For 26501/26504 co-relation queries the response was YES. [2024-06-27 18:52:23,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9515 conditions, 1745 events. 908/1745 cut-off events. For 26501/26504 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9970 event pairs, 244 based on Foata normal form. 10/1708 useless extension candidates. Maximal degree in co-relation 9450. Up to 790 conditions per place. [2024-06-27 18:52:23,867 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 121 selfloop transitions, 37 changer transitions 5/168 dead transitions. [2024-06-27 18:52:23,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 168 transitions, 1887 flow [2024-06-27 18:52:23,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:52:23,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:52:23,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-06-27 18:52:23,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2024-06-27 18:52:23,869 INFO L175 Difference]: Start difference. First operand has 131 places, 112 transitions, 1174 flow. Second operand 10 states and 172 transitions. [2024-06-27 18:52:23,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 168 transitions, 1887 flow [2024-06-27 18:52:23,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 168 transitions, 1854 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-27 18:52:23,915 INFO L231 Difference]: Finished difference. Result has 139 places, 111 transitions, 1217 flow [2024-06-27 18:52:23,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1217, PETRI_PLACES=139, PETRI_TRANSITIONS=111} [2024-06-27 18:52:23,915 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 99 predicate places. [2024-06-27 18:52:23,916 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 111 transitions, 1217 flow [2024-06-27 18:52:23,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:23,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:23,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:23,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 18:52:23,916 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:52:23,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:23,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1458681150, now seen corresponding path program 2 times [2024-06-27 18:52:23,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:23,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039856899] [2024-06-27 18:52:23,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:23,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:26,073 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-27 18:52:26,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:26,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039856899] [2024-06-27 18:52:26,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039856899] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:26,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:26,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:52:26,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714241876] [2024-06-27 18:52:26,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:26,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:52:26,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:26,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:52:26,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:52:26,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:52:26,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 111 transitions, 1217 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:26,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:26,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:52:26,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:26,952 INFO L124 PetriNetUnfolderBase]: 902/1778 cut-off events. [2024-06-27 18:52:26,952 INFO L125 PetriNetUnfolderBase]: For 28836/28839 co-relation queries the response was YES. [2024-06-27 18:52:26,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9451 conditions, 1778 events. 902/1778 cut-off events. For 28836/28839 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 10341 event pairs, 398 based on Foata normal form. 12/1725 useless extension candidates. Maximal degree in co-relation 9384. Up to 1237 conditions per place. [2024-06-27 18:52:26,964 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 107 selfloop transitions, 36 changer transitions 0/148 dead transitions. [2024-06-27 18:52:26,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 148 transitions, 1699 flow [2024-06-27 18:52:26,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:52:26,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:52:26,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions. [2024-06-27 18:52:26,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2024-06-27 18:52:26,990 INFO L175 Difference]: Start difference. First operand has 139 places, 111 transitions, 1217 flow. Second operand 10 states and 155 transitions. [2024-06-27 18:52:26,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 148 transitions, 1699 flow [2024-06-27 18:52:27,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 148 transitions, 1565 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-27 18:52:27,039 INFO L231 Difference]: Finished difference. Result has 139 places, 111 transitions, 1164 flow [2024-06-27 18:52:27,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1164, PETRI_PLACES=139, PETRI_TRANSITIONS=111} [2024-06-27 18:52:27,039 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 99 predicate places. [2024-06-27 18:52:27,040 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 111 transitions, 1164 flow [2024-06-27 18:52:27,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:27,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:27,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:27,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 18:52:27,040 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:52:27,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:27,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1458684870, now seen corresponding path program 3 times [2024-06-27 18:52:27,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:27,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822873533] [2024-06-27 18:52:27,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:27,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:29,008 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-27 18:52:29,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:29,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822873533] [2024-06-27 18:52:29,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822873533] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:29,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:29,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:52:29,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124268733] [2024-06-27 18:52:29,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:29,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:52:29,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:29,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:52:29,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:52:29,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:52:29,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 111 transitions, 1164 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:29,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:29,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:52:29,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:29,882 INFO L124 PetriNetUnfolderBase]: 867/1687 cut-off events. [2024-06-27 18:52:29,883 INFO L125 PetriNetUnfolderBase]: For 23940/23943 co-relation queries the response was YES. [2024-06-27 18:52:29,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8553 conditions, 1687 events. 867/1687 cut-off events. For 23940/23943 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 9571 event pairs, 320 based on Foata normal form. 10/1642 useless extension candidates. Maximal degree in co-relation 8487. Up to 999 conditions per place. [2024-06-27 18:52:29,894 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 116 selfloop transitions, 36 changer transitions 0/157 dead transitions. [2024-06-27 18:52:29,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 157 transitions, 1740 flow [2024-06-27 18:52:29,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:52:29,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:52:29,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions. [2024-06-27 18:52:29,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2024-06-27 18:52:29,902 INFO L175 Difference]: Start difference. First operand has 139 places, 111 transitions, 1164 flow. Second operand 10 states and 164 transitions. [2024-06-27 18:52:29,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 157 transitions, 1740 flow [2024-06-27 18:52:29,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 157 transitions, 1670 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 18:52:29,965 INFO L231 Difference]: Finished difference. Result has 141 places, 111 transitions, 1169 flow [2024-06-27 18:52:29,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1169, PETRI_PLACES=141, PETRI_TRANSITIONS=111} [2024-06-27 18:52:29,965 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 101 predicate places. [2024-06-27 18:52:29,965 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 111 transitions, 1169 flow [2024-06-27 18:52:29,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:29,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:29,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:29,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 18:52:29,966 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:52:29,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:29,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1371993060, now seen corresponding path program 4 times [2024-06-27 18:52:29,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:29,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985679807] [2024-06-27 18:52:29,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:29,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:32,666 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-27 18:52:32,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:32,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985679807] [2024-06-27 18:52:32,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985679807] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:32,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:32,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:52:32,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887604042] [2024-06-27 18:52:32,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:32,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:52:32,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:32,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:52:32,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:52:32,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:52:32,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 111 transitions, 1169 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:32,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:32,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:52:32,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:33,505 INFO L124 PetriNetUnfolderBase]: 1053/2093 cut-off events. [2024-06-27 18:52:33,505 INFO L125 PetriNetUnfolderBase]: For 32916/32919 co-relation queries the response was YES. [2024-06-27 18:52:33,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10646 conditions, 2093 events. 1053/2093 cut-off events. For 32916/32919 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 12945 event pairs, 454 based on Foata normal form. 10/2028 useless extension candidates. Maximal degree in co-relation 10579. Up to 1375 conditions per place. [2024-06-27 18:52:33,520 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 133 selfloop transitions, 15 changer transitions 0/153 dead transitions. [2024-06-27 18:52:33,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 153 transitions, 1799 flow [2024-06-27 18:52:33,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:52:33,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:52:33,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-06-27 18:52:33,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-27 18:52:33,522 INFO L175 Difference]: Start difference. First operand has 141 places, 111 transitions, 1169 flow. Second operand 9 states and 144 transitions. [2024-06-27 18:52:33,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 153 transitions, 1799 flow [2024-06-27 18:52:33,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 153 transitions, 1728 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 18:52:33,582 INFO L231 Difference]: Finished difference. Result has 142 places, 111 transitions, 1131 flow [2024-06-27 18:52:33,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1098, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1131, PETRI_PLACES=142, PETRI_TRANSITIONS=111} [2024-06-27 18:52:33,582 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 102 predicate places. [2024-06-27 18:52:33,583 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 111 transitions, 1131 flow [2024-06-27 18:52:33,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:33,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:33,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:33,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 18:52:33,583 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:52:33,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:33,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1371989340, now seen corresponding path program 5 times [2024-06-27 18:52:33,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:33,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486030249] [2024-06-27 18:52:33,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:33,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:36,597 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-27 18:52:36,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:36,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486030249] [2024-06-27 18:52:36,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486030249] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:36,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:36,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:52:36,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798107415] [2024-06-27 18:52:36,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:36,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:52:36,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:36,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:52:36,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:52:36,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:52:36,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 111 transitions, 1131 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:36,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:36,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:52:36,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:37,443 INFO L124 PetriNetUnfolderBase]: 1157/2337 cut-off events. [2024-06-27 18:52:37,443 INFO L125 PetriNetUnfolderBase]: For 37146/37149 co-relation queries the response was YES. [2024-06-27 18:52:37,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11610 conditions, 2337 events. 1157/2337 cut-off events. For 37146/37149 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 14994 event pairs, 573 based on Foata normal form. 12/2256 useless extension candidates. Maximal degree in co-relation 11542. Up to 1804 conditions per place. [2024-06-27 18:52:37,460 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 123 selfloop transitions, 17 changer transitions 0/145 dead transitions. [2024-06-27 18:52:37,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 145 transitions, 1618 flow [2024-06-27 18:52:37,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:52:37,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:52:37,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2024-06-27 18:52:37,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-27 18:52:37,462 INFO L175 Difference]: Start difference. First operand has 142 places, 111 transitions, 1131 flow. Second operand 9 states and 135 transitions. [2024-06-27 18:52:37,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 145 transitions, 1618 flow [2024-06-27 18:52:37,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 145 transitions, 1585 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 18:52:37,525 INFO L231 Difference]: Finished difference. Result has 144 places, 113 transitions, 1150 flow [2024-06-27 18:52:37,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1150, PETRI_PLACES=144, PETRI_TRANSITIONS=113} [2024-06-27 18:52:37,525 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 104 predicate places. [2024-06-27 18:52:37,526 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 113 transitions, 1150 flow [2024-06-27 18:52:37,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:37,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:37,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:37,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 18:52:37,526 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:52:37,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:37,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1431303838, now seen corresponding path program 1 times [2024-06-27 18:52:37,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:37,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372148480] [2024-06-27 18:52:37,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:37,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:40,714 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-27 18:52:40,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:40,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372148480] [2024-06-27 18:52:40,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372148480] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:40,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:40,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:52:40,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889847895] [2024-06-27 18:52:40,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:40,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:52:40,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:40,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:52:40,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:52:40,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:52:40,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 113 transitions, 1150 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:40,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:40,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:52:40,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:41,456 INFO L124 PetriNetUnfolderBase]: 1047/2105 cut-off events. [2024-06-27 18:52:41,457 INFO L125 PetriNetUnfolderBase]: For 26315/26318 co-relation queries the response was YES. [2024-06-27 18:52:41,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10248 conditions, 2105 events. 1047/2105 cut-off events. For 26315/26318 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 13119 event pairs, 517 based on Foata normal form. 4/2026 useless extension candidates. Maximal degree in co-relation 10179. Up to 1788 conditions per place. [2024-06-27 18:52:41,472 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 120 selfloop transitions, 13 changer transitions 0/138 dead transitions. [2024-06-27 18:52:41,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 138 transitions, 1529 flow [2024-06-27 18:52:41,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:52:41,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:52:41,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2024-06-27 18:52:41,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-27 18:52:41,473 INFO L175 Difference]: Start difference. First operand has 144 places, 113 transitions, 1150 flow. Second operand 8 states and 117 transitions. [2024-06-27 18:52:41,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 138 transitions, 1529 flow [2024-06-27 18:52:41,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 138 transitions, 1506 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-27 18:52:41,528 INFO L231 Difference]: Finished difference. Result has 147 places, 114 transitions, 1173 flow [2024-06-27 18:52:41,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1127, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1173, PETRI_PLACES=147, PETRI_TRANSITIONS=114} [2024-06-27 18:52:41,529 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 107 predicate places. [2024-06-27 18:52:41,529 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 114 transitions, 1173 flow [2024-06-27 18:52:41,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:41,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:41,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:41,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 18:52:41,530 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:52:41,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:41,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1371845190, now seen corresponding path program 6 times [2024-06-27 18:52:41,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:41,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060045896] [2024-06-27 18:52:41,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:41,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:44,436 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-27 18:52:44,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:44,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060045896] [2024-06-27 18:52:44,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060045896] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:44,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:44,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:52:44,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883941352] [2024-06-27 18:52:44,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:44,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:52:44,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:44,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:52:44,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:52:44,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:52:44,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 114 transitions, 1173 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:44,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:44,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:52:44,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:45,286 INFO L124 PetriNetUnfolderBase]: 1141/2309 cut-off events. [2024-06-27 18:52:45,286 INFO L125 PetriNetUnfolderBase]: For 33181/33184 co-relation queries the response was YES. [2024-06-27 18:52:45,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11191 conditions, 2309 events. 1141/2309 cut-off events. For 33181/33184 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 14810 event pairs, 581 based on Foata normal form. 12/2228 useless extension candidates. Maximal degree in co-relation 11121. Up to 1791 conditions per place. [2024-06-27 18:52:45,302 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 126 selfloop transitions, 14 changer transitions 0/145 dead transitions. [2024-06-27 18:52:45,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 145 transitions, 1628 flow [2024-06-27 18:52:45,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:52:45,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:52:45,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 132 transitions. [2024-06-27 18:52:45,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2024-06-27 18:52:45,303 INFO L175 Difference]: Start difference. First operand has 147 places, 114 transitions, 1173 flow. Second operand 9 states and 132 transitions. [2024-06-27 18:52:45,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 145 transitions, 1628 flow [2024-06-27 18:52:45,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 145 transitions, 1594 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-27 18:52:45,358 INFO L231 Difference]: Finished difference. Result has 150 places, 114 transitions, 1171 flow [2024-06-27 18:52:45,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1139, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1171, PETRI_PLACES=150, PETRI_TRANSITIONS=114} [2024-06-27 18:52:45,358 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 110 predicate places. [2024-06-27 18:52:45,358 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 114 transitions, 1171 flow [2024-06-27 18:52:45,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:45,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:45,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:45,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 18:52:45,359 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:52:45,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:45,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1287204058, now seen corresponding path program 2 times [2024-06-27 18:52:45,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:45,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362475917] [2024-06-27 18:52:45,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:45,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:47,368 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-27 18:52:47,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:47,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362475917] [2024-06-27 18:52:47,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362475917] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:47,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:47,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:52:47,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054962929] [2024-06-27 18:52:47,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:47,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:52:47,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:47,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:52:47,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:52:47,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:52:47,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 114 transitions, 1171 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:47,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:47,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:52:47,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:48,225 INFO L124 PetriNetUnfolderBase]: 1163/2347 cut-off events. [2024-06-27 18:52:48,225 INFO L125 PetriNetUnfolderBase]: For 29648/29651 co-relation queries the response was YES. [2024-06-27 18:52:48,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11390 conditions, 2347 events. 1163/2347 cut-off events. For 29648/29651 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 15040 event pairs, 571 based on Foata normal form. 4/2258 useless extension candidates. Maximal degree in co-relation 11319. Up to 1956 conditions per place. [2024-06-27 18:52:48,242 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 116 selfloop transitions, 20 changer transitions 0/141 dead transitions. [2024-06-27 18:52:48,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 141 transitions, 1592 flow [2024-06-27 18:52:48,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:52:48,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:52:48,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2024-06-27 18:52:48,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4131944444444444 [2024-06-27 18:52:48,245 INFO L175 Difference]: Start difference. First operand has 150 places, 114 transitions, 1171 flow. Second operand 8 states and 119 transitions. [2024-06-27 18:52:48,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 141 transitions, 1592 flow [2024-06-27 18:52:48,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 141 transitions, 1557 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 18:52:48,310 INFO L231 Difference]: Finished difference. Result has 151 places, 119 transitions, 1273 flow [2024-06-27 18:52:48,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1273, PETRI_PLACES=151, PETRI_TRANSITIONS=119} [2024-06-27 18:52:48,311 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 111 predicate places. [2024-06-27 18:52:48,312 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 119 transitions, 1273 flow [2024-06-27 18:52:48,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:48,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:48,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:48,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 18:52:48,312 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:52:48,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:48,313 INFO L85 PathProgramCache]: Analyzing trace with hash -2087216074, now seen corresponding path program 3 times [2024-06-27 18:52:48,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:48,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410927490] [2024-06-27 18:52:48,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:48,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:50,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:52:50,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:50,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410927490] [2024-06-27 18:52:50,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410927490] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:50,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:50,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:52:50,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903406425] [2024-06-27 18:52:50,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:50,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:52:50,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:50,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:52:50,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:52:50,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:52:50,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 119 transitions, 1273 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:50,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:50,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:52:50,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:51,531 INFO L124 PetriNetUnfolderBase]: 1167/2361 cut-off events. [2024-06-27 18:52:51,531 INFO L125 PetriNetUnfolderBase]: For 30492/30495 co-relation queries the response was YES. [2024-06-27 18:52:51,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11590 conditions, 2361 events. 1167/2361 cut-off events. For 30492/30495 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 15238 event pairs, 608 based on Foata normal form. 4/2270 useless extension candidates. Maximal degree in co-relation 11517. Up to 1985 conditions per place. [2024-06-27 18:52:51,548 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 112 selfloop transitions, 21 changer transitions 0/138 dead transitions. [2024-06-27 18:52:51,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 138 transitions, 1610 flow [2024-06-27 18:52:51,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:52:51,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:52:51,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2024-06-27 18:52:51,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2024-06-27 18:52:51,550 INFO L175 Difference]: Start difference. First operand has 151 places, 119 transitions, 1273 flow. Second operand 8 states and 116 transitions. [2024-06-27 18:52:51,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 138 transitions, 1610 flow [2024-06-27 18:52:51,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 138 transitions, 1536 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-27 18:52:51,625 INFO L231 Difference]: Finished difference. Result has 154 places, 120 transitions, 1267 flow [2024-06-27 18:52:51,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1199, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1267, PETRI_PLACES=154, PETRI_TRANSITIONS=120} [2024-06-27 18:52:51,625 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 114 predicate places. [2024-06-27 18:52:51,626 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 120 transitions, 1267 flow [2024-06-27 18:52:51,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:51,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:51,626 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:51,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 18:52:51,626 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:52:51,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:51,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1292775688, now seen corresponding path program 4 times [2024-06-27 18:52:51,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:51,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977322359] [2024-06-27 18:52:51,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:51,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:53,759 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-27 18:52:53,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:53,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977322359] [2024-06-27 18:52:53,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977322359] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:53,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:53,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:52:53,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434875308] [2024-06-27 18:52:53,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:53,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:52:53,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:53,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:52:53,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:52:53,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:52:53,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 120 transitions, 1267 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:53,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:53,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:52:53,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:54,714 INFO L124 PetriNetUnfolderBase]: 1171/2375 cut-off events. [2024-06-27 18:52:54,714 INFO L125 PetriNetUnfolderBase]: For 29485/29488 co-relation queries the response was YES. [2024-06-27 18:52:54,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11486 conditions, 2375 events. 1171/2375 cut-off events. For 29485/29488 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 15401 event pairs, 610 based on Foata normal form. 4/2282 useless extension candidates. Maximal degree in co-relation 11412. Up to 1996 conditions per place. [2024-06-27 18:52:54,732 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 116 selfloop transitions, 22 changer transitions 0/143 dead transitions. [2024-06-27 18:52:54,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 143 transitions, 1655 flow [2024-06-27 18:52:54,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:52:54,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:52:54,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions. [2024-06-27 18:52:54,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3950617283950617 [2024-06-27 18:52:54,733 INFO L175 Difference]: Start difference. First operand has 154 places, 120 transitions, 1267 flow. Second operand 9 states and 128 transitions. [2024-06-27 18:52:54,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 143 transitions, 1655 flow [2024-06-27 18:52:54,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 143 transitions, 1599 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-27 18:52:54,804 INFO L231 Difference]: Finished difference. Result has 158 places, 123 transitions, 1328 flow [2024-06-27 18:52:54,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1213, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1328, PETRI_PLACES=158, PETRI_TRANSITIONS=123} [2024-06-27 18:52:54,805 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 118 predicate places. [2024-06-27 18:52:54,805 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 123 transitions, 1328 flow [2024-06-27 18:52:54,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:54,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:54,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:54,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 18:52:54,806 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:52:54,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:54,806 INFO L85 PathProgramCache]: Analyzing trace with hash -2087423836, now seen corresponding path program 7 times [2024-06-27 18:52:54,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:54,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843536058] [2024-06-27 18:52:54,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:54,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:57,019 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-27 18:52:57,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:57,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843536058] [2024-06-27 18:52:57,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843536058] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:57,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:57,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:52:57,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205801620] [2024-06-27 18:52:57,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:57,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:52:57,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:57,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:52:57,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:52:57,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:52:57,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 123 transitions, 1328 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:57,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:57,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:52:57,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:57,996 INFO L124 PetriNetUnfolderBase]: 1249/2513 cut-off events. [2024-06-27 18:52:57,996 INFO L125 PetriNetUnfolderBase]: For 36868/36871 co-relation queries the response was YES. [2024-06-27 18:52:58,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12201 conditions, 2513 events. 1249/2513 cut-off events. For 36868/36871 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 16385 event pairs, 662 based on Foata normal form. 12/2428 useless extension candidates. Maximal degree in co-relation 12125. Up to 1972 conditions per place. [2024-06-27 18:52:58,012 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 121 selfloop transitions, 23 changer transitions 0/149 dead transitions. [2024-06-27 18:52:58,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 149 transitions, 1769 flow [2024-06-27 18:52:58,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:52:58,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:52:58,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 131 transitions. [2024-06-27 18:52:58,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.404320987654321 [2024-06-27 18:52:58,013 INFO L175 Difference]: Start difference. First operand has 158 places, 123 transitions, 1328 flow. Second operand 9 states and 131 transitions. [2024-06-27 18:52:58,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 149 transitions, 1769 flow [2024-06-27 18:52:58,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 149 transitions, 1711 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-27 18:52:58,088 INFO L231 Difference]: Finished difference. Result has 161 places, 124 transitions, 1341 flow [2024-06-27 18:52:58,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1270, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1341, PETRI_PLACES=161, PETRI_TRANSITIONS=124} [2024-06-27 18:52:58,089 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 121 predicate places. [2024-06-27 18:52:58,090 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 124 transitions, 1341 flow [2024-06-27 18:52:58,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:58,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:58,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:58,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 18:52:58,093 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:52:58,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:58,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1292929510, now seen corresponding path program 8 times [2024-06-27 18:52:58,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:58,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007716866] [2024-06-27 18:52:58,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:58,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:00,169 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-27 18:53:00,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:00,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007716866] [2024-06-27 18:53:00,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007716866] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:00,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:00,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:53:00,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158888878] [2024-06-27 18:53:00,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:00,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:53:00,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:00,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:53:00,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:53:00,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:53:00,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 124 transitions, 1341 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:00,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:00,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:53:00,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:01,428 INFO L124 PetriNetUnfolderBase]: 1442/2860 cut-off events. [2024-06-27 18:53:01,428 INFO L125 PetriNetUnfolderBase]: For 47398/47401 co-relation queries the response was YES. [2024-06-27 18:53:01,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14305 conditions, 2860 events. 1442/2860 cut-off events. For 47398/47401 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 18973 event pairs, 721 based on Foata normal form. 10/2773 useless extension candidates. Maximal degree in co-relation 14228. Up to 1969 conditions per place. [2024-06-27 18:53:01,449 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 122 selfloop transitions, 43 changer transitions 0/170 dead transitions. [2024-06-27 18:53:01,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 170 transitions, 2068 flow [2024-06-27 18:53:01,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:53:01,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:53:01,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2024-06-27 18:53:01,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-27 18:53:01,451 INFO L175 Difference]: Start difference. First operand has 161 places, 124 transitions, 1341 flow. Second operand 11 states and 168 transitions. [2024-06-27 18:53:01,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 170 transitions, 2068 flow [2024-06-27 18:53:01,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 170 transitions, 2001 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-27 18:53:01,555 INFO L231 Difference]: Finished difference. Result has 166 places, 131 transitions, 1494 flow [2024-06-27 18:53:01,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1292, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1494, PETRI_PLACES=166, PETRI_TRANSITIONS=131} [2024-06-27 18:53:01,556 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 126 predicate places. [2024-06-27 18:53:01,556 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 131 transitions, 1494 flow [2024-06-27 18:53:01,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:01,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:01,556 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:53:01,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 18:53:01,557 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:53:01,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:01,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1292925790, now seen corresponding path program 9 times [2024-06-27 18:53:01,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:01,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095865051] [2024-06-27 18:53:01,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:01,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:03,775 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-27 18:53:03,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:03,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095865051] [2024-06-27 18:53:03,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095865051] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:03,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:03,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:53:03,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259640414] [2024-06-27 18:53:03,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:03,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:53:03,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:03,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:53:03,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:53:03,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:53:03,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 131 transitions, 1494 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:03,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:03,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:53:03,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:05,093 INFO L124 PetriNetUnfolderBase]: 1520/2998 cut-off events. [2024-06-27 18:53:05,094 INFO L125 PetriNetUnfolderBase]: For 52801/52804 co-relation queries the response was YES. [2024-06-27 18:53:05,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15233 conditions, 2998 events. 1520/2998 cut-off events. For 52801/52804 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 20070 event pairs, 801 based on Foata normal form. 12/2913 useless extension candidates. Maximal degree in co-relation 15154. Up to 2407 conditions per place. [2024-06-27 18:53:05,116 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 119 selfloop transitions, 40 changer transitions 0/164 dead transitions. [2024-06-27 18:53:05,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 164 transitions, 1994 flow [2024-06-27 18:53:05,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:53:05,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:53:05,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 161 transitions. [2024-06-27 18:53:05,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4065656565656566 [2024-06-27 18:53:05,118 INFO L175 Difference]: Start difference. First operand has 166 places, 131 transitions, 1494 flow. Second operand 11 states and 161 transitions. [2024-06-27 18:53:05,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 164 transitions, 1994 flow [2024-06-27 18:53:05,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 164 transitions, 1914 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-27 18:53:05,221 INFO L231 Difference]: Finished difference. Result has 171 places, 132 transitions, 1521 flow [2024-06-27 18:53:05,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1416, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1521, PETRI_PLACES=171, PETRI_TRANSITIONS=132} [2024-06-27 18:53:05,222 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 131 predicate places. [2024-06-27 18:53:05,222 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 132 transitions, 1521 flow [2024-06-27 18:53:05,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:05,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:05,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:53:05,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-27 18:53:05,222 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:53:05,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:05,223 INFO L85 PathProgramCache]: Analyzing trace with hash -2092786216, now seen corresponding path program 10 times [2024-06-27 18:53:05,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:05,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987526273] [2024-06-27 18:53:05,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:05,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:07,449 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-27 18:53:07,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:07,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987526273] [2024-06-27 18:53:07,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987526273] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:07,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:07,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:53:07,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214319885] [2024-06-27 18:53:07,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:07,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:53:07,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:07,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:53:07,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:53:07,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:53:07,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 132 transitions, 1521 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:07,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:07,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:53:07,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:08,854 INFO L124 PetriNetUnfolderBase]: 1507/2975 cut-off events. [2024-06-27 18:53:08,854 INFO L125 PetriNetUnfolderBase]: For 45830/45833 co-relation queries the response was YES. [2024-06-27 18:53:08,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14778 conditions, 2975 events. 1507/2975 cut-off events. For 45830/45833 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 19865 event pairs, 808 based on Foata normal form. 12/2890 useless extension candidates. Maximal degree in co-relation 14697. Up to 2415 conditions per place. [2024-06-27 18:53:08,876 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 123 selfloop transitions, 35 changer transitions 0/163 dead transitions. [2024-06-27 18:53:08,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 163 transitions, 1981 flow [2024-06-27 18:53:08,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:53:08,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:53:08,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 160 transitions. [2024-06-27 18:53:08,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40404040404040403 [2024-06-27 18:53:08,882 INFO L175 Difference]: Start difference. First operand has 171 places, 132 transitions, 1521 flow. Second operand 11 states and 160 transitions. [2024-06-27 18:53:08,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 163 transitions, 1981 flow [2024-06-27 18:53:08,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 163 transitions, 1880 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-27 18:53:08,992 INFO L231 Difference]: Finished difference. Result has 173 places, 132 transitions, 1495 flow [2024-06-27 18:53:08,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1420, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1495, PETRI_PLACES=173, PETRI_TRANSITIONS=132} [2024-06-27 18:53:08,993 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 133 predicate places. [2024-06-27 18:53:08,993 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 132 transitions, 1495 flow [2024-06-27 18:53:08,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:08,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:08,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:53:08,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-27 18:53:08,993 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:53:08,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:08,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1645815708, now seen corresponding path program 5 times [2024-06-27 18:53:08,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:08,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129994577] [2024-06-27 18:53:08,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:08,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:11,289 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-27 18:53:11,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:11,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129994577] [2024-06-27 18:53:11,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129994577] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:11,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:11,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:53:11,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35042577] [2024-06-27 18:53:11,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:11,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:53:11,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:11,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:53:11,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:53:11,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:53:11,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 132 transitions, 1495 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:11,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:11,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:53:11,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:12,413 INFO L124 PetriNetUnfolderBase]: 1511/2989 cut-off events. [2024-06-27 18:53:12,413 INFO L125 PetriNetUnfolderBase]: For 38147/38150 co-relation queries the response was YES. [2024-06-27 18:53:12,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14687 conditions, 2989 events. 1511/2989 cut-off events. For 38147/38150 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 20059 event pairs, 817 based on Foata normal form. 4/2894 useless extension candidates. Maximal degree in co-relation 14605. Up to 2588 conditions per place. [2024-06-27 18:53:12,437 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 124 selfloop transitions, 24 changer transitions 0/153 dead transitions. [2024-06-27 18:53:12,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 153 transitions, 1874 flow [2024-06-27 18:53:12,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:53:12,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:53:12,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions. [2024-06-27 18:53:12,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3950617283950617 [2024-06-27 18:53:12,439 INFO L175 Difference]: Start difference. First operand has 173 places, 132 transitions, 1495 flow. Second operand 9 states and 128 transitions. [2024-06-27 18:53:12,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 153 transitions, 1874 flow [2024-06-27 18:53:12,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 153 transitions, 1797 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-27 18:53:12,536 INFO L231 Difference]: Finished difference. Result has 173 places, 133 transitions, 1496 flow [2024-06-27 18:53:12,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1496, PETRI_PLACES=173, PETRI_TRANSITIONS=133} [2024-06-27 18:53:12,537 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 133 predicate places. [2024-06-27 18:53:12,537 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 133 transitions, 1496 flow [2024-06-27 18:53:12,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:12,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:12,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:53:12,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-27 18:53:12,537 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:53:12,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:12,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1350387258, now seen corresponding path program 6 times [2024-06-27 18:53:12,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:12,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230515440] [2024-06-27 18:53:12,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:12,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:14,818 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-27 18:53:14,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:14,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230515440] [2024-06-27 18:53:14,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230515440] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:14,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:14,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:53:14,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025719222] [2024-06-27 18:53:14,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:14,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:53:14,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:14,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:53:14,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:53:14,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:53:14,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 133 transitions, 1496 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:14,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:14,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:53:14,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:15,986 INFO L124 PetriNetUnfolderBase]: 1563/3083 cut-off events. [2024-06-27 18:53:15,987 INFO L125 PetriNetUnfolderBase]: For 39308/39311 co-relation queries the response was YES. [2024-06-27 18:53:16,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15226 conditions, 3083 events. 1563/3083 cut-off events. For 39308/39311 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 20680 event pairs, 759 based on Foata normal form. 4/2986 useless extension candidates. Maximal degree in co-relation 15143. Up to 2463 conditions per place. [2024-06-27 18:53:16,014 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 130 selfloop transitions, 46 changer transitions 0/181 dead transitions. [2024-06-27 18:53:16,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 181 transitions, 2212 flow [2024-06-27 18:53:16,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:53:16,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:53:16,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2024-06-27 18:53:16,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4388888888888889 [2024-06-27 18:53:16,016 INFO L175 Difference]: Start difference. First operand has 173 places, 133 transitions, 1496 flow. Second operand 10 states and 158 transitions. [2024-06-27 18:53:16,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 181 transitions, 2212 flow [2024-06-27 18:53:16,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 181 transitions, 2143 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-27 18:53:16,125 INFO L231 Difference]: Finished difference. Result has 177 places, 144 transitions, 1744 flow [2024-06-27 18:53:16,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1432, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1744, PETRI_PLACES=177, PETRI_TRANSITIONS=144} [2024-06-27 18:53:16,125 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 137 predicate places. [2024-06-27 18:53:16,125 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 144 transitions, 1744 flow [2024-06-27 18:53:16,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:16,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:16,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:53:16,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-27 18:53:16,126 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:53:16,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:16,127 INFO L85 PathProgramCache]: Analyzing trace with hash -2048671628, now seen corresponding path program 7 times [2024-06-27 18:53:16,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:16,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882025589] [2024-06-27 18:53:16,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:16,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:18,906 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-27 18:53:18,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:18,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882025589] [2024-06-27 18:53:18,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882025589] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:18,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:18,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:53:18,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012020479] [2024-06-27 18:53:18,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:18,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:53:18,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:18,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:53:18,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:53:18,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:53:18,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 144 transitions, 1744 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:18,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:18,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:53:18,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:20,018 INFO L124 PetriNetUnfolderBase]: 1560/3078 cut-off events. [2024-06-27 18:53:20,019 INFO L125 PetriNetUnfolderBase]: For 39928/39931 co-relation queries the response was YES. [2024-06-27 18:53:20,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15427 conditions, 3078 events. 1560/3078 cut-off events. For 39928/39931 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 20751 event pairs, 833 based on Foata normal form. 4/2981 useless extension candidates. Maximal degree in co-relation 15342. Up to 2666 conditions per place. [2024-06-27 18:53:20,040 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 142 selfloop transitions, 22 changer transitions 0/169 dead transitions. [2024-06-27 18:53:20,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 169 transitions, 2184 flow [2024-06-27 18:53:20,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:53:20,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:53:20,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2024-06-27 18:53:20,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4012345679012346 [2024-06-27 18:53:20,042 INFO L175 Difference]: Start difference. First operand has 177 places, 144 transitions, 1744 flow. Second operand 9 states and 130 transitions. [2024-06-27 18:53:20,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 169 transitions, 2184 flow [2024-06-27 18:53:20,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 169 transitions, 2073 flow, removed 45 selfloop flow, removed 4 redundant places. [2024-06-27 18:53:20,154 INFO L231 Difference]: Finished difference. Result has 182 places, 145 transitions, 1713 flow [2024-06-27 18:53:20,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1639, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1713, PETRI_PLACES=182, PETRI_TRANSITIONS=145} [2024-06-27 18:53:20,154 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 142 predicate places. [2024-06-27 18:53:20,154 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 145 transitions, 1713 flow [2024-06-27 18:53:20,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:20,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:20,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:53:20,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-27 18:53:20,155 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:53:20,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:20,155 INFO L85 PathProgramCache]: Analyzing trace with hash -2056930400, now seen corresponding path program 11 times [2024-06-27 18:53:20,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:20,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881921976] [2024-06-27 18:53:20,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:20,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:22,250 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-27 18:53:22,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:22,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881921976] [2024-06-27 18:53:22,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881921976] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:22,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:22,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:53:22,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835927333] [2024-06-27 18:53:22,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:22,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:53:22,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:22,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:53:22,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:53:22,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:53:22,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 145 transitions, 1713 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:22,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:22,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:53:22,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:23,513 INFO L124 PetriNetUnfolderBase]: 1596/3146 cut-off events. [2024-06-27 18:53:23,513 INFO L125 PetriNetUnfolderBase]: For 43609/43612 co-relation queries the response was YES. [2024-06-27 18:53:23,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15388 conditions, 3146 events. 1596/3146 cut-off events. For 43609/43612 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 21307 event pairs, 857 based on Foata normal form. 12/3057 useless extension candidates. Maximal degree in co-relation 15301. Up to 2614 conditions per place. [2024-06-27 18:53:23,534 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 144 selfloop transitions, 27 changer transitions 0/176 dead transitions. [2024-06-27 18:53:23,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 176 transitions, 2218 flow [2024-06-27 18:53:23,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 18:53:23,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 18:53:23,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 163 transitions. [2024-06-27 18:53:23,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3773148148148148 [2024-06-27 18:53:23,536 INFO L175 Difference]: Start difference. First operand has 182 places, 145 transitions, 1713 flow. Second operand 12 states and 163 transitions. [2024-06-27 18:53:23,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 176 transitions, 2218 flow [2024-06-27 18:53:23,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 176 transitions, 2099 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-27 18:53:23,627 INFO L231 Difference]: Finished difference. Result has 186 places, 146 transitions, 1675 flow [2024-06-27 18:53:23,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1594, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1675, PETRI_PLACES=186, PETRI_TRANSITIONS=146} [2024-06-27 18:53:23,628 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 146 predicate places. [2024-06-27 18:53:23,628 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 146 transitions, 1675 flow [2024-06-27 18:53:23,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:23,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:23,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:53:23,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-27 18:53:23,629 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:53:23,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:23,629 INFO L85 PathProgramCache]: Analyzing trace with hash 422658178, now seen corresponding path program 1 times [2024-06-27 18:53:23,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:23,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085345008] [2024-06-27 18:53:23,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:23,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:27,000 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-27 18:53:27,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:27,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085345008] [2024-06-27 18:53:27,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085345008] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:27,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:27,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:53:27,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904947581] [2024-06-27 18:53:27,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:27,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:53:27,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:27,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:53:27,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:53:27,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:53:27,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 146 transitions, 1675 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 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-27 18:53:27,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:27,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:53:27,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:28,051 INFO L124 PetriNetUnfolderBase]: 1646/3244 cut-off events. [2024-06-27 18:53:28,051 INFO L125 PetriNetUnfolderBase]: For 40693/40696 co-relation queries the response was YES. [2024-06-27 18:53:28,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15742 conditions, 3244 events. 1646/3244 cut-off events. For 40693/40696 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 22200 event pairs, 825 based on Foata normal form. 8/3151 useless extension candidates. Maximal degree in co-relation 15654. Up to 2769 conditions per place. [2024-06-27 18:53:28,073 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 161 selfloop transitions, 14 changer transitions 0/180 dead transitions. [2024-06-27 18:53:28,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 180 transitions, 2208 flow [2024-06-27 18:53:28,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:53:28,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:53:28,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 133 transitions. [2024-06-27 18:53:28,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4104938271604938 [2024-06-27 18:53:28,075 INFO L175 Difference]: Start difference. First operand has 186 places, 146 transitions, 1675 flow. Second operand 9 states and 133 transitions. [2024-06-27 18:53:28,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 180 transitions, 2208 flow [2024-06-27 18:53:28,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 180 transitions, 2142 flow, removed 7 selfloop flow, removed 10 redundant places. [2024-06-27 18:53:28,184 INFO L231 Difference]: Finished difference. Result has 186 places, 148 transitions, 1674 flow [2024-06-27 18:53:28,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1609, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1674, PETRI_PLACES=186, PETRI_TRANSITIONS=148} [2024-06-27 18:53:28,185 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 146 predicate places. [2024-06-27 18:53:28,185 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 148 transitions, 1674 flow [2024-06-27 18:53:28,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 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-27 18:53:28,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:28,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:53:28,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-27 18:53:28,191 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:53:28,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:28,191 INFO L85 PathProgramCache]: Analyzing trace with hash -278956618, now seen corresponding path program 2 times [2024-06-27 18:53:28,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:28,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968486224] [2024-06-27 18:53:28,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:28,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:31,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-27 18:53:31,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:31,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968486224] [2024-06-27 18:53:31,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968486224] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:31,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:31,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:53:31,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912395500] [2024-06-27 18:53:31,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:31,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:53:31,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:31,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:53:31,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:53:31,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:53:31,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 148 transitions, 1674 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 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-27 18:53:31,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:31,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:53:31,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:32,666 INFO L124 PetriNetUnfolderBase]: 1696/3342 cut-off events. [2024-06-27 18:53:32,666 INFO L125 PetriNetUnfolderBase]: For 42597/42600 co-relation queries the response was YES. [2024-06-27 18:53:32,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16167 conditions, 3342 events. 1696/3342 cut-off events. For 42597/42600 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 22972 event pairs, 853 based on Foata normal form. 8/3249 useless extension candidates. Maximal degree in co-relation 16077. Up to 2819 conditions per place. [2024-06-27 18:53:32,695 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 154 selfloop transitions, 21 changer transitions 0/180 dead transitions. [2024-06-27 18:53:32,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 180 transitions, 2180 flow [2024-06-27 18:53:32,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:53:32,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:53:32,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2024-06-27 18:53:32,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41975308641975306 [2024-06-27 18:53:32,697 INFO L175 Difference]: Start difference. First operand has 186 places, 148 transitions, 1674 flow. Second operand 9 states and 136 transitions. [2024-06-27 18:53:32,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 180 transitions, 2180 flow [2024-06-27 18:53:32,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 180 transitions, 2134 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-27 18:53:32,826 INFO L231 Difference]: Finished difference. Result has 189 places, 149 transitions, 1701 flow [2024-06-27 18:53:32,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1628, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1701, PETRI_PLACES=189, PETRI_TRANSITIONS=149} [2024-06-27 18:53:32,827 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 149 predicate places. [2024-06-27 18:53:32,827 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 149 transitions, 1701 flow [2024-06-27 18:53:32,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 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-27 18:53:32,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:32,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:53:32,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-27 18:53:32,827 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:53:32,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:32,828 INFO L85 PathProgramCache]: Analyzing trace with hash -451677148, now seen corresponding path program 3 times [2024-06-27 18:53:32,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:32,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190060362] [2024-06-27 18:53:32,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:32,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:35,622 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-27 18:53:35,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:35,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190060362] [2024-06-27 18:53:35,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190060362] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:35,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:35,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:53:35,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582010153] [2024-06-27 18:53:35,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:35,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:53:35,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:35,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:53:35,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:53:35,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:53:35,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 149 transitions, 1701 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 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-27 18:53:35,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:35,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:53:35,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:37,011 INFO L124 PetriNetUnfolderBase]: 1738/3420 cut-off events. [2024-06-27 18:53:37,011 INFO L125 PetriNetUnfolderBase]: For 45221/45224 co-relation queries the response was YES. [2024-06-27 18:53:37,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16639 conditions, 3420 events. 1738/3420 cut-off events. For 45221/45224 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 23716 event pairs, 931 based on Foata normal form. 8/3327 useless extension candidates. Maximal degree in co-relation 16548. Up to 2786 conditions per place. [2024-06-27 18:53:37,038 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 148 selfloop transitions, 33 changer transitions 0/186 dead transitions. [2024-06-27 18:53:37,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 186 transitions, 2275 flow [2024-06-27 18:53:37,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 18:53:37,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 18:53:37,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 171 transitions. [2024-06-27 18:53:37,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-27 18:53:37,040 INFO L175 Difference]: Start difference. First operand has 189 places, 149 transitions, 1701 flow. Second operand 12 states and 171 transitions. [2024-06-27 18:53:37,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 186 transitions, 2275 flow [2024-06-27 18:53:37,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 186 transitions, 2214 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-27 18:53:37,168 INFO L231 Difference]: Finished difference. Result has 194 places, 150 transitions, 1739 flow [2024-06-27 18:53:37,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1640, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1739, PETRI_PLACES=194, PETRI_TRANSITIONS=150} [2024-06-27 18:53:37,168 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 154 predicate places. [2024-06-27 18:53:37,169 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 150 transitions, 1739 flow [2024-06-27 18:53:37,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 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-27 18:53:37,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:37,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:53:37,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-27 18:53:37,170 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:53:37,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:37,170 INFO L85 PathProgramCache]: Analyzing trace with hash 936537800, now seen corresponding path program 4 times [2024-06-27 18:53:37,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:37,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552950706] [2024-06-27 18:53:37,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:37,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:37,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:39,545 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-27 18:53:39,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:39,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552950706] [2024-06-27 18:53:39,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552950706] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:39,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:39,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:53:39,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040698879] [2024-06-27 18:53:39,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:39,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:53:39,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:39,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:53:39,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:53:39,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:53:39,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 150 transitions, 1739 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:39,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:39,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:53:39,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:40,750 INFO L124 PetriNetUnfolderBase]: 1780/3498 cut-off events. [2024-06-27 18:53:40,750 INFO L125 PetriNetUnfolderBase]: For 47409/47412 co-relation queries the response was YES. [2024-06-27 18:53:40,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17081 conditions, 3498 events. 1780/3498 cut-off events. For 47409/47412 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 24414 event pairs, 978 based on Foata normal form. 8/3405 useless extension candidates. Maximal degree in co-relation 16989. Up to 2988 conditions per place. [2024-06-27 18:53:40,778 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 149 selfloop transitions, 29 changer transitions 0/183 dead transitions. [2024-06-27 18:53:40,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 183 transitions, 2252 flow [2024-06-27 18:53:40,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 18:53:40,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 18:53:40,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 164 transitions. [2024-06-27 18:53:40,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37962962962962965 [2024-06-27 18:53:40,780 INFO L175 Difference]: Start difference. First operand has 194 places, 150 transitions, 1739 flow. Second operand 12 states and 164 transitions. [2024-06-27 18:53:40,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 183 transitions, 2252 flow [2024-06-27 18:53:40,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 183 transitions, 2170 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-27 18:53:40,947 INFO L231 Difference]: Finished difference. Result has 198 places, 153 transitions, 1794 flow [2024-06-27 18:53:40,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1657, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1794, PETRI_PLACES=198, PETRI_TRANSITIONS=153} [2024-06-27 18:53:40,947 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 158 predicate places. [2024-06-27 18:53:40,947 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 153 transitions, 1794 flow [2024-06-27 18:53:40,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:40,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:40,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:53:40,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-27 18:53:40,948 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:53:40,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:40,949 INFO L85 PathProgramCache]: Analyzing trace with hash 525808950, now seen corresponding path program 5 times [2024-06-27 18:53:40,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:40,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960338584] [2024-06-27 18:53:40,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:40,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:43,727 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-27 18:53:43,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:43,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960338584] [2024-06-27 18:53:43,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960338584] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:43,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:43,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 18:53:43,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705535204] [2024-06-27 18:53:43,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:43,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 18:53:43,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:43,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 18:53:43,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:53:43,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:53:43,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 153 transitions, 1794 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 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-27 18:53:43,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:43,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:53:43,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:45,314 INFO L124 PetriNetUnfolderBase]: 1822/3576 cut-off events. [2024-06-27 18:53:45,314 INFO L125 PetriNetUnfolderBase]: For 49820/49823 co-relation queries the response was YES. [2024-06-27 18:53:45,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17517 conditions, 3576 events. 1822/3576 cut-off events. For 49820/49823 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 25094 event pairs, 999 based on Foata normal form. 8/3483 useless extension candidates. Maximal degree in co-relation 17423. Up to 3005 conditions per place. [2024-06-27 18:53:45,340 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 152 selfloop transitions, 40 changer transitions 0/197 dead transitions. [2024-06-27 18:53:45,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 197 transitions, 2382 flow [2024-06-27 18:53:45,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 18:53:45,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 18:53:45,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 177 transitions. [2024-06-27 18:53:45,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2024-06-27 18:53:45,342 INFO L175 Difference]: Start difference. First operand has 198 places, 153 transitions, 1794 flow. Second operand 12 states and 177 transitions. [2024-06-27 18:53:45,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 197 transitions, 2382 flow [2024-06-27 18:53:45,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 197 transitions, 2297 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-27 18:53:45,488 INFO L231 Difference]: Finished difference. Result has 202 places, 156 transitions, 1863 flow [2024-06-27 18:53:45,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1709, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1863, PETRI_PLACES=202, PETRI_TRANSITIONS=156} [2024-06-27 18:53:45,489 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 162 predicate places. [2024-06-27 18:53:45,489 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 156 transitions, 1863 flow [2024-06-27 18:53:45,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 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-27 18:53:45,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:45,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:53:45,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-27 18:53:45,490 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:53:45,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:45,490 INFO L85 PathProgramCache]: Analyzing trace with hash 924627868, now seen corresponding path program 6 times [2024-06-27 18:53:45,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:45,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128162609] [2024-06-27 18:53:45,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:45,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:47,435 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-27 18:53:47,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:47,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128162609] [2024-06-27 18:53:47,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128162609] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:47,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:47,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:53:47,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953563205] [2024-06-27 18:53:47,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:47,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:53:47,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:47,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:53:47,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:53:47,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-27 18:53:47,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 156 transitions, 1863 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:47,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:47,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-27 18:53:47,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:48,482 INFO L124 PetriNetUnfolderBase]: 1825/3581 cut-off events. [2024-06-27 18:53:48,483 INFO L125 PetriNetUnfolderBase]: For 44568/44571 co-relation queries the response was YES. [2024-06-27 18:53:48,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17460 conditions, 3581 events. 1825/3581 cut-off events. For 44568/44571 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 24939 event pairs, 909 based on Foata normal form. 8/3488 useless extension candidates. Maximal degree in co-relation 17364. Up to 3017 conditions per place. [2024-06-27 18:53:48,510 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 161 selfloop transitions, 32 changer transitions 0/198 dead transitions. [2024-06-27 18:53:48,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 198 transitions, 2473 flow [2024-06-27 18:53:48,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:53:48,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:53:48,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2024-06-27 18:53:48,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41388888888888886 [2024-06-27 18:53:48,513 INFO L175 Difference]: Start difference. First operand has 202 places, 156 transitions, 1863 flow. Second operand 10 states and 149 transitions. [2024-06-27 18:53:48,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 198 transitions, 2473 flow [2024-06-27 18:53:48,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 198 transitions, 2258 flow, removed 33 selfloop flow, removed 40 redundant places. [2024-06-27 18:53:48,603 INFO L231 Difference]: Finished difference. Result has 173 places, 166 transitions, 1874 flow [2024-06-27 18:53:48,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1550, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1874, PETRI_PLACES=173, PETRI_TRANSITIONS=166} [2024-06-27 18:53:48,603 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 133 predicate places. [2024-06-27 18:53:48,603 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 166 transitions, 1874 flow [2024-06-27 18:53:48,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:48,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:48,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:53:48,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-27 18:53:48,604 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:53:48,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:48,604 INFO L85 PathProgramCache]: Analyzing trace with hash 938874221, now seen corresponding path program 1 times [2024-06-27 18:53:48,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:48,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523939263] [2024-06-27 18:53:48,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:48,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:48,689 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-27 18:53:48,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:48,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523939263] [2024-06-27 18:53:48,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523939263] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:48,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:48,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:53:48,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462461601] [2024-06-27 18:53:48,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:48,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 18:53:48,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:48,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 18:53:48,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 18:53:48,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 18:53:48,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 166 transitions, 1874 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:48,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:48,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 18:53:48,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:49,059 INFO L124 PetriNetUnfolderBase]: 1154/2366 cut-off events. [2024-06-27 18:53:49,060 INFO L125 PetriNetUnfolderBase]: For 17515/17524 co-relation queries the response was YES. [2024-06-27 18:53:49,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10275 conditions, 2366 events. 1154/2366 cut-off events. For 17515/17524 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 15633 event pairs, 195 based on Foata normal form. 173/2476 useless extension candidates. Maximal degree in co-relation 10209. Up to 800 conditions per place. [2024-06-27 18:53:49,076 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 79 selfloop transitions, 31 changer transitions 1/133 dead transitions. [2024-06-27 18:53:49,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 133 transitions, 1551 flow [2024-06-27 18:53:49,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:53:49,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:53:49,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2024-06-27 18:53:49,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2024-06-27 18:53:49,078 INFO L175 Difference]: Start difference. First operand has 173 places, 166 transitions, 1874 flow. Second operand 5 states and 92 transitions. [2024-06-27 18:53:49,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 133 transitions, 1551 flow [2024-06-27 18:53:49,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 133 transitions, 1170 flow, removed 53 selfloop flow, removed 41 redundant places. [2024-06-27 18:53:49,124 INFO L231 Difference]: Finished difference. Result has 138 places, 119 transitions, 999 flow [2024-06-27 18:53:49,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=999, PETRI_PLACES=138, PETRI_TRANSITIONS=119} [2024-06-27 18:53:49,124 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 98 predicate places. [2024-06-27 18:53:49,124 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 119 transitions, 999 flow [2024-06-27 18:53:49,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:49,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:49,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:53:49,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-27 18:53:49,125 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:53:49,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:49,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1756677446, now seen corresponding path program 1 times [2024-06-27 18:53:49,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:49,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884856416] [2024-06-27 18:53:49,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:49,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:49,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-27 18:53:49,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:49,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884856416] [2024-06-27 18:53:49,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884856416] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:49,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:49,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:53:49,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178219832] [2024-06-27 18:53:49,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:49,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 18:53:49,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:49,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 18:53:49,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 18:53:49,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 18:53:49,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 119 transitions, 999 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:49,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:49,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 18:53:49,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:49,556 INFO L124 PetriNetUnfolderBase]: 836/1837 cut-off events. [2024-06-27 18:53:49,556 INFO L125 PetriNetUnfolderBase]: For 6884/6887 co-relation queries the response was YES. [2024-06-27 18:53:49,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6920 conditions, 1837 events. 836/1837 cut-off events. For 6884/6887 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 12187 event pairs, 327 based on Foata normal form. 32/1844 useless extension candidates. Maximal degree in co-relation 6874. Up to 958 conditions per place. [2024-06-27 18:53:49,566 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 38 selfloop transitions, 5 changer transitions 79/135 dead transitions. [2024-06-27 18:53:49,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 135 transitions, 1255 flow [2024-06-27 18:53:49,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:53:49,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:53:49,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2024-06-27 18:53:49,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-27 18:53:49,567 INFO L175 Difference]: Start difference. First operand has 138 places, 119 transitions, 999 flow. Second operand 6 states and 99 transitions. [2024-06-27 18:53:49,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 135 transitions, 1255 flow [2024-06-27 18:53:49,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 135 transitions, 1075 flow, removed 18 selfloop flow, removed 13 redundant places. [2024-06-27 18:53:49,592 INFO L231 Difference]: Finished difference. Result has 132 places, 51 transitions, 331 flow [2024-06-27 18:53:49,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=331, PETRI_PLACES=132, PETRI_TRANSITIONS=51} [2024-06-27 18:53:49,593 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 92 predicate places. [2024-06-27 18:53:49,593 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 51 transitions, 331 flow [2024-06-27 18:53:49,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:49,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:49,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:53:49,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-27 18:53:49,594 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 18:53:49,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:49,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1106850766, now seen corresponding path program 2 times [2024-06-27 18:53:49,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:49,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272012498] [2024-06-27 18:53:49,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:49,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 18:53:49,616 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 18:53:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 18:53:49,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 18:53:49,660 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 18:53:49,661 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-06-27 18:53:49,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-06-27 18:53:49,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-06-27 18:53:49,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 7 remaining) [2024-06-27 18:53:49,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-06-27 18:53:49,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-06-27 18:53:49,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-06-27 18:53:49,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-27 18:53:49,664 INFO L445 BasicCegarLoop]: Path program histogram: [11, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:53:49,669 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 18:53:49,669 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 18:53:49,717 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 18:53:49,718 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 18:53:49,718 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 18:53:49,718 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 18:53:49,720 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 18:53:49,720 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 18:53:49,720 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 18:53:49,720 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 18:53:49,728 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-06-27 18:53:49,738 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-27 18:53:49,738 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-27 18:53:49,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 06:53:49 BasicIcfg [2024-06-27 18:53:49,739 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 18:53:49,739 INFO L158 Benchmark]: Toolchain (without parser) took 172776.14ms. Allocated memory was 130.0MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 82.5MB in the beginning and 608.9MB in the end (delta: -526.4MB). Peak memory consumption was 891.8MB. Max. memory is 16.1GB. [2024-06-27 18:53:49,739 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 130.0MB. Free memory was 100.4MB in the beginning and 100.2MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 18:53:49,739 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 130.0MB. Free memory is still 92.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 18:53:49,739 INFO L158 Benchmark]: CACSL2BoogieTranslator took 628.76ms. Allocated memory is still 130.0MB. Free memory was 82.1MB in the beginning and 89.6MB in the end (delta: -7.5MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2024-06-27 18:53:49,740 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.56ms. Allocated memory is still 130.0MB. Free memory was 89.6MB in the beginning and 87.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 18:53:49,740 INFO L158 Benchmark]: Boogie Preprocessor took 65.49ms. Allocated memory was 130.0MB in the beginning and 184.5MB in the end (delta: 54.5MB). Free memory was 87.0MB in the beginning and 151.2MB in the end (delta: -64.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-27 18:53:49,740 INFO L158 Benchmark]: RCFGBuilder took 881.04ms. Allocated memory is still 184.5MB. Free memory was 151.2MB in the beginning and 125.3MB in the end (delta: 26.0MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. [2024-06-27 18:53:49,740 INFO L158 Benchmark]: TraceAbstraction took 171141.90ms. Allocated memory was 184.5MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 125.3MB in the beginning and 608.9MB in the end (delta: -483.6MB). Peak memory consumption was 882.7MB. Max. memory is 16.1GB. [2024-06-27 18:53:49,741 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.14ms. Allocated memory is still 130.0MB. Free memory was 100.4MB in the beginning and 100.2MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.15ms. Allocated memory is still 130.0MB. Free memory is still 92.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 628.76ms. Allocated memory is still 130.0MB. Free memory was 82.1MB in the beginning and 89.6MB in the end (delta: -7.5MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.56ms. Allocated memory is still 130.0MB. Free memory was 89.6MB in the beginning and 87.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.49ms. Allocated memory was 130.0MB in the beginning and 184.5MB in the end (delta: 54.5MB). Free memory was 87.0MB in the beginning and 151.2MB in the end (delta: -64.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 881.04ms. Allocated memory is still 184.5MB. Free memory was 151.2MB in the beginning and 125.3MB in the end (delta: 26.0MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. * TraceAbstraction took 171141.90ms. Allocated memory was 184.5MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 125.3MB in the beginning and 608.9MB in the end (delta: -483.6MB). Peak memory consumption was 882.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L713] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L714] 0 int __unbuffered_p1_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L721] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L722] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L723] 0 int __unbuffered_p1_EAX$w_buff0; [L724] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L725] 0 int __unbuffered_p1_EAX$w_buff1; [L726] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L727] 0 _Bool main$tmp_guard0; [L728] 0 _Bool main$tmp_guard1; [L730] 0 int x = 0; [L730] 0 int x = 0; [L731] 0 _Bool x$flush_delayed; [L732] 0 int x$mem_tmp; [L733] 0 _Bool x$r_buff0_thd0; [L734] 0 _Bool x$r_buff0_thd1; [L735] 0 _Bool x$r_buff0_thd2; [L736] 0 _Bool x$r_buff1_thd0; [L737] 0 _Bool x$r_buff1_thd1; [L738] 0 _Bool x$r_buff1_thd2; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice1; [L749] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1923; [L826] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1923=-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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L826] FCALL, FORK 0 pthread_create(&t1923, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1923=-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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L827] 0 pthread_t t1924; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1923=-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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L828] 0 //@ assert ((((((((((((((((((((((((((((!multithreaded || ((x$w_buff0 == 0) || (x$w_buff0 == 1))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff0 == 0))) && (!multithreaded || ((__unbuffered_p1_EAX$read_delayed_var == 0) || ((__unbuffered_p1_EAX$read_delayed_var == &x) && ((*__unbuffered_p1_EAX$read_delayed_var == 0) || (*__unbuffered_p1_EAX$read_delayed_var == 1)))))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((x$mem_tmp == 0) || (x$mem_tmp == 1)))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || ((x$w_buff1 == 0) || (x$w_buff1 == 1)))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || (__unbuffered_p1_EAX$mem_tmp == 0))); [L828] 0 __unbuffered_p1_EAX$read_delayed_var [L828] 0 __unbuffered_p1_EAX$read_delayed_var [L828] 0 x [L828] 0 x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1923=-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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L828] FCALL, FORK 0 pthread_create(&t1924, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1923=-1, t1924=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L781] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 2 x$flush_delayed = weak$$choice2 [L784] EXPR 2 \read(x) [L784] 2 x$mem_tmp = x [L785] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] EXPR 2 \read(x) [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L793] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L794] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L795] EXPR 2 \read(x) [L795] 2 __unbuffered_p1_EAX = x [L796] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L796] EXPR 2 \read(x) [L796] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L796] 2 x = x$flush_delayed ? x$mem_tmp : x [L797] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L828] 0 __unbuffered_p1_EAX$read_delayed_var [L828] 0 __unbuffered_p1_EAX$read_delayed_var [L828] 0 x [L828] 0 x [L829] 0 //@ assert ((((((((((((((((((((((((((((!multithreaded || ((x$w_buff0 == 0) || (x$w_buff0 == 1))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff0 == 0))) && (!multithreaded || ((__unbuffered_p1_EAX$read_delayed_var == 0) || ((__unbuffered_p1_EAX$read_delayed_var == &x) && ((*__unbuffered_p1_EAX$read_delayed_var == 0) || (*__unbuffered_p1_EAX$read_delayed_var == 1)))))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((x$mem_tmp == 0) || (x$mem_tmp == 1)))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || ((x$w_buff1 == 0) || (x$w_buff1 == 1)))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || (__unbuffered_p1_EAX$mem_tmp == 0))); [L829] 0 __unbuffered_p1_EAX$read_delayed_var [L829] 0 __unbuffered_p1_EAX$read_delayed_var [L829] 0 x [L829] 0 x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1923=-1, t1924=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L800] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L753] 1 __unbuffered_p0_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L803] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L803] EXPR 2 \read(x) [L803] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L803] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L804] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L805] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L806] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L807] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L756] 1 x$w_buff1 = x$w_buff0 [L757] 1 x$w_buff0 = 1 [L758] 1 x$w_buff1_used = x$w_buff0_used [L759] 1 x$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 1 x$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0: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=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L767] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L767] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L767] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L768] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L769] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L770] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L771] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0: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=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0: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=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L829] 0 __unbuffered_p1_EAX$read_delayed_var [L829] 0 __unbuffered_p1_EAX$read_delayed_var [L829] 0 x [L829] 0 x [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1923=-1, t1924=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=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] EXPR 0 \read(x) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L835] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L837] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1923=-1, t1924=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=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L841] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L842] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L842] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L842] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L842] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L842] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L842] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L843] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1923=-1, t1924=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L845] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 53 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 171.0s, OverallIterations: 60, TraceHistogramMax: 1, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 55.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2978 SdHoareTripleChecker+Valid, 19.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2846 mSDsluCounter, 1293 SdHoareTripleChecker+Invalid, 17.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1084 mSDsCounter, 959 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19943 IncrementalHoareTripleChecker+Invalid, 20902 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 959 mSolverCounterUnsat, 209 mSDtfsCounter, 19943 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 629 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 624 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 45.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3255occurred in iteration=32, InterpolantAutomatonStates: 484, 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.8s SatisfiabilityAnalysisTime, 113.9s InterpolantComputationTime, 947 NumberOfCodeBlocks, 947 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 862 ConstructedInterpolants, 0 QuantifiedInterpolants, 79164 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 59 InterpolantComputations, 59 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-27 18:53:49,796 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