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

About the Execution of Marcie+red for JoinFreeModules-PT-0500

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15781.848 3600000.00 3688686.00 19986.40 ?T?T??TT???????F normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r234-tall-167856420000201.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is JoinFreeModules-PT-0500, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420000201
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.1K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Feb 25 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 11:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 5 18:22 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 JoinFreeModules-PT-0500-CTLCardinality-00
FORMULA_NAME JoinFreeModules-PT-0500-CTLCardinality-01
FORMULA_NAME JoinFreeModules-PT-0500-CTLCardinality-02
FORMULA_NAME JoinFreeModules-PT-0500-CTLCardinality-03
FORMULA_NAME JoinFreeModules-PT-0500-CTLCardinality-04
FORMULA_NAME JoinFreeModules-PT-0500-CTLCardinality-05
FORMULA_NAME JoinFreeModules-PT-0500-CTLCardinality-06
FORMULA_NAME JoinFreeModules-PT-0500-CTLCardinality-07
FORMULA_NAME JoinFreeModules-PT-0500-CTLCardinality-08
FORMULA_NAME JoinFreeModules-PT-0500-CTLCardinality-09
FORMULA_NAME JoinFreeModules-PT-0500-CTLCardinality-10
FORMULA_NAME JoinFreeModules-PT-0500-CTLCardinality-11
FORMULA_NAME JoinFreeModules-PT-0500-CTLCardinality-12
FORMULA_NAME JoinFreeModules-PT-0500-CTLCardinality-13
FORMULA_NAME JoinFreeModules-PT-0500-CTLCardinality-14
FORMULA_NAME JoinFreeModules-PT-0500-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679459395008

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=JoinFreeModules-PT-0500
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 04:29:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 04:29:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 04:29:56] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2023-03-22 04:29:56] [INFO ] Transformed 2501 places.
[2023-03-22 04:29:56] [INFO ] Transformed 4001 transitions.
[2023-03-22 04:29:56] [INFO ] Parsed PT model containing 2501 places and 4001 transitions and 11502 arcs in 275 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Initial state reduction rules removed 5 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0500-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0500-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0500-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0500-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0500-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 100 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 477 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-22 04:29:57] [INFO ] Computed 500 place invariants in 35 ms
[2023-03-22 04:29:59] [INFO ] Dead Transitions using invariants and state equation in 2216 ms found 0 transitions.
[2023-03-22 04:29:59] [INFO ] Invariant cache hit.
[2023-03-22 04:29:59] [INFO ] Implicit Places using invariants in 401 ms returned []
[2023-03-22 04:29:59] [INFO ] Invariant cache hit.
[2023-03-22 04:30:01] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 04:30:01] [INFO ] Implicit Places using invariants and state equation in 1816 ms returned []
Implicit Place search using SMT with State Equation took 2220 ms to find 0 implicit places.
[2023-03-22 04:30:01] [INFO ] Invariant cache hit.
[2023-03-22 04:30:03] [INFO ] Dead Transitions using invariants and state equation in 1835 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6778 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Support contains 100 out of 2500 places after structural reductions.
[2023-03-22 04:30:03] [INFO ] Flatten gal took : 215 ms
[2023-03-22 04:30:04] [INFO ] Flatten gal took : 133 ms
[2023-03-22 04:30:04] [INFO ] Input system was already deterministic with 4001 transitions.
Incomplete random walk after 10027 steps, including 2 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 59) seen :1
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 58) seen :0
Probabilistic random walk after 45174 steps, saw 45105 distinct states, run finished after 3040 ms. (steps per millisecond=14 ) properties seen :2
Running SMT prover for 56 properties.
[2023-03-22 04:30:08] [INFO ] Invariant cache hit.
[2023-03-22 04:30:11] [INFO ] After 2389ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:56
[2023-03-22 04:30:13] [INFO ] [Nat]Absence check using 500 positive place invariants in 87 ms returned sat
[2023-03-22 04:30:36] [INFO ] After 20765ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :56
[2023-03-22 04:30:36] [INFO ] State equation strengthened by 500 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-22 04:30:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 04:30:36] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:56
Fused 56 Parikh solutions to 28 different solutions.
Parikh walk visited 13 properties in 30017 ms.
Support contains 69 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 330 are kept as prefixes of interest. Removing 2170 places using SCC suffix rule.6 ms
Discarding 2170 places :
Also discarding 3472 output transitions
Drop transitions removed 3472 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 330 transition count 528
Applied a total of 2 rules in 44 ms. Remains 330 /2500 variables (removed 2170) and now considering 528/4001 (removed 3473) transitions.
// Phase 1: matrix 528 rows 330 cols
[2023-03-22 04:31:06] [INFO ] Computed 66 place invariants in 2 ms
[2023-03-22 04:31:06] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 274 ms. Remains : 330/2500 places, 528/4001 transitions.
Incomplete random walk after 10280 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=321 ) properties (out of 43) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) 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 39) seen :0
Running SMT prover for 39 properties.
[2023-03-22 04:31:06] [INFO ] Invariant cache hit.
[2023-03-22 04:31:07] [INFO ] [Real]Absence check using 66 positive place invariants in 10 ms returned sat
[2023-03-22 04:31:07] [INFO ] After 287ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:39
[2023-03-22 04:31:07] [INFO ] [Nat]Absence check using 66 positive place invariants in 9 ms returned sat
[2023-03-22 04:31:11] [INFO ] After 4113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :39
[2023-03-22 04:31:11] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-22 04:31:14] [INFO ] After 2923ms SMT Verify possible using 66 Read/Feed constraints in natural domain returned unsat :0 sat :39
[2023-03-22 04:31:14] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
[2023-03-22 04:31:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-22 04:31:17] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2023-03-22 04:31:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-22 04:31:18] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2023-03-22 04:31:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-22 04:31:18] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2023-03-22 04:31:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-22 04:31:19] [INFO ] After 7887ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :39
Attempting to minimize the solution found.
Minimization took 3683 ms.
[2023-03-22 04:31:23] [INFO ] After 16105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :39
Parikh walk visited 34 properties in 30398 ms.
Support contains 19 out of 330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 330/330 places, 528/528 transitions.
Graph (complete) has 792 edges and 330 vertex of which 95 are kept as prefixes of interest. Removing 235 places using SCC suffix rule.11 ms
Discarding 235 places :
Also discarding 376 output transitions
Drop transitions removed 376 transitions
Applied a total of 1 rules in 15 ms. Remains 95 /330 variables (removed 235) and now considering 152/528 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 95/330 places, 152/528 transitions.
[2023-03-22 04:31:53] [INFO ] Flatten gal took : 86 ms
[2023-03-22 04:31:53] [INFO ] Flatten gal took : 95 ms
[2023-03-22 04:31:54] [INFO ] Input system was already deterministic with 4001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 52 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-22 04:31:54] [INFO ] Computed 500 place invariants in 13 ms
[2023-03-22 04:31:56] [INFO ] Dead Transitions using invariants and state equation in 1767 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1825 ms. Remains : 2500/2500 places, 4001/4001 transitions.
[2023-03-22 04:31:56] [INFO ] Flatten gal took : 74 ms
[2023-03-22 04:31:56] [INFO ] Flatten gal took : 78 ms
[2023-03-22 04:31:56] [INFO ] Input system was already deterministic with 4001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 52 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 04:31:56] [INFO ] Invariant cache hit.
[2023-03-22 04:31:58] [INFO ] Dead Transitions using invariants and state equation in 1664 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1718 ms. Remains : 2500/2500 places, 4001/4001 transitions.
[2023-03-22 04:31:58] [INFO ] Flatten gal took : 92 ms
[2023-03-22 04:31:58] [INFO ] Flatten gal took : 73 ms
[2023-03-22 04:31:58] [INFO ] Input system was already deterministic with 4001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 51 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 04:31:58] [INFO ] Invariant cache hit.
[2023-03-22 04:32:00] [INFO ] Dead Transitions using invariants and state equation in 1725 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1777 ms. Remains : 2500/2500 places, 4001/4001 transitions.
[2023-03-22 04:32:00] [INFO ] Flatten gal took : 69 ms
[2023-03-22 04:32:00] [INFO ] Flatten gal took : 79 ms
[2023-03-22 04:32:00] [INFO ] Input system was already deterministic with 4001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 56 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 04:32:00] [INFO ] Invariant cache hit.
[2023-03-22 04:32:02] [INFO ] Dead Transitions using invariants and state equation in 1688 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1745 ms. Remains : 2500/2500 places, 4001/4001 transitions.
[2023-03-22 04:32:02] [INFO ] Flatten gal took : 70 ms
[2023-03-22 04:32:02] [INFO ] Flatten gal took : 71 ms
[2023-03-22 04:32:02] [INFO ] Input system was already deterministic with 4001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 51 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 04:32:02] [INFO ] Invariant cache hit.
[2023-03-22 04:32:04] [INFO ] Dead Transitions using invariants and state equation in 1678 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1730 ms. Remains : 2500/2500 places, 4001/4001 transitions.
[2023-03-22 04:32:04] [INFO ] Flatten gal took : 69 ms
[2023-03-22 04:32:04] [INFO ] Flatten gal took : 72 ms
[2023-03-22 04:32:04] [INFO ] Input system was already deterministic with 4001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 48 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 04:32:04] [INFO ] Invariant cache hit.
[2023-03-22 04:32:06] [INFO ] Dead Transitions using invariants and state equation in 1749 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1797 ms. Remains : 2500/2500 places, 4001/4001 transitions.
[2023-03-22 04:32:06] [INFO ] Flatten gal took : 68 ms
[2023-03-22 04:32:06] [INFO ] Flatten gal took : 64 ms
[2023-03-22 04:32:06] [INFO ] Input system was already deterministic with 4001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 48 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 04:32:06] [INFO ] Invariant cache hit.
[2023-03-22 04:32:08] [INFO ] Dead Transitions using invariants and state equation in 1672 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1721 ms. Remains : 2500/2500 places, 4001/4001 transitions.
[2023-03-22 04:32:08] [INFO ] Flatten gal took : 64 ms
[2023-03-22 04:32:08] [INFO ] Flatten gal took : 67 ms
[2023-03-22 04:32:08] [INFO ] Input system was already deterministic with 4001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 47 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 04:32:08] [INFO ] Invariant cache hit.
[2023-03-22 04:32:10] [INFO ] Dead Transitions using invariants and state equation in 1686 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1734 ms. Remains : 2500/2500 places, 4001/4001 transitions.
[2023-03-22 04:32:10] [INFO ] Flatten gal took : 67 ms
[2023-03-22 04:32:10] [INFO ] Flatten gal took : 65 ms
[2023-03-22 04:32:10] [INFO ] Input system was already deterministic with 4001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 48 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 04:32:10] [INFO ] Invariant cache hit.
[2023-03-22 04:32:12] [INFO ] Dead Transitions using invariants and state equation in 1694 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1743 ms. Remains : 2500/2500 places, 4001/4001 transitions.
[2023-03-22 04:32:12] [INFO ] Flatten gal took : 63 ms
[2023-03-22 04:32:12] [INFO ] Flatten gal took : 68 ms
[2023-03-22 04:32:12] [INFO ] Input system was already deterministic with 4001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 48 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 04:32:12] [INFO ] Invariant cache hit.
[2023-03-22 04:32:14] [INFO ] Dead Transitions using invariants and state equation in 1674 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1723 ms. Remains : 2500/2500 places, 4001/4001 transitions.
[2023-03-22 04:32:14] [INFO ] Flatten gal took : 62 ms
[2023-03-22 04:32:14] [INFO ] Flatten gal took : 64 ms
[2023-03-22 04:32:14] [INFO ] Input system was already deterministic with 4001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 48 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 04:32:14] [INFO ] Invariant cache hit.
[2023-03-22 04:32:16] [INFO ] Dead Transitions using invariants and state equation in 1721 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1769 ms. Remains : 2500/2500 places, 4001/4001 transitions.
[2023-03-22 04:32:16] [INFO ] Flatten gal took : 63 ms
[2023-03-22 04:32:16] [INFO ] Flatten gal took : 71 ms
[2023-03-22 04:32:16] [INFO ] Input system was already deterministic with 4001 transitions.
[2023-03-22 04:32:16] [INFO ] Flatten gal took : 64 ms
[2023-03-22 04:32:16] [INFO ] Flatten gal took : 71 ms
[2023-03-22 04:32:16] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-22 04:32:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2500 places, 4001 transitions and 11500 arcs took 17 ms.
Total runtime 140612 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: 2500 NrTr: 4001 NrArc: 11500)

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

net check time: 0m 0.001sec

init dd package: 0m 2.766sec


before gc: list nodes free: 494674

after gc: idd nodes used:29667, unused:63970333; list nodes free:637752248

before gc: list nodes free: 1470542

after gc: idd nodes used:52225, unused:63947775; list nodes free:641328913

before gc: list nodes free: 113622035

after gc: idd nodes used:75353, unused:63924647; list nodes free:631773951

before gc: list nodes free: 270287112

after gc: idd nodes used:93984, unused:63906016; list nodes free:623886598

before gc: list nodes free: 262973601

after gc: idd nodes used:111065, unused:63888935; list nodes free:617064681

before gc: list nodes free: 256365646

after gc: idd nodes used:130660, unused:63869340; list nodes free:609025228

before gc: list nodes free: 243859540

after gc: idd nodes used:148832, unused:63851168; list nodes free:601515466

before gc: list nodes free: 236953306

after gc: idd nodes used:169559, unused:63830441; list nodes free:592760227

before gc: list nodes free: 228054868

after gc: idd nodes used:188873, unused:63811127; list nodes free:584938301

before gc: list nodes free: 218475542

after gc: idd nodes used:208836, unused:63791164; list nodes free:576771570

before gc: list nodes free: 208130742

after gc: idd nodes used:229500, unused:63770500; list nodes free:568122025
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 359956 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16088628 kB

BK_TIME_CONFINEMENT_REACHED

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

33786 62971 87071 109544 132017 154492 176965 199439 221912 244385

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="JoinFreeModules-PT-0500"
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 JoinFreeModules-PT-0500, 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 r234-tall-167856420000201"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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