Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 7.6K Feb 25 14:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 14:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 14:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 14:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 25 14:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 14:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 14:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 303K 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 Echo-PT-d02r09-ReachabilityCardinality-00
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-01
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-02
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-03
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-04
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-05
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-06
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-07
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-08
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-09
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-10
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-11
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-12
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-13
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-14
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678433983208

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=Echo-PT-d02r09
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 07:39:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 07:39:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 07:39:44] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2023-03-10 07:39:44] [INFO ] Transformed 735 places.
[2023-03-10 07:39:44] [INFO ] Transformed 570 transitions.
[2023-03-10 07:39:44] [INFO ] Found NUPN structural information;
[2023-03-10 07:39:44] [INFO ] Parsed PT model containing 735 places and 570 transitions and 3220 arcs in 148 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA Echo-PT-d02r09-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r09-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 61 resets, run finished after 458 ms. (steps per millisecond=21 ) properties (out of 14) seen :11
FORMULA Echo-PT-d02r09-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :1
FORMULA Echo-PT-d02r09-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 570 rows 735 cols
[2023-03-10 07:39:45] [INFO ] Computed 369 place invariants in 47 ms
[2023-03-10 07:39:45] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 07:39:46] [INFO ] [Nat]Absence check using 85 positive place invariants in 22 ms returned sat
[2023-03-10 07:39:46] [INFO ] [Nat]Absence check using 85 positive and 284 generalized place invariants in 52 ms returned sat
[2023-03-10 07:39:56] [INFO ] After 10326ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 07:39:57] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 5 ms to minimize.
[2023-03-10 07:39:57] [INFO ] Deduced a trap composed of 12 places in 249 ms of which 1 ms to minimize.
[2023-03-10 07:39:57] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 1 ms to minimize.
[2023-03-10 07:39:57] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 2 ms to minimize.
[2023-03-10 07:39:58] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 0 ms to minimize.
[2023-03-10 07:39:58] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 3 ms to minimize.
[2023-03-10 07:39:58] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 1 ms to minimize.
[2023-03-10 07:39:58] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2023-03-10 07:39:58] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 1 ms to minimize.
[2023-03-10 07:39:59] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 1 ms to minimize.
[2023-03-10 07:39:59] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 0 ms to minimize.
[2023-03-10 07:39:59] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 0 ms to minimize.
[2023-03-10 07:39:59] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 1 ms to minimize.
[2023-03-10 07:39:59] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 1 ms to minimize.
[2023-03-10 07:40:00] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 1 ms to minimize.
[2023-03-10 07:40:00] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 0 ms to minimize.
[2023-03-10 07:40:00] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 3 ms to minimize.
[2023-03-10 07:40:00] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 1 ms to minimize.
[2023-03-10 07:40:00] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 0 ms to minimize.
[2023-03-10 07:40:01] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 0 ms to minimize.
[2023-03-10 07:40:01] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4285 ms
[2023-03-10 07:40:01] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2023-03-10 07:40:01] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 0 ms to minimize.
[2023-03-10 07:40:02] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2023-03-10 07:40:02] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 1 ms to minimize.
[2023-03-10 07:40:02] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 0 ms to minimize.
[2023-03-10 07:40:02] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 0 ms to minimize.
[2023-03-10 07:40:03] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 0 ms to minimize.
[2023-03-10 07:40:03] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 0 ms to minimize.
[2023-03-10 07:40:03] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 1 ms to minimize.
[2023-03-10 07:40:04] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2023-03-10 07:40:04] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2023-03-10 07:40:05] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2023-03-10 07:40:05] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 0 ms to minimize.
[2023-03-10 07:40:05] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 0 ms to minimize.
[2023-03-10 07:40:05] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 0 ms to minimize.
[2023-03-10 07:40:07] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2023-03-10 07:40:08] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2023-03-10 07:40:09] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 1 ms to minimize.
[2023-03-10 07:40:09] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2023-03-10 07:40:10] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
[2023-03-10 07:40:10] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 0 ms to minimize.
[2023-03-10 07:40:11] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.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-10 07:40:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 07:40:11] [INFO ] After 25102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 7 ms.
Support contains 54 out of 735 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 570/570 transitions.
Graph (complete) has 2466 edges and 735 vertex of which 648 are kept as prefixes of interest. Removing 87 places using SCC suffix rule.3 ms
Discarding 87 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 648 transition count 566
Applied a total of 4 rules in 103 ms. Remains 648 /735 variables (removed 87) and now considering 566/570 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 648/735 places, 566/570 transitions.
Incomplete random walk after 10000 steps, including 62 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :1
FORMULA Echo-PT-d02r09-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 566 rows 648 cols
[2023-03-10 07:40:11] [INFO ] Computed 283 place invariants in 155 ms
[2023-03-10 07:40:11] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 07:40:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 17 ms returned sat
[2023-03-10 07:40:12] [INFO ] [Nat]Absence check using 6 positive and 277 generalized place invariants in 370 ms returned sat
[2023-03-10 07:40:21] [INFO ] After 9833ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 07:40:22] [INFO ] After 10260ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 374 ms.
[2023-03-10 07:40:22] [INFO ] After 11173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 31 out of 648 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 648/648 places, 566/566 transitions.
Graph (complete) has 1878 edges and 648 vertex of which 647 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 27 ms. Remains 647 /648 variables (removed 1) and now considering 566/566 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 647/648 places, 566/566 transitions.
Incomplete random walk after 10000 steps, including 62 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 729705 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :{}
Probabilistic random walk after 729705 steps, saw 127096 distinct states, run finished after 3002 ms. (steps per millisecond=243 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 566 rows 647 cols
[2023-03-10 07:40:26] [INFO ] Computed 282 place invariants in 134 ms
[2023-03-10 07:40:26] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 07:40:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2023-03-10 07:40:26] [INFO ] [Nat]Absence check using 3 positive and 279 generalized place invariants in 491 ms returned sat
[2023-03-10 07:40:39] [INFO ] After 12361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 07:40:39] [INFO ] After 12639ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 607 ms.
[2023-03-10 07:40:40] [INFO ] After 13921ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 31 out of 647 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 647/647 places, 566/566 transitions.
Applied a total of 0 rules in 20 ms. Remains 647 /647 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 647/647 places, 566/566 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 647/647 places, 566/566 transitions.
Applied a total of 0 rules in 22 ms. Remains 647 /647 variables (removed 0) and now considering 566/566 (removed 0) transitions.
[2023-03-10 07:40:40] [INFO ] Invariant cache hit.
[2023-03-10 07:40:41] [INFO ] Implicit Places using invariants in 1689 ms returned []
[2023-03-10 07:40:41] [INFO ] Invariant cache hit.
[2023-03-10 07:40:47] [INFO ] Implicit Places using invariants and state equation in 5371 ms returned []
Implicit Place search using SMT with State Equation took 7066 ms to find 0 implicit places.
[2023-03-10 07:40:47] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-10 07:40:47] [INFO ] Invariant cache hit.
[2023-03-10 07:40:48] [INFO ] Dead Transitions using invariants and state equation in 1011 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8144 ms. Remains : 647/647 places, 566/566 transitions.
Applied a total of 0 rules in 19 ms. Remains 647 /647 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-10 07:40:48] [INFO ] Invariant cache hit.
[2023-03-10 07:40:48] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 07:40:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-10 07:40:48] [INFO ] [Nat]Absence check using 3 positive and 279 generalized place invariants in 433 ms returned sat
[2023-03-10 07:41:00] [INFO ] After 11664ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 07:41:00] [INFO ] After 11892ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 284 ms.
[2023-03-10 07:41:01] [INFO ] After 12796ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-10 07:41:01] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-10 07:41:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 647 places, 566 transitions and 2902 arcs took 8 ms.
[2023-03-10 07:41:01] [INFO ] Flatten gal took : 103 ms
Total runtime 76919 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Echo-PT-d02r09
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
ReachabilityCardinality

FORMULA Echo-PT-d02r09-ReachabilityCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678434062628

--------------------
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/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/ReachabilityCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
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 Echo-PT-d02r09-ReachabilityCardinality-05
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 Echo-PT-d02r09-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 Echo-PT-d02r09-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 6 (type SRCH) for 0 Echo-PT-d02r09-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 3 (type FNDP) for Echo-PT-d02r09-ReachabilityCardinality-05
lola: result : true
lola: fired transitions : 206
lola: tried executions : 17
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 4 (type EQUN) for Echo-PT-d02r09-ReachabilityCardinality-05 (obsolete)
lola: CANCELED task # 6 (type SRCH) for Echo-PT-d02r09-ReachabilityCardinality-05 (obsolete)
lola: CANCELED task # 7 (type EXCL) for Echo-PT-d02r09-ReachabilityCardinality-05 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Echo-PT-d02r09-ReachabilityCardinality-05: EF true findpath


Time elapsed: 0 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="Echo-PT-d02r09"
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 Echo-PT-d02r09, 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 r167-tall-167838852400054"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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