./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe009_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/safe009_pso.oepc_pso.opt_tso.oepc_tso.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7c74aec 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/safe009_pso.oepc_pso.opt_tso.oepc_tso.opt.i ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe009_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-wip.fs.fix-undeclared-acsl-variable-e7c74ae-m [2024-02-07 19:03:47,508 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 19:03:47,581 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 19:03:47,584 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 19:03:47,585 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 19:03:47,604 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 19:03:47,605 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 19:03:47,605 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 19:03:47,606 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 19:03:47,610 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 19:03:47,610 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 19:03:47,610 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 19:03:47,611 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 19:03:47,612 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 19:03:47,612 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 19:03:47,613 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 19:03:47,613 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 19:03:47,613 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 19:03:47,613 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 19:03:47,614 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 19:03:47,614 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 19:03:47,614 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 19:03:47,614 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 19:03:47,615 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 19:03:47,615 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 19:03:47,615 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 19:03:47,615 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 19:03:47,615 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 19:03:47,616 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 19:03:47,616 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 19:03:47,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 19:03:47,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 19:03:47,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:03:47,618 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 19:03:47,618 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 19:03:47,618 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 19:03:47,618 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 19:03:47,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 19:03:47,619 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 19:03:47,619 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 19:03:47,619 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 19:03:47,619 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 19:03:47,619 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 19:03:47,620 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 19:03:47,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 19:03:47,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 19:03:47,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 19:03:47,905 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 19:03:47,906 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 19:03:47,907 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe009_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-02-07 19:03:48,938 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 19:03:49,189 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 19:03:49,189 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe009_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-02-07 19:03:49,206 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b635df883/ef3332dd294c4cfc806e26d04ba17c8d/FLAG854d7ca8d [2024-02-07 19:03:49,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b635df883/ef3332dd294c4cfc806e26d04ba17c8d [2024-02-07 19:03:49,220 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 19:03:49,221 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 19:03:49,222 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/safe009_pso.oepc_pso.opt_tso.oepc_tso.opt.yml/witness.yml [2024-02-07 19:03:49,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 19:03:49,321 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 19:03:49,324 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 19:03:49,324 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 19:03:49,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 19:03:49,328 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:03:49" (1/2) ... [2024-02-07 19:03:49,329 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79abae28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:49, skipping insertion in model container [2024-02-07 19:03:49,329 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:03:49" (1/2) ... [2024-02-07 19:03:49,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2dbfe9f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:49, skipping insertion in model container [2024-02-07 19:03:49,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:03:49" (2/2) ... [2024-02-07 19:03:49,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79abae28 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:03:49, skipping insertion in model container [2024-02-07 19:03:49,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:03:49" (2/2) ... [2024-02-07 19:03:49,332 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 19:03:49,396 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 19:03:49,397 INFO L76 edCorrectnessWitness]: Location invariant before [L731-L731] 0 <= __unbuffered_cnt [2024-02-07 19:03:49,397 INFO L76 edCorrectnessWitness]: Location invariant before [L742-L742] y == 1 [2024-02-07 19:03:49,398 INFO L76 edCorrectnessWitness]: Location invariant before [L758-L758] 0 <= __unbuffered_cnt [2024-02-07 19:03:49,398 INFO L76 edCorrectnessWitness]: Location invariant before [L746-L746] 0 <= __unbuffered_cnt [2024-02-07 19:03:49,398 INFO L76 edCorrectnessWitness]: Location invariant before [L18-L18] ((0 <= expression) && (expression <= 1)) && (expression == 0 || expression == 1) [2024-02-07 19:03:49,399 INFO L76 edCorrectnessWitness]: Location invariant before [L780-L780] 0 <= __unbuffered_cnt [2024-02-07 19:03:49,399 INFO L76 edCorrectnessWitness]: Location invariant before [L781-L781] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 19:03:49,399 INFO L76 edCorrectnessWitness]: Location invariant before [L786-L786] ((((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && (y == 2)) && (__unbuffered_p0_EAX == 2 || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) [2024-02-07 19:03:49,399 INFO L76 edCorrectnessWitness]: Location invariant before [L787-L787] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 19:03:49,399 INFO L76 edCorrectnessWitness]: Location invariant before [L754-L754] y == 2 [2024-02-07 19:03:49,399 INFO L76 edCorrectnessWitness]: Location invariant before [L738-L738] ((0 <= x) && (x <= 1)) && (x == 0 || x == 1) [2024-02-07 19:03:49,399 INFO L76 edCorrectnessWitness]: Location invariant before [L739-L739] ((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) [2024-02-07 19:03:49,400 INFO L76 edCorrectnessWitness]: Location invariant before [L747-L747] 1 <= __unbuffered_cnt [2024-02-07 19:03:49,400 INFO L76 edCorrectnessWitness]: Location invariant before [L732-L732] 1 <= __unbuffered_cnt [2024-02-07 19:03:49,400 INFO L76 edCorrectnessWitness]: Location invariant before [L723-L723] (((0 <= y) && (y <= 2)) && (y <= 127)) && ((y == 0 || y == 1) || y == 2) [2024-02-07 19:03:49,400 INFO L76 edCorrectnessWitness]: Location invariant before [L724-L724] (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2) [2024-02-07 19:03:49,400 INFO L76 edCorrectnessWitness]: Location invariant before [L727-L727] x == 1 [2024-02-07 19:03:49,400 INFO L76 edCorrectnessWitness]: Location invariant before [L759-L759] 1 <= __unbuffered_cnt [2024-02-07 19:03:49,400 INFO L76 edCorrectnessWitness]: Location invariant before [L782-L782] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 19:03:49,401 INFO L76 edCorrectnessWitness]: Location invariant before [L788-L788] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 19:03:49,442 INFO L181 MainTranslator]: Built tables and reachable declarations [2024-02-07 19:03:49,593 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/safe009_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2024-02-07 19:03:49,716 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:03:49,722 INFO L206 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-07 19:03:49,753 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/safe009_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 [2024-02-07 19:03:49,836 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:03:49,871 INFO L211 MainTranslator]: Completed translation [2024-02-07 19:03:49,895 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:03:49 WrapperNode [2024-02-07 19:03:49,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 19:03:49,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 19:03:49,906 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 19:03:49,906 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 19:03:49,912 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 07:03:49" (1/1) ... [2024-02-07 19:03:49,924 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 07:03:49" (1/1) ... [2024-02-07 19:03:49,940 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2024-02-07 19:03:49,941 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 19:03:49,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 19:03:49,942 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 19:03:49,942 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 19:03:49,950 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 07:03:49" (1/1) ... [2024-02-07 19:03:49,950 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 07:03:49" (1/1) ... [2024-02-07 19:03:49,952 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 07:03:49" (1/1) ... [2024-02-07 19:03:49,978 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 19:03:49,978 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 07:03:49" (1/1) ... [2024-02-07 19:03:49,978 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 07:03:49" (1/1) ... [2024-02-07 19:03:49,982 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 07:03:49" (1/1) ... [2024-02-07 19:03:49,984 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 07:03:49" (1/1) ... [2024-02-07 19:03:50,001 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 07:03:49" (1/1) ... [2024-02-07 19:03:50,002 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 07:03:49" (1/1) ... [2024-02-07 19:03:50,004 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 19:03:50,005 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 19:03:50,005 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 19:03:50,005 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 19:03:50,005 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 07:03:49" (1/1) ... [2024-02-07 19:03:50,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:03:50,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:03:50,061 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 19:03:50,098 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 19:03:50,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 19:03:50,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 19:03:50,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 19:03:50,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 19:03:50,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-07 19:03:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 19:03:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 19:03:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 19:03:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-02-07 19:03:50,124 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-02-07 19:03:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-02-07 19:03:50,125 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-02-07 19:03:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-02-07 19:03:50,125 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-02-07 19:03:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 19:03:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 19:03:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 19:03:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 19:03:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-07 19:03:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 19:03:50,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 19:03:50,127 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 19:03:50,270 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 19:03:50,272 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 19:03:50,455 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 19:03:50,456 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 19:03:50,557 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 19:03:50,559 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-07 19:03:50,561 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:03:50 BoogieIcfgContainer [2024-02-07 19:03:50,561 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 19:03:50,563 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 19:03:50,563 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 19:03:50,566 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 19:03:50,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 07:03:49" (1/4) ... [2024-02-07 19:03:50,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e803a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:03:50, skipping insertion in model container [2024-02-07 19:03:50,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:03:49" (2/4) ... [2024-02-07 19:03:50,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e803a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 07:03:50, skipping insertion in model container [2024-02-07 19:03:50,567 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 07:03:49" (3/4) ... [2024-02-07 19:03:50,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e803a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 07:03:50, skipping insertion in model container [2024-02-07 19:03:50,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:03:50" (4/4) ... [2024-02-07 19:03:50,569 INFO L112 eAbstractionObserver]: Analyzing ICFG safe009_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-02-07 19:03:50,584 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 19:03:50,584 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2024-02-07 19:03:50,585 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 19:03:50,636 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-07 19:03:50,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 58 transitions, 128 flow [2024-02-07 19:03:50,697 INFO L124 PetriNetUnfolderBase]: 1/55 cut-off events. [2024-02-07 19:03:50,697 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:03:50,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 55 events. 1/55 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 151 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2024-02-07 19:03:50,701 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 58 transitions, 128 flow [2024-02-07 19:03:50,705 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 55 transitions, 119 flow [2024-02-07 19:03:50,722 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 19:03:50,729 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;@2f3250ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 19:03:50,730 INFO L358 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2024-02-07 19:03:50,736 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 19:03:50,736 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-02-07 19:03:50,736 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:03:50,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:50,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-07 19:03:50,738 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:03:50,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:50,745 INFO L85 PathProgramCache]: Analyzing trace with hash 9294719, now seen corresponding path program 1 times [2024-02-07 19:03:50,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:50,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819676768] [2024-02-07 19:03:50,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:50,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:51,004 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 19:03:51,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:51,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819676768] [2024-02-07 19:03:51,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819676768] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:51,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:51,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:03:51,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278030099] [2024-02-07 19:03:51,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:51,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:51,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:51,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:51,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:51,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-02-07 19:03:51,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:51,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:51,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-02-07 19:03:51,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:51,932 INFO L124 PetriNetUnfolderBase]: 5235/9149 cut-off events. [2024-02-07 19:03:51,933 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-02-07 19:03:51,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16724 conditions, 9149 events. 5235/9149 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 70231 event pairs, 1823 based on Foata normal form. 224/6767 useless extension candidates. Maximal degree in co-relation 16713. Up to 7099 conditions per place. [2024-02-07 19:03:52,002 INFO L140 encePairwiseOnDemand]: 42/58 looper letters, 43 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2024-02-07 19:03:52,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 60 transitions, 224 flow [2024-02-07 19:03:52,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:52,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:52,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2024-02-07 19:03:52,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6781609195402298 [2024-02-07 19:03:52,013 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 119 flow. Second operand 3 states and 118 transitions. [2024-02-07 19:03:52,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 60 transitions, 224 flow [2024-02-07 19:03:52,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 60 transitions, 220 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-07 19:03:52,020 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 115 flow [2024-02-07 19:03:52,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2024-02-07 19:03:52,024 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -10 predicate places. [2024-02-07 19:03:52,025 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 115 flow [2024-02-07 19:03:52,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:52,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:52,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-07 19:03:52,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 19:03:52,026 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:03:52,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:52,026 INFO L85 PathProgramCache]: Analyzing trace with hash 341349827, now seen corresponding path program 1 times [2024-02-07 19:03:52,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:52,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178055776] [2024-02-07 19:03:52,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:52,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:52,079 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 19:03:52,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:52,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178055776] [2024-02-07 19:03:52,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178055776] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:52,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:52,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:03:52,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201291006] [2024-02-07 19:03:52,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:52,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:52,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:52,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:52,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:52,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-02-07 19:03:52,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:52,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:52,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-02-07 19:03:52,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:52,608 INFO L124 PetriNetUnfolderBase]: 4908/7880 cut-off events. [2024-02-07 19:03:52,609 INFO L125 PetriNetUnfolderBase]: For 1042/1047 co-relation queries the response was YES. [2024-02-07 19:03:52,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16264 conditions, 7880 events. 4908/7880 cut-off events. For 1042/1047 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 56584 event pairs, 1764 based on Foata normal form. 1/6232 useless extension candidates. Maximal degree in co-relation 16253. Up to 4457 conditions per place. [2024-02-07 19:03:52,653 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 53 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2024-02-07 19:03:52,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 69 transitions, 287 flow [2024-02-07 19:03:52,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:52,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:52,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-02-07 19:03:52,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5919540229885057 [2024-02-07 19:03:52,655 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 115 flow. Second operand 3 states and 103 transitions. [2024-02-07 19:03:52,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 69 transitions, 287 flow [2024-02-07 19:03:52,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 69 transitions, 282 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:03:52,657 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 120 flow [2024-02-07 19:03:52,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=53, 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=120, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2024-02-07 19:03:52,658 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -8 predicate places. [2024-02-07 19:03:52,658 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 120 flow [2024-02-07 19:03:52,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:52,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:52,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:52,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 19:03:52,659 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:03:52,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:52,660 INFO L85 PathProgramCache]: Analyzing trace with hash 2021427279, now seen corresponding path program 1 times [2024-02-07 19:03:52,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:52,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368484721] [2024-02-07 19:03:52,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:52,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:52,699 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 19:03:52,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:52,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368484721] [2024-02-07 19:03:52,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368484721] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:52,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:52,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:03:52,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670517639] [2024-02-07 19:03:52,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:52,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:52,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:52,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:52,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:52,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-02-07 19:03:52,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:52,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:52,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-02-07 19:03:52,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:53,190 INFO L124 PetriNetUnfolderBase]: 3785/5685 cut-off events. [2024-02-07 19:03:53,190 INFO L125 PetriNetUnfolderBase]: For 1190/1197 co-relation queries the response was YES. [2024-02-07 19:03:53,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12711 conditions, 5685 events. 3785/5685 cut-off events. For 1190/1197 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 33361 event pairs, 1253 based on Foata normal form. 0/4882 useless extension candidates. Maximal degree in co-relation 12698. Up to 4997 conditions per place. [2024-02-07 19:03:53,229 INFO L140 encePairwiseOnDemand]: 50/58 looper letters, 51 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2024-02-07 19:03:53,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 69 transitions, 297 flow [2024-02-07 19:03:53,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:53,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:53,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-02-07 19:03:53,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6091954022988506 [2024-02-07 19:03:53,234 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 120 flow. Second operand 3 states and 106 transitions. [2024-02-07 19:03:53,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 69 transitions, 297 flow [2024-02-07 19:03:53,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 69 transitions, 291 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:03:53,237 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 148 flow [2024-02-07 19:03:53,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=54, 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=148, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2024-02-07 19:03:53,238 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -7 predicate places. [2024-02-07 19:03:53,238 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 148 flow [2024-02-07 19:03:53,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:53,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:53,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:53,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 19:03:53,240 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:03:53,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:53,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1232181015, now seen corresponding path program 1 times [2024-02-07 19:03:53,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:53,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309628129] [2024-02-07 19:03:53,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:53,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:53,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 19:03:53,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:53,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309628129] [2024-02-07 19:03:53,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309628129] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:53,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:53,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:03:53,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464837902] [2024-02-07 19:03:53,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:53,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:53,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:53,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:53,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:53,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-02-07 19:03:53,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 148 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 19:03:53,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:53,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-02-07 19:03:53,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:53,702 INFO L124 PetriNetUnfolderBase]: 3470/5648 cut-off events. [2024-02-07 19:03:53,702 INFO L125 PetriNetUnfolderBase]: For 1482/1488 co-relation queries the response was YES. [2024-02-07 19:03:53,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13512 conditions, 5648 events. 3470/5648 cut-off events. For 1482/1488 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 37505 event pairs, 1634 based on Foata normal form. 141/5097 useless extension candidates. Maximal degree in co-relation 13498. Up to 3134 conditions per place. [2024-02-07 19:03:53,734 INFO L140 encePairwiseOnDemand]: 56/58 looper letters, 58 selfloop transitions, 1 changer transitions 0/73 dead transitions. [2024-02-07 19:03:53,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 73 transitions, 342 flow [2024-02-07 19:03:53,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:53,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:53,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-02-07 19:03:53,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5862068965517241 [2024-02-07 19:03:53,736 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 148 flow. Second operand 3 states and 102 transitions. [2024-02-07 19:03:53,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 73 transitions, 342 flow [2024-02-07 19:03:53,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 73 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:03:53,738 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 140 flow [2024-02-07 19:03:53,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=54, 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=140, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2024-02-07 19:03:53,739 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -8 predicate places. [2024-02-07 19:03:53,739 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 140 flow [2024-02-07 19:03:53,739 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 19:03:53,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:53,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:53,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 19:03:53,740 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:03:53,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:53,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1329489898, now seen corresponding path program 1 times [2024-02-07 19:03:53,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:53,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549967520] [2024-02-07 19:03:53,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:53,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:53,771 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 19:03:53,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:53,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549967520] [2024-02-07 19:03:53,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549967520] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:53,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:53,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:03:53,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728669911] [2024-02-07 19:03:53,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:53,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:53,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:53,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:53,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:53,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-02-07 19:03:53,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 140 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 19:03:53,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:53,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-02-07 19:03:53,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:54,221 INFO L124 PetriNetUnfolderBase]: 4877/8412 cut-off events. [2024-02-07 19:03:54,221 INFO L125 PetriNetUnfolderBase]: For 2188/2201 co-relation queries the response was YES. [2024-02-07 19:03:54,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19179 conditions, 8412 events. 4877/8412 cut-off events. For 2188/2201 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 63798 event pairs, 2454 based on Foata normal form. 267/7399 useless extension candidates. Maximal degree in co-relation 19166. Up to 4157 conditions per place. [2024-02-07 19:03:54,268 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 54 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2024-02-07 19:03:54,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 71 transitions, 324 flow [2024-02-07 19:03:54,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:54,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:54,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-02-07 19:03:54,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5919540229885057 [2024-02-07 19:03:54,269 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 140 flow. Second operand 3 states and 103 transitions. [2024-02-07 19:03:54,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 71 transitions, 324 flow [2024-02-07 19:03:54,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 71 transitions, 322 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:03:54,273 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 152 flow [2024-02-07 19:03:54,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2024-02-07 19:03:54,275 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -6 predicate places. [2024-02-07 19:03:54,275 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 152 flow [2024-02-07 19:03:54,276 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 19:03:54,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:54,276 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:54,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 19:03:54,276 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:03:54,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:54,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1381668894, now seen corresponding path program 1 times [2024-02-07 19:03:54,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:54,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824979802] [2024-02-07 19:03:54,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:54,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:54,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 19:03:54,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:54,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824979802] [2024-02-07 19:03:54,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824979802] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:54,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:54,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:03:54,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143469139] [2024-02-07 19:03:54,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:54,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:54,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:54,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:54,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:54,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 58 [2024-02-07 19:03:54,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:54,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:54,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 58 [2024-02-07 19:03:54,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:54,803 INFO L124 PetriNetUnfolderBase]: 4877/8742 cut-off events. [2024-02-07 19:03:54,804 INFO L125 PetriNetUnfolderBase]: For 3511/3519 co-relation queries the response was YES. [2024-02-07 19:03:54,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20271 conditions, 8742 events. 4877/8742 cut-off events. For 3511/3519 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 69208 event pairs, 4429 based on Foata normal form. 0/7277 useless extension candidates. Maximal degree in co-relation 20257. Up to 7219 conditions per place. [2024-02-07 19:03:54,852 INFO L140 encePairwiseOnDemand]: 56/58 looper letters, 33 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2024-02-07 19:03:54,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 47 transitions, 218 flow [2024-02-07 19:03:54,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:54,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:54,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-02-07 19:03:54,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4482758620689655 [2024-02-07 19:03:54,854 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 152 flow. Second operand 3 states and 78 transitions. [2024-02-07 19:03:54,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 47 transitions, 218 flow [2024-02-07 19:03:54,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 47 transitions, 213 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-02-07 19:03:54,864 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 147 flow [2024-02-07 19:03:54,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2024-02-07 19:03:54,866 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -6 predicate places. [2024-02-07 19:03:54,867 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 147 flow [2024-02-07 19:03:54,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:54,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:54,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:54,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 19:03:54,867 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:03:54,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:54,868 INFO L85 PathProgramCache]: Analyzing trace with hash 119526450, now seen corresponding path program 1 times [2024-02-07 19:03:54,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:54,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483885078] [2024-02-07 19:03:54,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:54,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:54,938 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 19:03:54,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:54,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483885078] [2024-02-07 19:03:54,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483885078] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:54,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:54,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:03:54,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664918921] [2024-02-07 19:03:54,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:54,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:54,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:54,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:54,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:54,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-02-07 19:03:54,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 147 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 19:03:54,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:54,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-02-07 19:03:54,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:55,364 INFO L124 PetriNetUnfolderBase]: 4348/7402 cut-off events. [2024-02-07 19:03:55,364 INFO L125 PetriNetUnfolderBase]: For 2266/2274 co-relation queries the response was YES. [2024-02-07 19:03:55,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17251 conditions, 7402 events. 4348/7402 cut-off events. For 2266/2274 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 53380 event pairs, 1796 based on Foata normal form. 168/6397 useless extension candidates. Maximal degree in co-relation 17240. Up to 3440 conditions per place. [2024-02-07 19:03:55,411 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 52 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2024-02-07 19:03:55,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 68 transitions, 316 flow [2024-02-07 19:03:55,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:55,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:55,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2024-02-07 19:03:55,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5747126436781609 [2024-02-07 19:03:55,413 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 147 flow. Second operand 3 states and 100 transitions. [2024-02-07 19:03:55,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 68 transitions, 316 flow [2024-02-07 19:03:55,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 68 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:03:55,416 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 146 flow [2024-02-07 19:03:55,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-02-07 19:03:55,417 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -6 predicate places. [2024-02-07 19:03:55,417 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 146 flow [2024-02-07 19:03:55,417 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 19:03:55,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:55,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:55,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-07 19:03:55,418 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:03:55,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:55,419 INFO L85 PathProgramCache]: Analyzing trace with hash -638903580, now seen corresponding path program 1 times [2024-02-07 19:03:55,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:55,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565314217] [2024-02-07 19:03:55,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:55,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:55,498 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 19:03:55,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:55,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565314217] [2024-02-07 19:03:55,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565314217] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:55,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:55,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:03:55,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950282399] [2024-02-07 19:03:55,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:55,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:03:55,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:55,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:03:55,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:03:55,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 58 [2024-02-07 19:03:55,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:55,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:55,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 58 [2024-02-07 19:03:55,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:55,993 INFO L124 PetriNetUnfolderBase]: 4277/7687 cut-off events. [2024-02-07 19:03:55,993 INFO L125 PetriNetUnfolderBase]: For 2699/2705 co-relation queries the response was YES. [2024-02-07 19:03:56,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17863 conditions, 7687 events. 4277/7687 cut-off events. For 2699/2705 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 59272 event pairs, 953 based on Foata normal form. 233/6596 useless extension candidates. Maximal degree in co-relation 17852. Up to 3693 conditions per place. [2024-02-07 19:03:56,041 INFO L140 encePairwiseOnDemand]: 52/58 looper letters, 57 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2024-02-07 19:03:56,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 75 transitions, 382 flow [2024-02-07 19:03:56,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:03:56,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:03:56,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2024-02-07 19:03:56,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5258620689655172 [2024-02-07 19:03:56,042 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 146 flow. Second operand 4 states and 122 transitions. [2024-02-07 19:03:56,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 75 transitions, 382 flow [2024-02-07 19:03:56,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 75 transitions, 373 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:03:56,045 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 169 flow [2024-02-07 19:03:56,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=62, PETRI_TRANSITIONS=47} [2024-02-07 19:03:56,046 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -2 predicate places. [2024-02-07 19:03:56,046 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 169 flow [2024-02-07 19:03:56,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:56,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:56,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:56,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 19:03:56,047 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:03:56,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:56,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1100029062, now seen corresponding path program 1 times [2024-02-07 19:03:56,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:56,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780099491] [2024-02-07 19:03:56,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:56,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:56,068 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 19:03:56,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:56,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780099491] [2024-02-07 19:03:56,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780099491] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:56,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:56,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:03:56,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418216187] [2024-02-07 19:03:56,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:56,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:56,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:56,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:56,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:56,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-02-07 19:03:56,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 47 transitions, 169 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 19:03:56,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:56,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-02-07 19:03:56,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:56,308 INFO L124 PetriNetUnfolderBase]: 2226/4066 cut-off events. [2024-02-07 19:03:56,308 INFO L125 PetriNetUnfolderBase]: For 2471/2477 co-relation queries the response was YES. [2024-02-07 19:03:56,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9900 conditions, 4066 events. 2226/4066 cut-off events. For 2471/2477 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 27734 event pairs, 1098 based on Foata normal form. 124/3974 useless extension candidates. Maximal degree in co-relation 9886. Up to 3199 conditions per place. [2024-02-07 19:03:56,324 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 37 selfloop transitions, 3 changer transitions 2/55 dead transitions. [2024-02-07 19:03:56,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 55 transitions, 281 flow [2024-02-07 19:03:56,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:56,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:56,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-02-07 19:03:56,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2024-02-07 19:03:56,326 INFO L175 Difference]: Start difference. First operand has 62 places, 47 transitions, 169 flow. Second operand 3 states and 93 transitions. [2024-02-07 19:03:56,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 55 transitions, 281 flow [2024-02-07 19:03:56,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 55 transitions, 275 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:03:56,328 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 147 flow [2024-02-07 19:03:56,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=56, 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=147, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2024-02-07 19:03:56,328 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -6 predicate places. [2024-02-07 19:03:56,329 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 147 flow [2024-02-07 19:03:56,329 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 19:03:56,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:56,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:56,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-07 19:03:56,329 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:03:56,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:56,330 INFO L85 PathProgramCache]: Analyzing trace with hash -365003835, now seen corresponding path program 1 times [2024-02-07 19:03:56,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:56,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304591421] [2024-02-07 19:03:56,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:56,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:56,389 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 19:03:56,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:56,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304591421] [2024-02-07 19:03:56,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304591421] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:56,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:56,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:03:56,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992853575] [2024-02-07 19:03:56,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:56,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:03:56,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:56,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:03:56,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:03:56,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-02-07 19:03:56,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 147 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:56,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:56,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-02-07 19:03:56,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:56,585 INFO L124 PetriNetUnfolderBase]: 1799/3509 cut-off events. [2024-02-07 19:03:56,585 INFO L125 PetriNetUnfolderBase]: For 1895/1895 co-relation queries the response was YES. [2024-02-07 19:03:56,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8206 conditions, 3509 events. 1799/3509 cut-off events. For 1895/1895 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 25004 event pairs, 1199 based on Foata normal form. 2/3303 useless extension candidates. Maximal degree in co-relation 8193. Up to 2697 conditions per place. [2024-02-07 19:03:56,602 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 39 selfloop transitions, 6 changer transitions 0/58 dead transitions. [2024-02-07 19:03:56,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 58 transitions, 295 flow [2024-02-07 19:03:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:03:56,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:03:56,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-02-07 19:03:56,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4698275862068966 [2024-02-07 19:03:56,604 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 147 flow. Second operand 4 states and 109 transitions. [2024-02-07 19:03:56,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 58 transitions, 295 flow [2024-02-07 19:03:56,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 58 transitions, 272 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-02-07 19:03:56,607 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 172 flow [2024-02-07 19:03:56,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2024-02-07 19:03:56,607 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -5 predicate places. [2024-02-07 19:03:56,607 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 172 flow [2024-02-07 19:03:56,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:56,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:56,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:56,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-07 19:03:56,608 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:03:56,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:56,608 INFO L85 PathProgramCache]: Analyzing trace with hash -2076815497, now seen corresponding path program 1 times [2024-02-07 19:03:56,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:56,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137549783] [2024-02-07 19:03:56,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:56,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:56,683 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 19:03:56,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:56,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137549783] [2024-02-07 19:03:56,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137549783] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:56,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:56,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:03:56,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065297756] [2024-02-07 19:03:56,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:56,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 19:03:56,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:56,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 19:03:56,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 19:03:56,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 58 [2024-02-07 19:03:56,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 172 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:56,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:56,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 58 [2024-02-07 19:03:56,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:56,870 INFO L124 PetriNetUnfolderBase]: 1354/2517 cut-off events. [2024-02-07 19:03:56,870 INFO L125 PetriNetUnfolderBase]: For 1329/1335 co-relation queries the response was YES. [2024-02-07 19:03:56,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6118 conditions, 2517 events. 1354/2517 cut-off events. For 1329/1335 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 15368 event pairs, 124 based on Foata normal form. 124/2533 useless extension candidates. Maximal degree in co-relation 6104. Up to 849 conditions per place. [2024-02-07 19:03:56,881 INFO L140 encePairwiseOnDemand]: 52/58 looper letters, 64 selfloop transitions, 8 changer transitions 1/86 dead transitions. [2024-02-07 19:03:56,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 86 transitions, 471 flow [2024-02-07 19:03:56,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:03:56,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:03:56,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2024-02-07 19:03:56,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.496551724137931 [2024-02-07 19:03:56,883 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 172 flow. Second operand 5 states and 144 transitions. [2024-02-07 19:03:56,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 86 transitions, 471 flow [2024-02-07 19:03:56,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 86 transitions, 464 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-02-07 19:03:56,887 INFO L231 Difference]: Finished difference. Result has 64 places, 49 transitions, 215 flow [2024-02-07 19:03:56,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=215, PETRI_PLACES=64, PETRI_TRANSITIONS=49} [2024-02-07 19:03:56,888 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 0 predicate places. [2024-02-07 19:03:56,888 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 49 transitions, 215 flow [2024-02-07 19:03:56,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:56,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:56,888 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] [2024-02-07 19:03:56,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-07 19:03:56,888 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:03:56,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:56,889 INFO L85 PathProgramCache]: Analyzing trace with hash -2054286336, now seen corresponding path program 1 times [2024-02-07 19:03:56,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:56,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441900839] [2024-02-07 19:03:56,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:56,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:56,998 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 19:03:56,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:56,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441900839] [2024-02-07 19:03:56,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441900839] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:56,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:56,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:03:56,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098213585] [2024-02-07 19:03:56,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:56,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 19:03:57,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:57,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 19:03:57,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 19:03:57,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-02-07 19:03:57,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 49 transitions, 215 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:57,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:57,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-02-07 19:03:57,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:57,177 INFO L124 PetriNetUnfolderBase]: 1232/2387 cut-off events. [2024-02-07 19:03:57,177 INFO L125 PetriNetUnfolderBase]: For 2258/2258 co-relation queries the response was YES. [2024-02-07 19:03:57,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6339 conditions, 2387 events. 1232/2387 cut-off events. For 2258/2258 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 14857 event pairs, 420 based on Foata normal form. 4/2285 useless extension candidates. Maximal degree in co-relation 6322. Up to 1778 conditions per place. [2024-02-07 19:03:57,189 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 49 selfloop transitions, 8 changer transitions 0/70 dead transitions. [2024-02-07 19:03:57,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 70 transitions, 429 flow [2024-02-07 19:03:57,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:03:57,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:03:57,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2024-02-07 19:03:57,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4870689655172414 [2024-02-07 19:03:57,190 INFO L175 Difference]: Start difference. First operand has 64 places, 49 transitions, 215 flow. Second operand 4 states and 113 transitions. [2024-02-07 19:03:57,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 70 transitions, 429 flow [2024-02-07 19:03:57,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 70 transitions, 390 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-02-07 19:03:57,194 INFO L231 Difference]: Finished difference. Result has 65 places, 52 transitions, 240 flow [2024-02-07 19:03:57,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=65, PETRI_TRANSITIONS=52} [2024-02-07 19:03:57,195 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 1 predicate places. [2024-02-07 19:03:57,195 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 52 transitions, 240 flow [2024-02-07 19:03:57,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:57,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:57,195 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] [2024-02-07 19:03:57,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-07 19:03:57,195 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:03:57,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:57,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1194328634, now seen corresponding path program 2 times [2024-02-07 19:03:57,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:57,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936619920] [2024-02-07 19:03:57,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:57,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:57,282 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 19:03:57,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:57,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936619920] [2024-02-07 19:03:57,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936619920] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:57,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:57,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:03:57,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582864718] [2024-02-07 19:03:57,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:57,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 19:03:57,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:57,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 19:03:57,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-07 19:03:57,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-02-07 19:03:57,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 52 transitions, 240 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:57,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:57,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-02-07 19:03:57,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:57,482 INFO L124 PetriNetUnfolderBase]: 1224/2375 cut-off events. [2024-02-07 19:03:57,483 INFO L125 PetriNetUnfolderBase]: For 1735/1735 co-relation queries the response was YES. [2024-02-07 19:03:57,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6178 conditions, 2375 events. 1224/2375 cut-off events. For 1735/1735 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 14808 event pairs, 404 based on Foata normal form. 4/2273 useless extension candidates. Maximal degree in co-relation 6160. Up to 1682 conditions per place. [2024-02-07 19:03:57,495 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 60 selfloop transitions, 9 changer transitions 0/82 dead transitions. [2024-02-07 19:03:57,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 82 transitions, 494 flow [2024-02-07 19:03:57,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:03:57,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:03:57,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2024-02-07 19:03:57,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4827586206896552 [2024-02-07 19:03:57,496 INFO L175 Difference]: Start difference. First operand has 65 places, 52 transitions, 240 flow. Second operand 5 states and 140 transitions. [2024-02-07 19:03:57,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 82 transitions, 494 flow [2024-02-07 19:03:57,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 82 transitions, 492 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-02-07 19:03:57,500 INFO L231 Difference]: Finished difference. Result has 70 places, 52 transitions, 260 flow [2024-02-07 19:03:57,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=260, PETRI_PLACES=70, PETRI_TRANSITIONS=52} [2024-02-07 19:03:57,500 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 6 predicate places. [2024-02-07 19:03:57,500 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 52 transitions, 260 flow [2024-02-07 19:03:57,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:57,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:57,501 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] [2024-02-07 19:03:57,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-07 19:03:57,501 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:03:57,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:57,502 INFO L85 PathProgramCache]: Analyzing trace with hash -832786777, now seen corresponding path program 1 times [2024-02-07 19:03:57,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:57,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955778898] [2024-02-07 19:03:57,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:57,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:57,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:03:57,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:57,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955778898] [2024-02-07 19:03:57,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955778898] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:57,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:57,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:03:57,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404470727] [2024-02-07 19:03:57,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:57,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 19:03:57,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:57,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 19:03:57,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-07 19:03:57,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-02-07 19:03:57,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 52 transitions, 260 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:57,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:57,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-02-07 19:03:57,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:57,773 INFO L124 PetriNetUnfolderBase]: 1216/2363 cut-off events. [2024-02-07 19:03:57,774 INFO L125 PetriNetUnfolderBase]: For 2195/2197 co-relation queries the response was YES. [2024-02-07 19:03:57,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6361 conditions, 2363 events. 1216/2363 cut-off events. For 2195/2197 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 14703 event pairs, 669 based on Foata normal form. 4/2259 useless extension candidates. Maximal degree in co-relation 6340. Up to 1707 conditions per place. [2024-02-07 19:03:57,785 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 60 selfloop transitions, 9 changer transitions 0/82 dead transitions. [2024-02-07 19:03:57,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 82 transitions, 527 flow [2024-02-07 19:03:57,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:03:57,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:03:57,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2024-02-07 19:03:57,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5129310344827587 [2024-02-07 19:03:57,787 INFO L175 Difference]: Start difference. First operand has 70 places, 52 transitions, 260 flow. Second operand 4 states and 119 transitions. [2024-02-07 19:03:57,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 82 transitions, 527 flow [2024-02-07 19:03:57,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 82 transitions, 501 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-02-07 19:03:57,790 INFO L231 Difference]: Finished difference. Result has 71 places, 56 transitions, 296 flow [2024-02-07 19:03:57,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=66, 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=4, PETRI_FLOW=296, PETRI_PLACES=71, PETRI_TRANSITIONS=56} [2024-02-07 19:03:57,791 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 7 predicate places. [2024-02-07 19:03:57,791 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 296 flow [2024-02-07 19:03:57,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:57,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:57,792 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] [2024-02-07 19:03:57,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-02-07 19:03:57,792 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:03:57,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:57,792 INFO L85 PathProgramCache]: Analyzing trace with hash 586582573, now seen corresponding path program 2 times [2024-02-07 19:03:57,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:57,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063739009] [2024-02-07 19:03:57,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:57,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:57,899 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 19:03:57,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:57,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063739009] [2024-02-07 19:03:57,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063739009] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:57,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:57,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 19:03:57,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538478128] [2024-02-07 19:03:57,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:57,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 19:03:57,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:57,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 19:03:57,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-07 19:03:57,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 58 [2024-02-07 19:03:57,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 56 transitions, 296 flow. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 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 19:03:57,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:57,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 58 [2024-02-07 19:03:57,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:58,067 INFO L124 PetriNetUnfolderBase]: 868/1485 cut-off events. [2024-02-07 19:03:58,067 INFO L125 PetriNetUnfolderBase]: For 1783/1789 co-relation queries the response was YES. [2024-02-07 19:03:58,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4468 conditions, 1485 events. 868/1485 cut-off events. For 1783/1789 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7095 event pairs, 86 based on Foata normal form. 72/1529 useless extension candidates. Maximal degree in co-relation 4446. Up to 512 conditions per place. [2024-02-07 19:03:58,074 INFO L140 encePairwiseOnDemand]: 52/58 looper letters, 72 selfloop transitions, 11 changer transitions 1/97 dead transitions. [2024-02-07 19:03:58,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 97 transitions, 664 flow [2024-02-07 19:03:58,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 19:03:58,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 19:03:58,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2024-02-07 19:03:58,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4482758620689655 [2024-02-07 19:03:58,076 INFO L175 Difference]: Start difference. First operand has 71 places, 56 transitions, 296 flow. Second operand 6 states and 156 transitions. [2024-02-07 19:03:58,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 97 transitions, 664 flow [2024-02-07 19:03:58,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 97 transitions, 627 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-02-07 19:03:58,079 INFO L231 Difference]: Finished difference. Result has 75 places, 56 transitions, 310 flow [2024-02-07 19:03:58,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=310, PETRI_PLACES=75, PETRI_TRANSITIONS=56} [2024-02-07 19:03:58,080 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 11 predicate places. [2024-02-07 19:03:58,080 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 56 transitions, 310 flow [2024-02-07 19:03:58,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 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 19:03:58,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:58,081 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] [2024-02-07 19:03:58,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-02-07 19:03:58,081 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:03:58,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:58,081 INFO L85 PathProgramCache]: Analyzing trace with hash 633726462, now seen corresponding path program 1 times [2024-02-07 19:03:58,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:58,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686999455] [2024-02-07 19:03:58,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:58,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:58,218 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 19:03:58,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:58,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686999455] [2024-02-07 19:03:58,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686999455] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:58,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:58,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:03:58,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62978819] [2024-02-07 19:03:58,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:58,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 19:03:58,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:58,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 19:03:58,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-07 19:03:58,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-02-07 19:03:58,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 56 transitions, 310 flow. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:58,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:58,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-02-07 19:03:58,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:58,396 INFO L124 PetriNetUnfolderBase]: 1186/2188 cut-off events. [2024-02-07 19:03:58,396 INFO L125 PetriNetUnfolderBase]: For 3660/3668 co-relation queries the response was YES. [2024-02-07 19:03:58,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6656 conditions, 2188 events. 1186/2188 cut-off events. For 3660/3668 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12678 event pairs, 213 based on Foata normal form. 16/2169 useless extension candidates. Maximal degree in co-relation 6633. Up to 861 conditions per place. [2024-02-07 19:03:58,407 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 76 selfloop transitions, 13 changer transitions 0/102 dead transitions. [2024-02-07 19:03:58,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 102 transitions, 758 flow [2024-02-07 19:03:58,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:03:58,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:03:58,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2024-02-07 19:03:58,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5103448275862069 [2024-02-07 19:03:58,409 INFO L175 Difference]: Start difference. First operand has 75 places, 56 transitions, 310 flow. Second operand 5 states and 148 transitions. [2024-02-07 19:03:58,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 102 transitions, 758 flow [2024-02-07 19:03:58,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 102 transitions, 588 flow, removed 29 selfloop flow, removed 9 redundant places. [2024-02-07 19:03:58,422 INFO L231 Difference]: Finished difference. Result has 72 places, 59 transitions, 318 flow [2024-02-07 19:03:58,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=318, PETRI_PLACES=72, PETRI_TRANSITIONS=59} [2024-02-07 19:03:58,422 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 8 predicate places. [2024-02-07 19:03:58,422 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 59 transitions, 318 flow [2024-02-07 19:03:58,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:58,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:58,423 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] [2024-02-07 19:03:58,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-02-07 19:03:58,424 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:03:58,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:58,424 INFO L85 PathProgramCache]: Analyzing trace with hash -578541336, now seen corresponding path program 2 times [2024-02-07 19:03:58,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:58,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323133014] [2024-02-07 19:03:58,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:58,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:58,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:03:58,446 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 19:03:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:03:58,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 19:03:58,471 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 19:03:58,471 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 37 remaining) [2024-02-07 19:03:58,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 37 remaining) [2024-02-07 19:03:58,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 37 remaining) [2024-02-07 19:03:58,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 37 remaining) [2024-02-07 19:03:58,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 37 remaining) [2024-02-07 19:03:58,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 37 remaining) [2024-02-07 19:03:58,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 37 remaining) [2024-02-07 19:03:58,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 37 remaining) [2024-02-07 19:03:58,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 37 remaining) [2024-02-07 19:03:58,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 37 remaining) [2024-02-07 19:03:58,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 37 remaining) [2024-02-07 19:03:58,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 37 remaining) [2024-02-07 19:03:58,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 37 remaining) [2024-02-07 19:03:58,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 37 remaining) [2024-02-07 19:03:58,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 37 remaining) [2024-02-07 19:03:58,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 37 remaining) [2024-02-07 19:03:58,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 37 remaining) [2024-02-07 19:03:58,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 37 remaining) [2024-02-07 19:03:58,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 37 remaining) [2024-02-07 19:03:58,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 37 remaining) [2024-02-07 19:03:58,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (16 of 37 remaining) [2024-02-07 19:03:58,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 37 remaining) [2024-02-07 19:03:58,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 37 remaining) [2024-02-07 19:03:58,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 37 remaining) [2024-02-07 19:03:58,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 37 remaining) [2024-02-07 19:03:58,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 37 remaining) [2024-02-07 19:03:58,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 37 remaining) [2024-02-07 19:03:58,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 37 remaining) [2024-02-07 19:03:58,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 37 remaining) [2024-02-07 19:03:58,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 37 remaining) [2024-02-07 19:03:58,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 37 remaining) [2024-02-07 19:03:58,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 37 remaining) [2024-02-07 19:03:58,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 37 remaining) [2024-02-07 19:03:58,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 37 remaining) [2024-02-07 19:03:58,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 37 remaining) [2024-02-07 19:03:58,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 37 remaining) [2024-02-07 19:03:58,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 37 remaining) [2024-02-07 19:03:58,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-02-07 19:03:58,476 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:58,482 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 19:03:58,482 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 19:03:58,529 INFO L503 ceAbstractionStarter]: Automizer considered 20 witness invariants [2024-02-07 19:03:58,530 INFO L504 ceAbstractionStarter]: WitnessConsidered=20 [2024-02-07 19:03:58,530 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 07:03:58 BasicIcfg [2024-02-07 19:03:58,530 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 19:03:58,531 INFO L158 Benchmark]: Toolchain (without parser) took 9209.47ms. Allocated memory was 178.3MB in the beginning and 947.9MB in the end (delta: 769.7MB). Free memory was 101.3MB in the beginning and 426.6MB in the end (delta: -325.3MB). Peak memory consumption was 447.1MB. Max. memory is 16.1GB. [2024-02-07 19:03:58,531 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 178.3MB. Free memory is still 149.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:03:58,531 INFO L158 Benchmark]: Witness Parser took 0.74ms. Allocated memory is still 178.3MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:03:58,531 INFO L158 Benchmark]: CACSL2BoogieTranslator took 582.02ms. Allocated memory is still 178.3MB. Free memory was 100.9MB in the beginning and 148.0MB in the end (delta: -47.2MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. [2024-02-07 19:03:58,531 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.74ms. Allocated memory is still 178.3MB. Free memory was 148.0MB in the beginning and 145.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 19:03:58,531 INFO L158 Benchmark]: Boogie Preprocessor took 62.53ms. Allocated memory is still 178.3MB. Free memory was 145.9MB in the beginning and 143.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 19:03:58,531 INFO L158 Benchmark]: RCFGBuilder took 556.34ms. Allocated memory is still 178.3MB. Free memory was 143.8MB in the beginning and 117.6MB in the end (delta: 26.2MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. [2024-02-07 19:03:58,532 INFO L158 Benchmark]: TraceAbstraction took 7967.36ms. Allocated memory was 178.3MB in the beginning and 947.9MB in the end (delta: 769.7MB). Free memory was 116.6MB in the beginning and 426.6MB in the end (delta: -310.0MB). Peak memory consumption was 462.8MB. Max. memory is 16.1GB. [2024-02-07 19:03:58,532 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.16ms. Allocated memory is still 178.3MB. Free memory is still 149.9MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.74ms. Allocated memory is still 178.3MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 582.02ms. Allocated memory is still 178.3MB. Free memory was 100.9MB in the beginning and 148.0MB in the end (delta: -47.2MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.74ms. Allocated memory is still 178.3MB. Free memory was 148.0MB in the beginning and 145.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.53ms. Allocated memory is still 178.3MB. Free memory was 145.9MB in the beginning and 143.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 556.34ms. Allocated memory is still 178.3MB. Free memory was 143.8MB in the beginning and 117.6MB in the end (delta: 26.2MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7967.36ms. Allocated memory was 178.3MB in the beginning and 947.9MB in the end (delta: 769.7MB). Free memory was 116.6MB in the beginning and 426.6MB in the end (delta: -310.0MB). Peak memory consumption was 462.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 786]: 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_p1_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L773] 0 pthread_t t1991; [L774] FCALL, FORK 0 pthread_create(&t1991, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1991={5:0}, x=0, y=0] [L723] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]]]] [L723] 1 __unbuffered_p0_EAX = y [L724] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[2]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L775] 0 pthread_t t1992; [L776] FCALL, FORK 0 pthread_create(&t1992, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1991={5:0}, t1992={6:0}, x=0, y=0] [L738] 2 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]]]]]] [L738] 2 __unbuffered_p1_EAX = x [L739] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p1_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L726] 1 x = 1 [L727] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=0] [L731] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L731] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L732] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=0] [L777] 0 pthread_t t1993; [L778] FCALL, FORK 0 pthread_create(&t1993, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1991={5:0}, t1992={6:0}, t1993={3:0}, x=1, y=0] [L753] 3 y = 2 [L754] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]] VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, 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=2] [L741] 2 y = 1 [L742] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, 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] [L746] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L746] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L747] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, 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] [L758] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L758] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, 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] [L780] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L780] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L781] 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=0, __unbuffered_p1_EAX=0, 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, t1991={5:0}, t1992={6:0}, t1993={3:0}, x=1, y=1] [L782] 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]]]]]] [L782] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L782] RET 0 assume_abort_if_not(main$tmp_guard0) [L786] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p1_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[2]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[2]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[2]]]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, 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, t1991={5:0}, t1992={6:0}, t1993={3:0}, x=1, y=1] - UnprovableResult [Line: 723]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 727]: 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: 732]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 738]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 739]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 742]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 746]: 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: 754]: 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: 759]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 780]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 781]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 782]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 787]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 788]: 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: 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. - UnprovableResult [Line: 776]: 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: 774]: 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, 94 locations, 37 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.8s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 472 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 469 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1144 IncrementalHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 1 mSDtfsCounter, 1144 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=318occurred in iteration=16, InterpolantAutomatonStates: 61, 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, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 197 ConstructedInterpolants, 0 QuantifiedInterpolants, 1051 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-02-07 19:03:58,568 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