Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r066-tajo-171620415700328.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BusinessProcesses-PT-10, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-171620415700328
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 11 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 16:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 11 16:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 131K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1716663471479

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=gold2023
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=BusinessProcesses-PT-10
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202304061127
[2024-05-25 18:57:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-25 18:57:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 18:57:53] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-05-25 18:57:53] [INFO ] Transformed 518 places.
[2024-05-25 18:57:53] [INFO ] Transformed 471 transitions.
[2024-05-25 18:57:53] [INFO ] Found NUPN structural information;
[2024-05-25 18:57:53] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 171 ms.
Graph (trivial) has 296 edges and 518 vertex of which 7 / 518 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Structural test allowed to assert that 162 places are NOT stable. Took 14 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
[2024-05-25 18:57:54] [INFO ] Flatten gal took : 166 ms
[2024-05-25 18:57:54] [INFO ] Flatten gal took : 83 ms
[2024-05-25 18:57:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11950087595692564518.gal : 37 ms
[2024-05-25 18:57:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5334273497902988725.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11950087595692564518.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5334273497902988725.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality5334273497902988725.prop.
Incomplete random walk after 10000 steps, including 92 resets, run finished after 915 ms. (steps per millisecond=10 ) properties (out of 356) seen :47
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=9 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 309) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 309) seen :0
Running SMT prover for 309 properties.
// Phase 1: matrix 464 rows 512 cols
[2024-05-25 18:57:54] [INFO ] Computed 85 invariants in 27 ms
SDD proceeding with computation,356 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,356 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,356 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,356 properties remain. new max is 32
SDD size :19 after 22
SDD proceeding with computation,356 properties remain. new max is 64
SDD size :22 after 197
SDD proceeding with computation,356 properties remain. new max is 128
SDD size :197 after 391
SDD proceeding with computation,356 properties remain. new max is 256
SDD size :391 after 3.84528e+14
[2024-05-25 18:57:57] [INFO ] After 2774ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:309
[2024-05-25 18:57:59] [INFO ] [Nat]Absence check using 46 positive place invariants in 16 ms returned sat
[2024-05-25 18:57:59] [INFO ] [Nat]Absence check using 46 positive and 39 generalized place invariants in 18 ms returned sat
[2024-05-25 18:58:05] [INFO ] After 4179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :309
[2024-05-25 18:58:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 18:58:09] [INFO ] After 4093ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :309
[2024-05-25 18:58:09] [INFO ] Deduced a trap composed of 115 places in 161 ms of which 10 ms to minimize.
[2024-05-25 18:58:10] [INFO ] Deduced a trap composed of 120 places in 197 ms of which 2 ms to minimize.
[2024-05-25 18:58:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 417 ms
[2024-05-25 18:58:11] [INFO ] Deduced a trap composed of 116 places in 138 ms of which 2 ms to minimize.
[2024-05-25 18:58:11] [INFO ] Deduced a trap composed of 121 places in 127 ms of which 2 ms to minimize.
[2024-05-25 18:58:11] [INFO ] Deduced a trap composed of 124 places in 89 ms of which 0 ms to minimize.
[2024-05-25 18:58:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 431 ms
[2024-05-25 18:58:11] [INFO ] Deduced a trap composed of 119 places in 100 ms of which 1 ms to minimize.
[2024-05-25 18:58:12] [INFO ] Deduced a trap composed of 114 places in 89 ms of which 1 ms to minimize.
[2024-05-25 18:58:12] [INFO ] Deduced a trap composed of 111 places in 89 ms of which 1 ms to minimize.
[2024-05-25 18:58:12] [INFO ] Deduced a trap composed of 139 places in 87 ms of which 1 ms to minimize.
[2024-05-25 18:58:12] [INFO ] Deduced a trap composed of 118 places in 95 ms of which 0 ms to minimize.
[2024-05-25 18:58:12] [INFO ] Deduced a trap composed of 123 places in 92 ms of which 1 ms to minimize.
[2024-05-25 18:58:12] [INFO ] Deduced a trap composed of 121 places in 89 ms of which 1 ms to minimize.
[2024-05-25 18:58:12] [INFO ] Deduced a trap composed of 116 places in 88 ms of which 0 ms to minimize.
[2024-05-25 18:58:12] [INFO ] Deduced a trap composed of 122 places in 86 ms of which 0 ms to minimize.
[2024-05-25 18:58:12] [INFO ] Deduced a trap composed of 115 places in 87 ms of which 1 ms to minimize.
[2024-05-25 18:58:12] [INFO ] Deduced a trap composed of 117 places in 86 ms of which 0 ms to minimize.
[2024-05-25 18:58:13] [INFO ] Deduced a trap composed of 132 places in 129 ms of which 1 ms to minimize.
[2024-05-25 18:58:13] [INFO ] Deduced a trap composed of 124 places in 148 ms of which 1 ms to minimize.
[2024-05-25 18:58:13] [INFO ] Deduced a trap composed of 117 places in 149 ms of which 0 ms to minimize.
[2024-05-25 18:58:13] [INFO ] Deduced a trap composed of 128 places in 136 ms of which 1 ms to minimize.
[2024-05-25 18:58:13] [INFO ] Deduced a trap composed of 121 places in 127 ms of which 1 ms to minimize.
[2024-05-25 18:58:14] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 1 ms to minimize.
[2024-05-25 18:58:14] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 0 ms to minimize.
[2024-05-25 18:58:14] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 1 ms to minimize.
[2024-05-25 18:58:14] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 1 ms to minimize.
[2024-05-25 18:58:14] [INFO ] Deduced a trap composed of 21 places in 168 ms of which 1 ms to minimize.
[2024-05-25 18:58:14] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 1 ms to minimize.
[2024-05-25 18:58:15] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 0 ms to minimize.
[2024-05-25 18:58:15] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 0 ms to minimize.
[2024-05-25 18:58:15] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 0 ms to minimize.
[2024-05-25 18:58:15] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 0 ms to minimize.
[2024-05-25 18:58:15] [INFO ] Deduced a trap composed of 109 places in 120 ms of which 1 ms to minimize.
[2024-05-25 18:58:15] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 0 ms to minimize.
[2024-05-25 18:58:16] [INFO ] Deduced a trap composed of 114 places in 136 ms of which 4 ms to minimize.
[2024-05-25 18:58:16] [INFO ] Deduced a trap composed of 118 places in 124 ms of which 1 ms to minimize.
[2024-05-25 18:58:16] [INFO ] Deduced a trap composed of 114 places in 120 ms of which 1 ms to minimize.
[2024-05-25 18:58:16] [INFO ] Deduced a trap composed of 122 places in 124 ms of which 1 ms to minimize.
[2024-05-25 18:58:16] [INFO ] Deduced a trap composed of 112 places in 119 ms of which 1 ms to minimize.
[2024-05-25 18:58:16] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 0 ms to minimize.
[2024-05-25 18:58:16] [INFO ] Deduced a trap composed of 124 places in 121 ms of which 2 ms to minimize.
[2024-05-25 18:58:17] [INFO ] Deduced a trap composed of 121 places in 135 ms of which 0 ms to minimize.
[2024-05-25 18:58:17] [INFO ] Deduced a trap composed of 111 places in 120 ms of which 1 ms to minimize.
[2024-05-25 18:58:17] [INFO ] Deduced a trap composed of 125 places in 113 ms of which 1 ms to minimize.
[2024-05-25 18:58:17] [INFO ] Deduced a trap composed of 123 places in 119 ms of which 0 ms to minimize.
[2024-05-25 18:58:17] [INFO ] Deduced a trap composed of 131 places in 134 ms of which 1 ms to minimize.
[2024-05-25 18:58:17] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 0 ms to minimize.
[2024-05-25 18:58:18] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 1 ms to minimize.
[2024-05-25 18:58:18] [INFO ] Deduced a trap composed of 112 places in 116 ms of which 0 ms to minimize.
[2024-05-25 18:58:18] [INFO ] Deduced a trap composed of 119 places in 145 ms of which 0 ms to minimize.
[2024-05-25 18:58:18] [INFO ] Deduced a trap composed of 113 places in 139 ms of which 0 ms to minimize.
[2024-05-25 18:58:18] [INFO ] Deduced a trap composed of 117 places in 139 ms of which 2 ms to minimize.
[2024-05-25 18:58:19] [INFO ] Deduced a trap composed of 119 places in 264 ms of which 1 ms to minimize.
[2024-05-25 18:58:19] [INFO ] Deduced a trap composed of 117 places in 242 ms of which 1 ms to minimize.
[2024-05-25 18:58:19] [INFO ] Deduced a trap composed of 129 places in 202 ms of which 1 ms to minimize.
[2024-05-25 18:58:19] [INFO ] Deduced a trap composed of 47 places in 207 ms of which 1 ms to minimize.
[2024-05-25 18:58:19] [INFO ] Deduced a trap composed of 36 places in 197 ms of which 20 ms to minimize.
[2024-05-25 18:58:20] [INFO ] Deduced a trap composed of 128 places in 207 ms of which 1 ms to minimize.
[2024-05-25 18:58:20] [INFO ] Deduced a trap composed of 113 places in 202 ms of which 1 ms to minimize.
[2024-05-25 18:58:20] [INFO ] Deduced a trap composed of 143 places in 204 ms of which 1 ms to minimize.
[2024-05-25 18:58:20] [INFO ] Deduced a trap composed of 140 places in 225 ms of which 1 ms to minimize.
[2024-05-25 18:58:21] [INFO ] Deduced a trap composed of 8 places in 309 ms of which 1 ms to minimize.
[2024-05-25 18:58:21] [INFO ] Deduced a trap composed of 125 places in 250 ms of which 1 ms to minimize.
[2024-05-25 18:58:21] [INFO ] Deduced a trap composed of 117 places in 243 ms of which 1 ms to minimize.
[2024-05-25 18:58:22] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 1 ms to minimize.
[2024-05-25 18:58:22] [INFO ] Deduced a trap composed of 22 places in 249 ms of which 3 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:426)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-25 18:58:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 18:58:22] [INFO ] After 25054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:309
Fused 309 Parikh solutions to 302 different solutions.
Parikh walk visited 122 properties in 7377 ms.
Support contains 187 out of 512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 512/512 places, 464/464 transitions.
Graph (complete) has 1063 edges and 512 vertex of which 510 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 510 transition count 403
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 120 place count 451 transition count 403
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 120 place count 451 transition count 370
Deduced a syphon composed of 33 places in 7 ms
Ensure Unique test removed 5 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 71 rules applied. Total rules applied 191 place count 413 transition count 370
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 217 place count 387 transition count 344
Iterating global reduction 2 with 26 rules applied. Total rules applied 243 place count 387 transition count 344
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 243 place count 387 transition count 341
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 249 place count 384 transition count 341
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 409 place count 304 transition count 261
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 411 place count 303 transition count 264
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 413 place count 303 transition count 262
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 415 place count 301 transition count 262
Applied a total of 415 rules in 234 ms. Remains 301 /512 variables (removed 211) and now considering 262/464 (removed 202) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 235 ms. Remains : 301/512 places, 262/464 transitions.
Finished random walk after 17441 steps, including 261 resets, run visited all 187 properties in 212 ms. (steps per millisecond=82 )
Parikh walk visited 0 properties in 0 ms.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
Able to resolve query StableMarking after proving 358 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 37178 ms.

BK_STOP 1716663511100

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="BusinessProcesses-PT-10"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5568"
echo " Executing tool gold2023"
echo " Input is BusinessProcesses-PT-10, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r066-tajo-171620415700328"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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