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.r053-tajo-167813705300328.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 BusinessProcesses-PT-10, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r053-tajo-167813705300328
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 131K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1679000318722

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=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=BusinessProcesses-PT-10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-16 20:58:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-16 20:58:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 20:58:40] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-16 20:58:40] [INFO ] Transformed 518 places.
[2023-03-16 20:58:40] [INFO ] Transformed 471 transitions.
[2023-03-16 20:58:40] [INFO ] Found NUPN structural information;
[2023-03-16 20:58:40] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 122 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 12 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
Incomplete random walk after 10000 steps, including 91 resets, run finished after 545 ms. (steps per millisecond=18 ) properties (out of 356) seen :59
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) 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 297) seen :0
Running SMT prover for 297 properties.
// Phase 1: matrix 464 rows 512 cols
[2023-03-16 20:58:41] [INFO ] Computed 85 place invariants in 20 ms
[2023-03-16 20:58:43] [INFO ] After 2764ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:297
[2023-03-16 20:58:45] [INFO ] [Nat]Absence check using 46 positive place invariants in 31 ms returned sat
[2023-03-16 20:58:45] [INFO ] [Nat]Absence check using 46 positive and 39 generalized place invariants in 10 ms returned sat
[2023-03-16 20:58:51] [INFO ] After 4283ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :297
[2023-03-16 20:58:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 20:58:56] [INFO ] After 4220ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :297
[2023-03-16 20:58:56] [INFO ] Deduced a trap composed of 115 places in 176 ms of which 7 ms to minimize.
[2023-03-16 20:58:56] [INFO ] Deduced a trap composed of 122 places in 184 ms of which 1 ms to minimize.
[2023-03-16 20:58:56] [INFO ] Deduced a trap composed of 126 places in 155 ms of which 1 ms to minimize.
[2023-03-16 20:58:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 590 ms
[2023-03-16 20:58:58] [INFO ] Deduced a trap composed of 124 places in 153 ms of which 1 ms to minimize.
[2023-03-16 20:58:58] [INFO ] Deduced a trap composed of 121 places in 140 ms of which 1 ms to minimize.
[2023-03-16 20:58:58] [INFO ] Deduced a trap composed of 123 places in 99 ms of which 1 ms to minimize.
[2023-03-16 20:58:58] [INFO ] Deduced a trap composed of 113 places in 122 ms of which 0 ms to minimize.
[2023-03-16 20:58:59] [INFO ] Deduced a trap composed of 130 places in 159 ms of which 0 ms to minimize.
[2023-03-16 20:58:59] [INFO ] Deduced a trap composed of 113 places in 145 ms of which 1 ms to minimize.
[2023-03-16 20:58:59] [INFO ] Deduced a trap composed of 133 places in 97 ms of which 0 ms to minimize.
[2023-03-16 20:58:59] [INFO ] Deduced a trap composed of 129 places in 132 ms of which 1 ms to minimize.
[2023-03-16 20:58:59] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2023-03-16 20:58:59] [INFO ] Deduced a trap composed of 115 places in 141 ms of which 0 ms to minimize.
[2023-03-16 20:59:00] [INFO ] Deduced a trap composed of 117 places in 184 ms of which 0 ms to minimize.
[2023-03-16 20:59:00] [INFO ] Deduced a trap composed of 128 places in 102 ms of which 0 ms to minimize.
[2023-03-16 20:59:00] [INFO ] Deduced a trap composed of 124 places in 146 ms of which 1 ms to minimize.
[2023-03-16 20:59:00] [INFO ] Deduced a trap composed of 118 places in 164 ms of which 0 ms to minimize.
[2023-03-16 20:59:00] [INFO ] Deduced a trap composed of 125 places in 98 ms of which 1 ms to minimize.
[2023-03-16 20:59:00] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 1 ms to minimize.
[2023-03-16 20:59:00] [INFO ] Deduced a trap composed of 136 places in 98 ms of which 0 ms to minimize.
[2023-03-16 20:59:01] [INFO ] Deduced a trap composed of 128 places in 107 ms of which 0 ms to minimize.
[2023-03-16 20:59:01] [INFO ] Deduced a trap composed of 120 places in 95 ms of which 0 ms to minimize.
[2023-03-16 20:59:01] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 2 ms to minimize.
[2023-03-16 20:59:01] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 1 ms to minimize.
[2023-03-16 20:59:01] [INFO ] Deduced a trap composed of 112 places in 132 ms of which 1 ms to minimize.
[2023-03-16 20:59:01] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 0 ms to minimize.
[2023-03-16 20:59:01] [INFO ] Deduced a trap composed of 103 places in 122 ms of which 0 ms to minimize.
[2023-03-16 20:59:02] [INFO ] Deduced a trap composed of 128 places in 123 ms of which 1 ms to minimize.
[2023-03-16 20:59:02] [INFO ] Deduced a trap composed of 116 places in 131 ms of which 1 ms to minimize.
[2023-03-16 20:59:02] [INFO ] Deduced a trap composed of 117 places in 153 ms of which 1 ms to minimize.
[2023-03-16 20:59:02] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 1 ms to minimize.
[2023-03-16 20:59:02] [INFO ] Deduced a trap composed of 125 places in 147 ms of which 0 ms to minimize.
[2023-03-16 20:59:02] [INFO ] Deduced a trap composed of 128 places in 147 ms of which 1 ms to minimize.
[2023-03-16 20:59:03] [INFO ] Deduced a trap composed of 99 places in 140 ms of which 1 ms to minimize.
[2023-03-16 20:59:03] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 2 ms to minimize.
[2023-03-16 20:59:03] [INFO ] Deduced a trap composed of 101 places in 121 ms of which 1 ms to minimize.
[2023-03-16 20:59:03] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 0 ms to minimize.
[2023-03-16 20:59:03] [INFO ] Deduced a trap composed of 106 places in 114 ms of which 0 ms to minimize.
[2023-03-16 20:59:03] [INFO ] Deduced a trap composed of 123 places in 115 ms of which 1 ms to minimize.
[2023-03-16 20:59:03] [INFO ] Deduced a trap composed of 111 places in 139 ms of which 1 ms to minimize.
[2023-03-16 20:59:04] [INFO ] Deduced a trap composed of 132 places in 136 ms of which 1 ms to minimize.
[2023-03-16 20:59:04] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 1 ms to minimize.
[2023-03-16 20:59:04] [INFO ] Deduced a trap composed of 128 places in 131 ms of which 1 ms to minimize.
[2023-03-16 20:59:04] [INFO ] Deduced a trap composed of 126 places in 137 ms of which 1 ms to minimize.
[2023-03-16 20:59:04] [INFO ] Deduced a trap composed of 137 places in 135 ms of which 2 ms to minimize.
[2023-03-16 20:59:04] [INFO ] Deduced a trap composed of 126 places in 115 ms of which 0 ms to minimize.
[2023-03-16 20:59:05] [INFO ] Deduced a trap composed of 118 places in 135 ms of which 1 ms to minimize.
[2023-03-16 20:59:05] [INFO ] Deduced a trap composed of 126 places in 129 ms of which 1 ms to minimize.
[2023-03-16 20:59:05] [INFO ] Deduced a trap composed of 128 places in 116 ms of which 1 ms to minimize.
[2023-03-16 20:59:05] [INFO ] Deduced a trap composed of 125 places in 156 ms of which 1 ms to minimize.
[2023-03-16 20:59:05] [INFO ] Deduced a trap composed of 129 places in 137 ms of which 2 ms to minimize.
[2023-03-16 20:59:05] [INFO ] Deduced a trap composed of 103 places in 136 ms of which 1 ms to minimize.
[2023-03-16 20:59:05] [INFO ] Deduced a trap composed of 130 places in 124 ms of which 1 ms to minimize.
[2023-03-16 20:59:06] [INFO ] Deduced a trap composed of 123 places in 140 ms of which 0 ms to minimize.
[2023-03-16 20:59:06] [INFO ] Deduced a trap composed of 120 places in 127 ms of which 1 ms to minimize.
[2023-03-16 20:59:06] [INFO ] Deduced a trap composed of 109 places in 145 ms of which 4 ms to minimize.
[2023-03-16 20:59:06] [INFO ] Deduced a trap composed of 112 places in 230 ms of which 1 ms to minimize.
[2023-03-16 20:59:06] [INFO ] Deduced a trap composed of 43 places in 203 ms of which 0 ms to minimize.
[2023-03-16 20:59:07] [INFO ] Deduced a trap composed of 121 places in 178 ms of which 1 ms to minimize.
[2023-03-16 20:59:07] [INFO ] Deduced a trap composed of 109 places in 180 ms of which 0 ms to minimize.
[2023-03-16 20:59:07] [INFO ] Deduced a trap composed of 116 places in 205 ms of which 1 ms to minimize.
[2023-03-16 20:59:07] [INFO ] Deduced a trap composed of 117 places in 182 ms of which 1 ms to minimize.
[2023-03-16 20:59:08] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2023-03-16 20:59:08] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2023-03-16 20:59:08] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 0 ms to minimize.
[2023-03-16 20:59:08] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 14 ms to minimize.
[2023-03-16 20:59:08] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 0 ms to minimize.
[2023-03-16 20:59:08] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 25 ms to minimize.
[2023-03-16 20:59:08] [INFO ] Trap strengthening (SAT) tested/added 66/65 trap constraints in 10287 ms
[2023-03-16 20:59:09] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 1 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.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:386)
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-16 20:59:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 20:59:09] [INFO ] After 25239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:297
Fused 297 Parikh solutions to 289 different solutions.
Parikh walk visited 108 properties in 5033 ms.
Support contains 189 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.2 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 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 120 place count 451 transition count 372
Deduced a syphon composed of 31 places in 7 ms
Ensure Unique test removed 5 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 67 rules applied. Total rules applied 187 place count 415 transition count 372
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 213 place count 389 transition count 346
Iterating global reduction 2 with 26 rules applied. Total rules applied 239 place count 389 transition count 346
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 239 place count 389 transition count 343
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 245 place count 386 transition count 343
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 405 place count 306 transition count 263
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 407 place count 305 transition count 266
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 409 place count 305 transition count 264
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 411 place count 303 transition count 264
Applied a total of 411 rules in 176 ms. Remains 303 /512 variables (removed 209) and now considering 264/464 (removed 200) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 303/512 places, 264/464 transitions.
Finished random walk after 26002 steps, including 415 resets, run visited all 189 properties in 203 ms. (steps per millisecond=128 )
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 34412 ms.
ITS solved all properties within timeout

BK_STOP 1679000354908

--------------------
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 StableMarking -timeout 180 -rebuildPNML

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="lolaxred"
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-5348"
echo " Executing tool lolaxred"
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 r053-tajo-167813705300328"
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 ;