./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe037.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/safe037.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/safe037.i ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe037.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,747 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 19:05:01,844 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,849 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 19:05:01,850 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 19:05:01,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 19:05:01,874 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 19:05:01,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 19:05:01,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 19:05:01,878 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 19:05:01,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 19:05:01,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 19:05:01,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 19:05:01,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 19:05:01,881 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 19:05:01,881 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 19:05:01,881 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 19:05:01,881 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 19:05:01,882 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 19:05:01,882 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 19:05:01,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 19:05:01,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 19:05:01,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 19:05:01,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 19:05:01,883 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 19:05:01,883 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 19:05:01,883 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 19:05:01,883 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 19:05:01,884 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 19:05:01,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 19:05:01,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 19:05:01,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 19:05:01,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:05:01,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 19:05:01,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 19:05:01,886 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 19:05:01,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 19:05:01,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 19:05:01,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 19:05:01,887 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 19:05:01,887 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 19:05:01,887 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 19:05:01,887 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 19:05:01,887 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:02,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 19:05:02,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 19:05:02,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 19:05:02,134 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 19:05:02,134 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 19:05:02,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe037.i [2024-02-07 19:05:03,193 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 19:05:03,424 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 19:05:03,424 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe037.i [2024-02-07 19:05:03,446 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1703def39/73772c722e0445f98ec2085785d0266e/FLAG83fe10b14 [2024-02-07 19:05:03,461 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1703def39/73772c722e0445f98ec2085785d0266e [2024-02-07 19:05:03,463 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 19:05:03,464 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 19:05:03,466 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/safe037.yml/witness.yml [2024-02-07 19:05:03,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 19:05:03,558 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 19:05:03,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 19:05:03,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 19:05:03,563 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 19:05:03,564 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:05:03" (1/2) ... [2024-02-07 19:05:03,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@548c4dc8 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,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:05:03" (1/2) ... [2024-02-07 19:05:03,567 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@61720297 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,568 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:03" (2/2) ... [2024-02-07 19:05:03,568 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@548c4dc8 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,569 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:03" (2/2) ... [2024-02-07 19:05:03,569 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 19:05:03,635 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 19:05:03,636 INFO L76 edCorrectnessWitness]: Location invariant before [L18-L18] ((0 <= expression) && (expression <= 1)) && (expression == 0 || expression == 1) [2024-02-07 19:05:03,637 INFO L76 edCorrectnessWitness]: Location invariant before [L728-L728] z == 1 [2024-02-07 19:05:03,637 INFO L76 edCorrectnessWitness]: Location invariant before [L801-L801] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 19:05:03,637 INFO L76 edCorrectnessWitness]: Location invariant before [L772-L772] 1 <= __unbuffered_cnt [2024-02-07 19:05:03,637 INFO L76 edCorrectnessWitness]: Location invariant before [L749-L749] ((0 <= y) && (y <= 1)) && (y == 0 || y == 1) [2024-02-07 19:05:03,638 INFO L76 edCorrectnessWitness]: Location invariant before [L800-L800] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 19:05:03,638 INFO L76 edCorrectnessWitness]: Location invariant before [L738-L738] 1 <= __unbuffered_cnt [2024-02-07 19:05:03,638 INFO L76 edCorrectnessWitness]: Location invariant before [L750-L750] ((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) [2024-02-07 19:05:03,638 INFO L76 edCorrectnessWitness]: Location invariant before [L795-L795] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 19:05:03,638 INFO L76 edCorrectnessWitness]: Location invariant before [L745-L745] x == 1 [2024-02-07 19:05:03,657 INFO L76 edCorrectnessWitness]: Location invariant before [L754-L754] 0 <= __unbuffered_cnt [2024-02-07 19:05:03,657 INFO L76 edCorrectnessWitness]: Location invariant before [L732-L732] ((0 <= x) && (x <= 1)) && (x == 0 || x == 1) [2024-02-07 19:05:03,657 INFO L76 edCorrectnessWitness]: Location invariant before [L737-L737] 0 <= __unbuffered_cnt [2024-02-07 19:05:03,657 INFO L76 edCorrectnessWitness]: Location invariant before [L762-L762] y == 1 [2024-02-07 19:05:03,657 INFO L76 edCorrectnessWitness]: Location invariant before [L733-L733] ((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) [2024-02-07 19:05:03,658 INFO L76 edCorrectnessWitness]: Location invariant before [L771-L771] 0 <= __unbuffered_cnt [2024-02-07 19:05:03,658 INFO L76 edCorrectnessWitness]: Location invariant before [L794-L794] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 19:05:03,658 INFO L76 edCorrectnessWitness]: Location invariant before [L793-L793] 0 <= __unbuffered_cnt [2024-02-07 19:05:03,658 INFO L76 edCorrectnessWitness]: Location invariant before [L799-L799] ((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && (__unbuffered_p0_EAX == 0)) && (__unbuffered_p1_EAX == 0 || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) [2024-02-07 19:05:03,658 INFO L76 edCorrectnessWitness]: Location invariant before [L755-L755] 1 <= __unbuffered_cnt [2024-02-07 19:05:03,658 INFO L76 edCorrectnessWitness]: Location invariant before [L767-L767] ((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) [2024-02-07 19:05:03,658 INFO L76 edCorrectnessWitness]: Location invariant before [L766-L766] ((0 <= z) && (z <= 1)) && (z == 0 || z == 1) [2024-02-07 19:05:03,733 INFO L181 MainTranslator]: Built tables and reachable declarations [2024-02-07 19:05:03,881 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/safe037.i[941,954] [2024-02-07 19:05:04,003 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:05:04,013 INFO L206 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-07 19:05:04,040 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/safe037.i[941,954] 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,093 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:05:04,142 INFO L211 MainTranslator]: Completed translation [2024-02-07 19:05:04,142 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:05:04 WrapperNode [2024-02-07 19:05:04,143 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 19:05:04,144 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 19:05:04,145 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 19:05:04,145 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 19:05:04,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,178 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,207 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 78 [2024-02-07 19:05:04,209 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 19:05:04,209 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 19:05:04,209 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 19:05:04,210 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 19:05:04,218 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,230 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,257 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,257 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,264 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,267 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,268 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 19:05:04,271 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 19:05:04,271 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 19:05:04,271 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 19:05:04,271 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:05:04" (1/1) ... [2024-02-07 19:05:04,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:05:04,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:05:04,292 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,294 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,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 19:05:04,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 19:05:04,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 19:05:04,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 19:05:04,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-07 19:05:04,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 19:05:04,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 19:05:04,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 19:05:04,318 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-02-07 19:05:04,318 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-02-07 19:05:04,318 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-02-07 19:05:04,319 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-02-07 19:05:04,319 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-02-07 19:05:04,319 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-02-07 19:05:04,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 19:05:04,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 19:05:04,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 19:05:04,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 19:05:04,319 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-07 19:05:04,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 19:05:04,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 19:05:04,321 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,429 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 19:05:04,431 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 19:05:04,631 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 19:05:04,631 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 19:05:04,774 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 19:05:04,774 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-07 19:05:04,774 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:05:04 BoogieIcfgContainer [2024-02-07 19:05:04,775 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 19:05:04,777 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 19:05:04,777 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 19:05:04,779 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 19:05:04,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 07:05:03" (1/4) ... [2024-02-07 19:05:04,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab3bcf2 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,781 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:03" (2/4) ... [2024-02-07 19:05:04,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab3bcf2 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,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:05:04" (3/4) ... [2024-02-07 19:05:04,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab3bcf2 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,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:05:04" (4/4) ... [2024-02-07 19:05:04,783 INFO L112 eAbstractionObserver]: Analyzing ICFG safe037.i [2024-02-07 19:05:04,797 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 19:05:04,797 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2024-02-07 19:05:04,797 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 19:05:04,838 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-07 19:05:04,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 64 transitions, 140 flow [2024-02-07 19:05:04,897 INFO L124 PetriNetUnfolderBase]: 1/61 cut-off events. [2024-02-07 19:05:04,897 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:05:04,901 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 196 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,901 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 64 transitions, 140 flow [2024-02-07 19:05:04,903 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 61 transitions, 131 flow [2024-02-07 19:05:04,910 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 19:05:04,915 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;@72ef4756, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 19:05:04,915 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2024-02-07 19:05:04,918 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 19:05:04,918 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-02-07 19:05:04,918 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:05:04,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:04,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-07 19:05:04,919 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,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:04,922 INFO L85 PathProgramCache]: Analyzing trace with hash 10190242, now seen corresponding path program 1 times [2024-02-07 19:05:04,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:04,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635730880] [2024-02-07 19:05:04,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:04,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:05,104 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,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:05,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635730880] [2024-02-07 19:05:05,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635730880] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:05,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:05,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:05:05,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222470645] [2024-02-07 19:05:05,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:05,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-02-07 19:05:05,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:05,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-02-07 19:05:05,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-02-07 19:05:05,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2024-02-07 19:05:05,170 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,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:05,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2024-02-07 19:05:05,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:06,406 INFO L124 PetriNetUnfolderBase]: 7776/13223 cut-off events. [2024-02-07 19:05:06,406 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-02-07 19:05:06,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24318 conditions, 13223 events. 7776/13223 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 692. Compared 106603 event pairs, 7776 based on Foata normal form. 294/9317 useless extension candidates. Maximal degree in co-relation 24307. Up to 10977 conditions per place. [2024-02-07 19:05:06,503 INFO L140 encePairwiseOnDemand]: 52/64 looper letters, 32 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2024-02-07 19:05:06,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 171 flow [2024-02-07 19:05:06,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-02-07 19:05:06,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-02-07 19:05:06,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 84 transitions. [2024-02-07 19:05:06,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.65625 [2024-02-07 19:05:06,514 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,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 171 flow [2024-02-07 19:05:06,520 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,524 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 104 flow [2024-02-07 19:05:06,526 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,529 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -13 predicate places. [2024-02-07 19:05:06,529 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 104 flow [2024-02-07 19:05:06,529 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,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:06,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-07 19:05:06,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 19:05:06,530 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,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:06,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1202899396, now seen corresponding path program 1 times [2024-02-07 19:05:06,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:06,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514749688] [2024-02-07 19:05:06,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:06,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:06,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:05:06,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:06,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514749688] [2024-02-07 19:05:06,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514749688] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:06,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:06,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:05:06,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220188247] [2024-02-07 19:05:06,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:06,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:05:06,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:06,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:05:06,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:05:06,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2024-02-07 19:05:06,657 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,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:06,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2024-02-07 19:05:06,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:07,358 INFO L124 PetriNetUnfolderBase]: 7597/11719 cut-off events. [2024-02-07 19:05:07,358 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:05:07,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22562 conditions, 11719 events. 7597/11719 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 82562 event pairs, 1195 based on Foata normal form. 0/8323 useless extension candidates. Maximal degree in co-relation 22559. Up to 9710 conditions per place. [2024-02-07 19:05:07,491 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 51 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2024-02-07 19:05:07,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 70 transitions, 254 flow [2024-02-07 19:05:07,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:05:07,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:05:07,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-02-07 19:05:07,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.59375 [2024-02-07 19:05:07,494 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,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 70 transitions, 254 flow [2024-02-07 19:05:07,494 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,496 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 112 flow [2024-02-07 19:05:07,496 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,497 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -10 predicate places. [2024-02-07 19:05:07,497 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 112 flow [2024-02-07 19:05:07,497 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,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:07,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:07,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 19:05:07,498 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:07,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:07,501 INFO L85 PathProgramCache]: Analyzing trace with hash -96564248, now seen corresponding path program 1 times [2024-02-07 19:05:07,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:07,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264316042] [2024-02-07 19:05:07,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:07,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:07,583 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,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:07,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264316042] [2024-02-07 19:05:07,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264316042] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:07,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:07,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:05:07,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694239776] [2024-02-07 19:05:07,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:07,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:05:07,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:07,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:05:07,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:05:07,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2024-02-07 19:05:07,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 112 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:07,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:07,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2024-02-07 19:05:07,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:08,314 INFO L124 PetriNetUnfolderBase]: 7398/11523 cut-off events. [2024-02-07 19:05:08,314 INFO L125 PetriNetUnfolderBase]: For 768/768 co-relation queries the response was YES. [2024-02-07 19:05:08,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23238 conditions, 11523 events. 7398/11523 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 81710 event pairs, 1044 based on Foata normal form. 0/8597 useless extension candidates. Maximal degree in co-relation 23233. Up to 9262 conditions per place. [2024-02-07 19:05:08,378 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 49 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2024-02-07 19:05:08,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 68 transitions, 257 flow [2024-02-07 19:05:08,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:05:08,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:05:08,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2024-02-07 19:05:08,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-02-07 19:05:08,384 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 112 flow. Second operand 3 states and 112 transitions. [2024-02-07 19:05:08,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 68 transitions, 257 flow [2024-02-07 19:05:08,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 68 transitions, 251 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:05:08,387 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 116 flow [2024-02-07 19:05:08,387 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2024-02-07 19:05:08,388 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -9 predicate places. [2024-02-07 19:05:08,389 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 116 flow [2024-02-07 19:05:08,390 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:08,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:08,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:08,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 19:05:08,391 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:08,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:08,391 INFO L85 PathProgramCache]: Analyzing trace with hash -97019479, now seen corresponding path program 1 times [2024-02-07 19:05:08,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:08,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556912339] [2024-02-07 19:05:08,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:08,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:08,467 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,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:08,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556912339] [2024-02-07 19:05:08,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556912339] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:08,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:08,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:05:08,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573191480] [2024-02-07 19:05:08,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:08,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:05:08,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:08,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:05:08,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:05:08,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2024-02-07 19:05:08,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 116 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:08,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:08,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2024-02-07 19:05:08,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:09,115 INFO L124 PetriNetUnfolderBase]: 5662/8556 cut-off events. [2024-02-07 19:05:09,116 INFO L125 PetriNetUnfolderBase]: For 870/870 co-relation queries the response was YES. [2024-02-07 19:05:09,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18218 conditions, 8556 events. 5662/8556 cut-off events. For 870/870 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 54432 event pairs, 1914 based on Foata normal form. 0/6921 useless extension candidates. Maximal degree in co-relation 18212. Up to 6682 conditions per place. [2024-02-07 19:05:09,154 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 51 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2024-02-07 19:05:09,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 72 transitions, 284 flow [2024-02-07 19:05:09,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:05:09,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:05:09,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-02-07 19:05:09,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6197916666666666 [2024-02-07 19:05:09,157 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 116 flow. Second operand 3 states and 119 transitions. [2024-02-07 19:05:09,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 72 transitions, 284 flow [2024-02-07 19:05:09,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 72 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:05:09,160 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 144 flow [2024-02-07 19:05:09,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=59, 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=144, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2024-02-07 19:05:09,161 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -8 predicate places. [2024-02-07 19:05:09,161 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 144 flow [2024-02-07 19:05:09,162 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:09,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:09,162 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:09,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 19:05:09,162 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,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:09,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1287363820, now seen corresponding path program 1 times [2024-02-07 19:05:09,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:09,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723907734] [2024-02-07 19:05:09,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:09,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:09,231 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,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:09,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723907734] [2024-02-07 19:05:09,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723907734] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:09,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:09,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:05:09,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194719530] [2024-02-07 19:05:09,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:09,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:05:09,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:09,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:05:09,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:05:09,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 64 [2024-02-07 19:05:09,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 144 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,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:09,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 64 [2024-02-07 19:05:09,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:09,786 INFO L124 PetriNetUnfolderBase]: 5662/9402 cut-off events. [2024-02-07 19:05:09,786 INFO L125 PetriNetUnfolderBase]: For 1617/1617 co-relation queries the response was YES. [2024-02-07 19:05:09,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21073 conditions, 9402 events. 5662/9402 cut-off events. For 1617/1617 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 70319 event pairs, 5352 based on Foata normal form. 0/7580 useless extension candidates. Maximal degree in co-relation 21066. Up to 8113 conditions per place. [2024-02-07 19:05:09,843 INFO L140 encePairwiseOnDemand]: 62/64 looper letters, 34 selfloop transitions, 1 changer transitions 0/51 dead transitions. [2024-02-07 19:05:09,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 51 transitions, 212 flow [2024-02-07 19:05:09,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:05:09,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:05:09,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-02-07 19:05:09,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46875 [2024-02-07 19:05:09,845 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 144 flow. Second operand 3 states and 90 transitions. [2024-02-07 19:05:09,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 51 transitions, 212 flow [2024-02-07 19:05:09,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 51 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:05:09,846 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 140 flow [2024-02-07 19:05:09,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2024-02-07 19:05:09,847 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -8 predicate places. [2024-02-07 19:05:09,847 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 140 flow [2024-02-07 19:05:09,848 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,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:09,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:09,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 19:05:09,848 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:09,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:09,849 INFO L85 PathProgramCache]: Analyzing trace with hash 157689130, now seen corresponding path program 1 times [2024-02-07 19:05:09,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:09,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461166339] [2024-02-07 19:05:09,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:09,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:09,875 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,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:09,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461166339] [2024-02-07 19:05:09,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461166339] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:09,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:09,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:05:09,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71419939] [2024-02-07 19:05:09,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:09,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:05:09,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:09,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:05:09,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:05:09,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2024-02-07 19:05:09,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 140 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:09,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:09,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2024-02-07 19:05:09,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:10,331 INFO L124 PetriNetUnfolderBase]: 4940/7793 cut-off events. [2024-02-07 19:05:10,332 INFO L125 PetriNetUnfolderBase]: For 1288/1288 co-relation queries the response was YES. [2024-02-07 19:05:10,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17535 conditions, 7793 events. 4940/7793 cut-off events. For 1288/1288 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 52155 event pairs, 914 based on Foata normal form. 294/6854 useless extension candidates. Maximal degree in co-relation 17528. Up to 6328 conditions per place. [2024-02-07 19:05:10,373 INFO L140 encePairwiseOnDemand]: 62/64 looper letters, 56 selfloop transitions, 1 changer transitions 0/73 dead transitions. [2024-02-07 19:05:10,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 73 transitions, 313 flow [2024-02-07 19:05:10,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:05:10,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:05:10,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-02-07 19:05:10,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5885416666666666 [2024-02-07 19:05:10,378 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 140 flow. Second operand 3 states and 113 transitions. [2024-02-07 19:05:10,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 73 transitions, 313 flow [2024-02-07 19:05:10,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 73 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:05:10,381 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 135 flow [2024-02-07 19:05:10,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2024-02-07 19:05:10,383 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -9 predicate places. [2024-02-07 19:05:10,383 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 135 flow [2024-02-07 19:05:10,384 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:10,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:10,384 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:10,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 19:05:10,384 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:10,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:10,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1254501713, now seen corresponding path program 1 times [2024-02-07 19:05:10,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:10,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228772719] [2024-02-07 19:05:10,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:10,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:10,423 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,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:10,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228772719] [2024-02-07 19:05:10,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228772719] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:10,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:10,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:05:10,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170316901] [2024-02-07 19:05:10,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:10,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:05:10,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:10,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:05:10,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:05:10,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2024-02-07 19:05:10,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 135 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:10,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:10,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2024-02-07 19:05:10,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:10,889 INFO L124 PetriNetUnfolderBase]: 4805/7489 cut-off events. [2024-02-07 19:05:10,889 INFO L125 PetriNetUnfolderBase]: For 1318/1318 co-relation queries the response was YES. [2024-02-07 19:05:10,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17019 conditions, 7489 events. 4805/7489 cut-off events. For 1318/1318 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 48371 event pairs, 1488 based on Foata normal form. 0/6321 useless extension candidates. Maximal degree in co-relation 17013. Up to 6183 conditions per place. [2024-02-07 19:05:10,926 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 57 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2024-02-07 19:05:10,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 75 transitions, 326 flow [2024-02-07 19:05:10,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:05:10,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:05:10,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2024-02-07 19:05:10,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5989583333333334 [2024-02-07 19:05:10,928 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 135 flow. Second operand 3 states and 115 transitions. [2024-02-07 19:05:10,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 75 transitions, 326 flow [2024-02-07 19:05:10,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 75 transitions, 324 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:05:10,930 INFO L231 Difference]: Finished difference. Result has 63 places, 50 transitions, 142 flow [2024-02-07 19:05:10,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=63, PETRI_TRANSITIONS=50} [2024-02-07 19:05:10,931 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -7 predicate places. [2024-02-07 19:05:10,932 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 50 transitions, 142 flow [2024-02-07 19:05:10,932 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:10,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:10,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:10,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-07 19:05:10,933 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:10,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:10,936 INFO L85 PathProgramCache]: Analyzing trace with hash 206060042, now seen corresponding path program 1 times [2024-02-07 19:05:10,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:10,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882531977] [2024-02-07 19:05:10,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:10,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:10,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:11,018 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,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:11,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882531977] [2024-02-07 19:05:11,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882531977] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:11,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:11,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:05:11,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631188032] [2024-02-07 19:05:11,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:11,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:05:11,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:11,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:05:11,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:05:11,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2024-02-07 19:05:11,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 50 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:05:11,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:11,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2024-02-07 19:05:11,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:11,485 INFO L124 PetriNetUnfolderBase]: 4766/7353 cut-off events. [2024-02-07 19:05:11,485 INFO L125 PetriNetUnfolderBase]: For 1547/1547 co-relation queries the response was YES. [2024-02-07 19:05:11,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17648 conditions, 7353 events. 4766/7353 cut-off events. For 1547/1547 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 46894 event pairs, 1616 based on Foata normal form. 0/6468 useless extension candidates. Maximal degree in co-relation 17641. Up to 6619 conditions per place. [2024-02-07 19:05:11,535 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 48 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2024-02-07 19:05:11,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 68 transitions, 295 flow [2024-02-07 19:05:11,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:05:11,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:05:11,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2024-02-07 19:05:11,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5729166666666666 [2024-02-07 19:05:11,537 INFO L175 Difference]: Start difference. First operand has 63 places, 50 transitions, 142 flow. Second operand 3 states and 110 transitions. [2024-02-07 19:05:11,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 68 transitions, 295 flow [2024-02-07 19:05:11,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 68 transitions, 289 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:05:11,539 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 164 flow [2024-02-07 19:05:11,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2024-02-07 19:05:11,540 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -6 predicate places. [2024-02-07 19:05:11,540 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 164 flow [2024-02-07 19:05:11,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:05:11,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:11,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:11,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 19:05:11,541 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:11,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:11,541 INFO L85 PathProgramCache]: Analyzing trace with hash 779231123, now seen corresponding path program 1 times [2024-02-07 19:05:11,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:11,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878097529] [2024-02-07 19:05:11,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:11,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:11,571 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,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:11,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878097529] [2024-02-07 19:05:11,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878097529] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:11,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:11,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:05:11,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449476254] [2024-02-07 19:05:11,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:11,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:05:11,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:11,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:05:11,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:05:11,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2024-02-07 19:05:11,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:05:11,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:11,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2024-02-07 19:05:11,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:12,006 INFO L124 PetriNetUnfolderBase]: 4179/6570 cut-off events. [2024-02-07 19:05:12,007 INFO L125 PetriNetUnfolderBase]: For 2007/2007 co-relation queries the response was YES. [2024-02-07 19:05:12,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16445 conditions, 6570 events. 4179/6570 cut-off events. For 2007/2007 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 41993 event pairs, 1751 based on Foata normal form. 241/6154 useless extension candidates. Maximal degree in co-relation 16437. Up to 5317 conditions per place. [2024-02-07 19:05:12,055 INFO L140 encePairwiseOnDemand]: 62/64 looper letters, 62 selfloop transitions, 1 changer transitions 0/79 dead transitions. [2024-02-07 19:05:12,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 79 transitions, 374 flow [2024-02-07 19:05:12,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:05:12,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:05:12,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-02-07 19:05:12,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.59375 [2024-02-07 19:05:12,057 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 164 flow. Second operand 3 states and 114 transitions. [2024-02-07 19:05:12,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 79 transitions, 374 flow [2024-02-07 19:05:12,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 79 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:05:12,059 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 156 flow [2024-02-07 19:05:12,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=61, 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=156, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2024-02-07 19:05:12,060 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -7 predicate places. [2024-02-07 19:05:12,060 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 156 flow [2024-02-07 19:05:12,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:05:12,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:12,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:12,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-07 19:05:12,061 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:12,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:12,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1076211475, now seen corresponding path program 1 times [2024-02-07 19:05:12,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:12,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509585786] [2024-02-07 19:05:12,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:12,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:12,090 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,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:12,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509585786] [2024-02-07 19:05:12,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509585786] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:12,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:12,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:05:12,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989872139] [2024-02-07 19:05:12,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:12,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:05:12,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:12,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:05:12,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:05:12,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2024-02-07 19:05:12,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:05:12,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:12,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2024-02-07 19:05:12,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:12,492 INFO L124 PetriNetUnfolderBase]: 3678/5970 cut-off events. [2024-02-07 19:05:12,492 INFO L125 PetriNetUnfolderBase]: For 1893/1893 co-relation queries the response was YES. [2024-02-07 19:05:12,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14554 conditions, 5970 events. 3678/5970 cut-off events. For 1893/1893 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 39418 event pairs, 627 based on Foata normal form. 208/5536 useless extension candidates. Maximal degree in co-relation 14547. Up to 4546 conditions per place. [2024-02-07 19:05:12,535 INFO L140 encePairwiseOnDemand]: 62/64 looper letters, 56 selfloop transitions, 1 changer transitions 0/73 dead transitions. [2024-02-07 19:05:12,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 73 transitions, 337 flow [2024-02-07 19:05:12,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:05:12,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:05:12,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-02-07 19:05:12,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5625 [2024-02-07 19:05:12,537 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 156 flow. Second operand 3 states and 108 transitions. [2024-02-07 19:05:12,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 73 transitions, 337 flow [2024-02-07 19:05:12,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 73 transitions, 333 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:05:12,539 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 151 flow [2024-02-07 19:05:12,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=151, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2024-02-07 19:05:12,540 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -8 predicate places. [2024-02-07 19:05:12,540 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 151 flow [2024-02-07 19:05:12,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:05:12,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:12,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:12,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-07 19:05:12,541 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:12,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:12,541 INFO L85 PathProgramCache]: Analyzing trace with hash 2092894381, now seen corresponding path program 1 times [2024-02-07 19:05:12,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:12,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336641576] [2024-02-07 19:05:12,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:12,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:12,578 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,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:12,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336641576] [2024-02-07 19:05:12,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336641576] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:12,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:12,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:05:12,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130346367] [2024-02-07 19:05:12,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:12,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:05:12,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:12,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:05:12,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:05:12,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 64 [2024-02-07 19:05:12,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 151 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:12,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:12,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 64 [2024-02-07 19:05:12,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:12,960 INFO L124 PetriNetUnfolderBase]: 3678/6095 cut-off events. [2024-02-07 19:05:12,961 INFO L125 PetriNetUnfolderBase]: For 1873/1873 co-relation queries the response was YES. [2024-02-07 19:05:12,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14678 conditions, 6095 events. 3678/6095 cut-off events. For 1873/1873 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 41989 event pairs, 3144 based on Foata normal form. 0/5131 useless extension candidates. Maximal degree in co-relation 14672. Up to 5323 conditions per place. [2024-02-07 19:05:13,002 INFO L140 encePairwiseOnDemand]: 62/64 looper letters, 34 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2024-02-07 19:05:13,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 50 transitions, 219 flow [2024-02-07 19:05:13,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:05:13,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:05:13,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-02-07 19:05:13,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.453125 [2024-02-07 19:05:13,004 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 151 flow. Second operand 3 states and 87 transitions. [2024-02-07 19:05:13,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 50 transitions, 219 flow [2024-02-07 19:05:13,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 50 transitions, 218 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:05:13,008 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 150 flow [2024-02-07 19:05:13,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2024-02-07 19:05:13,008 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -8 predicate places. [2024-02-07 19:05:13,008 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 150 flow [2024-02-07 19:05:13,009 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:13,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:13,009 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:13,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-07 19:05:13,009 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:13,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:13,010 INFO L85 PathProgramCache]: Analyzing trace with hash 455216717, now seen corresponding path program 1 times [2024-02-07 19:05:13,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:13,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867034875] [2024-02-07 19:05:13,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:13,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:13,093 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,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:13,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867034875] [2024-02-07 19:05:13,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867034875] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:13,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:13,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:05:13,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300026562] [2024-02-07 19:05:13,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:13,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:05:13,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:13,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:05:13,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:05:13,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2024-02-07 19:05:13,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:05:13,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:13,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2024-02-07 19:05:13,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:13,559 INFO L124 PetriNetUnfolderBase]: 4536/7039 cut-off events. [2024-02-07 19:05:13,560 INFO L125 PetriNetUnfolderBase]: For 1979/1979 co-relation queries the response was YES. [2024-02-07 19:05:13,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17481 conditions, 7039 events. 4536/7039 cut-off events. For 1979/1979 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 45678 event pairs, 2774 based on Foata normal form. 0/6250 useless extension candidates. Maximal degree in co-relation 17475. Up to 4715 conditions per place. [2024-02-07 19:05:13,612 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 55 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2024-02-07 19:05:13,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 70 transitions, 339 flow [2024-02-07 19:05:13,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:05:13,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:05:13,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2024-02-07 19:05:13,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43359375 [2024-02-07 19:05:13,614 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 150 flow. Second operand 4 states and 111 transitions. [2024-02-07 19:05:13,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 70 transitions, 339 flow [2024-02-07 19:05:13,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 70 transitions, 338 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:05:13,616 INFO L231 Difference]: Finished difference. Result has 63 places, 49 transitions, 153 flow [2024-02-07 19:05:13,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=153, PETRI_PLACES=63, PETRI_TRANSITIONS=49} [2024-02-07 19:05:13,618 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -7 predicate places. [2024-02-07 19:05:13,618 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 49 transitions, 153 flow [2024-02-07 19:05:13,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:05:13,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:13,618 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,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-07 19:05:13,619 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:13,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:13,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1103868913, now seen corresponding path program 1 times [2024-02-07 19:05:13,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:13,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135607772] [2024-02-07 19:05:13,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:13,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:13,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:13,647 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,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:13,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135607772] [2024-02-07 19:05:13,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135607772] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:13,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:13,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:05:13,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130751417] [2024-02-07 19:05:13,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:13,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:05:13,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:13,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:05:13,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:05:13,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2024-02-07 19:05:13,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 49 transitions, 153 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,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:13,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2024-02-07 19:05:13,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:13,960 INFO L124 PetriNetUnfolderBase]: 2340/3567 cut-off events. [2024-02-07 19:05:13,960 INFO L125 PetriNetUnfolderBase]: For 1403/1403 co-relation queries the response was YES. [2024-02-07 19:05:13,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9242 conditions, 3567 events. 2340/3567 cut-off events. For 1403/1403 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 19655 event pairs, 596 based on Foata normal form. 98/3594 useless extension candidates. Maximal degree in co-relation 9236. Up to 2750 conditions per place. [2024-02-07 19:05:13,979 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 43 selfloop transitions, 3 changer transitions 2/62 dead transitions. [2024-02-07 19:05:13,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 62 transitions, 286 flow [2024-02-07 19:05:13,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:05:13,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:05:13,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-02-07 19:05:13,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5677083333333334 [2024-02-07 19:05:13,980 INFO L175 Difference]: Start difference. First operand has 63 places, 49 transitions, 153 flow. Second operand 3 states and 109 transitions. [2024-02-07 19:05:13,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 62 transitions, 286 flow [2024-02-07 19:05:13,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 62 transitions, 276 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-07 19:05:13,983 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 135 flow [2024-02-07 19:05:13,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2024-02-07 19:05:13,984 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -12 predicate places. [2024-02-07 19:05:13,984 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 135 flow [2024-02-07 19:05:13,984 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:13,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:13,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:13,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-07 19:05:13,985 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:13,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:13,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1803338939, now seen corresponding path program 1 times [2024-02-07 19:05:13,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:13,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125098892] [2024-02-07 19:05:13,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:13,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:14,077 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,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:14,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125098892] [2024-02-07 19:05:14,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125098892] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:14,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:14,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:05:14,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456452132] [2024-02-07 19:05:14,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:14,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:05:14,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:14,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:05:14,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:05:14,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2024-02-07 19:05:14,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:05:14,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:14,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2024-02-07 19:05:14,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:14,286 INFO L124 PetriNetUnfolderBase]: 2124/3437 cut-off events. [2024-02-07 19:05:14,286 INFO L125 PetriNetUnfolderBase]: For 1410/1410 co-relation queries the response was YES. [2024-02-07 19:05:14,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8624 conditions, 3437 events. 2124/3437 cut-off events. For 1410/1410 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 20153 event pairs, 342 based on Foata normal form. 10/3424 useless extension candidates. Maximal degree in co-relation 8618. Up to 2721 conditions per place. [2024-02-07 19:05:14,305 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 49 selfloop transitions, 9 changer transitions 0/72 dead transitions. [2024-02-07 19:05:14,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 72 transitions, 334 flow [2024-02-07 19:05:14,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:05:14,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:05:14,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2024-02-07 19:05:14,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5234375 [2024-02-07 19:05:14,307 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 135 flow. Second operand 4 states and 134 transitions. [2024-02-07 19:05:14,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 72 transitions, 334 flow [2024-02-07 19:05:14,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 72 transitions, 329 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:05:14,310 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 195 flow [2024-02-07 19:05:14,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2024-02-07 19:05:14,310 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -9 predicate places. [2024-02-07 19:05:14,311 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 195 flow [2024-02-07 19:05:14,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:05:14,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:14,311 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:14,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-02-07 19:05:14,311 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:14,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:14,312 INFO L85 PathProgramCache]: Analyzing trace with hash 710021679, now seen corresponding path program 1 times [2024-02-07 19:05:14,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:14,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811505605] [2024-02-07 19:05:14,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:14,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:14,412 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,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:14,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811505605] [2024-02-07 19:05:14,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811505605] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:14,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:14,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:05:14,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823178902] [2024-02-07 19:05:14,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:14,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:05:14,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:14,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:05:14,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:05:14,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2024-02-07 19:05:14,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 195 flow. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:05:14,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:14,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2024-02-07 19:05:14,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:14,723 INFO L124 PetriNetUnfolderBase]: 2198/3572 cut-off events. [2024-02-07 19:05:14,723 INFO L125 PetriNetUnfolderBase]: For 2602/2602 co-relation queries the response was YES. [2024-02-07 19:05:14,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10014 conditions, 3572 events. 2198/3572 cut-off events. For 2602/2602 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 21208 event pairs, 479 based on Foata normal form. 12/3560 useless extension candidates. Maximal degree in co-relation 10006. Up to 2835 conditions per place. [2024-02-07 19:05:14,742 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 53 selfloop transitions, 12 changer transitions 0/79 dead transitions. [2024-02-07 19:05:14,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 79 transitions, 428 flow [2024-02-07 19:05:14,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:05:14,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:05:14,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2024-02-07 19:05:14,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5234375 [2024-02-07 19:05:14,744 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 195 flow. Second operand 4 states and 134 transitions. [2024-02-07 19:05:14,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 79 transitions, 428 flow [2024-02-07 19:05:14,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 79 transitions, 428 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-07 19:05:14,746 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 281 flow [2024-02-07 19:05:14,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=281, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2024-02-07 19:05:14,747 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -4 predicate places. [2024-02-07 19:05:14,747 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 281 flow [2024-02-07 19:05:14,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:05:14,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:14,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:14,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-02-07 19:05:14,747 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:14,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:14,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1065022767, now seen corresponding path program 1 times [2024-02-07 19:05:14,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:14,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176054286] [2024-02-07 19:05:14,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:14,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:14,810 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,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:14,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176054286] [2024-02-07 19:05:14,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176054286] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:14,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:14,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:05:14,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22175696] [2024-02-07 19:05:14,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:14,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:05:14,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:14,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:05:14,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:05:14,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2024-02-07 19:05:14,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 281 flow. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:05:14,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:14,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2024-02-07 19:05:14,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:15,016 INFO L124 PetriNetUnfolderBase]: 2166/3498 cut-off events. [2024-02-07 19:05:15,017 INFO L125 PetriNetUnfolderBase]: For 4550/4550 co-relation queries the response was YES. [2024-02-07 19:05:15,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10796 conditions, 3498 events. 2166/3498 cut-off events. For 4550/4550 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 20851 event pairs, 713 based on Foata normal form. 12/3460 useless extension candidates. Maximal degree in co-relation 10785. Up to 2809 conditions per place. [2024-02-07 19:05:15,038 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 51 selfloop transitions, 9 changer transitions 0/74 dead transitions. [2024-02-07 19:05:15,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 74 transitions, 464 flow [2024-02-07 19:05:15,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:05:15,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:05:15,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-02-07 19:05:15,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53125 [2024-02-07 19:05:15,040 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 281 flow. Second operand 3 states and 102 transitions. [2024-02-07 19:05:15,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 74 transitions, 464 flow [2024-02-07 19:05:15,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 74 transitions, 464 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-07 19:05:15,043 INFO L231 Difference]: Finished difference. Result has 69 places, 59 transitions, 326 flow [2024-02-07 19:05:15,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=69, PETRI_TRANSITIONS=59} [2024-02-07 19:05:15,043 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -1 predicate places. [2024-02-07 19:05:15,043 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 59 transitions, 326 flow [2024-02-07 19:05:15,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:05:15,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:15,044 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:15,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-02-07 19:05:15,044 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:15,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:15,044 INFO L85 PathProgramCache]: Analyzing trace with hash -623388527, now seen corresponding path program 1 times [2024-02-07 19:05:15,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:15,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834665295] [2024-02-07 19:05:15,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:15,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:15,116 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,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:15,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834665295] [2024-02-07 19:05:15,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834665295] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:15,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:15,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:05:15,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857490856] [2024-02-07 19:05:15,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:15,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:05:15,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:15,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:05:15,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:05:15,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 64 [2024-02-07 19:05:15,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 59 transitions, 326 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 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,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:15,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 64 [2024-02-07 19:05:15,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:15,361 INFO L124 PetriNetUnfolderBase]: 1987/3556 cut-off events. [2024-02-07 19:05:15,362 INFO L125 PetriNetUnfolderBase]: For 5576/5576 co-relation queries the response was YES. [2024-02-07 19:05:15,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10634 conditions, 3556 events. 1987/3556 cut-off events. For 5576/5576 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 23333 event pairs, 219 based on Foata normal form. 137/3552 useless extension candidates. Maximal degree in co-relation 10621. Up to 1642 conditions per place. [2024-02-07 19:05:15,382 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 83 selfloop transitions, 5 changer transitions 1/103 dead transitions. [2024-02-07 19:05:15,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 103 transitions, 764 flow [2024-02-07 19:05:15,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:05:15,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:05:15,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2024-02-07 19:05:15,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.50390625 [2024-02-07 19:05:15,383 INFO L175 Difference]: Start difference. First operand has 69 places, 59 transitions, 326 flow. Second operand 4 states and 129 transitions. [2024-02-07 19:05:15,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 103 transitions, 764 flow [2024-02-07 19:05:15,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 103 transitions, 751 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:05:15,390 INFO L231 Difference]: Finished difference. Result has 73 places, 59 transitions, 339 flow [2024-02-07 19:05:15,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=339, PETRI_PLACES=73, PETRI_TRANSITIONS=59} [2024-02-07 19:05:15,390 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 3 predicate places. [2024-02-07 19:05:15,390 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 59 transitions, 339 flow [2024-02-07 19:05:15,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 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,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:15,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:15,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-02-07 19:05:15,391 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:15,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:15,391 INFO L85 PathProgramCache]: Analyzing trace with hash 811749772, now seen corresponding path program 1 times [2024-02-07 19:05:15,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:15,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282106174] [2024-02-07 19:05:15,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:15,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:15,504 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,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:15,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282106174] [2024-02-07 19:05:15,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282106174] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:15,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:15,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:05:15,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944417912] [2024-02-07 19:05:15,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:15,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 19:05:15,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:15,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 19:05:15,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 19:05:15,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 64 [2024-02-07 19:05:15,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 59 transitions, 339 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 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,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:15,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 64 [2024-02-07 19:05:15,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:15,698 INFO L124 PetriNetUnfolderBase]: 1241/2178 cut-off events. [2024-02-07 19:05:15,698 INFO L125 PetriNetUnfolderBase]: For 3772/3772 co-relation queries the response was YES. [2024-02-07 19:05:15,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6905 conditions, 2178 events. 1241/2178 cut-off events. For 3772/3772 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 12231 event pairs, 125 based on Foata normal form. 106/2205 useless extension candidates. Maximal degree in co-relation 6890. Up to 641 conditions per place. [2024-02-07 19:05:15,710 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 85 selfloop transitions, 8 changer transitions 1/108 dead transitions. [2024-02-07 19:05:15,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 108 transitions, 775 flow [2024-02-07 19:05:15,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:05:15,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:05:15,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions. [2024-02-07 19:05:15,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509375 [2024-02-07 19:05:15,712 INFO L175 Difference]: Start difference. First operand has 73 places, 59 transitions, 339 flow. Second operand 5 states and 163 transitions. [2024-02-07 19:05:15,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 108 transitions, 775 flow [2024-02-07 19:05:15,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 108 transitions, 755 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-02-07 19:05:15,718 INFO L231 Difference]: Finished difference. Result has 75 places, 62 transitions, 369 flow [2024-02-07 19:05:15,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=69, 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=369, PETRI_PLACES=75, PETRI_TRANSITIONS=62} [2024-02-07 19:05:15,719 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 5 predicate places. [2024-02-07 19:05:15,719 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 62 transitions, 369 flow [2024-02-07 19:05:15,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 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,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:15,719 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,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-02-07 19:05:15,720 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:15,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:15,720 INFO L85 PathProgramCache]: Analyzing trace with hash 983705730, now seen corresponding path program 1 times [2024-02-07 19:05:15,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:15,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562242459] [2024-02-07 19:05:15,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:15,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:15,855 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,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:15,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562242459] [2024-02-07 19:05:15,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562242459] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:15,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:15,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:05:15,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521028102] [2024-02-07 19:05:15,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:15,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 19:05:15,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:15,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 19:05:15,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-07 19:05:15,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2024-02-07 19:05:15,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 62 transitions, 369 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 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,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:15,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2024-02-07 19:05:15,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:16,057 INFO L124 PetriNetUnfolderBase]: 1226/2320 cut-off events. [2024-02-07 19:05:16,058 INFO L125 PetriNetUnfolderBase]: For 4312/4312 co-relation queries the response was YES. [2024-02-07 19:05:16,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7246 conditions, 2320 events. 1226/2320 cut-off events. For 4312/4312 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 14042 event pairs, 226 based on Foata normal form. 8/2273 useless extension candidates. Maximal degree in co-relation 7231. Up to 1432 conditions per place. [2024-02-07 19:05:16,071 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 71 selfloop transitions, 19 changer transitions 0/104 dead transitions. [2024-02-07 19:05:16,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 104 transitions, 762 flow [2024-02-07 19:05:16,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:05:16,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:05:16,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2024-02-07 19:05:16,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5125 [2024-02-07 19:05:16,073 INFO L175 Difference]: Start difference. First operand has 75 places, 62 transitions, 369 flow. Second operand 5 states and 164 transitions. [2024-02-07 19:05:16,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 104 transitions, 762 flow [2024-02-07 19:05:16,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 104 transitions, 708 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-02-07 19:05:16,079 INFO L231 Difference]: Finished difference. Result has 78 places, 70 transitions, 478 flow [2024-02-07 19:05:16,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=478, PETRI_PLACES=78, PETRI_TRANSITIONS=70} [2024-02-07 19:05:16,079 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 8 predicate places. [2024-02-07 19:05:16,079 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 70 transitions, 478 flow [2024-02-07 19:05:16,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 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,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:16,080 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,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-02-07 19:05:16,081 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:16,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:16,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1631475030, now seen corresponding path program 2 times [2024-02-07 19:05:16,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:16,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560840153] [2024-02-07 19:05:16,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:16,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:16,188 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,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:16,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560840153] [2024-02-07 19:05:16,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560840153] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:16,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:16,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 19:05:16,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388215674] [2024-02-07 19:05:16,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:16,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 19:05:16,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:16,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 19:05:16,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-07 19:05:16,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 64 [2024-02-07 19:05:16,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 70 transitions, 478 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,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:16,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 64 [2024-02-07 19:05:16,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:16,350 INFO L124 PetriNetUnfolderBase]: 894/1493 cut-off events. [2024-02-07 19:05:16,351 INFO L125 PetriNetUnfolderBase]: For 3420/3420 co-relation queries the response was YES. [2024-02-07 19:05:16,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5393 conditions, 1493 events. 894/1493 cut-off events. For 3420/3420 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7211 event pairs, 102 based on Foata normal form. 52/1502 useless extension candidates. Maximal degree in co-relation 5376. Up to 530 conditions per place. [2024-02-07 19:05:16,358 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 94 selfloop transitions, 11 changer transitions 1/120 dead transitions. [2024-02-07 19:05:16,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 120 transitions, 1002 flow [2024-02-07 19:05:16,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 19:05:16,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 19:05:16,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 177 transitions. [2024-02-07 19:05:16,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4609375 [2024-02-07 19:05:16,359 INFO L175 Difference]: Start difference. First operand has 78 places, 70 transitions, 478 flow. Second operand 6 states and 177 transitions. [2024-02-07 19:05:16,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 120 transitions, 1002 flow [2024-02-07 19:05:16,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 120 transitions, 976 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-02-07 19:05:16,363 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 493 flow [2024-02-07 19:05:16,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=493, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2024-02-07 19:05:16,364 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 14 predicate places. [2024-02-07 19:05:16,364 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 493 flow [2024-02-07 19:05:16,364 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,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:16,364 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,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-02-07 19:05:16,364 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:16,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:16,365 INFO L85 PathProgramCache]: Analyzing trace with hash 898177124, now seen corresponding path program 1 times [2024-02-07 19:05:16,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:16,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574858723] [2024-02-07 19:05:16,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:16,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:16,475 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,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:16,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574858723] [2024-02-07 19:05:16,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574858723] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:16,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:16,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 19:05:16,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480741942] [2024-02-07 19:05:16,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:16,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-07 19:05:16,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:16,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-07 19:05:16,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-02-07 19:05:16,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2024-02-07 19:05:16,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 70 transitions, 493 flow. Second operand has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 0 states have call successors, (0), 0 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,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:16,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2024-02-07 19:05:16,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:16,825 INFO L124 PetriNetUnfolderBase]: 1329/2499 cut-off events. [2024-02-07 19:05:16,825 INFO L125 PetriNetUnfolderBase]: For 5138/5138 co-relation queries the response was YES. [2024-02-07 19:05:16,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8221 conditions, 2499 events. 1329/2499 cut-off events. For 5138/5138 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 14909 event pairs, 256 based on Foata normal form. 0/2443 useless extension candidates. Maximal degree in co-relation 8202. Up to 835 conditions per place. [2024-02-07 19:05:16,836 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 131 selfloop transitions, 23 changer transitions 0/168 dead transitions. [2024-02-07 19:05:16,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 168 transitions, 1380 flow [2024-02-07 19:05:16,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-07 19:05:16,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-07 19:05:16,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 282 transitions. [2024-02-07 19:05:16,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4895833333333333 [2024-02-07 19:05:16,837 INFO L175 Difference]: Start difference. First operand has 84 places, 70 transitions, 493 flow. Second operand 9 states and 282 transitions. [2024-02-07 19:05:16,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 168 transitions, 1380 flow [2024-02-07 19:05:16,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 168 transitions, 1131 flow, removed 37 selfloop flow, removed 8 redundant places. [2024-02-07 19:05:16,846 INFO L231 Difference]: Finished difference. Result has 89 places, 82 transitions, 607 flow [2024-02-07 19:05:16,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=607, PETRI_PLACES=89, PETRI_TRANSITIONS=82} [2024-02-07 19:05:16,847 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 19 predicate places. [2024-02-07 19:05:16,847 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 82 transitions, 607 flow [2024-02-07 19:05:16,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 0 states have call successors, (0), 0 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,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:16,847 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,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-02-07 19:05:16,847 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:16,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:16,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1567069574, now seen corresponding path program 2 times [2024-02-07 19:05:16,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:16,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426293848] [2024-02-07 19:05:16,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:16,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:16,952 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,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:16,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426293848] [2024-02-07 19:05:16,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426293848] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:16,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:16,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:05:16,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843040225] [2024-02-07 19:05:16,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:16,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 19:05:16,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:16,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 19:05:16,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-02-07 19:05:16,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2024-02-07 19:05:16,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 82 transitions, 607 flow. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 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,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:16,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2024-02-07 19:05:16,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:17,193 INFO L124 PetriNetUnfolderBase]: 1590/2998 cut-off events. [2024-02-07 19:05:17,193 INFO L125 PetriNetUnfolderBase]: For 4936/4936 co-relation queries the response was YES. [2024-02-07 19:05:17,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8892 conditions, 2998 events. 1590/2998 cut-off events. For 4936/4936 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 18744 event pairs, 344 based on Foata normal form. 8/2967 useless extension candidates. Maximal degree in co-relation 8872. Up to 1667 conditions per place. [2024-02-07 19:05:17,209 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 87 selfloop transitions, 20 changer transitions 0/121 dead transitions. [2024-02-07 19:05:17,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 121 transitions, 992 flow [2024-02-07 19:05:17,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:05:17,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:05:17,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2024-02-07 19:05:17,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503125 [2024-02-07 19:05:17,211 INFO L175 Difference]: Start difference. First operand has 89 places, 82 transitions, 607 flow. Second operand 5 states and 161 transitions. [2024-02-07 19:05:17,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 121 transitions, 992 flow [2024-02-07 19:05:17,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 121 transitions, 957 flow, removed 14 selfloop flow, removed 1 redundant places. [2024-02-07 19:05:17,221 INFO L231 Difference]: Finished difference. Result has 93 places, 84 transitions, 654 flow [2024-02-07 19:05:17,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=654, PETRI_PLACES=93, PETRI_TRANSITIONS=84} [2024-02-07 19:05:17,221 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 23 predicate places. [2024-02-07 19:05:17,221 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 84 transitions, 654 flow [2024-02-07 19:05:17,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 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:17,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:17,221 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:17,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-02-07 19:05:17,222 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:17,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:17,222 INFO L85 PathProgramCache]: Analyzing trace with hash -247389460, now seen corresponding path program 3 times [2024-02-07 19:05:17,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:17,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984964156] [2024-02-07 19:05:17,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:17,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:05:17,348 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:17,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:05:17,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984964156] [2024-02-07 19:05:17,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984964156] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:05:17,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:05:17,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 19:05:17,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139672415] [2024-02-07 19:05:17,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:05:17,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-07 19:05:17,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:05:17,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-07 19:05:17,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-02-07 19:05:17,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2024-02-07 19:05:17,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 84 transitions, 654 flow. Second operand has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 0 states have call successors, (0), 0 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:17,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:05:17,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2024-02-07 19:05:17,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:05:17,649 INFO L124 PetriNetUnfolderBase]: 1594/3044 cut-off events. [2024-02-07 19:05:17,649 INFO L125 PetriNetUnfolderBase]: For 5168/5168 co-relation queries the response was YES. [2024-02-07 19:05:17,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9024 conditions, 3044 events. 1594/3044 cut-off events. For 5168/5168 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 19221 event pairs, 344 based on Foata normal form. 8/3004 useless extension candidates. Maximal degree in co-relation 9003. Up to 937 conditions per place. [2024-02-07 19:05:17,665 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 120 selfloop transitions, 22 changer transitions 0/156 dead transitions. [2024-02-07 19:05:17,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 156 transitions, 1212 flow [2024-02-07 19:05:17,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-07 19:05:17,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-07 19:05:17,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 253 transitions. [2024-02-07 19:05:17,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.494140625 [2024-02-07 19:05:17,667 INFO L175 Difference]: Start difference. First operand has 93 places, 84 transitions, 654 flow. Second operand 8 states and 253 transitions. [2024-02-07 19:05:17,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 156 transitions, 1212 flow [2024-02-07 19:05:17,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 156 transitions, 1184 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-07 19:05:17,676 INFO L231 Difference]: Finished difference. Result has 99 places, 85 transitions, 697 flow [2024-02-07 19:05:17,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=697, PETRI_PLACES=99, PETRI_TRANSITIONS=85} [2024-02-07 19:05:17,677 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 29 predicate places. [2024-02-07 19:05:17,677 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 85 transitions, 697 flow [2024-02-07 19:05:17,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 0 states have call successors, (0), 0 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:17,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:05:17,677 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:17,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-02-07 19:05:17,677 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:05:17,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:05:17,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1209921694, now seen corresponding path program 4 times [2024-02-07 19:05:17,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:05:17,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927849882] [2024-02-07 19:05:17,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:05:17,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:05:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:05:17,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 19:05:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:05:17,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 19:05:17,739 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 19:05:17,741 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 41 remaining) [2024-02-07 19:05:17,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 41 remaining) [2024-02-07 19:05:17,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 41 remaining) [2024-02-07 19:05:17,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 41 remaining) [2024-02-07 19:05:17,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 41 remaining) [2024-02-07 19:05:17,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 41 remaining) [2024-02-07 19:05:17,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 41 remaining) [2024-02-07 19:05:17,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 41 remaining) [2024-02-07 19:05:17,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 41 remaining) [2024-02-07 19:05:17,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 41 remaining) [2024-02-07 19:05:17,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 41 remaining) [2024-02-07 19:05:17,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 41 remaining) [2024-02-07 19:05:17,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 41 remaining) [2024-02-07 19:05:17,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 41 remaining) [2024-02-07 19:05:17,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 41 remaining) [2024-02-07 19:05:17,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 41 remaining) [2024-02-07 19:05:17,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 41 remaining) [2024-02-07 19:05:17,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 41 remaining) [2024-02-07 19:05:17,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 41 remaining) [2024-02-07 19:05:17,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 41 remaining) [2024-02-07 19:05:17,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 41 remaining) [2024-02-07 19:05:17,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 41 remaining) [2024-02-07 19:05:17,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (18 of 41 remaining) [2024-02-07 19:05:17,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 41 remaining) [2024-02-07 19:05:17,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 41 remaining) [2024-02-07 19:05:17,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 41 remaining) [2024-02-07 19:05:17,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 41 remaining) [2024-02-07 19:05:17,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 41 remaining) [2024-02-07 19:05:17,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 41 remaining) [2024-02-07 19:05:17,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 41 remaining) [2024-02-07 19:05:17,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 41 remaining) [2024-02-07 19:05:17,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 41 remaining) [2024-02-07 19:05:17,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 41 remaining) [2024-02-07 19:05:17,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 41 remaining) [2024-02-07 19:05:17,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 41 remaining) [2024-02-07 19:05:17,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 41 remaining) [2024-02-07 19:05:17,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 41 remaining) [2024-02-07 19:05:17,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 41 remaining) [2024-02-07 19:05:17,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 41 remaining) [2024-02-07 19:05:17,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 41 remaining) [2024-02-07 19:05:17,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 41 remaining) [2024-02-07 19:05:17,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-02-07 19:05:17,751 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:05:17,756 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 19:05:17,756 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 19:05:17,806 INFO L503 ceAbstractionStarter]: Automizer considered 22 witness invariants [2024-02-07 19:05:17,806 INFO L504 ceAbstractionStarter]: WitnessConsidered=22 [2024-02-07 19:05:17,807 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 07:05:17 BasicIcfg [2024-02-07 19:05:17,807 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 19:05:17,807 INFO L158 Benchmark]: Toolchain (without parser) took 14249.31ms. Allocated memory was 172.0MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 96.7MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 594.9MB. Max. memory is 16.1GB. [2024-02-07 19:05:17,807 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 77.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:05:17,808 INFO L158 Benchmark]: Witness Parser took 0.41ms. Allocated memory is still 172.0MB. Free memory was 100.5MB in the beginning and 100.4MB in the end (delta: 67.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:05:17,808 INFO L158 Benchmark]: CACSL2BoogieTranslator took 583.82ms. Allocated memory is still 172.0MB. Free memory was 96.5MB in the beginning and 120.6MB in the end (delta: -24.0MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2024-02-07 19:05:17,808 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.62ms. Allocated memory is still 172.0MB. Free memory was 120.6MB in the beginning and 118.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 19:05:17,808 INFO L158 Benchmark]: Boogie Preprocessor took 60.63ms. Allocated memory is still 172.0MB. Free memory was 118.2MB in the beginning and 116.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 19:05:17,808 INFO L158 Benchmark]: RCFGBuilder took 504.07ms. Allocated memory is still 172.0MB. Free memory was 116.0MB in the beginning and 82.8MB in the end (delta: 33.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-02-07 19:05:17,808 INFO L158 Benchmark]: TraceAbstraction took 13030.44ms. Allocated memory was 172.0MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 82.5MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 581.1MB. Max. memory is 16.1GB. [2024-02-07 19:05:17,809 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 77.7MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.41ms. Allocated memory is still 172.0MB. Free memory was 100.5MB in the beginning and 100.4MB in the end (delta: 67.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 583.82ms. Allocated memory is still 172.0MB. Free memory was 96.5MB in the beginning and 120.6MB in the end (delta: -24.0MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.62ms. Allocated memory is still 172.0MB. Free memory was 120.6MB in the beginning and 118.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.63ms. Allocated memory is still 172.0MB. Free memory was 118.2MB in the beginning and 116.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 504.07ms. Allocated memory is still 172.0MB. Free memory was 116.0MB in the beginning and 82.8MB in the end (delta: 33.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13030.44ms. Allocated memory was 172.0MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 82.5MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 581.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 799]: 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; [L723] 0 int z = 0; [L786] 0 pthread_t t2641; [L787] FCALL, FORK 0 pthread_create(&t2641, ((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, t2641={5:0}, x=0, y=0, z=0] [L788] 0 pthread_t t2642; [L789] FCALL, FORK 0 pthread_create(&t2642, ((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}, main$tmp_guard0=0, main$tmp_guard1=0, t2641={5:0}, t2642={6:0}, x=0, y=0, z=0] [L790] 0 pthread_t t2643; [L791] FCALL, FORK 0 pthread_create(&t2643, ((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}, main$tmp_guard0=0, main$tmp_guard1=0, t2641={5:0}, t2642={6:0}, t2643={3:0}, x=0, y=0, z=0] [L727] 1 z = 1 [L728] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[z],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}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=1] [L744] 2 x = 1 [L745] 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}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=0, z=1] [L749] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]]]]] [L749] 2 __unbuffered_p1_EAX = y [L750] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p1_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=1, y=0, z=1] [L754] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L754] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=1, __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=1, y=0, z=1] [L761] 3 y = 1 [L762] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=1, __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, z=1] [L732] 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]]]]]] [L732] 1 __unbuffered_p0_EAX = x [L733] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_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, z=1] [L737] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L737] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L738] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __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, z=1] [L766] 3 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[z]],BinaryExpression[COMPLEQ,IdentifierExpression[z],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[z],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[z],IntegerLiteral[1]]]]]] [L766] 3 __unbuffered_p2_EAX = z [L767] 3 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __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, z=1] [L771] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L771] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L772] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __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, z=1] [L793] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L794] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __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, t2641={5:0}, t2642={6:0}, t2643={3:0}, x=1, y=1, z=1] [L795] 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]]]]]] [L795] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L795] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[0]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p1_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p1_EAX],IntegerLiteral[1]]]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __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, t2641={5:0}, t2642={6:0}, t2643={3:0}, x=1, y=1, z=1] - UnprovableResult [Line: 728]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 732]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 733]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 737]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 738]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 745]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 749]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 754]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 755]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 762]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 766]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 772]: 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: 794]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 795]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 800]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 801]: 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: 791]: 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.9s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 781 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 772 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1898 IncrementalHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 2 mSDtfsCounter, 1898 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=697occurred in iteration=23, InterpolantAutomatonStates: 92, 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.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 370 NumberOfCodeBlocks, 370 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 1848 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE