./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe028_pso.oepc_pso.opt_tso.oepc_tso.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe028_pso.oepc_pso.opt_tso.oepc_tso.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 958ec4d9 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/safe028_pso.oepc_pso.opt_tso.oepc_tso.opt.i ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe028_pso.oepc_pso.opt_tso.oepc_tso.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-dev-958ec4d-m [2024-02-07 14:25:03,954 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 14:25:04,032 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 14:25:04,037 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 14:25:04,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 14:25:04,061 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 14:25:04,062 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 14:25:04,062 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 14:25:04,063 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 14:25:04,066 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 14:25:04,066 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 14:25:04,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 14:25:04,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 14:25:04,068 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 14:25:04,068 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 14:25:04,068 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 14:25:04,069 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 14:25:04,069 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 14:25:04,069 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 14:25:04,069 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 14:25:04,069 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 14:25:04,070 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 14:25:04,070 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 14:25:04,070 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 14:25:04,070 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 14:25:04,070 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 14:25:04,071 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 14:25:04,071 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 14:25:04,071 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 14:25:04,071 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 14:25:04,072 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 14:25:04,072 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 14:25:04,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:25:04,073 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 14:25:04,073 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 14:25:04,073 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 14:25:04,073 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 14:25:04,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 14:25:04,074 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 14:25:04,074 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 14:25:04,074 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 14:25:04,075 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 14:25:04,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 14:25:04,075 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-02-07 14:25:04,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 14:25:04,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 14:25:04,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 14:25:04,311 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 14:25:04,311 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 14:25:04,312 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe028_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-02-07 14:25:05,374 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 14:25:05,637 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 14:25:05,641 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe028_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-02-07 14:25:05,655 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e380c3b97/88c499235f154d348f3a278fac3d84b7/FLAGbc2f5155a [2024-02-07 14:25:05,670 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e380c3b97/88c499235f154d348f3a278fac3d84b7 [2024-02-07 14:25:05,672 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 14:25:05,672 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 14:25:05,674 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe028_pso.oepc_pso.opt_tso.oepc_tso.opt.yml/witness.yml [2024-02-07 14:25:05,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 14:25:05,770 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 14:25:05,771 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 14:25:05,772 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 14:25:05,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 14:25:05,776 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:25:05" (1/2) ... [2024-02-07 14:25:05,777 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a3a3292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:05, skipping insertion in model container [2024-02-07 14:25:05,777 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:25:05" (1/2) ... [2024-02-07 14:25:05,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@150f22af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:25:05, skipping insertion in model container [2024-02-07 14:25:05,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:25:05" (2/2) ... [2024-02-07 14:25:05,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a3a3292 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:25:05, skipping insertion in model container [2024-02-07 14:25:05,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:25:05" (2/2) ... [2024-02-07 14:25:05,779 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 14:25:05,839 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 14:25:05,841 INFO L76 edCorrectnessWitness]: Location invariant before [L747-L747] 0 <= __unbuffered_cnt [2024-02-07 14:25:05,841 INFO L76 edCorrectnessWitness]: Location invariant before [L762-L762] 0 <= __unbuffered_cnt [2024-02-07 14:25:05,841 INFO L76 edCorrectnessWitness]: Location invariant before [L730-L730] ((0 <= x) && (x <= 1)) && (x == 0 || x == 1) [2024-02-07 14:25:05,841 INFO L76 edCorrectnessWitness]: Location invariant before [L763-L763] 1 <= __unbuffered_cnt [2024-02-07 14:25:05,841 INFO L76 edCorrectnessWitness]: Location invariant before [L791-L791] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 14:25:05,842 INFO L76 edCorrectnessWitness]: Location invariant before [L743-L743] x == 1 [2024-02-07 14:25:05,842 INFO L76 edCorrectnessWitness]: Location invariant before [L754-L754] ((0 <= x) && (x <= 1)) && (x == 0 || x == 1) [2024-02-07 14:25:05,842 INFO L76 edCorrectnessWitness]: Location invariant before [L785-L785] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 14:25:05,843 INFO L76 edCorrectnessWitness]: Location invariant before [L755-L755] ((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) [2024-02-07 14:25:05,843 INFO L76 edCorrectnessWitness]: Location invariant before [L758-L758] ((0 <= __unbuffered_p2_EBX) && (__unbuffered_p2_EBX <= 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) [2024-02-07 14:25:05,843 INFO L76 edCorrectnessWitness]: Location invariant before [L784-L784] 0 <= __unbuffered_cnt [2024-02-07 14:25:05,843 INFO L76 edCorrectnessWitness]: Location invariant before [L18-L18] ((0 <= expression) && (expression <= 1)) && (expression == 0 || expression == 1) [2024-02-07 14:25:05,843 INFO L76 edCorrectnessWitness]: Location invariant before [L786-L786] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 14:25:05,843 INFO L76 edCorrectnessWitness]: Location invariant before [L790-L790] ((((0 <= __unbuffered_p2_EBX) && (__unbuffered_p2_EBX <= 1)) && (__unbuffered_p0_EAX == 0)) && (__unbuffered_p2_EAX == 1 || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) [2024-02-07 14:25:05,843 INFO L76 edCorrectnessWitness]: Location invariant before [L748-L748] 1 <= __unbuffered_cnt [2024-02-07 14:25:05,844 INFO L76 edCorrectnessWitness]: Location invariant before [L726-L726] y == 1 [2024-02-07 14:25:05,844 INFO L76 edCorrectnessWitness]: Location invariant before [L735-L735] 0 <= __unbuffered_cnt [2024-02-07 14:25:05,844 INFO L76 edCorrectnessWitness]: Location invariant before [L757-L757] ((0 <= y) && (y <= 1)) && (y == 0 || y == 1) [2024-02-07 14:25:05,844 INFO L76 edCorrectnessWitness]: Location invariant before [L736-L736] 1 <= __unbuffered_cnt [2024-02-07 14:25:05,844 INFO L76 edCorrectnessWitness]: Location invariant before [L792-L792] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 14:25:05,844 INFO L76 edCorrectnessWitness]: Location invariant before [L731-L731] ((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) [2024-02-07 14:25:05,892 INFO L178 MainTranslator]: Built tables and reachable declarations [2024-02-07 14:25:06,047 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe028_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2024-02-07 14:25:06,179 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:25:06,185 INFO L203 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-07 14:25:06,217 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe028_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-07 14:25:06,252 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:25:06,279 INFO L207 MainTranslator]: Completed translation [2024-02-07 14:25:06,279 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:25:06 WrapperNode [2024-02-07 14:25:06,280 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 14:25:06,280 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 14:25:06,280 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 14:25:06,281 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 14:25:06,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:25:06" (1/1) ... [2024-02-07 14:25:06,293 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:25:06" (1/1) ... [2024-02-07 14:25:06,307 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 77 [2024-02-07 14:25:06,308 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 14:25:06,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 14:25:06,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 14:25:06,308 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 14:25:06,315 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:25:06" (1/1) ... [2024-02-07 14:25:06,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:25:06" (1/1) ... [2024-02-07 14:25:06,318 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:25:06" (1/1) ... [2024-02-07 14:25:06,327 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-02-07 14:25:06,327 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:25:06" (1/1) ... [2024-02-07 14:25:06,328 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:25:06" (1/1) ... [2024-02-07 14:25:06,332 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:25:06" (1/1) ... [2024-02-07 14:25:06,333 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:25:06" (1/1) ... [2024-02-07 14:25:06,334 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:25:06" (1/1) ... [2024-02-07 14:25:06,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:25:06" (1/1) ... [2024-02-07 14:25:06,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 14:25:06,338 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 14:25:06,338 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 14:25:06,338 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 14:25:06,338 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:25:06" (1/1) ... [2024-02-07 14:25:06,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:25:06,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:25:06,359 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-02-07 14:25:06,364 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-02-07 14:25:06,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 14:25:06,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 14:25:06,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 14:25:06,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 14:25:06,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-07 14:25:06,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 14:25:06,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 14:25:06,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 14:25:06,401 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-02-07 14:25:06,401 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-02-07 14:25:06,401 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-02-07 14:25:06,401 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-02-07 14:25:06,401 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-02-07 14:25:06,401 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-02-07 14:25:06,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 14:25:06,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 14:25:06,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 14:25:06,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 14:25:06,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-07 14:25:06,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 14:25:06,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 14:25:06,404 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-07 14:25:06,498 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 14:25:06,500 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 14:25:06,659 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 14:25:06,659 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 14:25:06,778 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 14:25:06,778 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-07 14:25:06,778 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:25:06 BoogieIcfgContainer [2024-02-07 14:25:06,779 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 14:25:06,780 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 14:25:06,780 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 14:25:06,782 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 14:25:06,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 02:25:05" (1/4) ... [2024-02-07 14:25:06,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@843076f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 02:25:06, skipping insertion in model container [2024-02-07 14:25:06,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:25:05" (2/4) ... [2024-02-07 14:25:06,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@843076f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 02:25:06, skipping insertion in model container [2024-02-07 14:25:06,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:25:06" (3/4) ... [2024-02-07 14:25:06,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@843076f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 02:25:06, skipping insertion in model container [2024-02-07 14:25:06,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:25:06" (4/4) ... [2024-02-07 14:25:06,785 INFO L112 eAbstractionObserver]: Analyzing ICFG safe028_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-02-07 14:25:06,798 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 14:25:06,798 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-02-07 14:25:06,799 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 14:25:06,845 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-07 14:25:06,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 60 transitions, 132 flow [2024-02-07 14:25:06,918 INFO L124 PetriNetUnfolderBase]: 1/57 cut-off events. [2024-02-07 14:25:06,919 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:25:06,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 57 events. 1/57 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 176 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2024-02-07 14:25:06,922 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 60 transitions, 132 flow [2024-02-07 14:25:06,926 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 57 transitions, 123 flow [2024-02-07 14:25:06,939 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 14:25:06,944 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;@62684076, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 14:25:06,944 INFO L358 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2024-02-07 14:25:06,946 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 14:25:06,947 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-02-07 14:25:06,947 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:25:06,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:06,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-07 14:25:06,948 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:06,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:06,952 INFO L85 PathProgramCache]: Analyzing trace with hash 9786142, now seen corresponding path program 1 times [2024-02-07 14:25:06,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:06,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163415003] [2024-02-07 14:25:06,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:06,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:07,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:07,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:07,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163415003] [2024-02-07 14:25:07,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163415003] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:07,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:07,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:25:07,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771164027] [2024-02-07 14:25:07,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:07,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-02-07 14:25:07,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:07,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-02-07 14:25:07,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-02-07 14:25:07,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 60 [2024-02-07 14:25:07,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 123 flow. Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 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-02-07 14:25:07,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:07,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 60 [2024-02-07 14:25:07,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:08,046 INFO L124 PetriNetUnfolderBase]: 6230/10626 cut-off events. [2024-02-07 14:25:08,047 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-02-07 14:25:08,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19552 conditions, 10626 events. 6230/10626 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 82541 event pairs, 6230 based on Foata normal form. 245/7477 useless extension candidates. Maximal degree in co-relation 19541. Up to 8836 conditions per place. [2024-02-07 14:25:08,115 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 31 selfloop transitions, 0 changer transitions 0/46 dead transitions. [2024-02-07 14:25:08,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 46 transitions, 163 flow [2024-02-07 14:25:08,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-02-07 14:25:08,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-02-07 14:25:08,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 78 transitions. [2024-02-07 14:25:08,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.65 [2024-02-07 14:25:08,126 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 123 flow. Second operand 2 states and 78 transitions. [2024-02-07 14:25:08,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 46 transitions, 163 flow [2024-02-07 14:25:08,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 46 transitions, 160 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-07 14:25:08,135 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 98 flow [2024-02-07 14:25:08,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2024-02-07 14:25:08,140 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -12 predicate places. [2024-02-07 14:25:08,140 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 98 flow [2024-02-07 14:25:08,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 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-02-07 14:25:08,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:08,141 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-07 14:25:08,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 14:25:08,142 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:08,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:08,142 INFO L85 PathProgramCache]: Analyzing trace with hash 814558816, now seen corresponding path program 1 times [2024-02-07 14:25:08,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:08,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223722895] [2024-02-07 14:25:08,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:08,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:08,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:08,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:08,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223722895] [2024-02-07 14:25:08,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223722895] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:08,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:08,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:25:08,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336911777] [2024-02-07 14:25:08,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:08,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:08,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:08,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:08,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:08,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 60 [2024-02-07 14:25:08,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:08,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:08,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 60 [2024-02-07 14:25:08,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:08,834 INFO L124 PetriNetUnfolderBase]: 5878/8970 cut-off events. [2024-02-07 14:25:08,834 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:25:08,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17408 conditions, 8970 events. 5878/8970 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 59965 event pairs, 1220 based on Foata normal form. 0/6300 useless extension candidates. Maximal degree in co-relation 17405. Up to 7333 conditions per place. [2024-02-07 14:25:08,880 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 50 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2024-02-07 14:25:08,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 246 flow [2024-02-07 14:25:08,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:08,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:08,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-02-07 14:25:08,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-02-07 14:25:08,883 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 98 flow. Second operand 3 states and 108 transitions. [2024-02-07 14:25:08,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 246 flow [2024-02-07 14:25:08,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 67 transitions, 246 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-07 14:25:08,886 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 108 flow [2024-02-07 14:25:08,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2024-02-07 14:25:08,887 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -9 predicate places. [2024-02-07 14:25:08,887 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 108 flow [2024-02-07 14:25:08,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:08,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:08,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:08,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 14:25:08,889 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:08,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:08,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1106986339, now seen corresponding path program 1 times [2024-02-07 14:25:08,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:08,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155111029] [2024-02-07 14:25:08,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:08,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:08,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:08,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:08,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155111029] [2024-02-07 14:25:08,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155111029] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:08,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:08,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:25:08,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706126658] [2024-02-07 14:25:08,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:08,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:08,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:08,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:08,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:08,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 60 [2024-02-07 14:25:08,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:08,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:08,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 60 [2024-02-07 14:25:08,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:09,358 INFO L124 PetriNetUnfolderBase]: 4504/6767 cut-off events. [2024-02-07 14:25:09,358 INFO L125 PetriNetUnfolderBase]: For 719/719 co-relation queries the response was YES. [2024-02-07 14:25:09,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14366 conditions, 6767 events. 4504/6767 cut-off events. For 719/719 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 41540 event pairs, 1374 based on Foata normal form. 0/5405 useless extension candidates. Maximal degree in co-relation 14361. Up to 5754 conditions per place. [2024-02-07 14:25:09,393 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 49 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2024-02-07 14:25:09,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 68 transitions, 269 flow [2024-02-07 14:25:09,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:09,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:09,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2024-02-07 14:25:09,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2024-02-07 14:25:09,395 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 108 flow. Second operand 3 states and 111 transitions. [2024-02-07 14:25:09,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 68 transitions, 269 flow [2024-02-07 14:25:09,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 68 transitions, 263 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:25:09,397 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 136 flow [2024-02-07 14:25:09,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2024-02-07 14:25:09,398 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -8 predicate places. [2024-02-07 14:25:09,450 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 136 flow [2024-02-07 14:25:09,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:09,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:09,450 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:09,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 14:25:09,450 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:09,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:09,451 INFO L85 PathProgramCache]: Analyzing trace with hash 982070655, now seen corresponding path program 1 times [2024-02-07 14:25:09,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:09,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780361218] [2024-02-07 14:25:09,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:09,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:09,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:09,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:09,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780361218] [2024-02-07 14:25:09,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780361218] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:09,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:09,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:25:09,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319724581] [2024-02-07 14:25:09,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:09,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:09,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:09,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:09,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:09,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 60 [2024-02-07 14:25:09,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 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-02-07 14:25:09,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:09,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 60 [2024-02-07 14:25:09,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:09,980 INFO L124 PetriNetUnfolderBase]: 4504/7628 cut-off events. [2024-02-07 14:25:09,981 INFO L125 PetriNetUnfolderBase]: For 1235/1235 co-relation queries the response was YES. [2024-02-07 14:25:09,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16954 conditions, 7628 events. 4504/7628 cut-off events. For 1235/1235 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 56283 event pairs, 4212 based on Foata normal form. 0/6105 useless extension candidates. Maximal degree in co-relation 16948. Up to 6499 conditions per place. [2024-02-07 14:25:10,011 INFO L140 encePairwiseOnDemand]: 58/60 looper letters, 33 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2024-02-07 14:25:10,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 48 transitions, 202 flow [2024-02-07 14:25:10,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:10,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:10,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2024-02-07 14:25:10,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46111111111111114 [2024-02-07 14:25:10,014 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 136 flow. Second operand 3 states and 83 transitions. [2024-02-07 14:25:10,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 48 transitions, 202 flow [2024-02-07 14:25:10,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 48 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:10,016 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 132 flow [2024-02-07 14:25:10,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2024-02-07 14:25:10,018 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -8 predicate places. [2024-02-07 14:25:10,018 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 132 flow [2024-02-07 14:25:10,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 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-02-07 14:25:10,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:10,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:10,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 14:25:10,019 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:10,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:10,019 INFO L85 PathProgramCache]: Analyzing trace with hash 982102827, now seen corresponding path program 1 times [2024-02-07 14:25:10,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:10,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669443549] [2024-02-07 14:25:10,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:10,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:10,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:10,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:10,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669443549] [2024-02-07 14:25:10,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669443549] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:10,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:10,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:25:10,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329353767] [2024-02-07 14:25:10,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:10,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:10,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:10,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:10,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:10,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 60 [2024-02-07 14:25:10,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:10,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:10,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 60 [2024-02-07 14:25:10,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:10,495 INFO L124 PetriNetUnfolderBase]: 4415/6939 cut-off events. [2024-02-07 14:25:10,496 INFO L125 PetriNetUnfolderBase]: For 1226/1226 co-relation queries the response was YES. [2024-02-07 14:25:10,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15823 conditions, 6939 events. 4415/6939 cut-off events. For 1226/1226 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 45629 event pairs, 1217 based on Foata normal form. 0/5846 useless extension candidates. Maximal degree in co-relation 15817. Up to 5786 conditions per place. [2024-02-07 14:25:10,526 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 56 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2024-02-07 14:25:10,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 72 transitions, 317 flow [2024-02-07 14:25:10,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:10,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:10,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-02-07 14:25:10,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-02-07 14:25:10,529 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 132 flow. Second operand 3 states and 108 transitions. [2024-02-07 14:25:10,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 72 transitions, 317 flow [2024-02-07 14:25:10,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 72 transitions, 316 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:10,531 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 139 flow [2024-02-07 14:25:10,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2024-02-07 14:25:10,534 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -6 predicate places. [2024-02-07 14:25:10,534 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 139 flow [2024-02-07 14:25:10,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:10,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:10,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:10,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 14:25:10,535 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:10,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:10,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1791863835, now seen corresponding path program 1 times [2024-02-07 14:25:10,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:10,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141632052] [2024-02-07 14:25:10,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:10,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:10,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:10,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:10,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141632052] [2024-02-07 14:25:10,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141632052] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:10,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:10,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:25:10,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063689352] [2024-02-07 14:25:10,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:10,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:10,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:10,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:10,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:10,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 60 [2024-02-07 14:25:10,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:10,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:10,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 60 [2024-02-07 14:25:10,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:10,887 INFO L124 PetriNetUnfolderBase]: 3483/5440 cut-off events. [2024-02-07 14:25:10,888 INFO L125 PetriNetUnfolderBase]: For 1252/1252 co-relation queries the response was YES. [2024-02-07 14:25:10,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12928 conditions, 5440 events. 3483/5440 cut-off events. For 1252/1252 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 33227 event pairs, 956 based on Foata normal form. 368/5021 useless extension candidates. Maximal degree in co-relation 12921. Up to 4304 conditions per place. [2024-02-07 14:25:10,911 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 54 selfloop transitions, 1 changer transitions 0/69 dead transitions. [2024-02-07 14:25:10,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 69 transitions, 308 flow [2024-02-07 14:25:10,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:10,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:10,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-02-07 14:25:10,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2024-02-07 14:25:10,912 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 139 flow. Second operand 3 states and 106 transitions. [2024-02-07 14:25:10,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 69 transitions, 308 flow [2024-02-07 14:25:10,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 69 transitions, 300 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-07 14:25:10,914 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 127 flow [2024-02-07 14:25:10,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2024-02-07 14:25:10,915 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -9 predicate places. [2024-02-07 14:25:10,915 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 127 flow [2024-02-07 14:25:10,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:10,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:10,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:10,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 14:25:10,916 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:10,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:10,916 INFO L85 PathProgramCache]: Analyzing trace with hash -284076663, now seen corresponding path program 1 times [2024-02-07 14:25:10,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:10,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824448141] [2024-02-07 14:25:10,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:10,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:10,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:10,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:10,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824448141] [2024-02-07 14:25:10,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824448141] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:10,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:10,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:25:10,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147674229] [2024-02-07 14:25:10,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:10,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:10,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:10,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:10,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:10,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 60 [2024-02-07 14:25:10,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:10,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:10,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 60 [2024-02-07 14:25:10,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:11,235 INFO L124 PetriNetUnfolderBase]: 3065/4996 cut-off events. [2024-02-07 14:25:11,236 INFO L125 PetriNetUnfolderBase]: For 969/969 co-relation queries the response was YES. [2024-02-07 14:25:11,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11338 conditions, 4996 events. 3065/4996 cut-off events. For 969/969 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 32102 event pairs, 760 based on Foata normal form. 176/4461 useless extension candidates. Maximal degree in co-relation 11332. Up to 3931 conditions per place. [2024-02-07 14:25:11,261 INFO L140 encePairwiseOnDemand]: 58/60 looper letters, 53 selfloop transitions, 1 changer transitions 0/68 dead transitions. [2024-02-07 14:25:11,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 68 transitions, 297 flow [2024-02-07 14:25:11,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:11,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:11,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-02-07 14:25:11,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2024-02-07 14:25:11,262 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 127 flow. Second operand 3 states and 104 transitions. [2024-02-07 14:25:11,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 68 transitions, 297 flow [2024-02-07 14:25:11,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 68 transitions, 293 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:25:11,264 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 122 flow [2024-02-07 14:25:11,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2024-02-07 14:25:11,265 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -10 predicate places. [2024-02-07 14:25:11,265 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 122 flow [2024-02-07 14:25:11,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:11,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:11,265 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:11,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-07 14:25:11,266 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:11,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:11,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1122895130, now seen corresponding path program 1 times [2024-02-07 14:25:11,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:11,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373504831] [2024-02-07 14:25:11,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:11,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:11,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:11,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:11,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373504831] [2024-02-07 14:25:11,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373504831] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:11,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:11,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:25:11,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579706363] [2024-02-07 14:25:11,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:11,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:11,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:11,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:11,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:11,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 60 [2024-02-07 14:25:11,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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-02-07 14:25:11,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:11,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 60 [2024-02-07 14:25:11,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:11,569 INFO L124 PetriNetUnfolderBase]: 3043/4668 cut-off events. [2024-02-07 14:25:11,569 INFO L125 PetriNetUnfolderBase]: For 762/762 co-relation queries the response was YES. [2024-02-07 14:25:11,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10971 conditions, 4668 events. 3043/4668 cut-off events. For 762/762 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 27640 event pairs, 1017 based on Foata normal form. 0/3985 useless extension candidates. Maximal degree in co-relation 10966. Up to 4257 conditions per place. [2024-02-07 14:25:11,589 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 45 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2024-02-07 14:25:11,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 62 transitions, 263 flow [2024-02-07 14:25:11,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:11,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:11,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2024-02-07 14:25:11,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-02-07 14:25:11,590 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 122 flow. Second operand 3 states and 100 transitions. [2024-02-07 14:25:11,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 62 transitions, 263 flow [2024-02-07 14:25:11,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 62 transitions, 261 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:11,591 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 140 flow [2024-02-07 14:25:11,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2024-02-07 14:25:11,592 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -8 predicate places. [2024-02-07 14:25:11,592 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 140 flow [2024-02-07 14:25:11,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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-02-07 14:25:11,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:11,592 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:11,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 14:25:11,593 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:11,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:11,593 INFO L85 PathProgramCache]: Analyzing trace with hash 142291193, now seen corresponding path program 1 times [2024-02-07 14:25:11,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:11,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282299287] [2024-02-07 14:25:11,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:11,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:11,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:11,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:11,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282299287] [2024-02-07 14:25:11,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282299287] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:11,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:11,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:25:11,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725779001] [2024-02-07 14:25:11,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:11,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:11,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:11,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:11,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:11,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 60 [2024-02-07 14:25:11,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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-02-07 14:25:11,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:11,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 60 [2024-02-07 14:25:11,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:11,792 INFO L124 PetriNetUnfolderBase]: 1829/2837 cut-off events. [2024-02-07 14:25:11,792 INFO L125 PetriNetUnfolderBase]: For 803/803 co-relation queries the response was YES. [2024-02-07 14:25:11,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6986 conditions, 2837 events. 1829/2837 cut-off events. For 803/803 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 15615 event pairs, 451 based on Foata normal form. 82/2853 useless extension candidates. Maximal degree in co-relation 6980. Up to 2258 conditions per place. [2024-02-07 14:25:11,803 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 42 selfloop transitions, 3 changer transitions 2/61 dead transitions. [2024-02-07 14:25:11,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 61 transitions, 272 flow [2024-02-07 14:25:11,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:11,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:11,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2024-02-07 14:25:11,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5611111111111111 [2024-02-07 14:25:11,804 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 140 flow. Second operand 3 states and 101 transitions. [2024-02-07 14:25:11,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 61 transitions, 272 flow [2024-02-07 14:25:11,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 61 transitions, 267 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:11,806 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 125 flow [2024-02-07 14:25:11,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2024-02-07 14:25:11,806 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -11 predicate places. [2024-02-07 14:25:11,806 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 125 flow [2024-02-07 14:25:11,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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-02-07 14:25:11,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:11,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:11,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-07 14:25:11,807 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:11,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:11,807 INFO L85 PathProgramCache]: Analyzing trace with hash -450010317, now seen corresponding path program 1 times [2024-02-07 14:25:11,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:11,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614368542] [2024-02-07 14:25:11,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:11,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:11,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:11,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:11,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614368542] [2024-02-07 14:25:11,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614368542] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:11,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:11,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:25:11,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907451005] [2024-02-07 14:25:11,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:11,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:25:11,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:11,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:25:11,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:25:11,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 60 [2024-02-07 14:25:11,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:11,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:11,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 60 [2024-02-07 14:25:11,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:11,996 INFO L124 PetriNetUnfolderBase]: 1594/2920 cut-off events. [2024-02-07 14:25:11,996 INFO L125 PetriNetUnfolderBase]: For 1083/1083 co-relation queries the response was YES. [2024-02-07 14:25:12,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6647 conditions, 2920 events. 1594/2920 cut-off events. For 1083/1083 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 19460 event pairs, 1338 based on Foata normal form. 0/2702 useless extension candidates. Maximal degree in co-relation 6641. Up to 2337 conditions per place. [2024-02-07 14:25:12,007 INFO L140 encePairwiseOnDemand]: 58/60 looper letters, 27 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2024-02-07 14:25:12,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 41 transitions, 179 flow [2024-02-07 14:25:12,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:12,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:12,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-02-07 14:25:12,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-02-07 14:25:12,009 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 125 flow. Second operand 3 states and 75 transitions. [2024-02-07 14:25:12,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 41 transitions, 179 flow [2024-02-07 14:25:12,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 41 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:12,010 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 122 flow [2024-02-07 14:25:12,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2024-02-07 14:25:12,010 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -12 predicate places. [2024-02-07 14:25:12,010 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 122 flow [2024-02-07 14:25:12,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:12,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:12,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:12,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-07 14:25:12,011 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:12,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:12,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1453196445, now seen corresponding path program 1 times [2024-02-07 14:25:12,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:12,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297346967] [2024-02-07 14:25:12,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:12,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:12,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:12,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:12,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297346967] [2024-02-07 14:25:12,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297346967] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:12,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:12,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:25:12,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228479754] [2024-02-07 14:25:12,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:12,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:25:12,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:12,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:25:12,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:25:12,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 60 [2024-02-07 14:25:12,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:12,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:12,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 60 [2024-02-07 14:25:12,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:12,236 INFO L124 PetriNetUnfolderBase]: 1572/2569 cut-off events. [2024-02-07 14:25:12,237 INFO L125 PetriNetUnfolderBase]: For 712/712 co-relation queries the response was YES. [2024-02-07 14:25:12,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6245 conditions, 2569 events. 1572/2569 cut-off events. For 712/712 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 14640 event pairs, 517 based on Foata normal form. 8/2536 useless extension candidates. Maximal degree in co-relation 6239. Up to 2016 conditions per place. [2024-02-07 14:25:12,247 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 39 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2024-02-07 14:25:12,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 56 transitions, 249 flow [2024-02-07 14:25:12,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:25:12,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:25:12,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-02-07 14:25:12,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2024-02-07 14:25:12,248 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 122 flow. Second operand 3 states and 94 transitions. [2024-02-07 14:25:12,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 56 transitions, 249 flow [2024-02-07 14:25:12,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 56 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:12,249 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 145 flow [2024-02-07 14:25:12,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2024-02-07 14:25:12,250 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -10 predicate places. [2024-02-07 14:25:12,250 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 145 flow [2024-02-07 14:25:12,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:12,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:12,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:12,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-07 14:25:12,251 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:12,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:12,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1065417608, now seen corresponding path program 1 times [2024-02-07 14:25:12,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:12,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431292148] [2024-02-07 14:25:12,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:12,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:12,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:12,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:12,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431292148] [2024-02-07 14:25:12,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431292148] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:12,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:12,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:25:12,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481789907] [2024-02-07 14:25:12,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:12,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:25:12,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:12,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:25:12,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:25:12,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 60 [2024-02-07 14:25:12,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:12,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:12,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 60 [2024-02-07 14:25:12,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:12,518 INFO L124 PetriNetUnfolderBase]: 1479/2757 cut-off events. [2024-02-07 14:25:12,518 INFO L125 PetriNetUnfolderBase]: For 1175/1175 co-relation queries the response was YES. [2024-02-07 14:25:12,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6626 conditions, 2757 events. 1479/2757 cut-off events. For 1175/1175 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 18171 event pairs, 176 based on Foata normal form. 100/2682 useless extension candidates. Maximal degree in co-relation 6619. Up to 1288 conditions per place. [2024-02-07 14:25:12,529 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 54 selfloop transitions, 5 changer transitions 1/73 dead transitions. [2024-02-07 14:25:12,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 73 transitions, 385 flow [2024-02-07 14:25:12,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:25:12,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:25:12,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2024-02-07 14:25:12,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2024-02-07 14:25:12,531 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 145 flow. Second operand 4 states and 118 transitions. [2024-02-07 14:25:12,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 73 transitions, 385 flow [2024-02-07 14:25:12,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 73 transitions, 375 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:25:12,533 INFO L231 Difference]: Finished difference. Result has 60 places, 43 transitions, 163 flow [2024-02-07 14:25:12,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=163, PETRI_PLACES=60, PETRI_TRANSITIONS=43} [2024-02-07 14:25:12,534 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -6 predicate places. [2024-02-07 14:25:12,534 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 43 transitions, 163 flow [2024-02-07 14:25:12,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:12,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:12,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:12,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-07 14:25:12,534 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:12,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:12,535 INFO L85 PathProgramCache]: Analyzing trace with hash -997827867, now seen corresponding path program 1 times [2024-02-07 14:25:12,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:12,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612612182] [2024-02-07 14:25:12,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:12,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:12,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:12,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:12,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:12,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612612182] [2024-02-07 14:25:12,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612612182] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:12,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:12,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:25:12,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063147132] [2024-02-07 14:25:12,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:12,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:25:12,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:12,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:25:12,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 14:25:12,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 60 [2024-02-07 14:25:12,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 43 transitions, 163 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:12,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:12,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 60 [2024-02-07 14:25:12,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:12,924 INFO L124 PetriNetUnfolderBase]: 2083/3821 cut-off events. [2024-02-07 14:25:12,924 INFO L125 PetriNetUnfolderBase]: For 2377/2377 co-relation queries the response was YES. [2024-02-07 14:25:12,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9612 conditions, 3821 events. 2083/3821 cut-off events. For 2377/2377 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 26055 event pairs, 464 based on Foata normal form. 74/3709 useless extension candidates. Maximal degree in co-relation 9603. Up to 1543 conditions per place. [2024-02-07 14:25:12,937 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 66 selfloop transitions, 7 changer transitions 0/86 dead transitions. [2024-02-07 14:25:12,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 86 transitions, 494 flow [2024-02-07 14:25:12,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:25:12,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:25:12,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2024-02-07 14:25:12,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5375 [2024-02-07 14:25:12,938 INFO L175 Difference]: Start difference. First operand has 60 places, 43 transitions, 163 flow. Second operand 4 states and 129 transitions. [2024-02-07 14:25:12,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 86 transitions, 494 flow [2024-02-07 14:25:12,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 86 transitions, 449 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-02-07 14:25:12,941 INFO L231 Difference]: Finished difference. Result has 61 places, 48 transitions, 207 flow [2024-02-07 14:25:12,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=207, PETRI_PLACES=61, PETRI_TRANSITIONS=48} [2024-02-07 14:25:12,941 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -5 predicate places. [2024-02-07 14:25:12,942 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 48 transitions, 207 flow [2024-02-07 14:25:12,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:12,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:12,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:12,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-07 14:25:12,942 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:12,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:12,942 INFO L85 PathProgramCache]: Analyzing trace with hash -493254819, now seen corresponding path program 1 times [2024-02-07 14:25:12,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:12,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692387671] [2024-02-07 14:25:12,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:12,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:12,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:12,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:12,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692387671] [2024-02-07 14:25:12,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692387671] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:12,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:12,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:25:12,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106985443] [2024-02-07 14:25:12,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:12,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:25:12,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:12,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:25:12,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:25:13,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2024-02-07 14:25:13,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 207 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:13,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:13,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2024-02-07 14:25:13,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:13,235 INFO L124 PetriNetUnfolderBase]: 2711/4595 cut-off events. [2024-02-07 14:25:13,236 INFO L125 PetriNetUnfolderBase]: For 3938/3938 co-relation queries the response was YES. [2024-02-07 14:25:13,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12144 conditions, 4595 events. 2711/4595 cut-off events. For 3938/3938 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 30108 event pairs, 1373 based on Foata normal form. 0/4577 useless extension candidates. Maximal degree in co-relation 12135. Up to 2666 conditions per place. [2024-02-07 14:25:13,253 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 53 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2024-02-07 14:25:13,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 65 transitions, 414 flow [2024-02-07 14:25:13,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:25:13,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:25:13,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2024-02-07 14:25:13,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-02-07 14:25:13,254 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 207 flow. Second operand 4 states and 93 transitions. [2024-02-07 14:25:13,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 65 transitions, 414 flow [2024-02-07 14:25:13,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 65 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:25:13,257 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 201 flow [2024-02-07 14:25:13,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=201, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2024-02-07 14:25:13,257 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -5 predicate places. [2024-02-07 14:25:13,257 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 201 flow [2024-02-07 14:25:13,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:13,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:13,257 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:13,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-02-07 14:25:13,258 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:13,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:13,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1405547769, now seen corresponding path program 1 times [2024-02-07 14:25:13,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:13,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535086666] [2024-02-07 14:25:13,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:13,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:13,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:13,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:13,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535086666] [2024-02-07 14:25:13,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535086666] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:13,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:13,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:25:13,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359230403] [2024-02-07 14:25:13,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:13,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:25:13,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:13,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:25:13,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:25:13,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 60 [2024-02-07 14:25:13,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 47 transitions, 201 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:13,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:13,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 60 [2024-02-07 14:25:13,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:13,622 INFO L124 PetriNetUnfolderBase]: 2415/4651 cut-off events. [2024-02-07 14:25:13,622 INFO L125 PetriNetUnfolderBase]: For 3157/3157 co-relation queries the response was YES. [2024-02-07 14:25:13,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11502 conditions, 4651 events. 2415/4651 cut-off events. For 3157/3157 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 34377 event pairs, 788 based on Foata normal form. 16/4496 useless extension candidates. Maximal degree in co-relation 11493. Up to 1869 conditions per place. [2024-02-07 14:25:13,639 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 86 selfloop transitions, 17 changer transitions 0/115 dead transitions. [2024-02-07 14:25:13,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 115 transitions, 652 flow [2024-02-07 14:25:13,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 14:25:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 14:25:13,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 191 transitions. [2024-02-07 14:25:13,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5305555555555556 [2024-02-07 14:25:13,640 INFO L175 Difference]: Start difference. First operand has 61 places, 47 transitions, 201 flow. Second operand 6 states and 191 transitions. [2024-02-07 14:25:13,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 115 transitions, 652 flow [2024-02-07 14:25:13,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 115 transitions, 645 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:25:13,646 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 328 flow [2024-02-07 14:25:13,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=328, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2024-02-07 14:25:13,647 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 3 predicate places. [2024-02-07 14:25:13,647 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 328 flow [2024-02-07 14:25:13,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:13,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:13,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:13,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-02-07 14:25:13,647 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:13,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:13,648 INFO L85 PathProgramCache]: Analyzing trace with hash -318556180, now seen corresponding path program 1 times [2024-02-07 14:25:13,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:13,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268476469] [2024-02-07 14:25:13,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:13,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:13,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:13,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:13,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268476469] [2024-02-07 14:25:13,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268476469] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:13,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:13,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:25:13,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393369317] [2024-02-07 14:25:13,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:13,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:25:13,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:13,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:25:13,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 14:25:13,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 60 [2024-02-07 14:25:13,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 328 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:13,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:13,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 60 [2024-02-07 14:25:13,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:13,963 INFO L124 PetriNetUnfolderBase]: 1626/3038 cut-off events. [2024-02-07 14:25:13,964 INFO L125 PetriNetUnfolderBase]: For 4313/4313 co-relation queries the response was YES. [2024-02-07 14:25:13,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8491 conditions, 3038 events. 1626/3038 cut-off events. For 4313/4313 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 19342 event pairs, 144 based on Foata normal form. 144/3083 useless extension candidates. Maximal degree in co-relation 8478. Up to 1065 conditions per place. [2024-02-07 14:25:13,975 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 82 selfloop transitions, 8 changer transitions 1/103 dead transitions. [2024-02-07 14:25:13,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 103 transitions, 792 flow [2024-02-07 14:25:13,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:25:13,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:25:13,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2024-02-07 14:25:13,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49666666666666665 [2024-02-07 14:25:13,976 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 328 flow. Second operand 5 states and 149 transitions. [2024-02-07 14:25:13,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 103 transitions, 792 flow [2024-02-07 14:25:13,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 103 transitions, 760 flow, removed 16 selfloop flow, removed 0 redundant places. [2024-02-07 14:25:13,981 INFO L231 Difference]: Finished difference. Result has 75 places, 55 transitions, 330 flow [2024-02-07 14:25:13,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=330, PETRI_PLACES=75, PETRI_TRANSITIONS=55} [2024-02-07 14:25:13,981 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 9 predicate places. [2024-02-07 14:25:13,981 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 55 transitions, 330 flow [2024-02-07 14:25:13,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:13,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:13,981 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-02-07 14:25:13,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-02-07 14:25:13,982 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:13,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:13,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1136790257, now seen corresponding path program 1 times [2024-02-07 14:25:13,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:13,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499606708] [2024-02-07 14:25:13,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:13,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:14,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:14,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:14,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499606708] [2024-02-07 14:25:14,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499606708] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:14,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:14,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 14:25:14,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757987587] [2024-02-07 14:25:14,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:14,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:25:14,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:14,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:25:14,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:25:14,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 60 [2024-02-07 14:25:14,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 55 transitions, 330 flow. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:14,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:14,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 60 [2024-02-07 14:25:14,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:14,194 INFO L124 PetriNetUnfolderBase]: 940/1616 cut-off events. [2024-02-07 14:25:14,194 INFO L125 PetriNetUnfolderBase]: For 3200/3200 co-relation queries the response was YES. [2024-02-07 14:25:14,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5405 conditions, 1616 events. 940/1616 cut-off events. For 3200/3200 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 8042 event pairs, 92 based on Foata normal form. 76/1665 useless extension candidates. Maximal degree in co-relation 5389. Up to 576 conditions per place. [2024-02-07 14:25:14,200 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 71 selfloop transitions, 11 changer transitions 1/95 dead transitions. [2024-02-07 14:25:14,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 95 transitions, 714 flow [2024-02-07 14:25:14,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 14:25:14,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 14:25:14,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2024-02-07 14:25:14,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-02-07 14:25:14,201 INFO L175 Difference]: Start difference. First operand has 75 places, 55 transitions, 330 flow. Second operand 6 states and 162 transitions. [2024-02-07 14:25:14,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 95 transitions, 714 flow [2024-02-07 14:25:14,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 95 transitions, 628 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-02-07 14:25:14,206 INFO L231 Difference]: Finished difference. Result has 74 places, 54 transitions, 303 flow [2024-02-07 14:25:14,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=303, PETRI_PLACES=74, PETRI_TRANSITIONS=54} [2024-02-07 14:25:14,207 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 8 predicate places. [2024-02-07 14:25:14,207 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 54 transitions, 303 flow [2024-02-07 14:25:14,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:14,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:14,207 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-02-07 14:25:14,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-02-07 14:25:14,207 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:14,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:14,208 INFO L85 PathProgramCache]: Analyzing trace with hash 827760794, now seen corresponding path program 1 times [2024-02-07 14:25:14,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:14,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017551287] [2024-02-07 14:25:14,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:14,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:14,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:25:14,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:25:14,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:25:14,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017551287] [2024-02-07 14:25:14,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017551287] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:25:14,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:25:14,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:25:14,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254060198] [2024-02-07 14:25:14,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:25:14,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:25:14,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:25:14,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:25:14,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:25:14,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 60 [2024-02-07 14:25:14,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 54 transitions, 303 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:14,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:25:14,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 60 [2024-02-07 14:25:14,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:25:14,461 INFO L124 PetriNetUnfolderBase]: 958/1756 cut-off events. [2024-02-07 14:25:14,461 INFO L125 PetriNetUnfolderBase]: For 3037/3037 co-relation queries the response was YES. [2024-02-07 14:25:14,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5484 conditions, 1756 events. 958/1756 cut-off events. For 3037/3037 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9570 event pairs, 216 based on Foata normal form. 8/1742 useless extension candidates. Maximal degree in co-relation 5470. Up to 983 conditions per place. [2024-02-07 14:25:14,468 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 65 selfloop transitions, 9 changer transitions 0/86 dead transitions. [2024-02-07 14:25:14,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 86 transitions, 633 flow [2024-02-07 14:25:14,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:25:14,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:25:14,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2024-02-07 14:25:14,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5041666666666667 [2024-02-07 14:25:14,470 INFO L175 Difference]: Start difference. First operand has 74 places, 54 transitions, 303 flow. Second operand 4 states and 121 transitions. [2024-02-07 14:25:14,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 86 transitions, 633 flow [2024-02-07 14:25:14,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 86 transitions, 512 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-02-07 14:25:14,475 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 290 flow [2024-02-07 14:25:14,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=290, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2024-02-07 14:25:14,477 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 5 predicate places. [2024-02-07 14:25:14,477 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 290 flow [2024-02-07 14:25:14,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:25:14,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:25:14,477 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-02-07 14:25:14,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-02-07 14:25:14,477 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 14:25:14,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:25:14,478 INFO L85 PathProgramCache]: Analyzing trace with hash -2077930254, now seen corresponding path program 2 times [2024-02-07 14:25:14,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:25:14,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357223518] [2024-02-07 14:25:14,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:25:14,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:25:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 14:25:14,495 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 14:25:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 14:25:14,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 14:25:14,528 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 14:25:14,529 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 39 remaining) [2024-02-07 14:25:14,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 39 remaining) [2024-02-07 14:25:14,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 39 remaining) [2024-02-07 14:25:14,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 39 remaining) [2024-02-07 14:25:14,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 39 remaining) [2024-02-07 14:25:14,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 39 remaining) [2024-02-07 14:25:14,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 39 remaining) [2024-02-07 14:25:14,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 39 remaining) [2024-02-07 14:25:14,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 39 remaining) [2024-02-07 14:25:14,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 39 remaining) [2024-02-07 14:25:14,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 39 remaining) [2024-02-07 14:25:14,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 39 remaining) [2024-02-07 14:25:14,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 39 remaining) [2024-02-07 14:25:14,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 39 remaining) [2024-02-07 14:25:14,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 39 remaining) [2024-02-07 14:25:14,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 39 remaining) [2024-02-07 14:25:14,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 39 remaining) [2024-02-07 14:25:14,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 39 remaining) [2024-02-07 14:25:14,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 39 remaining) [2024-02-07 14:25:14,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 39 remaining) [2024-02-07 14:25:14,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 39 remaining) [2024-02-07 14:25:14,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (17 of 39 remaining) [2024-02-07 14:25:14,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 39 remaining) [2024-02-07 14:25:14,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 39 remaining) [2024-02-07 14:25:14,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 39 remaining) [2024-02-07 14:25:14,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 39 remaining) [2024-02-07 14:25:14,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 39 remaining) [2024-02-07 14:25:14,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 39 remaining) [2024-02-07 14:25:14,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 39 remaining) [2024-02-07 14:25:14,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 39 remaining) [2024-02-07 14:25:14,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 39 remaining) [2024-02-07 14:25:14,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 39 remaining) [2024-02-07 14:25:14,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 39 remaining) [2024-02-07 14:25:14,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 39 remaining) [2024-02-07 14:25:14,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 39 remaining) [2024-02-07 14:25:14,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 39 remaining) [2024-02-07 14:25:14,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 39 remaining) [2024-02-07 14:25:14,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 39 remaining) [2024-02-07 14:25:14,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 39 remaining) [2024-02-07 14:25:14,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-02-07 14:25:14,537 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:25:14,542 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 14:25:14,542 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 14:25:14,587 INFO L503 ceAbstractionStarter]: Automizer considered 21 witness invariants [2024-02-07 14:25:14,587 INFO L504 ceAbstractionStarter]: WitnessConsidered=21 [2024-02-07 14:25:14,587 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 02:25:14 BasicIcfg [2024-02-07 14:25:14,588 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 14:25:14,589 INFO L158 Benchmark]: Toolchain (without parser) took 8818.18ms. Allocated memory was 159.4MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 122.2MB in the beginning and 604.0MB in the end (delta: -481.8MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-02-07 14:25:14,589 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory was 87.7MB in the beginning and 87.6MB in the end (delta: 69.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:25:14,589 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:25:14,589 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.48ms. Allocated memory is still 159.4MB. Free memory was 122.2MB in the beginning and 91.9MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-02-07 14:25:14,589 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.42ms. Allocated memory is still 159.4MB. Free memory was 91.9MB in the beginning and 89.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 14:25:14,590 INFO L158 Benchmark]: Boogie Preprocessor took 28.88ms. Allocated memory is still 159.4MB. Free memory was 89.9MB in the beginning and 87.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 14:25:14,590 INFO L158 Benchmark]: RCFGBuilder took 441.14ms. Allocated memory is still 159.4MB. Free memory was 87.9MB in the beginning and 119.9MB in the end (delta: -32.1MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. [2024-02-07 14:25:14,590 INFO L158 Benchmark]: TraceAbstraction took 7808.24ms. Allocated memory was 159.4MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 118.8MB in the beginning and 604.0MB in the end (delta: -485.1MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-02-07 14:25:14,591 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory was 87.7MB in the beginning and 87.6MB in the end (delta: 69.8kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 508.48ms. Allocated memory is still 159.4MB. Free memory was 122.2MB in the beginning and 91.9MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.42ms. Allocated memory is still 159.4MB. Free memory was 91.9MB in the beginning and 89.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.88ms. Allocated memory is still 159.4MB. Free memory was 89.9MB in the beginning and 87.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 441.14ms. Allocated memory is still 159.4MB. Free memory was 87.9MB in the beginning and 119.9MB in the end (delta: -32.1MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7808.24ms. Allocated memory was 159.4MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 118.8MB in the beginning and 604.0MB in the end (delta: -485.1MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 790]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L777] 0 pthread_t t2455; [L778] FCALL, FORK 0 pthread_create(&t2455, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2455={5:0}, x=0, y=0] [L725] 1 y = 1 [L726] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=1] [L779] 0 pthread_t t2456; [L780] FCALL, FORK 0 pthread_create(&t2456, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2455={5:0}, t2456={6:0}, x=0, y=1] [L781] 0 pthread_t t2457; [L782] FCALL, FORK 0 pthread_create(&t2457, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2455={5:0}, t2456={6:0}, t2457={3:0}, x=0, y=1] [L754] 3 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]]]] [L754] 3 __unbuffered_p2_EAX = x [L755] 3 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=1] [L757] 3 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]]]]] [L757] 3 __unbuffered_p2_EBX = y [L758] 3 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EBX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=1] [L742] 2 x = 1 [L743] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L747] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L747] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L748] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L730] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]]]] [L730] 1 __unbuffered_p0_EAX = x [L731] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L735] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L735] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L736] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L762] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L762] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L784] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L784] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L785] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2455={5:0}, t2456={6:0}, t2457={3:0}, x=1, y=1] [L786] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] [L786] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L786] RET 0 assume_abort_if_not(main$tmp_guard0) [L790] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EBX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EBX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2455={5:0}, t2456={6:0}, t2457={3:0}, x=1, y=1] - UnprovableResult [Line: 726]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 730]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 731]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 735]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 736]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 743]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 748]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 754]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 755]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 757]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 758]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 762]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 763]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 784]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 785]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 786]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 791]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 792]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 782]: 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: 780]: 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: 778]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 98 locations, 39 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: 7.7s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 553 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 545 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1164 IncrementalHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 2 mSDtfsCounter, 1164 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=330occurred in iteration=16, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 1050 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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-02-07 14:25:14,621 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