./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe035_pso.oepc_pso.opt_rmo.oepc_rmo.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/safe035_pso.oepc_pso.opt_rmo.oepc_rmo.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/safe035_pso.oepc_pso.opt_rmo.oepc_rmo.opt_tso.oepc_tso.opt.i ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe035_pso.oepc_pso.opt_rmo.oepc_rmo.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:05:01,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 19:05:01,562 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 19:05:01,576 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 19:05:01,576 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 19:05:01,603 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 19:05:01,604 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 19:05:01,604 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 19:05:01,605 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 19:05:01,608 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 19:05:01,608 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 19:05:01,608 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 19:05:01,609 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 19:05:01,610 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 19:05:01,610 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 19:05:01,611 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 19:05:01,611 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 19:05:01,611 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 19:05:01,611 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 19:05:01,611 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 19:05:01,612 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 19:05:01,612 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 19:05:01,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 19:05:01,613 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 19:05:01,613 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 19:05:01,613 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 19:05:01,613 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 19:05:01,613 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 19:05:01,614 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 19:05:01,614 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 19:05:01,615 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 19:05:01,615 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 19:05:01,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:05:01,616 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 19:05:01,616 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 19:05:01,616 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 19:05:01,616 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 19:05:01,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 19:05:01,616 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 19:05:01,617 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 19:05:01,617 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 19:05:01,617 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 19:05:01,617 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 19:05:01,617 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:05:01,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 19:05:01,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 19:05:01,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 19:05:01,890 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 19:05:01,890 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 19:05:01,891 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/safe035_pso.oepc_pso.opt_rmo.oepc_rmo.opt_tso.oepc_tso.opt.yml/witness.yml [2024-02-07 19:05:02,028 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 19:05:02,028 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 19:05:02,033 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe035_pso.oepc_pso.opt_rmo.oepc_rmo.opt_tso.oepc_tso.opt.i [2024-02-07 19:05:03,269 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 19:05:03,488 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 19:05:03,490 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe035_pso.oepc_pso.opt_rmo.oepc_rmo.opt_tso.oepc_tso.opt.i [2024-02-07 19:05:03,508 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92b67d399/9c0c27e407a64c299c9d0d2c62b6e631/FLAGa7e9ed926 [2024-02-07 19:05:03,518 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92b67d399/9c0c27e407a64c299c9d0d2c62b6e631 [2024-02-07 19:05:03,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 19:05:03,524 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 19:05:03,526 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 19:05:03,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 19:05:03,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 19:05:03,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:05:02" (1/2) ... [2024-02-07 19:05:03,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5486a705 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:05:03, skipping insertion in model container [2024-02-07 19:05:03,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:05:02" (1/2) ... [2024-02-07 19:05:03,533 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@642b1c5a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:05:03, skipping insertion in model container [2024-02-07 19:05:03,533 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:05:03" (2/2) ... [2024-02-07 19:05:03,534 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5486a705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:05:03, skipping insertion in model container [2024-02-07 19:05:03,534 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:05:03" (2/2) ... [2024-02-07 19:05:03,534 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 19:05:03,594 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 19:05:03,595 INFO L76 edCorrectnessWitness]: Location invariant before [L736-L736] 1 <= __unbuffered_cnt [2024-02-07 19:05:03,595 INFO L76 edCorrectnessWitness]: Location invariant before [L798-L798] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 19:05:03,595 INFO L76 edCorrectnessWitness]: Location invariant before [L752-L752] 0 <= __unbuffered_cnt [2024-02-07 19:05:03,595 INFO L76 edCorrectnessWitness]: Location invariant before [L747-L747] (((0 <= y) && (y <= 2)) && (y <= 127)) && ((y == 0 || y == 1) || y == 2) [2024-02-07 19:05:03,595 INFO L76 edCorrectnessWitness]: Location invariant before [L735-L735] 0 <= __unbuffered_cnt [2024-02-07 19:05:03,596 INFO L76 edCorrectnessWitness]: Location invariant before [L769-L769] 0 <= __unbuffered_cnt [2024-02-07 19:05:03,596 INFO L76 edCorrectnessWitness]: Location invariant before [L726-L726] y == 2 [2024-02-07 19:05:03,596 INFO L76 edCorrectnessWitness]: Location invariant before [L799-L799] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 19:05:03,596 INFO L76 edCorrectnessWitness]: Location invariant before [L731-L731] ((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) [2024-02-07 19:05:03,596 INFO L76 edCorrectnessWitness]: Location invariant before [L743-L743] x == 1 [2024-02-07 19:05:03,596 INFO L76 edCorrectnessWitness]: Location invariant before [L791-L791] 0 <= __unbuffered_cnt [2024-02-07 19:05:03,596 INFO L76 edCorrectnessWitness]: Location invariant before [L730-L730] ((0 <= x) && (x <= 1)) && (x == 0 || x == 1) [2024-02-07 19:05:03,597 INFO L76 edCorrectnessWitness]: Location invariant before [L792-L792] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 19:05:03,597 INFO L76 edCorrectnessWitness]: Location invariant before [L764-L764] (((0 <= y) && (y <= 2)) && (y <= 127)) && ((y == 0 || y == 1) || y == 2) [2024-02-07 19:05:03,597 INFO L76 edCorrectnessWitness]: Location invariant before [L797-L797] (((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && (y == 2)) && ((__unbuffered_p0_EAX == 0 && (__unbuffered_p1_EAX == 0 || (((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 2) && __unbuffered_p1_EAX <= 127) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) || ((((((0 <= __unbuffered_p0_EAX && 0 <= __unbuffered_p1_EAX) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 2) && __unbuffered_p1_EAX <= 127) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2) [2024-02-07 19:05:03,597 INFO L76 edCorrectnessWitness]: Location invariant before [L770-L770] 1 <= __unbuffered_cnt [2024-02-07 19:05:03,597 INFO L76 edCorrectnessWitness]: Location invariant before [L18-L18] ((0 <= expression) && (expression <= 1)) && (expression == 0 || expression == 1) [2024-02-07 19:05:03,597 INFO L76 edCorrectnessWitness]: Location invariant before [L760-L760] y == 1 [2024-02-07 19:05:03,597 INFO L76 edCorrectnessWitness]: Location invariant before [L753-L753] 1 <= __unbuffered_cnt [2024-02-07 19:05:03,598 INFO L76 edCorrectnessWitness]: Location invariant before [L793-L793] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 19:05:03,598 INFO L76 edCorrectnessWitness]: Location invariant before [L765-L765] (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2) [2024-02-07 19:05:03,598 INFO L76 edCorrectnessWitness]: Location invariant before [L748-L748] (((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 2)) && (__unbuffered_p1_EAX <= 127)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2) [2024-02-07 19:05:03,637 INFO L181 MainTranslator]: Built tables and reachable declarations [2024-02-07 19:05:03,789 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/safe035_pso.oepc_pso.opt_rmo.oepc_rmo.opt_tso.oepc_tso.opt.i[992,1005] [2024-02-07 19:05:03,912 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:05:03,923 INFO L206 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-07 19:05:03,967 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/safe035_pso.oepc_pso.opt_rmo.oepc_rmo.opt_tso.oepc_tso.opt.i[992,1005] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-07 19:05:04,032 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:05:04,072 INFO L211 MainTranslator]: Completed translation [2024-02-07 19:05:04,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:05:04 WrapperNode [2024-02-07 19:05:04,074 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 19:05:04,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 19:05:04,075 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 19:05:04,082 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 19:05:04,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,160 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 77 [2024-02-07 19:05:04,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 19:05:04,164 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 19:05:04,164 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 19:05:04,164 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 19:05:04,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,176 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,187 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:05:04,188 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,188 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,194 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,197 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,198 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 19:05:04,201 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 19:05:04,201 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 19:05:04,202 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 19:05:04,202 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:05:04,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:05:04,234 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:05:04,299 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:05:04,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 19:05:04,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 19:05:04,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 19:05:04,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 19:05:04,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-07 19:05:04,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 19:05:04,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 19:05:04,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 19:05:04,329 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-02-07 19:05:04,329 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-02-07 19:05:04,329 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-02-07 19:05:04,330 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-02-07 19:05:04,330 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-02-07 19:05:04,334 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-02-07 19:05:04,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 19:05:04,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 19:05:04,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 19:05:04,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 19:05:04,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-07 19:05:04,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 19:05:04,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 19:05:04,336 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:05:04,452 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 19:05:04,455 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 19:05:04,671 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 19:05:04,672 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 19:05:04,804 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 19:05:04,804 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-07 19:05:04,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:05:04 BoogieIcfgContainer [2024-02-07 19:05:04,805 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 19:05:04,807 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 19:05:04,807 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 19:05:04,810 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 19:05:04,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:05:02" (1/4) ... [2024-02-07 19:05:04,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39040b67 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 07:05:04, skipping insertion in model container [2024-02-07 19:05:04,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 07:05:03" (2/4) ... [2024-02-07 19:05:04,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39040b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:05:04, skipping insertion in model container [2024-02-07 19:05:04,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:05:04" (3/4) ... [2024-02-07 19:05:04,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39040b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:05:04, skipping insertion in model container [2024-02-07 19:05:04,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:05:04" (4/4) ... [2024-02-07 19:05:04,813 INFO L112 eAbstractionObserver]: Analyzing ICFG safe035_pso.oepc_pso.opt_rmo.oepc_rmo.opt_tso.oepc_tso.opt.i [2024-02-07 19:05:04,827 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 19:05:04,827 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2024-02-07 19:05:04,827 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 19:05:04,880 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-07 19:05:04,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 64 transitions, 140 flow [2024-02-07 19:05:04,934 INFO L124 PetriNetUnfolderBase]: 1/61 cut-off events. [2024-02-07 19:05:04,934 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:05:04,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 61 events. 1/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 202 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2024-02-07 19:05:04,937 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 64 transitions, 140 flow [2024-02-07 19:05:04,940 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 61 transitions, 131 flow [2024-02-07 19:05:04,947 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 19:05:04,952 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;@7ccf9f63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 19:05:04,952 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2024-02-07 19:05:04,954 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 19:05:04,955 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-02-07 19:05:04,955 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:05:04,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:04,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-07 19:05:04,956 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:04,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:04,960 INFO L85 PathProgramCache]: Analyzing trace with hash 10007588, now seen corresponding path program 1 times [2024-02-07 19:05:04,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:04,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961121581] [2024-02-07 19:05:04,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:04,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:05,081 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:05:05,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:05,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961121581] [2024-02-07 19:05:05,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961121581] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:05,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:05,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:05:05,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365256304] [2024-02-07 19:05:05,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:05,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-02-07 19:05:05,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:05,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-02-07 19:05:05,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-02-07 19:05:05,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2024-02-07 19:05:05,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 131 flow. Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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:05:05,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:05,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2024-02-07 19:05:05,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:06,639 INFO L124 PetriNetUnfolderBase]: 7776/13295 cut-off events. [2024-02-07 19:05:06,640 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-02-07 19:05:06,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24390 conditions, 13295 events. 7776/13295 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 107051 event pairs, 7776 based on Foata normal form. 294/9455 useless extension candidates. Maximal degree in co-relation 24379. Up to 10977 conditions per place. [2024-02-07 19:05:06,728 INFO L140 encePairwiseOnDemand]: 52/64 looper letters, 32 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2024-02-07 19:05:06,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 171 flow [2024-02-07 19:05:06,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-02-07 19:05:06,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-02-07 19:05:06,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 84 transitions. [2024-02-07 19:05:06,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.65625 [2024-02-07 19:05:06,740 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 131 flow. Second operand 2 states and 84 transitions. [2024-02-07 19:05:06,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 171 flow [2024-02-07 19:05:06,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-07 19:05:06,752 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 104 flow [2024-02-07 19:05:06,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=104, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2024-02-07 19:05:06,757 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -13 predicate places. [2024-02-07 19:05:06,757 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 104 flow [2024-02-07 19:05:06,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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:05:06,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:06,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-07 19:05:06,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 19:05:06,758 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:06,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:06,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1027368838, now seen corresponding path program 1 times [2024-02-07 19:05:06,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:06,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370921316] [2024-02-07 19:05:06,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:06,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:06,901 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:05:06,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:06,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370921316] [2024-02-07 19:05:06,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370921316] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:06,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:06,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:05:06,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625181811] [2024-02-07 19:05:06,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:06,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:05:06,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:06,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:05:06,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:05:06,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2024-02-07 19:05:06,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:05:06,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:06,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2024-02-07 19:05:06,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:07,654 INFO L124 PetriNetUnfolderBase]: 7597/11731 cut-off events. [2024-02-07 19:05:07,655 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:05:07,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22574 conditions, 11731 events. 7597/11731 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 82788 event pairs, 1195 based on Foata normal form. 0/8346 useless extension candidates. Maximal degree in co-relation 22571. Up to 9710 conditions per place. [2024-02-07 19:05:07,721 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 51 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2024-02-07 19:05:07,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 70 transitions, 254 flow [2024-02-07 19:05:07,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:05:07,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:05:07,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-02-07 19:05:07,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.59375 [2024-02-07 19:05:07,725 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 104 flow. Second operand 3 states and 114 transitions. [2024-02-07 19:05:07,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 70 transitions, 254 flow [2024-02-07 19:05:07,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 70 transitions, 254 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-07 19:05:07,727 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 112 flow [2024-02-07 19:05:07,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2024-02-07 19:05:07,728 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -10 predicate places. [2024-02-07 19:05:07,728 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 112 flow [2024-02-07 19:05:07,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:05:07,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:07,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:07,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 19:05:07,730 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:07,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:07,733 INFO L85 PathProgramCache]: Analyzing trace with hash -541012311, now seen corresponding path program 1 times [2024-02-07 19:05:07,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:07,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011834561] [2024-02-07 19:05:07,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:07,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:07,792 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:05:07,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:07,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011834561] [2024-02-07 19:05:07,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011834561] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:07,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:07,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:05:07,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813204609] [2024-02-07 19:05:07,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:07,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:05:07,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:07,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:05:07,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:05:07,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2024-02-07 19:05:07,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:05:07,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:07,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2024-02-07 19:05:07,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:08,558 INFO L124 PetriNetUnfolderBase]: 5819/8848 cut-off events. [2024-02-07 19:05:08,558 INFO L125 PetriNetUnfolderBase]: For 607/607 co-relation queries the response was YES. [2024-02-07 19:05:08,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18188 conditions, 8848 events. 5819/8848 cut-off events. For 607/607 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 56921 event pairs, 2013 based on Foata normal form. 0/6845 useless extension candidates. Maximal degree in co-relation 18183. Up to 6763 conditions per place. [2024-02-07 19:05:08,708 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 51 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2024-02-07 19:05:08,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 72 transitions, 277 flow [2024-02-07 19:05:08,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:05:08,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:05:08,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-02-07 19:05:08,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6197916666666666 [2024-02-07 19:05:08,710 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 112 flow. Second operand 3 states and 119 transitions. [2024-02-07 19:05:08,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 72 transitions, 277 flow [2024-02-07 19:05:08,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 72 transitions, 271 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:05:08,712 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 140 flow [2024-02-07 19:05:08,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2024-02-07 19:05:08,713 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -9 predicate places. [2024-02-07 19:05:08,713 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 140 flow [2024-02-07 19:05:08,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:05:08,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:08,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:08,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 19:05:08,714 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:08,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:08,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1250923897, now seen corresponding path program 1 times [2024-02-07 19:05:08,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:08,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514786436] [2024-02-07 19:05:08,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:08,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:08,756 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:05:08,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:08,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514786436] [2024-02-07 19:05:08,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514786436] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:08,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:08,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:05:08,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379748209] [2024-02-07 19:05:08,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:08,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:05:08,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:08,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:05:08,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:05:08,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2024-02-07 19:05:08,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:05:08,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:08,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2024-02-07 19:05:08,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:09,324 INFO L124 PetriNetUnfolderBase]: 5750/9835 cut-off events. [2024-02-07 19:05:09,324 INFO L125 PetriNetUnfolderBase]: For 1262/1262 co-relation queries the response was YES. [2024-02-07 19:05:09,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21083 conditions, 9835 events. 5750/9835 cut-off events. For 1262/1262 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 74718 event pairs, 2908 based on Foata normal form. 0/7721 useless extension candidates. Maximal degree in co-relation 21077. Up to 8174 conditions per place. [2024-02-07 19:05:09,380 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 47 selfloop transitions, 3 changer transitions 0/67 dead transitions. [2024-02-07 19:05:09,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 67 transitions, 280 flow [2024-02-07 19:05:09,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:05:09,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:05:09,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-02-07 19:05:09,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5677083333333334 [2024-02-07 19:05:09,383 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 140 flow. Second operand 3 states and 109 transitions. [2024-02-07 19:05:09,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 67 transitions, 280 flow [2024-02-07 19:05:09,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 67 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:05:09,385 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 157 flow [2024-02-07 19:05:09,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2024-02-07 19:05:09,386 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -7 predicate places. [2024-02-07 19:05:09,386 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 157 flow [2024-02-07 19:05:09,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:05:09,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:09,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:09,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 19:05:09,387 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:09,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:09,388 INFO L85 PathProgramCache]: Analyzing trace with hash -166559330, now seen corresponding path program 1 times [2024-02-07 19:05:09,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:09,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360654767] [2024-02-07 19:05:09,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:09,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:09,439 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:05:09,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:09,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360654767] [2024-02-07 19:05:09,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360654767] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:09,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:09,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:05:09,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263373856] [2024-02-07 19:05:09,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:09,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:05:09,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:09,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:05:09,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:05:09,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 64 [2024-02-07 19:05:09,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 157 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:05:09,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:09,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 64 [2024-02-07 19:05:09,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:10,206 INFO L124 PetriNetUnfolderBase]: 5750/9831 cut-off events. [2024-02-07 19:05:10,207 INFO L125 PetriNetUnfolderBase]: For 2489/2489 co-relation queries the response was YES. [2024-02-07 19:05:10,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22018 conditions, 9831 events. 5750/9831 cut-off events. For 2489/2489 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 75854 event pairs, 5146 based on Foata normal form. 0/8263 useless extension candidates. Maximal degree in co-relation 22011. Up to 8238 conditions per place. [2024-02-07 19:05:10,246 INFO L140 encePairwiseOnDemand]: 62/64 looper letters, 36 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2024-02-07 19:05:10,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 53 transitions, 229 flow [2024-02-07 19:05:10,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:05:10,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:05:10,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-02-07 19:05:10,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46875 [2024-02-07 19:05:10,247 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 157 flow. Second operand 3 states and 90 transitions. [2024-02-07 19:05:10,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 53 transitions, 229 flow [2024-02-07 19:05:10,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 53 transitions, 226 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:05:10,249 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 154 flow [2024-02-07 19:05:10,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2024-02-07 19:05:10,250 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -7 predicate places. [2024-02-07 19:05:10,250 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 154 flow [2024-02-07 19:05:10,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:05:10,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:10,251 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:10,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 19:05:10,251 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:10,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:10,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1021392119, now seen corresponding path program 1 times [2024-02-07 19:05:10,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:10,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451435903] [2024-02-07 19:05:10,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:10,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:10,277 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:05:10,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:10,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451435903] [2024-02-07 19:05:10,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451435903] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:10,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:10,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:05:10,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889732724] [2024-02-07 19:05:10,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:10,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:05:10,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:10,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:05:10,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:05:10,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2024-02-07 19:05:10,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:05:10,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:10,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2024-02-07 19:05:10,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:10,938 INFO L124 PetriNetUnfolderBase]: 5001/7906 cut-off events. [2024-02-07 19:05:10,939 INFO L125 PetriNetUnfolderBase]: For 2077/2077 co-relation queries the response was YES. [2024-02-07 19:05:10,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18381 conditions, 7906 events. 5001/7906 cut-off events. For 2077/2077 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 53023 event pairs, 866 based on Foata normal form. 304/7220 useless extension candidates. Maximal degree in co-relation 18374. Up to 6425 conditions per place. [2024-02-07 19:05:11,034 INFO L140 encePairwiseOnDemand]: 62/64 looper letters, 60 selfloop transitions, 1 changer transitions 0/77 dead transitions. [2024-02-07 19:05:11,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 77 transitions, 348 flow [2024-02-07 19:05:11,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:05:11,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:05:11,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-02-07 19:05:11,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5885416666666666 [2024-02-07 19:05:11,036 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 154 flow. Second operand 3 states and 113 transitions. [2024-02-07 19:05:11,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 77 transitions, 348 flow [2024-02-07 19:05:11,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 77 transitions, 345 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:05:11,038 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 149 flow [2024-02-07 19:05:11,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=149, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2024-02-07 19:05:11,039 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -8 predicate places. [2024-02-07 19:05:11,039 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 149 flow [2024-02-07 19:05:11,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:05:11,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:11,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:11,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 19:05:11,040 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:11,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:11,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1021391735, now seen corresponding path program 1 times [2024-02-07 19:05:11,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:11,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910783105] [2024-02-07 19:05:11,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:11,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:11,069 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:05:11,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:11,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910783105] [2024-02-07 19:05:11,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910783105] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:11,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:11,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:05:11,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754138544] [2024-02-07 19:05:11,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:11,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:05:11,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:11,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:05:11,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:05:11,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2024-02-07 19:05:11,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 149 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:05:11,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:11,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2024-02-07 19:05:11,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:11,763 INFO L124 PetriNetUnfolderBase]: 7900/13088 cut-off events. [2024-02-07 19:05:11,763 INFO L125 PetriNetUnfolderBase]: For 3283/3283 co-relation queries the response was YES. [2024-02-07 19:05:11,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29668 conditions, 13088 events. 7900/13088 cut-off events. For 3283/3283 co-relation queries the response was YES. Maximal size of possible extension queue 758. Compared 101439 event pairs, 3242 based on Foata normal form. 267/11480 useless extension candidates. Maximal degree in co-relation 29662. Up to 5961 conditions per place. [2024-02-07 19:05:11,846 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 61 selfloop transitions, 4 changer transitions 0/81 dead transitions. [2024-02-07 19:05:11,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 81 transitions, 367 flow [2024-02-07 19:05:11,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:05:11,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:05:11,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2024-02-07 19:05:11,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-02-07 19:05:11,847 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 149 flow. Second operand 3 states and 120 transitions. [2024-02-07 19:05:11,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 81 transitions, 367 flow [2024-02-07 19:05:11,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 81 transitions, 365 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:05:11,851 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 180 flow [2024-02-07 19:05:11,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2024-02-07 19:05:11,852 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -5 predicate places. [2024-02-07 19:05:11,852 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 180 flow [2024-02-07 19:05:11,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:05:11,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:11,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:11,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-07 19:05:11,853 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:11,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:11,853 INFO L85 PathProgramCache]: Analyzing trace with hash -867368269, now seen corresponding path program 1 times [2024-02-07 19:05:11,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:11,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254326732] [2024-02-07 19:05:11,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:11,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:11,912 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:05:11,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:11,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254326732] [2024-02-07 19:05:11,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254326732] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:11,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:11,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:05:11,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625598622] [2024-02-07 19:05:11,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:11,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:05:11,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:11,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:05:11,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:05:11,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2024-02-07 19:05:11,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:05:11,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:11,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2024-02-07 19:05:11,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:12,637 INFO L124 PetriNetUnfolderBase]: 5826/9602 cut-off events. [2024-02-07 19:05:12,643 INFO L125 PetriNetUnfolderBase]: For 5204/5204 co-relation queries the response was YES. [2024-02-07 19:05:12,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22721 conditions, 9602 events. 5826/9602 cut-off events. For 5204/5204 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 70541 event pairs, 2455 based on Foata normal form. 585/8968 useless extension candidates. Maximal degree in co-relation 22714. Up to 4483 conditions per place. [2024-02-07 19:05:12,765 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 54 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2024-02-07 19:05:12,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 73 transitions, 337 flow [2024-02-07 19:05:12,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:05:12,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:05:12,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-02-07 19:05:12,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5885416666666666 [2024-02-07 19:05:12,766 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 180 flow. Second operand 3 states and 113 transitions. [2024-02-07 19:05:12,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 73 transitions, 337 flow [2024-02-07 19:05:12,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 73 transitions, 324 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-02-07 19:05:12,774 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 149 flow [2024-02-07 19:05:12,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=149, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2024-02-07 19:05:12,777 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -8 predicate places. [2024-02-07 19:05:12,777 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 149 flow [2024-02-07 19:05:12,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:05:12,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:12,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:12,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 19:05:12,778 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:12,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:12,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1149715802, now seen corresponding path program 1 times [2024-02-07 19:05:12,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:12,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551526250] [2024-02-07 19:05:12,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:12,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:12,905 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:05:12,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:12,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551526250] [2024-02-07 19:05:12,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551526250] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:12,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:12,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:05:12,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842020851] [2024-02-07 19:05:12,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:12,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:05:12,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:12,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:05:12,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:05:12,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 64 [2024-02-07 19:05:12,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 149 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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:05:12,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:12,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 64 [2024-02-07 19:05:12,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:13,512 INFO L124 PetriNetUnfolderBase]: 5517/9850 cut-off events. [2024-02-07 19:05:13,512 INFO L125 PetriNetUnfolderBase]: For 2209/2209 co-relation queries the response was YES. [2024-02-07 19:05:13,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21980 conditions, 9850 events. 5517/9850 cut-off events. For 2209/2209 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 78642 event pairs, 1191 based on Foata normal form. 305/8611 useless extension candidates. Maximal degree in co-relation 21974. Up to 4681 conditions per place. [2024-02-07 19:05:13,568 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 60 selfloop transitions, 5 changer transitions 0/81 dead transitions. [2024-02-07 19:05:13,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 81 transitions, 389 flow [2024-02-07 19:05:13,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:05:13,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:05:13,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2024-02-07 19:05:13,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53515625 [2024-02-07 19:05:13,570 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 149 flow. Second operand 4 states and 137 transitions. [2024-02-07 19:05:13,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 81 transitions, 389 flow [2024-02-07 19:05:13,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 81 transitions, 367 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-02-07 19:05:13,574 INFO L231 Difference]: Finished difference. Result has 65 places, 51 transitions, 167 flow [2024-02-07 19:05:13,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=65, PETRI_TRANSITIONS=51} [2024-02-07 19:05:13,574 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -5 predicate places. [2024-02-07 19:05:13,575 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 51 transitions, 167 flow [2024-02-07 19:05:13,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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:05:13,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:13,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:13,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-07 19:05:13,575 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:13,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:13,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1319949943, now seen corresponding path program 1 times [2024-02-07 19:05:13,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:13,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829621926] [2024-02-07 19:05:13,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:13,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:13,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:05:13,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:13,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829621926] [2024-02-07 19:05:13,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829621926] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:13,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:13,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:05:13,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977996677] [2024-02-07 19:05:13,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:13,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:05:13,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:13,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:05:13,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:05:13,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2024-02-07 19:05:13,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 51 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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:05:13,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:13,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2024-02-07 19:05:13,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:14,013 INFO L124 PetriNetUnfolderBase]: 3112/5653 cut-off events. [2024-02-07 19:05:14,014 INFO L125 PetriNetUnfolderBase]: For 2186/2186 co-relation queries the response was YES. [2024-02-07 19:05:14,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12981 conditions, 5653 events. 3112/5653 cut-off events. For 2186/2186 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 41365 event pairs, 1432 based on Foata normal form. 166/5517 useless extension candidates. Maximal degree in co-relation 12974. Up to 4346 conditions per place. [2024-02-07 19:05:14,043 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 39 selfloop transitions, 3 changer transitions 2/60 dead transitions. [2024-02-07 19:05:14,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 278 flow [2024-02-07 19:05:14,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:05:14,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:05:14,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-02-07 19:05:14,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-02-07 19:05:14,045 INFO L175 Difference]: Start difference. First operand has 65 places, 51 transitions, 167 flow. Second operand 3 states and 104 transitions. [2024-02-07 19:05:14,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 278 flow [2024-02-07 19:05:14,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:05:14,048 INFO L231 Difference]: Finished difference. Result has 61 places, 45 transitions, 145 flow [2024-02-07 19:05:14,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=61, PETRI_TRANSITIONS=45} [2024-02-07 19:05:14,049 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -9 predicate places. [2024-02-07 19:05:14,051 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 45 transitions, 145 flow [2024-02-07 19:05:14,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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:05:14,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:14,052 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:14,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-07 19:05:14,053 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:14,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:14,054 INFO L85 PathProgramCache]: Analyzing trace with hash 2092184858, now seen corresponding path program 1 times [2024-02-07 19:05:14,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:14,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839779190] [2024-02-07 19:05:14,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:14,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:14,223 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:05:14,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:14,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839779190] [2024-02-07 19:05:14,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839779190] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:14,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:14,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:05:14,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583983966] [2024-02-07 19:05:14,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:14,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 19:05:14,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:14,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 19:05:14,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 19:05:14,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2024-02-07 19:05:14,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 45 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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:05:14,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:14,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2024-02-07 19:05:14,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:14,580 INFO L124 PetriNetUnfolderBase]: 2561/4546 cut-off events. [2024-02-07 19:05:14,581 INFO L125 PetriNetUnfolderBase]: For 1901/1901 co-relation queries the response was YES. [2024-02-07 19:05:14,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10540 conditions, 4546 events. 2561/4546 cut-off events. For 1901/1901 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 31260 event pairs, 755 based on Foata normal form. 8/4419 useless extension candidates. Maximal degree in co-relation 10533. Up to 3626 conditions per place. [2024-02-07 19:05:14,604 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 64 selfloop transitions, 15 changer transitions 0/95 dead transitions. [2024-02-07 19:05:14,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 95 transitions, 473 flow [2024-02-07 19:05:14,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 19:05:14,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 19:05:14,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2024-02-07 19:05:14,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5078125 [2024-02-07 19:05:14,606 INFO L175 Difference]: Start difference. First operand has 61 places, 45 transitions, 145 flow. Second operand 6 states and 195 transitions. [2024-02-07 19:05:14,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 95 transitions, 473 flow [2024-02-07 19:05:14,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 95 transitions, 434 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-02-07 19:05:14,609 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 240 flow [2024-02-07 19:05:14,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=240, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2024-02-07 19:05:14,610 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -4 predicate places. [2024-02-07 19:05:14,610 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 240 flow [2024-02-07 19:05:14,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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:05:14,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:14,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:14,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-07 19:05:14,611 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:14,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:14,611 INFO L85 PathProgramCache]: Analyzing trace with hash 22604590, now seen corresponding path program 1 times [2024-02-07 19:05:14,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:14,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644234156] [2024-02-07 19:05:14,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:14,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:14,686 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:05:14,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:14,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644234156] [2024-02-07 19:05:14,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644234156] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:14,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:14,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:05:14,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634503746] [2024-02-07 19:05:14,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:14,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 19:05:14,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:14,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 19:05:14,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 19:05:14,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 64 [2024-02-07 19:05:14,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 240 flow. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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:05:14,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:14,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 64 [2024-02-07 19:05:14,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:14,980 INFO L124 PetriNetUnfolderBase]: 1833/3325 cut-off events. [2024-02-07 19:05:14,980 INFO L125 PetriNetUnfolderBase]: For 2025/2025 co-relation queries the response was YES. [2024-02-07 19:05:14,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8440 conditions, 3325 events. 1833/3325 cut-off events. For 2025/2025 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 21189 event pairs, 166 based on Foata normal form. 170/3363 useless extension candidates. Maximal degree in co-relation 8431. Up to 1001 conditions per place. [2024-02-07 19:05:14,996 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 83 selfloop transitions, 8 changer transitions 1/108 dead transitions. [2024-02-07 19:05:14,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 108 transitions, 630 flow [2024-02-07 19:05:14,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:05:14,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:05:14,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions. [2024-02-07 19:05:14,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509375 [2024-02-07 19:05:14,998 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 240 flow. Second operand 5 states and 163 transitions. [2024-02-07 19:05:14,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 108 transitions, 630 flow [2024-02-07 19:05:15,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 108 transitions, 621 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-02-07 19:05:15,002 INFO L231 Difference]: Finished difference. Result has 71 places, 62 transitions, 282 flow [2024-02-07 19:05:15,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=71, PETRI_TRANSITIONS=62} [2024-02-07 19:05:15,002 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 1 predicate places. [2024-02-07 19:05:15,003 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 282 flow [2024-02-07 19:05:15,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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:05:15,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:15,003 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] [2024-02-07 19:05:15,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-07 19:05:15,003 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:15,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:15,004 INFO L85 PathProgramCache]: Analyzing trace with hash -207135134, now seen corresponding path program 1 times [2024-02-07 19:05:15,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:15,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121787447] [2024-02-07 19:05:15,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:15,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:15,121 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:05:15,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:15,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121787447] [2024-02-07 19:05:15,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121787447] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:15,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:15,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:05:15,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463591977] [2024-02-07 19:05:15,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:15,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 19:05:15,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:15,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 19:05:15,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-07 19:05:15,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2024-02-07 19:05:15,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 282 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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:05:15,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:15,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2024-02-07 19:05:15,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:15,417 INFO L124 PetriNetUnfolderBase]: 1690/3183 cut-off events. [2024-02-07 19:05:15,417 INFO L125 PetriNetUnfolderBase]: For 3248/3248 co-relation queries the response was YES. [2024-02-07 19:05:15,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8770 conditions, 3183 events. 1690/3183 cut-off events. For 3248/3248 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 20635 event pairs, 551 based on Foata normal form. 8/3076 useless extension candidates. Maximal degree in co-relation 8759. Up to 2302 conditions per place. [2024-02-07 19:05:15,436 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 68 selfloop transitions, 17 changer transitions 0/101 dead transitions. [2024-02-07 19:05:15,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 101 transitions, 611 flow [2024-02-07 19:05:15,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-07 19:05:15,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-07 19:05:15,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 215 transitions. [2024-02-07 19:05:15,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4799107142857143 [2024-02-07 19:05:15,438 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 282 flow. Second operand 7 states and 215 transitions. [2024-02-07 19:05:15,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 101 transitions, 611 flow [2024-02-07 19:05:15,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 101 transitions, 568 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-02-07 19:05:15,444 INFO L231 Difference]: Finished difference. Result has 74 places, 64 transitions, 313 flow [2024-02-07 19:05:15,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=313, PETRI_PLACES=74, PETRI_TRANSITIONS=64} [2024-02-07 19:05:15,445 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 4 predicate places. [2024-02-07 19:05:15,445 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 64 transitions, 313 flow [2024-02-07 19:05:15,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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:05:15,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:15,446 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] [2024-02-07 19:05:15,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-07 19:05:15,446 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:15,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:15,446 INFO L85 PathProgramCache]: Analyzing trace with hash -349189706, now seen corresponding path program 2 times [2024-02-07 19:05:15,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:15,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056683885] [2024-02-07 19:05:15,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:15,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:15,563 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:05:15,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:15,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056683885] [2024-02-07 19:05:15,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056683885] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:15,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:15,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 19:05:15,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200388682] [2024-02-07 19:05:15,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:15,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-07 19:05:15,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:15,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-07 19:05:15,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-02-07 19:05:15,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2024-02-07 19:05:15,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 64 transitions, 313 flow. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 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:05:15,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:15,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2024-02-07 19:05:15,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:15,934 INFO L124 PetriNetUnfolderBase]: 2100/3941 cut-off events. [2024-02-07 19:05:15,934 INFO L125 PetriNetUnfolderBase]: For 3906/3906 co-relation queries the response was YES. [2024-02-07 19:05:15,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10888 conditions, 3941 events. 2100/3941 cut-off events. For 3906/3906 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 26411 event pairs, 273 based on Foata normal form. 8/3831 useless extension candidates. Maximal degree in co-relation 10877. Up to 1822 conditions per place. [2024-02-07 19:05:15,956 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 94 selfloop transitions, 28 changer transitions 0/138 dead transitions. [2024-02-07 19:05:15,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 138 transitions, 866 flow [2024-02-07 19:05:15,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-07 19:05:15,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-07 19:05:15,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 234 transitions. [2024-02-07 19:05:15,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5223214285714286 [2024-02-07 19:05:15,958 INFO L175 Difference]: Start difference. First operand has 74 places, 64 transitions, 313 flow. Second operand 7 states and 234 transitions. [2024-02-07 19:05:15,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 138 transitions, 866 flow [2024-02-07 19:05:15,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 138 transitions, 831 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-02-07 19:05:15,964 INFO L231 Difference]: Finished difference. Result has 79 places, 74 transitions, 437 flow [2024-02-07 19:05:15,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=437, PETRI_PLACES=79, PETRI_TRANSITIONS=74} [2024-02-07 19:05:15,965 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 9 predicate places. [2024-02-07 19:05:15,965 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 74 transitions, 437 flow [2024-02-07 19:05:15,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 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:05:15,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:15,965 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] [2024-02-07 19:05:15,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-02-07 19:05:15,966 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:15,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:15,966 INFO L85 PathProgramCache]: Analyzing trace with hash 583614770, now seen corresponding path program 3 times [2024-02-07 19:05:15,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:15,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403923319] [2024-02-07 19:05:15,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:15,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:16,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:05:16,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:16,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403923319] [2024-02-07 19:05:16,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403923319] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:16,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:16,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 19:05:16,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643782632] [2024-02-07 19:05:16,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:16,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-07 19:05:16,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:16,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-07 19:05:16,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-02-07 19:05:16,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2024-02-07 19:05:16,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 74 transitions, 437 flow. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 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:05:16,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:16,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2024-02-07 19:05:16,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:16,476 INFO L124 PetriNetUnfolderBase]: 2084/3917 cut-off events. [2024-02-07 19:05:16,476 INFO L125 PetriNetUnfolderBase]: For 6753/6753 co-relation queries the response was YES. [2024-02-07 19:05:16,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11914 conditions, 3917 events. 2084/3917 cut-off events. For 6753/6753 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 26266 event pairs, 297 based on Foata normal form. 8/3807 useless extension candidates. Maximal degree in co-relation 11899. Up to 1818 conditions per place. [2024-02-07 19:05:16,499 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 102 selfloop transitions, 32 changer transitions 0/150 dead transitions. [2024-02-07 19:05:16,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 150 transitions, 1042 flow [2024-02-07 19:05:16,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-07 19:05:16,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-07 19:05:16,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 239 transitions. [2024-02-07 19:05:16,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5334821428571429 [2024-02-07 19:05:16,501 INFO L175 Difference]: Start difference. First operand has 79 places, 74 transitions, 437 flow. Second operand 7 states and 239 transitions. [2024-02-07 19:05:16,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 150 transitions, 1042 flow [2024-02-07 19:05:16,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 150 transitions, 1001 flow, removed 14 selfloop flow, removed 1 redundant places. [2024-02-07 19:05:16,514 INFO L231 Difference]: Finished difference. Result has 87 places, 80 transitions, 544 flow [2024-02-07 19:05:16,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=544, PETRI_PLACES=87, PETRI_TRANSITIONS=80} [2024-02-07 19:05:16,515 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 17 predicate places. [2024-02-07 19:05:16,515 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 80 transitions, 544 flow [2024-02-07 19:05:16,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 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:05:16,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:16,515 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] [2024-02-07 19:05:16,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-02-07 19:05:16,516 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:16,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:16,516 INFO L85 PathProgramCache]: Analyzing trace with hash -2111186206, now seen corresponding path program 1 times [2024-02-07 19:05:16,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:16,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910682899] [2024-02-07 19:05:16,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:16,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:16,592 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:05:16,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:16,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910682899] [2024-02-07 19:05:16,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910682899] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:16,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:16,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 19:05:16,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34703239] [2024-02-07 19:05:16,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:16,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 19:05:16,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:16,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 19:05:16,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-07 19:05:16,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 64 [2024-02-07 19:05:16,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 80 transitions, 544 flow. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 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:05:16,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:16,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 64 [2024-02-07 19:05:16,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:16,872 INFO L124 PetriNetUnfolderBase]: 1524/2554 cut-off events. [2024-02-07 19:05:16,872 INFO L125 PetriNetUnfolderBase]: For 6745/6745 co-relation queries the response was YES. [2024-02-07 19:05:16,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8929 conditions, 2554 events. 1524/2554 cut-off events. For 6745/6745 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13933 event pairs, 154 based on Foata normal form. 104/2622 useless extension candidates. Maximal degree in co-relation 8911. Up to 904 conditions per place. [2024-02-07 19:05:16,887 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 114 selfloop transitions, 11 changer transitions 1/142 dead transitions. [2024-02-07 19:05:16,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 142 transitions, 1252 flow [2024-02-07 19:05:16,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 19:05:16,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 19:05:16,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 177 transitions. [2024-02-07 19:05:16,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4609375 [2024-02-07 19:05:16,889 INFO L175 Difference]: Start difference. First operand has 87 places, 80 transitions, 544 flow. Second operand 6 states and 177 transitions. [2024-02-07 19:05:16,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 142 transitions, 1252 flow [2024-02-07 19:05:16,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 142 transitions, 1101 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-02-07 19:05:16,899 INFO L231 Difference]: Finished difference. Result has 89 places, 80 transitions, 506 flow [2024-02-07 19:05:16,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=506, PETRI_PLACES=89, PETRI_TRANSITIONS=80} [2024-02-07 19:05:16,899 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 19 predicate places. [2024-02-07 19:05:16,899 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 80 transitions, 506 flow [2024-02-07 19:05:16,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 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:05:16,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:16,900 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:16,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-02-07 19:05:16,900 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:16,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:16,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1334676498, now seen corresponding path program 1 times [2024-02-07 19:05:16,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:16,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292423373] [2024-02-07 19:05:16,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:16,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:05:16,914 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 19:05:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:05:16,940 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 19:05:16,940 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 19:05:16,941 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 41 remaining) [2024-02-07 19:05:16,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 41 remaining) [2024-02-07 19:05:16,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 41 remaining) [2024-02-07 19:05:16,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 41 remaining) [2024-02-07 19:05:16,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 41 remaining) [2024-02-07 19:05:16,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 41 remaining) [2024-02-07 19:05:16,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 41 remaining) [2024-02-07 19:05:16,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 41 remaining) [2024-02-07 19:05:16,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 41 remaining) [2024-02-07 19:05:16,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 41 remaining) [2024-02-07 19:05:16,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 41 remaining) [2024-02-07 19:05:16,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 41 remaining) [2024-02-07 19:05:16,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 41 remaining) [2024-02-07 19:05:16,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 41 remaining) [2024-02-07 19:05:16,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 41 remaining) [2024-02-07 19:05:16,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 41 remaining) [2024-02-07 19:05:16,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 41 remaining) [2024-02-07 19:05:16,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 41 remaining) [2024-02-07 19:05:16,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 41 remaining) [2024-02-07 19:05:16,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 41 remaining) [2024-02-07 19:05:16,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 41 remaining) [2024-02-07 19:05:16,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 41 remaining) [2024-02-07 19:05:16,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (18 of 41 remaining) [2024-02-07 19:05:16,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 41 remaining) [2024-02-07 19:05:16,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 41 remaining) [2024-02-07 19:05:16,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 41 remaining) [2024-02-07 19:05:16,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 41 remaining) [2024-02-07 19:05:16,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 41 remaining) [2024-02-07 19:05:16,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 41 remaining) [2024-02-07 19:05:16,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 41 remaining) [2024-02-07 19:05:16,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 41 remaining) [2024-02-07 19:05:16,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 41 remaining) [2024-02-07 19:05:16,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 41 remaining) [2024-02-07 19:05:16,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 41 remaining) [2024-02-07 19:05:16,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 41 remaining) [2024-02-07 19:05:16,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 41 remaining) [2024-02-07 19:05:16,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 41 remaining) [2024-02-07 19:05:16,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 41 remaining) [2024-02-07 19:05:16,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 41 remaining) [2024-02-07 19:05:16,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 41 remaining) [2024-02-07 19:05:16,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 41 remaining) [2024-02-07 19:05:16,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-02-07 19:05:16,950 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:16,955 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 19:05:16,955 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 19:05:16,986 INFO L503 ceAbstractionStarter]: Automizer considered 22 witness invariants [2024-02-07 19:05:16,986 INFO L504 ceAbstractionStarter]: WitnessConsidered=22 [2024-02-07 19:05:16,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 07:05:16 BasicIcfg [2024-02-07 19:05:16,987 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 19:05:16,987 INFO L158 Benchmark]: Toolchain (without parser) took 13463.15ms. Allocated memory was 167.8MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 106.3MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2024-02-07 19:05:16,987 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:05:16,988 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:05:16,988 INFO L158 Benchmark]: CACSL2BoogieTranslator took 548.86ms. Allocated memory is still 167.8MB. Free memory was 106.3MB in the beginning and 74.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-02-07 19:05:16,988 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.19ms. Allocated memory is still 167.8MB. Free memory was 74.9MB in the beginning and 72.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 19:05:16,988 INFO L158 Benchmark]: Boogie Preprocessor took 37.03ms. Allocated memory is still 167.8MB. Free memory was 72.8MB in the beginning and 70.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 19:05:16,988 INFO L158 Benchmark]: RCFGBuilder took 603.73ms. Allocated memory is still 167.8MB. Free memory was 70.3MB in the beginning and 101.1MB in the end (delta: -30.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-02-07 19:05:16,989 INFO L158 Benchmark]: TraceAbstraction took 12179.64ms. Allocated memory was 167.8MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 100.9MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2024-02-07 19:05:16,990 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 548.86ms. Allocated memory is still 167.8MB. Free memory was 106.3MB in the beginning and 74.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.19ms. Allocated memory is still 167.8MB. Free memory was 74.9MB in the beginning and 72.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.03ms. Allocated memory is still 167.8MB. Free memory was 72.8MB in the beginning and 70.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 603.73ms. Allocated memory is still 167.8MB. Free memory was 70.3MB in the beginning and 101.1MB in the end (delta: -30.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 12179.64ms. Allocated memory was 167.8MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 100.9MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 797]: 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; [L715] 0 int __unbuffered_p2_EAX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L784] 0 pthread_t t2607; [L785] FCALL, FORK 0 pthread_create(&t2607, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2607={5:0}, x=0, y=0] [L725] 1 y = 2 [L726] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=2] [L730] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]]]] [L730] 1 __unbuffered_p0_EAX = x [L731] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=2] [L786] 0 pthread_t t2608; [L787] FCALL, FORK 0 pthread_create(&t2608, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2607={5:0}, t2608={6:0}, x=0, y=2] [L788] 0 pthread_t t2609; [L789] FCALL, FORK 0 pthread_create(&t2609, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2607={5:0}, t2608={6:0}, t2609={3:0}, x=0, y=2] [L759] 3 y = 1 [L760] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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, x=0, y=1] [L742] 2 x = 1 [L743] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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] [L747] 2 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]]]]]] [L747] 2 __unbuffered_p1_EAX = y [L748] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p1_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[2]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_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] [L764] 3 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]]]]]] [L764] 3 __unbuffered_p2_EAX = y [L765] 3 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[2]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L735] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L735] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L736] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L752] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L752] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L769] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L769] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L770] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L791] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L791] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L792] 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=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2607={5:0}, t2608={6:0}, t2609={3:0}, x=1, y=1] [L793] 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]]]]]] [L793] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L793] RET 0 assume_abort_if_not(main$tmp_guard0) [L797] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[127]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[0]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p1_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[2]]]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EAX]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p1_EAX]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[2]]]]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[2]]]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2607={5:0}, t2608={6:0}, t2609={3:0}, x=1, y=1] - UnprovableResult [Line: 726]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 730]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 731]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 735]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 736]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 743]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 748]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 753]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 760]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 764]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 765]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 769]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 770]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 791]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 792]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 798]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 799]: 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: 785]: 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: 789]: 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: 787]: 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, 106 locations, 41 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: 12.0s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 609 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 605 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1405 IncrementalHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 2 mSDtfsCounter, 1405 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=544occurred in iteration=15, InterpolantAutomatonStates: 68, 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, 245 NumberOfCodeBlocks, 245 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 1094 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:05:17,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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