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-167905978800345.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-100B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978800345
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 7.2K Feb 25 23:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 23:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 23:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 23:00 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.4K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 23:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 23:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 23:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 25 23:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:05 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 1.3M 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-100B-CTLCardinality-00
FORMULA_NAME ShieldRVt-PT-100B-CTLCardinality-01
FORMULA_NAME ShieldRVt-PT-100B-CTLCardinality-02
FORMULA_NAME ShieldRVt-PT-100B-CTLCardinality-03
FORMULA_NAME ShieldRVt-PT-100B-CTLCardinality-04
FORMULA_NAME ShieldRVt-PT-100B-CTLCardinality-05
FORMULA_NAME ShieldRVt-PT-100B-CTLCardinality-06
FORMULA_NAME ShieldRVt-PT-100B-CTLCardinality-07
FORMULA_NAME ShieldRVt-PT-100B-CTLCardinality-08
FORMULA_NAME ShieldRVt-PT-100B-CTLCardinality-09
FORMULA_NAME ShieldRVt-PT-100B-CTLCardinality-10
FORMULA_NAME ShieldRVt-PT-100B-CTLCardinality-11
FORMULA_NAME ShieldRVt-PT-100B-CTLCardinality-12
FORMULA_NAME ShieldRVt-PT-100B-CTLCardinality-13
FORMULA_NAME ShieldRVt-PT-100B-CTLCardinality-14
FORMULA_NAME ShieldRVt-PT-100B-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679350597027

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-100B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 22:16:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 22:16:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 22:16:39] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2023-03-20 22:16:39] [INFO ] Transformed 5003 places.
[2023-03-20 22:16:39] [INFO ] Transformed 5003 transitions.
[2023-03-20 22:16:39] [INFO ] Found NUPN structural information;
[2023-03-20 22:16:39] [INFO ] Parsed PT model containing 5003 places and 5003 transitions and 11806 arcs in 420 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Support contains 128 out of 5003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5003/5003 places, 5003/5003 transitions.
Discarding 1055 places :
Symmetric choice reduction at 0 with 1055 rule applications. Total rules 1055 place count 3948 transition count 3948
Iterating global reduction 0 with 1055 rules applied. Total rules applied 2110 place count 3948 transition count 3948
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2111 place count 3947 transition count 3947
Iterating global reduction 0 with 1 rules applied. Total rules applied 2112 place count 3947 transition count 3947
Applied a total of 2112 rules in 1551 ms. Remains 3947 /5003 variables (removed 1056) and now considering 3947/5003 (removed 1056) transitions.
// Phase 1: matrix 3947 rows 3947 cols
[2023-03-20 22:16:41] [INFO ] Computed 401 place invariants in 86 ms
[2023-03-20 22:16:43] [INFO ] Implicit Places using invariants in 1754 ms returned []
[2023-03-20 22:16:43] [INFO ] Invariant cache hit.
[2023-03-20 22:16:45] [INFO ] Implicit Places using invariants and state equation in 2520 ms returned []
Implicit Place search using SMT with State Equation took 4308 ms to find 0 implicit places.
[2023-03-20 22:16:45] [INFO ] Invariant cache hit.
[2023-03-20 22:16:48] [INFO ] Dead Transitions using invariants and state equation in 2835 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3947/5003 places, 3947/5003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8702 ms. Remains : 3947/5003 places, 3947/5003 transitions.
Support contains 128 out of 3947 places after structural reductions.
[2023-03-20 22:16:49] [INFO ] Flatten gal took : 237 ms
[2023-03-20 22:16:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-20 22:16:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldRVt-PT-100B-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 22:16:49] [INFO ] Flatten gal took : 140 ms
[2023-03-20 22:16:49] [INFO ] Input system was already deterministic with 3947 transitions.
Support contains 112 out of 3947 places (down from 128) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 656 ms. (steps per millisecond=15 ) properties (out of 60) seen :27
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) seen :0
Running SMT prover for 33 properties.
[2023-03-20 22:16:50] [INFO ] Invariant cache hit.
[2023-03-20 22:16:53] [INFO ] After 3145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:33
[2023-03-20 22:16:57] [INFO ] [Nat]Absence check using 401 positive place invariants in 215 ms returned sat
[2023-03-20 22:17:11] [INFO ] After 11391ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :32
[2023-03-20 22:17:12] [INFO ] Deduced a trap composed of 56 places in 1165 ms of which 9 ms to minimize.
[2023-03-20 22:17:13] [INFO ] Deduced a trap composed of 57 places in 1002 ms of which 2 ms to minimize.
[2023-03-20 22:17:14] [INFO ] Deduced a trap composed of 111 places in 921 ms of which 4 ms to minimize.
[2023-03-20 22:17:16] [INFO ] Deduced a trap composed of 107 places in 962 ms of which 3 ms to minimize.
[2023-03-20 22:17:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 4967 ms
[2023-03-20 22:17:17] [INFO ] Deduced a trap composed of 30 places in 986 ms of which 3 ms to minimize.
[2023-03-20 22:17:18] [INFO ] Deduced a trap composed of 26 places in 869 ms of which 2 ms to minimize.
[2023-03-20 22:17:19] [INFO ] Deduced a trap composed of 22 places in 930 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
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 22:17:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 22:17:19] [INFO ] After 25967ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:33
Fused 33 Parikh solutions to 32 different solutions.
Parikh walk visited 0 properties in 6896 ms.
Support contains 67 out of 3947 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3947/3947 places, 3947/3947 transitions.
Drop transitions removed 1054 transitions
Trivial Post-agglo rules discarded 1054 transitions
Performed 1054 trivial Post agglomeration. Transition count delta: 1054
Iterating post reduction 0 with 1054 rules applied. Total rules applied 1054 place count 3947 transition count 2893
Reduce places removed 1054 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 1066 rules applied. Total rules applied 2120 place count 2893 transition count 2881
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 2132 place count 2881 transition count 2881
Performed 762 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 762 Pre rules applied. Total rules applied 2132 place count 2881 transition count 2119
Deduced a syphon composed of 762 places in 12 ms
Reduce places removed 762 places and 0 transitions.
Iterating global reduction 3 with 1524 rules applied. Total rules applied 3656 place count 2119 transition count 2119
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 3673 place count 2102 transition count 2102
Iterating global reduction 3 with 17 rules applied. Total rules applied 3690 place count 2102 transition count 2102
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 3690 place count 2102 transition count 2089
Deduced a syphon composed of 13 places in 27 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 3716 place count 2089 transition count 2089
Performed 905 Post agglomeration using F-continuation condition.Transition count delta: 905
Deduced a syphon composed of 905 places in 3 ms
Reduce places removed 905 places and 0 transitions.
Iterating global reduction 3 with 1810 rules applied. Total rules applied 5526 place count 1184 transition count 1184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5527 place count 1184 transition count 1183
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 5529 place count 1183 transition count 1182
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -90
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5731 place count 1082 transition count 1272
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5933 place count 981 transition count 1363
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: -69
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 6081 place count 907 transition count 1432
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6082 place count 907 transition count 1431
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 6088 place count 907 transition count 1425
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 6094 place count 901 transition count 1425
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 6100 place count 901 transition count 1419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 6101 place count 900 transition count 1418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 6102 place count 899 transition count 1418
Applied a total of 6102 rules in 1643 ms. Remains 899 /3947 variables (removed 3048) and now considering 1418/3947 (removed 2529) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1643 ms. Remains : 899/3947 places, 1418/3947 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 699 ms. (steps per millisecond=14 ) properties (out of 32) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) 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 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 29) 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 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) 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 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) 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 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) 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 29) 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 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 29) 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 29) 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 29) 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 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) 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 29) seen :0
Running SMT prover for 29 properties.
// Phase 1: matrix 1418 rows 899 cols
[2023-03-20 22:17:29] [INFO ] Computed 400 place invariants in 4 ms
[2023-03-20 22:17:29] [INFO ] After 413ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:29
[2023-03-20 22:17:30] [INFO ] [Nat]Absence check using 400 positive place invariants in 89 ms returned sat
[2023-03-20 22:17:32] [INFO ] After 2003ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :29
[2023-03-20 22:17:32] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-20 22:17:34] [INFO ] After 1718ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :29
[2023-03-20 22:17:34] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 1 ms to minimize.
[2023-03-20 22:17:34] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 0 ms to minimize.
[2023-03-20 22:17:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 292 ms
[2023-03-20 22:17:34] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2023-03-20 22:17:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2023-03-20 22:17:35] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2023-03-20 22:17:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-03-20 22:17:37] [INFO ] After 4563ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :29
Attempting to minimize the solution found.
Minimization took 1154 ms.
[2023-03-20 22:17:38] [INFO ] After 8614ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :29
Fused 29 Parikh solutions to 28 different solutions.
Parikh walk visited 0 properties in 1444 ms.
Support contains 63 out of 899 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 899/899 places, 1418/1418 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 899 transition count 1416
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 897 transition count 1416
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 897 transition count 1414
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 8 place count 895 transition count 1414
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 894 transition count 1416
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 893 transition count 1415
Applied a total of 11 rules in 77 ms. Remains 893 /899 variables (removed 6) and now considering 1415/1418 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 893/899 places, 1415/1418 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) seen :0
Interrupted probabilistic random walk after 76904 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76904 steps, saw 63596 distinct states, run finished after 3004 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 29 properties.
// Phase 1: matrix 1415 rows 893 cols
[2023-03-20 22:17:43] [INFO ] Computed 400 place invariants in 4 ms
[2023-03-20 22:17:43] [INFO ] After 328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:29
[2023-03-20 22:17:44] [INFO ] [Nat]Absence check using 400 positive place invariants in 58 ms returned sat
[2023-03-20 22:17:45] [INFO ] After 1287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :29
[2023-03-20 22:17:45] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-20 22:17:48] [INFO ] After 2887ms SMT Verify possible using 52 Read/Feed constraints in natural domain returned unsat :0 sat :29
[2023-03-20 22:17:48] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2023-03-20 22:17:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2023-03-20 22:17:49] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2023-03-20 22:17:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2023-03-20 22:17:51] [INFO ] After 5571ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :29
Attempting to minimize the solution found.
Minimization took 1097 ms.
[2023-03-20 22:17:52] [INFO ] After 8579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :29
Fused 29 Parikh solutions to 27 different solutions.
Parikh walk visited 0 properties in 1208 ms.
Support contains 63 out of 893 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 893/893 places, 1415/1415 transitions.
Applied a total of 0 rules in 24 ms. Remains 893 /893 variables (removed 0) and now considering 1415/1415 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 893/893 places, 1415/1415 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 893/893 places, 1415/1415 transitions.
Applied a total of 0 rules in 24 ms. Remains 893 /893 variables (removed 0) and now considering 1415/1415 (removed 0) transitions.
[2023-03-20 22:17:53] [INFO ] Invariant cache hit.
[2023-03-20 22:17:54] [INFO ] Implicit Places using invariants in 654 ms returned []
[2023-03-20 22:17:54] [INFO ] Invariant cache hit.
[2023-03-20 22:17:54] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-20 22:17:55] [INFO ] Implicit Places using invariants and state equation in 1303 ms returned []
Implicit Place search using SMT with State Equation took 1961 ms to find 0 implicit places.
[2023-03-20 22:17:55] [INFO ] Redundant transitions in 87 ms returned []
[2023-03-20 22:17:55] [INFO ] Invariant cache hit.
[2023-03-20 22:17:56] [INFO ] Dead Transitions using invariants and state equation in 734 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2818 ms. Remains : 893/893 places, 1415/1415 transitions.
Graph (trivial) has 333 edges and 893 vertex of which 4 / 893 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 2941 edges and 891 vertex of which 889 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 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 330 edges and 887 vertex of which 4 / 887 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 885 transition count 1406
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 329 edges and 883 vertex of which 6 / 883 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 880 transition count 1397
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 327 edges and 877 vertex of which 8 / 877 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 873 transition count 1386
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 323 edges and 869 vertex of which 8 / 869 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 865 transition count 1372
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 319 edges and 861 vertex of which 8 / 861 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 857 transition count 1358
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 315 edges and 853 vertex of which 8 / 853 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 849 transition count 1344
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 311 edges and 845 vertex of which 8 / 845 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 841 transition count 1330
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 307 edges and 837 vertex of which 6 / 837 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 130 place count 834 transition count 1316
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 304 edges and 831 vertex of which 4 / 831 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 829 transition count 1306
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (trivial) has 301 edges and 827 vertex of which 2 / 827 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 11 rules applied. Total rules applied 155 place count 826 transition count 1298
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.
Graph (trivial) has 300 edges and 825 vertex of which 2 / 825 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 5 rules applied. Total rules applied 160 place count 824 transition count 1295
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 2700 edges and 823 vertex of which 817 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 7 rules applied. Total rules applied 167 place count 817 transition count 1283
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 167 place count 817 transition count 1282
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 170 place count 815 transition count 1282
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 12 with 3 rules applied. Total rules applied 173 place count 813 transition count 1281
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 177 place count 813 transition count 1277
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 13 with 24 rules applied. Total rules applied 201 place count 813 transition count 1253
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 13 with 6 rules applied. Total rules applied 207 place count 813 transition count 1253
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 13 with 6 rules applied. Total rules applied 213 place count 813 transition count 1247
Applied a total of 213 rules in 198 ms. Remains 813 /893 variables (removed 80) and now considering 1247/1415 (removed 168) transitions.
Running SMT prover for 29 properties.
// Phase 1: matrix 1247 rows 813 cols
[2023-03-20 22:17:56] [INFO ] Computed 360 place invariants in 9 ms
[2023-03-20 22:17:57] [INFO ] After 488ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:29
[2023-03-20 22:17:57] [INFO ] [Nat]Absence check using 360 positive place invariants in 44 ms returned sat
[2023-03-20 22:17:59] [INFO ] After 1246ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :29
[2023-03-20 22:17:59] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2023-03-20 22:17:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-20 22:18:00] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2023-03-20 22:18:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2023-03-20 22:18:00] [INFO ] After 2890ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :29
Attempting to minimize the solution found.
Minimization took 761 ms.
[2023-03-20 22:18:01] [INFO ] After 4368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :29
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2023-03-20 22:18:01] [INFO ] Flatten gal took : 85 ms
[2023-03-20 22:18:01] [INFO ] Flatten gal took : 98 ms
[2023-03-20 22:18:02] [INFO ] Input system was already deterministic with 3947 transitions.
Computed a total of 1208 stabilizing places and 1208 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 3947/3947 places, 3947/3947 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 3903 transition count 3903
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 3903 transition count 3903
Applied a total of 88 rules in 711 ms. Remains 3903 /3947 variables (removed 44) and now considering 3903/3947 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 712 ms. Remains : 3903/3947 places, 3903/3947 transitions.
[2023-03-20 22:18:02] [INFO ] Flatten gal took : 73 ms
[2023-03-20 22:18:03] [INFO ] Flatten gal took : 76 ms
[2023-03-20 22:18:03] [INFO ] Input system was already deterministic with 3903 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3947/3947 places, 3947/3947 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1089 transitions
Trivial Post-agglo rules discarded 1089 transitions
Performed 1089 trivial Post agglomeration. Transition count delta: 1089
Iterating post reduction 0 with 1089 rules applied. Total rules applied 1089 place count 3946 transition count 2857
Reduce places removed 1089 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1091 rules applied. Total rules applied 2180 place count 2857 transition count 2855
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2182 place count 2855 transition count 2855
Performed 779 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 779 Pre rules applied. Total rules applied 2182 place count 2855 transition count 2076
Deduced a syphon composed of 779 places in 6 ms
Reduce places removed 779 places and 0 transitions.
Iterating global reduction 3 with 1558 rules applied. Total rules applied 3740 place count 2076 transition count 2076
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 3766 place count 2050 transition count 2050
Iterating global reduction 3 with 26 rules applied. Total rules applied 3792 place count 2050 transition count 2050
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 3792 place count 2050 transition count 2030
Deduced a syphon composed of 20 places in 10 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 3832 place count 2030 transition count 2030
Performed 807 Post agglomeration using F-continuation condition.Transition count delta: 807
Deduced a syphon composed of 807 places in 1 ms
Reduce places removed 807 places and 0 transitions.
Iterating global reduction 3 with 1614 rules applied. Total rules applied 5446 place count 1223 transition count 1223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5447 place count 1223 transition count 1222
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 5449 place count 1222 transition count 1221
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5451 place count 1220 transition count 1219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5452 place count 1219 transition count 1219
Applied a total of 5452 rules in 907 ms. Remains 1219 /3947 variables (removed 2728) and now considering 1219/3947 (removed 2728) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 908 ms. Remains : 1219/3947 places, 1219/3947 transitions.
[2023-03-20 22:18:04] [INFO ] Flatten gal took : 26 ms
[2023-03-20 22:18:04] [INFO ] Flatten gal took : 28 ms
[2023-03-20 22:18:04] [INFO ] Input system was already deterministic with 1219 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3947/3947 places, 3947/3947 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1092 transitions
Trivial Post-agglo rules discarded 1092 transitions
Performed 1092 trivial Post agglomeration. Transition count delta: 1092
Iterating post reduction 0 with 1092 rules applied. Total rules applied 1092 place count 3946 transition count 2854
Reduce places removed 1092 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1093 rules applied. Total rules applied 2185 place count 2854 transition count 2853
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2186 place count 2853 transition count 2853
Performed 772 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 772 Pre rules applied. Total rules applied 2186 place count 2853 transition count 2081
Deduced a syphon composed of 772 places in 6 ms
Reduce places removed 772 places and 0 transitions.
Iterating global reduction 3 with 1544 rules applied. Total rules applied 3730 place count 2081 transition count 2081
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 3761 place count 2050 transition count 2050
Iterating global reduction 3 with 31 rules applied. Total rules applied 3792 place count 2050 transition count 2050
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 3792 place count 2050 transition count 2025
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 3842 place count 2025 transition count 2025
Performed 802 Post agglomeration using F-continuation condition.Transition count delta: 802
Deduced a syphon composed of 802 places in 1 ms
Reduce places removed 802 places and 0 transitions.
Iterating global reduction 3 with 1604 rules applied. Total rules applied 5446 place count 1223 transition count 1223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5447 place count 1223 transition count 1222
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 5449 place count 1222 transition count 1221
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 5450 place count 1222 transition count 1221
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5452 place count 1220 transition count 1219
Applied a total of 5452 rules in 711 ms. Remains 1220 /3947 variables (removed 2727) and now considering 1219/3947 (removed 2728) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 713 ms. Remains : 1220/3947 places, 1219/3947 transitions.
[2023-03-20 22:18:05] [INFO ] Flatten gal took : 47 ms
[2023-03-20 22:18:05] [INFO ] Flatten gal took : 42 ms
[2023-03-20 22:18:05] [INFO ] Input system was already deterministic with 1219 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3947/3947 places, 3947/3947 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 3902 transition count 3902
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 3902 transition count 3902
Applied a total of 90 rules in 585 ms. Remains 3902 /3947 variables (removed 45) and now considering 3902/3947 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 586 ms. Remains : 3902/3947 places, 3902/3947 transitions.
[2023-03-20 22:18:05] [INFO ] Flatten gal took : 64 ms
[2023-03-20 22:18:05] [INFO ] Flatten gal took : 66 ms
[2023-03-20 22:18:06] [INFO ] Input system was already deterministic with 3902 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3947/3947 places, 3947/3947 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 3903 transition count 3903
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 3903 transition count 3903
Applied a total of 88 rules in 632 ms. Remains 3903 /3947 variables (removed 44) and now considering 3903/3947 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 634 ms. Remains : 3903/3947 places, 3903/3947 transitions.
[2023-03-20 22:18:06] [INFO ] Flatten gal took : 60 ms
[2023-03-20 22:18:06] [INFO ] Flatten gal took : 63 ms
[2023-03-20 22:18:06] [INFO ] Input system was already deterministic with 3903 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3947/3947 places, 3947/3947 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 3902 transition count 3902
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 3902 transition count 3902
Applied a total of 90 rules in 569 ms. Remains 3902 /3947 variables (removed 45) and now considering 3902/3947 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 572 ms. Remains : 3902/3947 places, 3902/3947 transitions.
[2023-03-20 22:18:07] [INFO ] Flatten gal took : 57 ms
[2023-03-20 22:18:07] [INFO ] Flatten gal took : 59 ms
[2023-03-20 22:18:07] [INFO ] Input system was already deterministic with 3902 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3947/3947 places, 3947/3947 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 3903 transition count 3903
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 3903 transition count 3903
Applied a total of 88 rules in 666 ms. Remains 3903 /3947 variables (removed 44) and now considering 3903/3947 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 667 ms. Remains : 3903/3947 places, 3903/3947 transitions.
[2023-03-20 22:18:08] [INFO ] Flatten gal took : 57 ms
[2023-03-20 22:18:08] [INFO ] Flatten gal took : 60 ms
[2023-03-20 22:18:08] [INFO ] Input system was already deterministic with 3903 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3947/3947 places, 3947/3947 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 3902 transition count 3902
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 3902 transition count 3902
Applied a total of 90 rules in 543 ms. Remains 3902 /3947 variables (removed 45) and now considering 3902/3947 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 547 ms. Remains : 3902/3947 places, 3902/3947 transitions.
[2023-03-20 22:18:09] [INFO ] Flatten gal took : 56 ms
[2023-03-20 22:18:09] [INFO ] Flatten gal took : 58 ms
[2023-03-20 22:18:09] [INFO ] Input system was already deterministic with 3902 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3947/3947 places, 3947/3947 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 3902 transition count 3902
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 3902 transition count 3902
Applied a total of 90 rules in 554 ms. Remains 3902 /3947 variables (removed 45) and now considering 3902/3947 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 555 ms. Remains : 3902/3947 places, 3902/3947 transitions.
[2023-03-20 22:18:10] [INFO ] Flatten gal took : 54 ms
[2023-03-20 22:18:10] [INFO ] Flatten gal took : 55 ms
[2023-03-20 22:18:10] [INFO ] Input system was already deterministic with 3902 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3947/3947 places, 3947/3947 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 3905 transition count 3905
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 3905 transition count 3905
Applied a total of 84 rules in 706 ms. Remains 3905 /3947 variables (removed 42) and now considering 3905/3947 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 707 ms. Remains : 3905/3947 places, 3905/3947 transitions.
[2023-03-20 22:18:11] [INFO ] Flatten gal took : 55 ms
[2023-03-20 22:18:11] [INFO ] Flatten gal took : 58 ms
[2023-03-20 22:18:11] [INFO ] Input system was already deterministic with 3905 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3947/3947 places, 3947/3947 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 3904 transition count 3904
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 3904 transition count 3904
Applied a total of 86 rules in 585 ms. Remains 3904 /3947 variables (removed 43) and now considering 3904/3947 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 586 ms. Remains : 3904/3947 places, 3904/3947 transitions.
[2023-03-20 22:18:12] [INFO ] Flatten gal took : 52 ms
[2023-03-20 22:18:12] [INFO ] Flatten gal took : 55 ms
[2023-03-20 22:18:12] [INFO ] Input system was already deterministic with 3904 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3947/3947 places, 3947/3947 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1099 transitions
Trivial Post-agglo rules discarded 1099 transitions
Performed 1099 trivial Post agglomeration. Transition count delta: 1099
Iterating post reduction 0 with 1099 rules applied. Total rules applied 1099 place count 3946 transition count 2847
Reduce places removed 1099 places and 0 transitions.
Iterating post reduction 1 with 1099 rules applied. Total rules applied 2198 place count 2847 transition count 2847
Performed 776 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 776 Pre rules applied. Total rules applied 2198 place count 2847 transition count 2071
Deduced a syphon composed of 776 places in 5 ms
Reduce places removed 776 places and 0 transitions.
Iterating global reduction 2 with 1552 rules applied. Total rules applied 3750 place count 2071 transition count 2071
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 3781 place count 2040 transition count 2040
Iterating global reduction 2 with 31 rules applied. Total rules applied 3812 place count 2040 transition count 2040
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 3812 place count 2040 transition count 2016
Deduced a syphon composed of 24 places in 4 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 3860 place count 2016 transition count 2016
Performed 800 Post agglomeration using F-continuation condition.Transition count delta: 800
Deduced a syphon composed of 800 places in 0 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 5460 place count 1216 transition count 1216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5461 place count 1216 transition count 1215
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 3 with 2 rules applied. Total rules applied 5463 place count 1215 transition count 1214
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5465 place count 1213 transition count 1212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5466 place count 1212 transition count 1212
Applied a total of 5466 rules in 538 ms. Remains 1212 /3947 variables (removed 2735) and now considering 1212/3947 (removed 2735) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 538 ms. Remains : 1212/3947 places, 1212/3947 transitions.
[2023-03-20 22:18:12] [INFO ] Flatten gal took : 21 ms
[2023-03-20 22:18:12] [INFO ] Flatten gal took : 22 ms
[2023-03-20 22:18:12] [INFO ] Input system was already deterministic with 1212 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3947/3947 places, 3947/3947 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 3903 transition count 3903
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 3903 transition count 3903
Applied a total of 88 rules in 579 ms. Remains 3903 /3947 variables (removed 44) and now considering 3903/3947 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 580 ms. Remains : 3903/3947 places, 3903/3947 transitions.
[2023-03-20 22:18:13] [INFO ] Flatten gal took : 52 ms
[2023-03-20 22:18:13] [INFO ] Flatten gal took : 55 ms
[2023-03-20 22:18:13] [INFO ] Input system was already deterministic with 3903 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3947/3947 places, 3947/3947 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 3902 transition count 3902
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 3902 transition count 3902
Applied a total of 90 rules in 590 ms. Remains 3902 /3947 variables (removed 45) and now considering 3902/3947 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 595 ms. Remains : 3902/3947 places, 3902/3947 transitions.
[2023-03-20 22:18:14] [INFO ] Flatten gal took : 56 ms
[2023-03-20 22:18:14] [INFO ] Flatten gal took : 58 ms
[2023-03-20 22:18:14] [INFO ] Input system was already deterministic with 3902 transitions.
[2023-03-20 22:18:14] [INFO ] Flatten gal took : 58 ms
[2023-03-20 22:18:14] [INFO ] Flatten gal took : 67 ms
[2023-03-20 22:18:14] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-20 22:18:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3947 places, 3947 transitions and 9694 arcs took 14 ms.
Total runtime 95575 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: 3947 NrTr: 3947 NrArc: 9694)

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

net check time: 0m 0.003sec

init dd package: 0m 3.484sec


before gc: list nodes free: 1036146

after gc: idd nodes used:45099094, unused:18900906; list nodes free:80681886

RS generation: 28m 4.676sec


-> last computed set: #nodes 45095149 (4.5e+07) #states 38,009,927,549,751,878,086,589 (22)


CANNOT_COMPUTE


BK_STOP 1679352417943

--------------------
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.044sec

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-100B"
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-100B, 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-167905978800345"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-100B.tgz
mv ShieldRVt-PT-100B 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 ;