fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r426-tajo-167905978800313
Last Updated
May 14, 2023

About the Execution of Marcie+red for ShieldRVt-PT-040B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10113.840 1769725.00 1824432.00 389.60 ?????????????F?? normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978800313.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldRVt-PT-040B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978800313
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 952K
-rw-r--r-- 1 mcc users 9.3K Feb 25 23:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 23:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 23:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 23:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 23:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 25 23:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 23:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 25 23:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 489K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVt-PT-040B-CTLCardinality-00
FORMULA_NAME ShieldRVt-PT-040B-CTLCardinality-01
FORMULA_NAME ShieldRVt-PT-040B-CTLCardinality-02
FORMULA_NAME ShieldRVt-PT-040B-CTLCardinality-03
FORMULA_NAME ShieldRVt-PT-040B-CTLCardinality-04
FORMULA_NAME ShieldRVt-PT-040B-CTLCardinality-05
FORMULA_NAME ShieldRVt-PT-040B-CTLCardinality-06
FORMULA_NAME ShieldRVt-PT-040B-CTLCardinality-07
FORMULA_NAME ShieldRVt-PT-040B-CTLCardinality-08
FORMULA_NAME ShieldRVt-PT-040B-CTLCardinality-09
FORMULA_NAME ShieldRVt-PT-040B-CTLCardinality-10
FORMULA_NAME ShieldRVt-PT-040B-CTLCardinality-11
FORMULA_NAME ShieldRVt-PT-040B-CTLCardinality-12
FORMULA_NAME ShieldRVt-PT-040B-CTLCardinality-13
FORMULA_NAME ShieldRVt-PT-040B-CTLCardinality-14
FORMULA_NAME ShieldRVt-PT-040B-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679349413230

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-040B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 21:56:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 21:56:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:56:55] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2023-03-20 21:56:55] [INFO ] Transformed 2003 places.
[2023-03-20 21:56:55] [INFO ] Transformed 2003 transitions.
[2023-03-20 21:56:55] [INFO ] Found NUPN structural information;
[2023-03-20 21:56:55] [INFO ] Parsed PT model containing 2003 places and 2003 transitions and 4726 arcs in 273 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Support contains 147 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Discarding 389 places :
Symmetric choice reduction at 0 with 389 rule applications. Total rules 389 place count 1614 transition count 1614
Iterating global reduction 0 with 389 rules applied. Total rules applied 778 place count 1614 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 779 place count 1613 transition count 1613
Iterating global reduction 0 with 1 rules applied. Total rules applied 780 place count 1613 transition count 1613
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 781 place count 1612 transition count 1612
Iterating global reduction 0 with 1 rules applied. Total rules applied 782 place count 1612 transition count 1612
Applied a total of 782 rules in 607 ms. Remains 1612 /2003 variables (removed 391) and now considering 1612/2003 (removed 391) transitions.
// Phase 1: matrix 1612 rows 1612 cols
[2023-03-20 21:56:56] [INFO ] Computed 161 place invariants in 21 ms
[2023-03-20 21:56:57] [INFO ] Implicit Places using invariants in 651 ms returned []
[2023-03-20 21:56:57] [INFO ] Invariant cache hit.
[2023-03-20 21:56:58] [INFO ] Implicit Places using invariants and state equation in 1043 ms returned []
Implicit Place search using SMT with State Equation took 1722 ms to find 0 implicit places.
[2023-03-20 21:56:58] [INFO ] Invariant cache hit.
[2023-03-20 21:56:59] [INFO ] Dead Transitions using invariants and state equation in 817 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1612/2003 places, 1612/2003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3152 ms. Remains : 1612/2003 places, 1612/2003 transitions.
Support contains 147 out of 1612 places after structural reductions.
[2023-03-20 21:56:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-20 21:56:59] [INFO ] Flatten gal took : 113 ms
FORMULA ShieldRVt-PT-040B-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 21:56:59] [INFO ] Flatten gal took : 68 ms
[2023-03-20 21:56:59] [INFO ] Input system was already deterministic with 1612 transitions.
Support contains 141 out of 1612 places (down from 147) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 451 ms. (steps per millisecond=22 ) properties (out of 87) seen :40
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Running SMT prover for 47 properties.
[2023-03-20 21:57:00] [INFO ] Invariant cache hit.
[2023-03-20 21:57:01] [INFO ] After 1348ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:47
[2023-03-20 21:57:02] [INFO ] [Nat]Absence check using 161 positive place invariants in 57 ms returned sat
[2023-03-20 21:57:08] [INFO ] After 5320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :47
[2023-03-20 21:57:09] [INFO ] Deduced a trap composed of 35 places in 309 ms of which 5 ms to minimize.
[2023-03-20 21:57:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 465 ms
[2023-03-20 21:57:10] [INFO ] Deduced a trap composed of 26 places in 304 ms of which 2 ms to minimize.
[2023-03-20 21:57:10] [INFO ] Deduced a trap composed of 30 places in 301 ms of which 2 ms to minimize.
[2023-03-20 21:57:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 825 ms
[2023-03-20 21:57:11] [INFO ] Deduced a trap composed of 50 places in 321 ms of which 2 ms to minimize.
[2023-03-20 21:57:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 469 ms
[2023-03-20 21:57:12] [INFO ] Deduced a trap composed of 61 places in 271 ms of which 1 ms to minimize.
[2023-03-20 21:57:12] [INFO ] Deduced a trap composed of 66 places in 273 ms of which 0 ms to minimize.
[2023-03-20 21:57:12] [INFO ] Deduced a trap composed of 63 places in 278 ms of which 2 ms to minimize.
[2023-03-20 21:57:13] [INFO ] Deduced a trap composed of 58 places in 286 ms of which 1 ms to minimize.
[2023-03-20 21:57:13] [INFO ] Deduced a trap composed of 64 places in 270 ms of which 1 ms to minimize.
[2023-03-20 21:57:14] [INFO ] Deduced a trap composed of 58 places in 295 ms of which 0 ms to minimize.
[2023-03-20 21:57:14] [INFO ] Deduced a trap composed of 58 places in 267 ms of which 0 ms to minimize.
[2023-03-20 21:57:14] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2623 ms
[2023-03-20 21:57:14] [INFO ] Deduced a trap composed of 23 places in 264 ms of which 1 ms to minimize.
[2023-03-20 21:57:15] [INFO ] Deduced a trap composed of 24 places in 278 ms of which 1 ms to minimize.
[2023-03-20 21:57:15] [INFO ] Deduced a trap composed of 25 places in 249 ms of which 1 ms to minimize.
[2023-03-20 21:57:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1053 ms
[2023-03-20 21:57:16] [INFO ] Deduced a trap composed of 31 places in 262 ms of which 1 ms to minimize.
[2023-03-20 21:57:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 413 ms
[2023-03-20 21:57:16] [INFO ] Deduced a trap composed of 57 places in 243 ms of which 1 ms to minimize.
[2023-03-20 21:57:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 432 ms
[2023-03-20 21:57:17] [INFO ] Deduced a trap composed of 47 places in 240 ms of which 2 ms to minimize.
[2023-03-20 21:57:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 387 ms
[2023-03-20 21:57:18] [INFO ] Deduced a trap composed of 61 places in 256 ms of which 1 ms to minimize.
[2023-03-20 21:57:18] [INFO ] Deduced a trap composed of 57 places in 215 ms of which 1 ms to minimize.
[2023-03-20 21:57:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 708 ms
[2023-03-20 21:57:19] [INFO ] Deduced a trap composed of 37 places in 230 ms of which 0 ms to minimize.
[2023-03-20 21:57:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 396 ms
[2023-03-20 21:57:19] [INFO ] Deduced a trap composed of 46 places in 260 ms of which 1 ms to minimize.
[2023-03-20 21:57:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 438 ms
[2023-03-20 21:57:20] [INFO ] Deduced a trap composed of 58 places in 240 ms of which 2 ms to minimize.
[2023-03-20 21:57:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 391 ms
[2023-03-20 21:57:21] [INFO ] Deduced a trap composed of 38 places in 242 ms of which 1 ms to minimize.
[2023-03-20 21:57:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 403 ms
[2023-03-20 21:57:22] [INFO ] Deduced a trap composed of 27 places in 219 ms of which 1 ms to minimize.
[2023-03-20 21:57:22] [INFO ] Deduced a trap composed of 43 places in 225 ms of which 1 ms to minimize.
[2023-03-20 21:57:22] [INFO ] Deduced a trap composed of 39 places in 212 ms of which 1 ms to minimize.
[2023-03-20 21:57:22] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 1 ms to minimize.
[2023-03-20 21:57:23] [INFO ] Deduced a trap composed of 29 places in 241 ms of which 1 ms to minimize.
[2023-03-20 21:57:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1561 ms
[2023-03-20 21:57:25] [INFO ] Deduced a trap composed of 54 places in 239 ms of which 1 ms to minimize.
[2023-03-20 21:57:26] [INFO ] Deduced a trap composed of 59 places in 220 ms of which 0 ms to minimize.
[2023-03-20 21:57:26] [INFO ] Deduced a trap composed of 61 places in 218 ms of which 1 ms to minimize.
[2023-03-20 21:57:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 932 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:722)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 21:57:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 21:57:26] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:47
Parikh walk visited 1 properties in 2115 ms.
Support contains 75 out of 1612 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1612/1612 places, 1612/1612 transitions.
Drop transitions removed 389 transitions
Trivial Post-agglo rules discarded 389 transitions
Performed 389 trivial Post agglomeration. Transition count delta: 389
Iterating post reduction 0 with 389 rules applied. Total rules applied 389 place count 1612 transition count 1223
Reduce places removed 389 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 399 rules applied. Total rules applied 788 place count 1223 transition count 1213
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 798 place count 1213 transition count 1213
Performed 282 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 282 Pre rules applied. Total rules applied 798 place count 1213 transition count 931
Deduced a syphon composed of 282 places in 3 ms
Reduce places removed 282 places and 0 transitions.
Iterating global reduction 3 with 564 rules applied. Total rules applied 1362 place count 931 transition count 931
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1376 place count 917 transition count 917
Iterating global reduction 3 with 14 rules applied. Total rules applied 1390 place count 917 transition count 917
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 1390 place count 917 transition count 906
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 1412 place count 906 transition count 906
Performed 373 Post agglomeration using F-continuation condition.Transition count delta: 373
Deduced a syphon composed of 373 places in 2 ms
Reduce places removed 373 places and 0 transitions.
Iterating global reduction 3 with 746 rules applied. Total rules applied 2158 place count 533 transition count 533
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2159 place count 533 transition count 532
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2161 place count 532 transition count 531
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 2355 place count 435 transition count 598
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2356 place count 435 transition count 597
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 2362 place count 435 transition count 591
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 2368 place count 429 transition count 591
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 2371 place count 429 transition count 588
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 2373 place count 429 transition count 588
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2374 place count 428 transition count 587
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2375 place count 427 transition count 587
Applied a total of 2375 rules in 375 ms. Remains 427 /1612 variables (removed 1185) and now considering 587/1612 (removed 1025) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 375 ms. Remains : 427/1612 places, 587/1612 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 46) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Running SMT prover for 38 properties.
// Phase 1: matrix 587 rows 427 cols
[2023-03-20 21:57:29] [INFO ] Computed 160 place invariants in 3 ms
[2023-03-20 21:57:30] [INFO ] After 263ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:38
[2023-03-20 21:57:30] [INFO ] [Nat]Absence check using 160 positive place invariants in 17 ms returned sat
[2023-03-20 21:57:31] [INFO ] After 829ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :38
[2023-03-20 21:57:31] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-20 21:57:31] [INFO ] After 570ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :38
[2023-03-20 21:57:31] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2023-03-20 21:57:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-20 21:57:32] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2023-03-20 21:57:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-03-20 21:57:32] [INFO ] After 1577ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :38
Attempting to minimize the solution found.
Minimization took 602 ms.
[2023-03-20 21:57:33] [INFO ] After 3478ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :38
Parikh walk visited 0 properties in 344 ms.
Support contains 65 out of 427 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 587/587 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 427 transition count 582
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 422 transition count 581
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 421 transition count 581
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 12 place count 421 transition count 578
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 18 place count 418 transition count 578
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 26 place count 414 transition count 582
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 414 transition count 580
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 30 place count 412 transition count 580
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 411 transition count 579
Applied a total of 31 rules in 71 ms. Remains 411 /427 variables (removed 16) and now considering 579/587 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 411/427 places, 579/587 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 529 ms. (steps per millisecond=18 ) properties (out of 38) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 27) seen :0
Running SMT prover for 27 properties.
// Phase 1: matrix 579 rows 411 cols
[2023-03-20 21:57:34] [INFO ] Computed 160 place invariants in 2 ms
[2023-03-20 21:57:34] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2023-03-20 21:57:34] [INFO ] [Nat]Absence check using 160 positive place invariants in 40 ms returned sat
[2023-03-20 21:57:35] [INFO ] After 452ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :27
[2023-03-20 21:57:35] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-20 21:57:36] [INFO ] After 521ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :27
[2023-03-20 21:57:36] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2023-03-20 21:57:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-20 21:57:36] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2023-03-20 21:57:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-20 21:57:36] [INFO ] After 1352ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :27
Attempting to minimize the solution found.
Minimization took 391 ms.
[2023-03-20 21:57:37] [INFO ] After 2539ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :27
Fused 27 Parikh solutions to 26 different solutions.
Parikh walk visited 0 properties in 332 ms.
Support contains 44 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 579/579 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 411 transition count 573
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 405 transition count 573
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 12 place count 405 transition count 565
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 28 place count 397 transition count 565
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 38 place count 392 transition count 560
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 386 transition count 566
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 386 transition count 565
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 385 transition count 565
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 55 place count 382 transition count 562
Applied a total of 55 rules in 47 ms. Remains 382 /411 variables (removed 29) and now considering 562/579 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 382/411 places, 562/579 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 27) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Interrupted probabilistic random walk after 113548 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 113548 steps, saw 77396 distinct states, run finished after 3002 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 26 properties.
// Phase 1: matrix 562 rows 382 cols
[2023-03-20 21:57:41] [INFO ] Computed 160 place invariants in 2 ms
[2023-03-20 21:57:41] [INFO ] After 261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:26
[2023-03-20 21:57:41] [INFO ] [Nat]Absence check using 160 positive place invariants in 15 ms returned sat
[2023-03-20 21:57:42] [INFO ] After 438ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :26
[2023-03-20 21:57:42] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-20 21:57:42] [INFO ] After 326ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :26
[2023-03-20 21:57:43] [INFO ] After 869ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :26
Attempting to minimize the solution found.
Minimization took 275 ms.
[2023-03-20 21:57:43] [INFO ] After 1883ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :26
Parikh walk visited 2 properties in 286 ms.
Support contains 37 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 562/562 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 382 transition count 561
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 381 transition count 561
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 381 transition count 559
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 379 transition count 559
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 377 transition count 557
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 375 transition count 557
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 373 transition count 555
Applied a total of 16 rules in 35 ms. Remains 373 /382 variables (removed 9) and now considering 555/562 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 373/382 places, 555/562 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 460 ms. (steps per millisecond=21 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 118626 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 118626 steps, saw 76651 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 555 rows 373 cols
[2023-03-20 21:57:47] [INFO ] Computed 160 place invariants in 6 ms
[2023-03-20 21:57:47] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-03-20 21:57:47] [INFO ] [Nat]Absence check using 160 positive place invariants in 21 ms returned sat
[2023-03-20 21:57:48] [INFO ] After 503ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-03-20 21:57:48] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-20 21:57:48] [INFO ] After 289ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-03-20 21:57:49] [INFO ] After 794ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 264 ms.
[2023-03-20 21:57:49] [INFO ] After 1891ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Parikh walk visited 0 properties in 317 ms.
Support contains 37 out of 373 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 373/373 places, 555/555 transitions.
Applied a total of 0 rules in 8 ms. Remains 373 /373 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 373/373 places, 555/555 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 373/373 places, 555/555 transitions.
Applied a total of 0 rules in 7 ms. Remains 373 /373 variables (removed 0) and now considering 555/555 (removed 0) transitions.
[2023-03-20 21:57:49] [INFO ] Invariant cache hit.
[2023-03-20 21:57:49] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-03-20 21:57:49] [INFO ] Invariant cache hit.
[2023-03-20 21:57:50] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-20 21:57:50] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
[2023-03-20 21:57:50] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-20 21:57:50] [INFO ] Invariant cache hit.
[2023-03-20 21:57:50] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 841 ms. Remains : 373/373 places, 555/555 transitions.
Graph (trivial) has 122 edges and 373 vertex of which 4 / 373 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1186 edges and 371 vertex of which 369 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 119 edges and 367 vertex of which 4 / 367 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 365 transition count 546
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 118 edges and 363 vertex of which 6 / 363 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 360 transition count 537
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 116 edges and 357 vertex of which 6 / 357 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 13 rules applied. Total rules applied 33 place count 354 transition count 528
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 113 edges and 351 vertex of which 6 / 351 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 17 rules applied. Total rules applied 50 place count 348 transition count 515
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 110 edges and 344 vertex of which 6 / 344 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 4 with 17 rules applied. Total rules applied 67 place count 341 transition count 503
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 108 edges and 338 vertex of which 8 / 338 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 15 rules applied. Total rules applied 82 place count 334 transition count 492
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 104 edges and 330 vertex of which 8 / 330 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 20 rules applied. Total rules applied 102 place count 326 transition count 477
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 100 edges and 322 vertex of which 6 / 322 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 121 place count 319 transition count 463
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 96 edges and 316 vertex of which 4 / 316 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 135 place count 314 transition count 453
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 93 edges and 312 vertex of which 2 / 312 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 9 rules applied. Total rules applied 144 place count 311 transition count 447
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 149 place count 310 transition count 443
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 3 Pre rules applied. Total rules applied 149 place count 310 transition count 440
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 11 with 9 rules applied. Total rules applied 158 place count 304 transition count 440
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 90 edges and 304 vertex of which 2 / 304 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 11 with 2 rules applied. Total rules applied 160 place count 303 transition count 439
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 91 edges and 302 vertex of which 4 / 302 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 12 with 4 rules applied. Total rules applied 164 place count 300 transition count 437
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 88 edges and 299 vertex of which 2 / 299 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 13 with 8 rules applied. Total rules applied 172 place count 298 transition count 431
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 87 edges and 297 vertex of which 2 / 297 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 14 with 4 rules applied. Total rules applied 176 place count 296 transition count 429
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 180 place count 295 transition count 426
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 180 place count 295 transition count 425
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 182 place count 294 transition count 425
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 3 rules applied. Total rules applied 185 place count 292 transition count 424
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 188 place count 292 transition count 421
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 17 with 10 rules applied. Total rules applied 198 place count 292 transition count 411
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 17 with 3 rules applied. Total rules applied 201 place count 292 transition count 411
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 17 with 3 rules applied. Total rules applied 204 place count 292 transition count 408
Applied a total of 204 rules in 89 ms. Remains 292 /373 variables (removed 81) and now considering 408/555 (removed 147) transitions.
Running SMT prover for 24 properties.
// Phase 1: matrix 408 rows 292 cols
[2023-03-20 21:57:50] [INFO ] Computed 121 place invariants in 1 ms
[2023-03-20 21:57:50] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-03-20 21:57:50] [INFO ] [Nat]Absence check using 121 positive place invariants in 12 ms returned sat
[2023-03-20 21:57:51] [INFO ] After 271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-03-20 21:57:51] [INFO ] After 610ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 199 ms.
[2023-03-20 21:57:51] [INFO ] After 990ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
[2023-03-20 21:57:51] [INFO ] Flatten gal took : 43 ms
[2023-03-20 21:57:51] [INFO ] Flatten gal took : 40 ms
[2023-03-20 21:57:52] [INFO ] Input system was already deterministic with 1612 transitions.
Computed a total of 490 stabilizing places and 490 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1612/1612 places, 1612/1612 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 436 transitions
Trivial Post-agglo rules discarded 436 transitions
Performed 436 trivial Post agglomeration. Transition count delta: 436
Iterating post reduction 0 with 436 rules applied. Total rules applied 436 place count 1611 transition count 1175
Reduce places removed 436 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 437 rules applied. Total rules applied 873 place count 1175 transition count 1174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 874 place count 1174 transition count 1174
Performed 295 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 295 Pre rules applied. Total rules applied 874 place count 1174 transition count 879
Deduced a syphon composed of 295 places in 1 ms
Reduce places removed 295 places and 0 transitions.
Iterating global reduction 3 with 590 rules applied. Total rules applied 1464 place count 879 transition count 879
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 1501 place count 842 transition count 842
Iterating global reduction 3 with 37 rules applied. Total rules applied 1538 place count 842 transition count 842
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 1538 place count 842 transition count 811
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 1600 place count 811 transition count 811
Performed 317 Post agglomeration using F-continuation condition.Transition count delta: 317
Deduced a syphon composed of 317 places in 0 ms
Reduce places removed 317 places and 0 transitions.
Iterating global reduction 3 with 634 rules applied. Total rules applied 2234 place count 494 transition count 494
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2235 place count 494 transition count 493
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2237 place count 493 transition count 492
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2239 place count 491 transition count 490
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2240 place count 490 transition count 490
Applied a total of 2240 rules in 155 ms. Remains 490 /1612 variables (removed 1122) and now considering 490/1612 (removed 1122) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 156 ms. Remains : 490/1612 places, 490/1612 transitions.
[2023-03-20 21:57:52] [INFO ] Flatten gal took : 14 ms
[2023-03-20 21:57:52] [INFO ] Flatten gal took : 13 ms
[2023-03-20 21:57:52] [INFO ] Input system was already deterministic with 490 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1612/1612 places, 1612/1612 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 1563 transition count 1563
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 1563 transition count 1563
Applied a total of 98 rules in 96 ms. Remains 1563 /1612 variables (removed 49) and now considering 1563/1612 (removed 49) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 1563/1612 places, 1563/1612 transitions.
[2023-03-20 21:57:52] [INFO ] Flatten gal took : 32 ms
[2023-03-20 21:57:52] [INFO ] Flatten gal took : 31 ms
[2023-03-20 21:57:52] [INFO ] Input system was already deterministic with 1563 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1612/1612 places, 1612/1612 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 1564 transition count 1564
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 1564 transition count 1564
Applied a total of 96 rules in 97 ms. Remains 1564 /1612 variables (removed 48) and now considering 1564/1612 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 1564/1612 places, 1564/1612 transitions.
[2023-03-20 21:57:52] [INFO ] Flatten gal took : 28 ms
[2023-03-20 21:57:52] [INFO ] Flatten gal took : 31 ms
[2023-03-20 21:57:52] [INFO ] Input system was already deterministic with 1564 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1612/1612 places, 1612/1612 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 1563 transition count 1563
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 1563 transition count 1563
Applied a total of 98 rules in 95 ms. Remains 1563 /1612 variables (removed 49) and now considering 1563/1612 (removed 49) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 1563/1612 places, 1563/1612 transitions.
[2023-03-20 21:57:52] [INFO ] Flatten gal took : 27 ms
[2023-03-20 21:57:52] [INFO ] Flatten gal took : 32 ms
[2023-03-20 21:57:52] [INFO ] Input system was already deterministic with 1563 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1612/1612 places, 1612/1612 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 1562 transition count 1562
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 1562 transition count 1562
Applied a total of 100 rules in 96 ms. Remains 1562 /1612 variables (removed 50) and now considering 1562/1612 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98 ms. Remains : 1562/1612 places, 1562/1612 transitions.
[2023-03-20 21:57:53] [INFO ] Flatten gal took : 26 ms
[2023-03-20 21:57:53] [INFO ] Flatten gal took : 28 ms
[2023-03-20 21:57:53] [INFO ] Input system was already deterministic with 1562 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1612/1612 places, 1612/1612 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 443 transitions
Trivial Post-agglo rules discarded 443 transitions
Performed 443 trivial Post agglomeration. Transition count delta: 443
Iterating post reduction 0 with 443 rules applied. Total rules applied 443 place count 1611 transition count 1168
Reduce places removed 443 places and 0 transitions.
Iterating post reduction 1 with 443 rules applied. Total rules applied 886 place count 1168 transition count 1168
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 886 place count 1168 transition count 874
Deduced a syphon composed of 294 places in 1 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1474 place count 874 transition count 874
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 1513 place count 835 transition count 835
Iterating global reduction 2 with 39 rules applied. Total rules applied 1552 place count 835 transition count 835
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 1552 place count 835 transition count 803
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 1616 place count 803 transition count 803
Performed 318 Post agglomeration using F-continuation condition.Transition count delta: 318
Deduced a syphon composed of 318 places in 0 ms
Reduce places removed 318 places and 0 transitions.
Iterating global reduction 2 with 636 rules applied. Total rules applied 2252 place count 485 transition count 485
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2253 place count 485 transition count 484
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2255 place count 484 transition count 483
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2257 place count 482 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2258 place count 481 transition count 481
Applied a total of 2258 rules in 124 ms. Remains 481 /1612 variables (removed 1131) and now considering 481/1612 (removed 1131) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 125 ms. Remains : 481/1612 places, 481/1612 transitions.
[2023-03-20 21:57:53] [INFO ] Flatten gal took : 10 ms
[2023-03-20 21:57:53] [INFO ] Flatten gal took : 12 ms
[2023-03-20 21:57:53] [INFO ] Input system was already deterministic with 481 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1612/1612 places, 1612/1612 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 1566 transition count 1566
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 1566 transition count 1566
Applied a total of 92 rules in 106 ms. Remains 1566 /1612 variables (removed 46) and now considering 1566/1612 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 1566/1612 places, 1566/1612 transitions.
[2023-03-20 21:57:53] [INFO ] Flatten gal took : 28 ms
[2023-03-20 21:57:53] [INFO ] Flatten gal took : 29 ms
[2023-03-20 21:57:53] [INFO ] Input system was already deterministic with 1566 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1612/1612 places, 1612/1612 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 1561 transition count 1561
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 1561 transition count 1561
Applied a total of 102 rules in 98 ms. Remains 1561 /1612 variables (removed 51) and now considering 1561/1612 (removed 51) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98 ms. Remains : 1561/1612 places, 1561/1612 transitions.
[2023-03-20 21:57:53] [INFO ] Flatten gal took : 23 ms
[2023-03-20 21:57:53] [INFO ] Flatten gal took : 23 ms
[2023-03-20 21:57:53] [INFO ] Input system was already deterministic with 1561 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1612/1612 places, 1612/1612 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 1563 transition count 1563
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 1563 transition count 1563
Applied a total of 98 rules in 100 ms. Remains 1563 /1612 variables (removed 49) and now considering 1563/1612 (removed 49) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102 ms. Remains : 1563/1612 places, 1563/1612 transitions.
[2023-03-20 21:57:53] [INFO ] Flatten gal took : 22 ms
[2023-03-20 21:57:53] [INFO ] Flatten gal took : 23 ms
[2023-03-20 21:57:54] [INFO ] Input system was already deterministic with 1563 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1612/1612 places, 1612/1612 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 1565 transition count 1565
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 1565 transition count 1565
Applied a total of 94 rules in 98 ms. Remains 1565 /1612 variables (removed 47) and now considering 1565/1612 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99 ms. Remains : 1565/1612 places, 1565/1612 transitions.
[2023-03-20 21:57:54] [INFO ] Flatten gal took : 22 ms
[2023-03-20 21:57:54] [INFO ] Flatten gal took : 23 ms
[2023-03-20 21:57:54] [INFO ] Input system was already deterministic with 1565 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1612/1612 places, 1612/1612 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 1565 transition count 1565
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 1565 transition count 1565
Applied a total of 94 rules in 108 ms. Remains 1565 /1612 variables (removed 47) and now considering 1565/1612 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 ms. Remains : 1565/1612 places, 1565/1612 transitions.
[2023-03-20 21:57:54] [INFO ] Flatten gal took : 23 ms
[2023-03-20 21:57:54] [INFO ] Flatten gal took : 24 ms
[2023-03-20 21:57:54] [INFO ] Input system was already deterministic with 1565 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1612/1612 places, 1612/1612 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 1561 transition count 1561
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 1561 transition count 1561
Applied a total of 102 rules in 90 ms. Remains 1561 /1612 variables (removed 51) and now considering 1561/1612 (removed 51) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 1561/1612 places, 1561/1612 transitions.
[2023-03-20 21:57:54] [INFO ] Flatten gal took : 23 ms
[2023-03-20 21:57:54] [INFO ] Flatten gal took : 22 ms
[2023-03-20 21:57:54] [INFO ] Input system was already deterministic with 1561 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1612/1612 places, 1612/1612 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 1567 transition count 1567
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 1567 transition count 1567
Applied a total of 90 rules in 86 ms. Remains 1567 /1612 variables (removed 45) and now considering 1567/1612 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 1567/1612 places, 1567/1612 transitions.
[2023-03-20 21:57:54] [INFO ] Flatten gal took : 22 ms
[2023-03-20 21:57:54] [INFO ] Flatten gal took : 23 ms
[2023-03-20 21:57:54] [INFO ] Input system was already deterministic with 1567 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1612/1612 places, 1612/1612 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 1573 transition count 1573
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 1573 transition count 1573
Applied a total of 78 rules in 87 ms. Remains 1573 /1612 variables (removed 39) and now considering 1573/1612 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87 ms. Remains : 1573/1612 places, 1573/1612 transitions.
[2023-03-20 21:57:55] [INFO ] Flatten gal took : 22 ms
[2023-03-20 21:57:55] [INFO ] Flatten gal took : 23 ms
[2023-03-20 21:57:55] [INFO ] Input system was already deterministic with 1573 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1612/1612 places, 1612/1612 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 434 transitions
Trivial Post-agglo rules discarded 434 transitions
Performed 434 trivial Post agglomeration. Transition count delta: 434
Iterating post reduction 0 with 434 rules applied. Total rules applied 434 place count 1611 transition count 1177
Reduce places removed 434 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 435 rules applied. Total rules applied 869 place count 1177 transition count 1176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 870 place count 1176 transition count 1176
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 294 Pre rules applied. Total rules applied 870 place count 1176 transition count 882
Deduced a syphon composed of 294 places in 1 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 3 with 588 rules applied. Total rules applied 1458 place count 882 transition count 882
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 1491 place count 849 transition count 849
Iterating global reduction 3 with 33 rules applied. Total rules applied 1524 place count 849 transition count 849
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 1524 place count 849 transition count 820
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 1582 place count 820 transition count 820
Performed 322 Post agglomeration using F-continuation condition.Transition count delta: 322
Deduced a syphon composed of 322 places in 1 ms
Reduce places removed 322 places and 0 transitions.
Iterating global reduction 3 with 644 rules applied. Total rules applied 2226 place count 498 transition count 498
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2227 place count 498 transition count 497
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2229 place count 497 transition count 496
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 2231 place count 497 transition count 496
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2233 place count 495 transition count 494
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2234 place count 494 transition count 494
Applied a total of 2234 rules in 154 ms. Remains 494 /1612 variables (removed 1118) and now considering 494/1612 (removed 1118) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 154 ms. Remains : 494/1612 places, 494/1612 transitions.
[2023-03-20 21:57:55] [INFO ] Flatten gal took : 9 ms
[2023-03-20 21:57:55] [INFO ] Flatten gal took : 10 ms
[2023-03-20 21:57:55] [INFO ] Input system was already deterministic with 494 transitions.
[2023-03-20 21:57:55] [INFO ] Flatten gal took : 24 ms
[2023-03-20 21:57:55] [INFO ] Flatten gal took : 24 ms
[2023-03-20 21:57:55] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-20 21:57:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1612 places, 1612 transitions and 3944 arcs took 6 ms.
Total runtime 60006 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 1612 NrTr: 1612 NrArc: 3944)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.214sec

net check time: 0m 0.000sec

init dd package: 0m 3.316sec


before gc: list nodes free: 1818927

after gc: idd nodes used:44183196, unused:19816804; list nodes free:88479121

RS generation: 27m54.828sec


-> last computed set: #nodes 44181586 (4.4e+07) #states 117,690,893,362,092,721,593,215 (23)


CANNOT_COMPUTE


BK_STOP 1679351182955

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.006sec

idd.cc:820: DD Exception: No free nodes

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-040B"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is ShieldRVt-PT-040B, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r426-tajo-167905978800313"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-040B.tgz
mv ShieldRVt-PT-040B execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;