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.r043-tajo-167813697200686.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 smartxred
Input is CANConstruction-PT-090, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697200686
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 7.3K Feb 25 22:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 25 22:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 22:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 25 22:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 22:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 22:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 25 22:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Feb 25 22:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 12M 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 CANConstruction-PT-090-ReachabilityCardinality-00
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-01
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-02
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-03
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-04
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-05
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-06
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-07
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-08
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-09
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-10
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-11
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-12
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-13
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-14
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678799855440

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-090
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 13:17:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 13:17:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 13:17:37] [INFO ] Load time of PNML (sax parser for PT used): 507 ms
[2023-03-14 13:17:37] [INFO ] Transformed 17282 places.
[2023-03-14 13:17:37] [INFO ] Transformed 33120 transitions.
[2023-03-14 13:17:37] [INFO ] Parsed PT model containing 17282 places and 33120 transitions and 99000 arcs in 725 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 6 resets, run finished after 684 ms. (steps per millisecond=14 ) properties (out of 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) seen :0
Interrupted probabilistic random walk after 68734 steps, run timeout after 3002 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68734 steps, saw 67741 distinct states, run finished after 3008 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 33120 rows 17282 cols
[2023-03-14 13:17:42] [INFO ] Computed 181 place invariants in 472 ms
[2023-03-14 13:17:49] [INFO ] [Real]Absence check using 91 positive place invariants in 417 ms returned sat
[2023-03-14 13:17:49] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 184 ms returned sat
[2023-03-14 13:17:50] [INFO ] After 7642ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-14 13:17:56] [INFO ] [Nat]Absence check using 91 positive place invariants in 372 ms returned sat
[2023-03-14 13:17:56] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 153 ms returned sat
[2023-03-14 13:18:15] [INFO ] After 15025ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :11
[2023-03-14 13:18:15] [INFO ] State equation strengthened by 16110 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.Application.startNoEx(Application.java:902)
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-14 13:18:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 13:18:15] [INFO ] After 25293ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:16
FORMULA CANConstruction-PT-090-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANConstruction-PT-090-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANConstruction-PT-090-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANConstruction-PT-090-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 121 out of 17282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17282/17282 places, 33120/33120 transitions.
Drop transitions removed 613 transitions
Trivial Post-agglo rules discarded 613 transitions
Performed 613 trivial Post agglomeration. Transition count delta: 613
Iterating post reduction 0 with 613 rules applied. Total rules applied 613 place count 17282 transition count 32507
Reduce places removed 613 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 619 rules applied. Total rules applied 1232 place count 16669 transition count 32501
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1238 place count 16663 transition count 32501
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1238 place count 16663 transition count 32499
Deduced a syphon composed of 2 places in 19 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1242 place count 16661 transition count 32499
Discarding 7858 places :
Symmetric choice reduction at 3 with 7858 rule applications. Total rules 9100 place count 8803 transition count 16783
Iterating global reduction 3 with 7858 rules applied. Total rules applied 16958 place count 8803 transition count 16783
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 12 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 17130 place count 8717 transition count 16697
Free-agglomeration rule applied 90 times.
Iterating global reduction 3 with 90 rules applied. Total rules applied 17220 place count 8717 transition count 16607
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 3 with 90 rules applied. Total rules applied 17310 place count 8627 transition count 16607
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 17315 place count 8627 transition count 16602
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 17320 place count 8622 transition count 16602
Partial Free-agglomeration rule applied 90 times.
Drop transitions removed 90 transitions
Iterating global reduction 5 with 90 rules applied. Total rules applied 17410 place count 8622 transition count 16602
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 17412 place count 8622 transition count 16602
Applied a total of 17412 rules in 20347 ms. Remains 8622 /17282 variables (removed 8660) and now considering 16602/33120 (removed 16518) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20350 ms. Remains : 8622/17282 places, 16602/33120 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 564 ms. (steps per millisecond=17 ) properties (out of 12) seen :3
FORMULA CANConstruction-PT-090-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 16602 rows 8622 cols
[2023-03-14 13:18:36] [INFO ] Computed 181 place invariants in 142 ms
[2023-03-14 13:18:39] [INFO ] After 2358ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-14 13:18:41] [INFO ] [Nat]Absence check using 91 positive place invariants in 233 ms returned sat
[2023-03-14 13:18:41] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 127 ms returned sat
[2023-03-14 13:18:56] [INFO ] After 12664ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-14 13:18:56] [INFO ] State equation strengthened by 16238 read => feed constraints.
[2023-03-14 13:19:04] [INFO ] After 7835ms SMT Verify possible using 16238 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-14 13:19:04] [INFO ] After 7843ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-14 13:19:04] [INFO ] After 25048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA CANConstruction-PT-090-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 230 ms.
Support contains 103 out of 8622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8622/8622 places, 16602/16602 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 8611 transition count 16591
Applied a total of 22 rules in 5290 ms. Remains 8611 /8622 variables (removed 11) and now considering 16591/16602 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5290 ms. Remains : 8611/8622 places, 16591/16602 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 7) seen :2
FORMULA CANConstruction-PT-090-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 16591 rows 8611 cols
[2023-03-14 13:19:10] [INFO ] Computed 181 place invariants in 186 ms
[2023-03-14 13:19:12] [INFO ] [Real]Absence check using 91 positive place invariants in 231 ms returned sat
[2023-03-14 13:19:12] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 160 ms returned sat
[2023-03-14 13:19:12] [INFO ] After 2058ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-14 13:19:14] [INFO ] [Nat]Absence check using 91 positive place invariants in 234 ms returned sat
[2023-03-14 13:19:14] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 104 ms returned sat
[2023-03-14 13:19:25] [INFO ] After 10303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-14 13:19:25] [INFO ] State equation strengthened by 16249 read => feed constraints.
[2023-03-14 13:19:30] [INFO ] After 4716ms SMT Verify possible using 16249 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-03-14 13:19:35] [INFO ] After 9360ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 2342 ms.
[2023-03-14 13:19:37] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA CANConstruction-PT-090-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 4 different solutions.
FORMULA CANConstruction-PT-090-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 36 ms.
Support contains 22 out of 8611 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8611/8611 places, 16591/16591 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 8611 transition count 16589
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8609 transition count 16589
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 13 place count 8600 transition count 16571
Iterating global reduction 2 with 9 rules applied. Total rules applied 22 place count 8600 transition count 16571
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 4 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 80 place count 8571 transition count 16542
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 96 place count 8563 transition count 16543
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 8563 transition count 16541
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 100 place count 8561 transition count 16541
Applied a total of 100 rules in 14010 ms. Remains 8561 /8611 variables (removed 50) and now considering 16541/16591 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14010 ms. Remains : 8561/8611 places, 16541/16591 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 99363 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{2=1}
Probabilistic random walk after 99363 steps, saw 90698 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :1
FORMULA CANConstruction-PT-090-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 16541 rows 8561 cols
[2023-03-14 13:19:55] [INFO ] Computed 181 place invariants in 174 ms
[2023-03-14 13:19:56] [INFO ] [Real]Absence check using 91 positive place invariants in 257 ms returned sat
[2023-03-14 13:19:56] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 98 ms returned sat
[2023-03-14 13:19:56] [INFO ] After 1634ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 13:19:58] [INFO ] [Nat]Absence check using 91 positive place invariants in 251 ms returned sat
[2023-03-14 13:19:58] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 113 ms returned sat
[2023-03-14 13:20:08] [INFO ] After 10168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 13:20:09] [INFO ] State equation strengthened by 16295 read => feed constraints.
[2023-03-14 13:20:12] [INFO ] After 3157ms SMT Verify possible using 16295 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 13:20:14] [INFO ] After 5468ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1720 ms.
[2023-03-14 13:20:16] [INFO ] After 19322ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 21 out of 8561 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8561/8561 places, 16541/16541 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8560 transition count 16540
Applied a total of 2 rules in 5352 ms. Remains 8560 /8561 variables (removed 1) and now considering 16540/16541 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5352 ms. Remains : 8560/8561 places, 16540/16541 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 100060 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100060 steps, saw 90805 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 16540 rows 8560 cols
[2023-03-14 13:20:25] [INFO ] Computed 181 place invariants in 144 ms
[2023-03-14 13:20:26] [INFO ] [Real]Absence check using 91 positive place invariants in 248 ms returned sat
[2023-03-14 13:20:26] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 159 ms returned sat
[2023-03-14 13:20:26] [INFO ] After 1691ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 13:20:28] [INFO ] [Nat]Absence check using 91 positive place invariants in 274 ms returned sat
[2023-03-14 13:20:28] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 160 ms returned sat
[2023-03-14 13:20:38] [INFO ] After 9242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 13:20:38] [INFO ] State equation strengthened by 16296 read => feed constraints.
[2023-03-14 13:20:41] [INFO ] After 3353ms SMT Verify possible using 16296 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 13:20:43] [INFO ] After 5729ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1626 ms.
[2023-03-14 13:20:45] [INFO ] After 18635ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA CANConstruction-PT-090-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 11 ms.
Support contains 20 out of 8560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8560/8560 places, 16540/16540 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8559 transition count 16539
Applied a total of 2 rules in 5344 ms. Remains 8559 /8560 variables (removed 1) and now considering 16539/16540 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5344 ms. Remains : 8559/8560 places, 16539/16540 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 104941 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104941 steps, saw 92025 distinct states, run finished after 3006 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16539 rows 8559 cols
[2023-03-14 13:20:54] [INFO ] Computed 181 place invariants in 105 ms
[2023-03-14 13:20:55] [INFO ] After 1123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 13:20:56] [INFO ] [Nat]Absence check using 91 positive place invariants in 251 ms returned sat
[2023-03-14 13:20:57] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 118 ms returned sat
[2023-03-14 13:21:06] [INFO ] After 9494ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 13:21:06] [INFO ] State equation strengthened by 16297 read => feed constraints.
[2023-03-14 13:21:09] [INFO ] After 3001ms SMT Verify possible using 16297 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 13:21:11] [INFO ] After 4173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 992 ms.
[2023-03-14 13:21:12] [INFO ] After 16492ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 32 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=10 )
FORMULA CANConstruction-PT-090-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 4 ms.
All properties solved without resorting to model-checking.
Total runtime 214887 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running CANConstruction (PT), instance 090
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 17282 places, 33120 transitions, 99000 arcs.
Final Score: 1.313386359E8
Took : 550 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: CANConstruction-PT-090-ReachabilityCardinality-00 (reachable & potential(( (! ( (tk(P2714)) <= ( 1 ) )) | ( ( 1 ) <= (tk(P6434)) ) )))
PROPERTY: CANConstruction-PT-090-ReachabilityCardinality-01 (reachable &!potential( ( (tk(P4462)) <= (tk(P16893)) )))
PROPERTY: CANConstruction-PT-090-ReachabilityCardinality-02 (reachable & potential(( ( 1 ) <= (tk(P14466)) )))
PROPERTY: CANConstruction-PT-090-ReachabilityCardinality-03 (reachable &!potential( (! ( (! ( (tk(P3575)) <= ( 0 ) )) & ( ( (tk(P15785)) <= ( 1 ) ) | ( (! ( ( ( (tk(P2466)) <= (tk(P10898)) ) | ( (tk(P16617)) <= (tk(P12086)) ) ) | (! ( (tk(P2694)) <= ( 0 ) )) )) | ( (tk(P14473)) <= (tk(P456)) ) ) ) ))))
PROPERTY: CANConstruction-PT-090-ReachabilityCardinality-04 (reachable & potential(( ( 1 ) <= (tk(P1970)) )))
PROPERTY: CANConstruction-PT-090-ReachabilityCardinality-05 (reachable & potential((! ( (! ( ( ( (! ( ( (tk(P4051)) <= ( 0 ) ) | ( ( (tk(P512)) <= (tk(P17271)) ) | ( (tk(P10649)) <= (tk(P1602)) ) ) )) & (! ( ( ( (tk(P8890)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P7153)) ) ) & (! ( (tk(P5778)) <= (tk(P13313)) )) )) ) | ( ( ( ( (tk(P1634)) <= (tk(P35)) ) | ( (tk(P1407)) <= ( 1 ) ) ) & ( ( ( ( 1 ) <= (tk(P6892)) ) & ( (tk(P13373)) <= (tk(P3190)) ) ) | ( ( 1 ) <= (tk(P5584)) ) ) ) & ( (tk(P7841)) <= ( 1 ) ) ) ) | ( (! ( ( ( ( (tk(P5868)) <= (tk(P1356)) ) & ( (tk(P17121)) <= (tk(P4804)) ) ) & ( (tk(P10775)) <= ( 0 ) ) ) & ( (tk(P11422)) <= ( 0 ) ) )) & (! ( (tk(P15248)) <= ( 0 ) )) ) )) | ( ( (! ( ( ( (! ( (tk(P6678)) <= (tk(P7634)) )) | ( ( ( 1 ) <= (tk(P8043)) ) & ( (tk(P11316)) <= ( 0 ) ) ) ) | ( (tk(P4918)) <= ( 1 ) ) ) | (! ( ( ( (tk(P6059)) <= ( 0 ) ) | ( (tk(P7786)) <= ( 0 ) ) ) | ( (tk(P5427)) <= (tk(P8528)) ) )) )) & ( ( (! ( ( (tk(P4899)) <= (tk(P4884)) ) | ( ( 1 ) <= (tk(P6935)) ) )) & ( ( ( (tk(P9765)) <= ( 0 ) ) | (! ( (tk(P12306)) <= (tk(P4909)) )) ) & ( ( 1 ) <= (tk(P12548)) ) ) ) | (! ( ( 1 ) <= (tk(P14064)) )) ) ) & ( (tk(P6277)) <= ( 0 ) ) ) ))))
PROPERTY: CANConstruction-PT-090-ReachabilityCardinality-06 (reachable &!potential( ( ( (tk(P8446)) <= (tk(P13031)) ) & ( (tk(P10909)) <= (tk(P12986)) ) )))
PROPERTY: CANConstruction-PT-090-ReachabilityCardinality-07 (reachable &!potential( ( ( ( 1 ) <= (tk(P16626)) ) | ( (tk(P11751)) <= (tk(P13259)) ) )))
PROPERTY: CANConstruction-PT-090-ReachabilityCardinality-08 (reachable & potential((! ( (! ( ( ( (! ( (tk(P12907)) <= ( 1 ) )) & ( ( ( 1 ) <= (tk(P8652)) ) & (! ( ( 1 ) <= (tk(P5130)) )) ) ) & (! ( ( ( (tk(P1209)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P11838)) ) ) & ( (tk(P4933)) <= ( 1 ) ) )) ) & ( ( ( (! ( (tk(P7995)) <= (tk(P4973)) )) & ( ( (tk(P16933)) <= ( 0 ) ) & ( (tk(P10549)) <= ( 0 ) ) ) ) & ( (! ( ( 1 ) <= (tk(P7066)) )) | (! ( ( 1 ) <= (tk(P7733)) )) ) ) & (! ( ( 1 ) <= (tk(P16209)) )) ) )) | ( (! ( ( (tk(P14814)) <= ( 1 ) ) & ( ( ( (tk(P12379)) <= ( 0 ) ) & ( (tk(P17057)) <= ( 1 ) ) ) & ( ( (tk(P9159)) <= ( 1 ) ) | ( (tk(P4494)) <= ( 0 ) ) ) ) )) | ( ( 1 ) <= (tk(P9977)) ) ) ))))
PROPERTY: CANConstruction-PT-090-ReachabilityCardinality-09 (reachable &!potential( (! ( (! ( (tk(P11588)) <= ( 1 ) )) & ( (tk(P10181)) <= ( 0 ) ) ))))
PROPERTY: CANConstruction-PT-090-ReachabilityCardinality-10 (reachable & potential((! ( ( ( ( (tk(P4507)) <= (tk(P9188)) ) & ( (! ( (tk(P9467)) <= ( 1 ) )) | ( ( ( (! ( ( 1 ) <= (tk(P4138)) )) | (! ( (tk(P3600)) <= (tk(P13107)) )) ) | ( ( ( 1 ) <= (tk(P6626)) ) | ( ( ( 1 ) <= (tk(P11452)) ) & ( (tk(P5923)) <= ( 0 ) ) ) ) ) & ( ( ( ( ( 1 ) <= (tk(P11575)) ) | ( ( 1 ) <= (tk(P10851)) ) ) | ( ( ( 1 ) <= (tk(P14156)) ) | ( (tk(P10041)) <= (tk(P2173)) ) ) ) & (! ( (tk(P14934)) <= ( 1 ) )) ) ) ) ) | ( ( (tk(P66)) <= (tk(P6459)) ) | ( (tk(P14749)) <= (tk(P4611)) ) ) ) | (! ( ( 1 ) <= (tk(P6289)) )) ))))
PROPERTY: CANConstruction-PT-090-ReachabilityCardinality-11 (reachable &!potential( ( ( (tk(P16026)) <= (tk(P350)) ) | ( ( ( (tk(P3882)) <= (tk(P4584)) ) | ( ( (tk(P5794)) <= (tk(P122)) ) | ( (tk(P12172)) <= ( 0 ) ) ) ) | ( ( ( 1 ) <= (tk(P3217)) ) | ( ( (tk(P9212)) <= ( 0 ) ) & ( ( (tk(P762)) <= ( 1 ) ) & (! ( ( 1 ) <= (tk(P13187)) )) ) ) ) ) )))
PROPERTY: CANConstruction-PT-090-ReachabilityCardinality-12 (reachable &!potential( ( (! ( ( ( ( (tk(P10663)) <= (tk(P9077)) ) & ( ( (tk(P7589)) <= (tk(P4361)) ) & (! ( ( 1 ) <= (tk(P6526)) )) ) ) & ( (! ( (tk(P6306)) <= ( 1 ) )) | ( (tk(P5772)) <= ( 1 ) ) ) ) | (! ( (tk(P3404)) <= (tk(P16886)) )) )) | ( (tk(P8723)) <= ( 1 ) ) )))
PROPERTY: CANConstruction-PT-090-ReachabilityCardinality-13 (reachable & potential((! ( ( ( ( 1 ) <= (tk(P1699)) ) | ( ( ( ( ( (! ( (tk(P17258)) <= (tk(P16395)) )) & (! ( (tk(P16918)) <= ( 0 ) )) ) | ( ( (tk(P4622)) <= ( 0 ) ) | ( ( (tk(P9753)) <= ( 0 ) ) | ( (tk(P3505)) <= ( 0 ) ) ) ) ) & (! ( (! ( (tk(P15867)) <= (tk(P2753)) )) | (! ( (tk(P5790)) <= (tk(P5714)) )) )) ) & ( ( 1 ) <= (tk(P6194)) ) ) | ( ( ( ( ( 1 ) <= (tk(P13646)) ) | ( ( ( (tk(P8637)) <= ( 1 ) ) & ( (tk(P4592)) <= (tk(P281)) ) ) & (! ( (tk(P2007)) <= ( 0 ) )) ) ) & (! ( (! ( (tk(P6449)) <= (tk(P15704)) )) & ( ( (tk(P145)) <= ( 1 ) ) | ( (tk(P12410)) <= (tk(P13142)) ) ) )) ) | ( (tk(P8520)) <= (tk(P7316)) ) ) ) ) & ( (tk(P14970)) <= ( 0 ) ) ))))
PROPERTY: CANConstruction-PT-090-ReachabilityCardinality-14 (reachable & potential(( ( 1 ) <= (tk(P16884)) )))
PROPERTY: CANConstruction-PT-090-ReachabilityCardinality-15 (reachable &!potential( ( (tk(P3895)) <= ( 1 ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 14278436 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16077920 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 ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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="CANConstruction-PT-090"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is CANConstruction-PT-090, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-tajo-167813697200686"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-090.tgz
mv CANConstruction-PT-090 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;