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

About the Execution of LoLa+red for CANConstruction-PT-080

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1866.743 212863.00 257847.00 133.10 FFTFTFFTTTFFFTTT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r039-tajo-167813692900678.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 lolaxred
Input is CANConstruction-PT-080, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692900678
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 10M
-rw-r--r-- 1 mcc users 11K Feb 25 22:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 22:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 21:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 21:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 18K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 22:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 25 22:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 22:26 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 9.5M 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-080-ReachabilityCardinality-00
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-01
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-02
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-03
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-04
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-05
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-06
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-07
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-08
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-09
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-10
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-11
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-12
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-13
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-14
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678504928940

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=lolaxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-080
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:22:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 03:22:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:22:11] [INFO ] Load time of PNML (sax parser for PT used): 492 ms
[2023-03-11 03:22:11] [INFO ] Transformed 13762 places.
[2023-03-11 03:22:11] [INFO ] Transformed 26240 transitions.
[2023-03-11 03:22:11] [INFO ] Parsed PT model containing 13762 places and 26240 transitions and 78400 arcs in 667 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 7 resets, run finished after 602 ms. (steps per millisecond=16 ) properties (out of 16) seen :3
FORMULA CANConstruction-PT-080-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) 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 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 26240 rows 13762 cols
[2023-03-11 03:22:12] [INFO ] Computed 161 place invariants in 321 ms
[2023-03-11 03:22:17] [INFO ] After 4933ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-11 03:22:21] [INFO ] [Nat]Absence check using 81 positive place invariants in 292 ms returned sat
[2023-03-11 03:22:22] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 78 ms returned sat
[2023-03-11 03:22:42] [INFO ] After 18591ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :10
[2023-03-11 03:22:43] [INFO ] State equation strengthened by 12720 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-11 03:22:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 03:22:43] [INFO ] After 25273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
FORMULA CANConstruction-PT-080-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANConstruction-PT-080-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 251 out of 13762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13762/13762 places, 26240/26240 transitions.
Drop transitions removed 524 transitions
Trivial Post-agglo rules discarded 524 transitions
Performed 524 trivial Post agglomeration. Transition count delta: 524
Iterating post reduction 0 with 524 rules applied. Total rules applied 524 place count 13762 transition count 25716
Reduce places removed 524 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 537 rules applied. Total rules applied 1061 place count 13238 transition count 25703
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 1074 place count 13225 transition count 25703
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1074 place count 13225 transition count 25697
Deduced a syphon composed of 6 places in 19 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1086 place count 13219 transition count 25697
Discarding 6126 places :
Symmetric choice reduction at 3 with 6126 rule applications. Total rules 7212 place count 7093 transition count 13445
Iterating global reduction 3 with 6126 rules applied. Total rules applied 13338 place count 7093 transition count 13445
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 7 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 13478 place count 7023 transition count 13375
Free-agglomeration rule applied 38 times.
Iterating global reduction 3 with 38 rules applied. Total rules applied 13516 place count 7023 transition count 13337
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 13554 place count 6985 transition count 13337
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 13559 place count 6985 transition count 13332
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 13564 place count 6980 transition count 13332
Partial Free-agglomeration rule applied 125 times.
Drop transitions removed 125 transitions
Iterating global reduction 5 with 125 rules applied. Total rules applied 13689 place count 6980 transition count 13332
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 13695 place count 6980 transition count 13332
Applied a total of 13695 rules in 13779 ms. Remains 6980 /13762 variables (removed 6782) and now considering 13332/26240 (removed 12908) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13782 ms. Remains : 6980/13762 places, 13332/26240 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 444 ms. (steps per millisecond=22 ) properties (out of 11) seen :5
FORMULA CANConstruction-PT-080-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-00 FALSE 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) 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 6) 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 6) 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 6) 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 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 13332 rows 6980 cols
[2023-03-11 03:22:57] [INFO ] Computed 161 place invariants in 83 ms
[2023-03-11 03:22:58] [INFO ] After 1160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 03:23:00] [INFO ] [Nat]Absence check using 81 positive place invariants in 193 ms returned sat
[2023-03-11 03:23:00] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 82 ms returned sat
[2023-03-11 03:23:09] [INFO ] After 7880ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 03:23:09] [INFO ] State equation strengthened by 12846 read => feed constraints.
[2023-03-11 03:23:15] [INFO ] After 5980ms SMT Verify possible using 12846 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 03:23:20] [INFO ] After 11177ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 3361 ms.
[2023-03-11 03:23:23] [INFO ] After 25096ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 55 ms.
Support contains 79 out of 6980 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6980/6980 places, 13332/13332 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 6980 transition count 13326
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 6974 transition count 13326
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 39 place count 6947 transition count 13272
Iterating global reduction 2 with 27 rules applied. Total rules applied 66 place count 6947 transition count 13272
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 3 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 136 place count 6912 transition count 13237
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 184 place count 6888 transition count 13240
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 188 place count 6888 transition count 13240
Applied a total of 188 rules in 8042 ms. Remains 6888 /6980 variables (removed 92) and now considering 13240/13332 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8043 ms. Remains : 6888/6980 places, 13240/13332 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 6) seen :1
FORMULA CANConstruction-PT-080-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 13240 rows 6888 cols
[2023-03-11 03:23:32] [INFO ] Computed 161 place invariants in 102 ms
[2023-03-11 03:23:34] [INFO ] After 1290ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 03:23:35] [INFO ] [Nat]Absence check using 81 positive place invariants in 177 ms returned sat
[2023-03-11 03:23:35] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 78 ms returned sat
[2023-03-11 03:23:43] [INFO ] After 7295ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 03:23:43] [INFO ] State equation strengthened by 12931 read => feed constraints.
[2023-03-11 03:23:48] [INFO ] After 4922ms SMT Verify possible using 12931 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 03:23:52] [INFO ] After 9190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2996 ms.
[2023-03-11 03:23:55] [INFO ] After 21473ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 29 ms.
Support contains 78 out of 6888 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6888/6888 places, 13240/13240 transitions.
Applied a total of 0 rules in 1663 ms. Remains 6888 /6888 variables (removed 0) and now considering 13240/13240 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1665 ms. Remains : 6888/6888 places, 13240/13240 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 5) seen :2
FORMULA CANConstruction-PT-080-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) 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 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 03:23:57] [INFO ] Invariant cache hit.
[2023-03-11 03:23:58] [INFO ] After 976ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:23:59] [INFO ] [Nat]Absence check using 81 positive place invariants in 153 ms returned sat
[2023-03-11 03:24:00] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 82 ms returned sat
[2023-03-11 03:24:06] [INFO ] After 6233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:24:06] [INFO ] State equation strengthened by 12931 read => feed constraints.
[2023-03-11 03:24:10] [INFO ] After 3451ms SMT Verify possible using 12931 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:24:13] [INFO ] After 6670ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2284 ms.
[2023-03-11 03:24:15] [INFO ] After 17026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 69 out of 6888 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6888/6888 places, 13240/13240 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 6885 transition count 13237
Applied a total of 6 rules in 3171 ms. Remains 6885 /6888 variables (removed 3) and now considering 13237/13240 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3171 ms. Remains : 6885/6888 places, 13237/13240 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 485 ms. (steps per millisecond=20 ) properties (out of 3) seen :1
FORMULA CANConstruction-PT-080-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 13237 rows 6885 cols
[2023-03-11 03:24:19] [INFO ] Computed 161 place invariants in 93 ms
[2023-03-11 03:24:20] [INFO ] After 994ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:24:21] [INFO ] [Nat]Absence check using 81 positive place invariants in 188 ms returned sat
[2023-03-11 03:24:21] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 77 ms returned sat
[2023-03-11 03:24:27] [INFO ] After 5827ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:24:27] [INFO ] State equation strengthened by 12934 read => feed constraints.
[2023-03-11 03:24:31] [INFO ] After 3459ms SMT Verify possible using 12934 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:24:33] [INFO ] After 5705ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1328 ms.
[2023-03-11 03:24:35] [INFO ] After 14398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 42 out of 6885 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6885/6885 places, 13237/13237 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 6885 transition count 13236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 6884 transition count 13236
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4 place count 6882 transition count 13232
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 6882 transition count 13232
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 32 place count 6869 transition count 13219
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 6867 transition count 13219
Applied a total of 36 rules in 6231 ms. Remains 6867 /6885 variables (removed 18) and now considering 13219/13237 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6231 ms. Remains : 6867/6885 places, 13219/13237 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) 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
Interrupted probabilistic random walk after 89476 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{1=1}
Probabilistic random walk after 89476 steps, saw 79247 distinct states, run finished after 3003 ms. (steps per millisecond=29 ) properties seen :1
FORMULA CANConstruction-PT-080-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 13219 rows 6867 cols
[2023-03-11 03:24:44] [INFO ] Computed 161 place invariants in 127 ms
[2023-03-11 03:24:45] [INFO ] After 769ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:24:46] [INFO ] [Nat]Absence check using 81 positive place invariants in 187 ms returned sat
[2023-03-11 03:24:46] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 80 ms returned sat
[2023-03-11 03:24:52] [INFO ] After 5781ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:24:52] [INFO ] State equation strengthened by 12952 read => feed constraints.
[2023-03-11 03:24:55] [INFO ] After 2470ms SMT Verify possible using 12952 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:24:56] [INFO ] After 3653ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1275 ms.
[2023-03-11 03:24:57] [INFO ] After 11923ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 41 out of 6867 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6867/6867 places, 13219/13219 transitions.
Applied a total of 0 rules in 1662 ms. Remains 6867 /6867 variables (removed 0) and now considering 13219/13219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1662 ms. Remains : 6867/6867 places, 13219/13219 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 97186 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97186 steps, saw 81171 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:25:02] [INFO ] Invariant cache hit.
[2023-03-11 03:25:03] [INFO ] After 660ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:25:04] [INFO ] [Nat]Absence check using 81 positive place invariants in 170 ms returned sat
[2023-03-11 03:25:04] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 86 ms returned sat
[2023-03-11 03:25:10] [INFO ] After 6174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:25:10] [INFO ] State equation strengthened by 12952 read => feed constraints.
[2023-03-11 03:25:13] [INFO ] After 2614ms SMT Verify possible using 12952 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:25:14] [INFO ] After 4086ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1208 ms.
[2023-03-11 03:25:15] [INFO ] After 12660ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 41 out of 6867 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6867/6867 places, 13219/13219 transitions.
Applied a total of 0 rules in 1571 ms. Remains 6867 /6867 variables (removed 0) and now considering 13219/13219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1572 ms. Remains : 6867/6867 places, 13219/13219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6867/6867 places, 13219/13219 transitions.
Applied a total of 0 rules in 1487 ms. Remains 6867 /6867 variables (removed 0) and now considering 13219/13219 (removed 0) transitions.
[2023-03-11 03:25:18] [INFO ] Invariant cache hit.
[2023-03-11 03:25:19] [INFO ] Implicit Places using invariants in 695 ms returned []
Implicit Place search using SMT only with invariants took 697 ms to find 0 implicit places.
[2023-03-11 03:25:19] [INFO ] Invariant cache hit.
[2023-03-11 03:25:20] [INFO ] Dead Transitions using invariants and state equation in 856 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3046 ms. Remains : 6867/6867 places, 13219/13219 transitions.
Graph (trivial) has 12818 edges and 6867 vertex of which 6334 / 6867 are part of one of the 78 SCC in 12 ms
Free SCC test removed 6256 places
Drop transitions removed 12383 transitions
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 12421 transitions.
Graph (complete) has 1341 edges and 611 vertex of which 301 are kept as prefixes of interest. Removing 310 places using SCC suffix rule.2 ms
Discarding 310 places :
Also discarding 181 output transitions
Drop transitions removed 181 transitions
Drop transitions removed 134 transitions
Reduce isomorphic transitions removed 134 transitions.
Drop transitions removed 152 transitions
Trivial Post-agglo rules discarded 152 transitions
Performed 152 trivial Post agglomeration. Transition count delta: 152
Iterating post reduction 0 with 286 rules applied. Total rules applied 288 place count 301 transition count 331
Ensure Unique test removed 1 places
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 149 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 310 rules applied. Total rules applied 598 place count 148 transition count 174
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 606 place count 140 transition count 174
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 606 place count 140 transition count 159
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 636 place count 125 transition count 159
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 640 place count 121 transition count 152
Iterating global reduction 3 with 4 rules applied. Total rules applied 644 place count 121 transition count 152
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 648 place count 121 transition count 148
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 652 place count 119 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 654 place count 118 transition count 147
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 656 place count 118 transition count 145
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 659 place count 118 transition count 142
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 662 place count 115 transition count 142
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 5 with 29 rules applied. Total rules applied 691 place count 115 transition count 142
Discarding 27 places :
Symmetric choice reduction at 5 with 27 rule applications. Total rules 718 place count 88 transition count 115
Iterating global reduction 5 with 27 rules applied. Total rules applied 745 place count 88 transition count 115
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 749 place count 84 transition count 111
Applied a total of 749 rules in 144 ms. Remains 84 /6867 variables (removed 6783) and now considering 111/13219 (removed 13108) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 111 rows 84 cols
[2023-03-11 03:25:20] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-11 03:25:20] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:25:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-11 03:25:20] [INFO ] [Nat]Absence check using 14 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-11 03:25:20] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:25:20] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-11 03:25:20] [INFO ] After 179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:25:20] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-11 03:25:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 6867 places, 13219 transitions and 52866 arcs took 68 ms.
[2023-03-11 03:25:21] [INFO ] Flatten gal took : 620 ms
Total runtime 191347 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CANConstruction-PT-080
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
ReachabilityCardinality

FORMULA CANConstruction-PT-080-ReachabilityCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678505141803

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/ReachabilityCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 2.000000 secs.
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-080-ReachabilityCardinality-04: EF 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 14 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 7 (type EXCL) for 0 CANConstruction-PT-080-ReachabilityCardinality-04
lola: time limit : 3581 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 CANConstruction-PT-080-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 CANConstruction-PT-080-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 6 (type SRCH) for 0 CANConstruction-PT-080-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 3 (type FNDP) for CANConstruction-PT-080-ReachabilityCardinality-04
lola: result : true
lola: fired transitions : 1133
lola: tried executions : 4
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 4 (type EQUN) for CANConstruction-PT-080-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 6 (type SRCH) for CANConstruction-PT-080-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 7 (type EXCL) for CANConstruction-PT-080-ReachabilityCardinality-04 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANConstruction-PT-080-ReachabilityCardinality-04: EF true findpath


Time elapsed: 19 secs. Pages in use: 2

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-080"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is CANConstruction-PT-080, 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 r039-tajo-167813692900678"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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