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.r469-smll-167912658600262.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 StigmergyCommit-PT-03b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r469-smll-167912658600262
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 6.2K Feb 26 10:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 10:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 10:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 10:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 26 10:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 10:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 10:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 359K Mar 5 18:23 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1679381881519

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=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=StigmergyCommit-PT-03b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-21 06:58:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-21 06:58:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 06:58:05] [INFO ] Load time of PNML (sax parser for PT used): 230 ms
[2023-03-21 06:58:05] [INFO ] Transformed 1231 places.
[2023-03-21 06:58:05] [INFO ] Transformed 1476 transitions.
[2023-03-21 06:58:05] [INFO ] Found NUPN structural information;
[2023-03-21 06:58:05] [INFO ] Parsed PT model containing 1231 places and 1476 transitions and 4168 arcs in 393 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1231/1231 places, 1476/1476 transitions.
Graph (trivial) has 1222 edges and 1231 vertex of which 84 / 1231 are part of one of the 12 SCC in 11 ms
Free SCC test removed 72 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions removed 924 transitions
Trivial Post-agglo rules discarded 924 transitions
Performed 924 trivial Post agglomeration. Transition count delta: 924
Iterating post reduction 0 with 924 rules applied. Total rules applied 925 place count 1159 transition count 472
Reduce places removed 924 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 940 rules applied. Total rules applied 1865 place count 235 transition count 456
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1869 place count 231 transition count 456
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 1869 place count 231 transition count 412
Deduced a syphon composed of 44 places in 3 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 1957 place count 187 transition count 412
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 2077 place count 127 transition count 352
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 2097 place count 117 transition count 370
Applied a total of 2097 rules in 98 ms. Remains 117 /1231 variables (removed 1114) and now considering 370/1476 (removed 1106) transitions.
[2023-03-21 06:58:05] [INFO ] Flow matrix only has 358 transitions (discarded 12 similar events)
// Phase 1: matrix 358 rows 117 cols
[2023-03-21 06:58:05] [INFO ] Computed 5 place invariants in 35 ms
[2023-03-21 06:58:06] [INFO ] Implicit Places using invariants in 462 ms returned []
[2023-03-21 06:58:06] [INFO ] Flow matrix only has 358 transitions (discarded 12 similar events)
[2023-03-21 06:58:06] [INFO ] Invariant cache hit.
[2023-03-21 06:58:06] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-21 06:58:06] [INFO ] Implicit Places using invariants and state equation in 661 ms returned []
Implicit Place search using SMT with State Equation took 1175 ms to find 0 implicit places.
[2023-03-21 06:58:06] [INFO ] Flow matrix only has 358 transitions (discarded 12 similar events)
[2023-03-21 06:58:06] [INFO ] Invariant cache hit.
[2023-03-21 06:58:07] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 117/1231 places, 370/1476 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 1769 ms. Remains : 117/1231 places, 370/1476 transitions.
Discarding 102 transitions out of 370. Remains 268
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 1501 resets, run finished after 1186 ms. (steps per millisecond=8 ) properties (out of 267) seen :45
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 222) 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 222) 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 222) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) 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 222) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 222) seen :0
Running SMT prover for 222 properties.
[2023-03-21 06:58:08] [INFO ] Flow matrix only has 358 transitions (discarded 12 similar events)
[2023-03-21 06:58:08] [INFO ] Invariant cache hit.
[2023-03-21 06:58:10] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-21 06:58:18] [INFO ] After 6506ms SMT Verify possible using state equation in real domain returned unsat :0 sat :11 real:211
[2023-03-21 06:58:18] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-21 06:58:18] [INFO ] After 293ms SMT Verify possible using 71 Read/Feed constraints in real domain returned unsat :0 sat :0 real:222
[2023-03-21 06:58:18] [INFO ] After 9416ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:222
[2023-03-21 06:58:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-21 06:58:25] [INFO ] After 5024ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :222
[2023-03-21 06:58:32] [INFO ] After 6103ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :0 sat :222
[2023-03-21 06:58:32] [INFO ] Deduced a trap composed of 45 places in 212 ms of which 11 ms to minimize.
[2023-03-21 06:58:32] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 2 ms to minimize.
[2023-03-21 06:58:32] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 2 ms to minimize.
[2023-03-21 06:58:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 638 ms
[2023-03-21 06:58:32] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 1 ms to minimize.
[2023-03-21 06:58:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2023-03-21 06:58:33] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 1 ms to minimize.
[2023-03-21 06:58:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-03-21 06:58:33] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 0 ms to minimize.
[2023-03-21 06:58:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2023-03-21 06:58:33] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 1 ms to minimize.
[2023-03-21 06:58:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2023-03-21 06:58:33] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 2 ms to minimize.
[2023-03-21 06:58:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-03-21 06:58:34] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 0 ms to minimize.
[2023-03-21 06:58:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2023-03-21 06:58:34] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 1 ms to minimize.
[2023-03-21 06:58:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2023-03-21 06:58:41] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 3 ms to minimize.
[2023-03-21 06:58:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2023-03-21 06:58:41] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 1 ms to minimize.
[2023-03-21 06:58:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2023-03-21 06:58:41] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 1 ms to minimize.
[2023-03-21 06:58:41] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 1 ms to minimize.
[2023-03-21 06:58:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 350 ms
[2023-03-21 06:58:41] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 0 ms to minimize.
[2023-03-21 06:58:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-03-21 06:58:42] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 0 ms to minimize.
[2023-03-21 06:58:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2023-03-21 06:58:42] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 1 ms to minimize.
[2023-03-21 06:58:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2023-03-21 06:58:42] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 1 ms to minimize.
[2023-03-21 06:58:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2023-03-21 06:58:43] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 0 ms to minimize.
[2023-03-21 06:58:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2023-03-21 06:58:43] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 0 ms to minimize.
[2023-03-21 06:58:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2023-03-21 06:58:43] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 1 ms to minimize.
[2023-03-21 06:58:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2023-03-21 06:58:43] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 2 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-21 06:58:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 06:58:43] [INFO ] After 25113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:222
Fused 222 Parikh solutions to 220 different solutions.
Parikh walk visited 0 properties in 2438 ms.
Support contains 85 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 370/370 transitions.
Graph (complete) has 414 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 116 transition count 356
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 19 place count 111 transition count 351
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 111 transition count 351
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 107 transition count 347
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 107 transition count 347
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 103 transition count 343
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 103 transition count 343
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 60 place count 103 transition count 323
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 76 place count 103 transition count 307
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 103 transition count 306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 102 transition count 306
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 102 transition count 306
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 102 transition count 305
Applied a total of 80 rules in 111 ms. Remains 102 /117 variables (removed 15) and now considering 305/370 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 102/117 places, 305/370 transitions.
Interrupted random walk after 702847 steps, including 97060 resets, run timeout after 30001 ms. (steps per millisecond=23 ) properties seen 201
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 758 ms. (steps per millisecond=131 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 100001 steps, including 895 resets, run finished after 559 ms. (steps per millisecond=178 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 892 resets, run finished after 522 ms. (steps per millisecond=191 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 884 resets, run finished after 531 ms. (steps per millisecond=188 ) properties (out of 20) seen :8
Incomplete Best-First random walk after 100000 steps, including 887 resets, run finished after 417 ms. (steps per millisecond=239 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 100001 steps, including 875 resets, run finished after 393 ms. (steps per millisecond=254 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 100001 steps, including 882 resets, run finished after 371 ms. (steps per millisecond=269 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 100001 steps, including 890 resets, run finished after 353 ms. (steps per millisecond=283 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 100001 steps, including 893 resets, run finished after 350 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 100001 steps, including 887 resets, run finished after 419 ms. (steps per millisecond=238 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 100001 steps, including 887 resets, run finished after 377 ms. (steps per millisecond=265 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 305 rows 102 cols
[2023-03-21 06:59:21] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-21 06:59:21] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-21 06:59:21] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-21 06:59:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-21 06:59:22] [INFO ] After 297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-21 06:59:22] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-21 06:59:22] [INFO ] After 194ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-21 06:59:22] [INFO ] Deduced a trap composed of 33 places in 155 ms of which 1 ms to minimize.
[2023-03-21 06:59:22] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 1 ms to minimize.
[2023-03-21 06:59:22] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 1 ms to minimize.
[2023-03-21 06:59:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 490 ms
[2023-03-21 06:59:23] [INFO ] Deduced a trap composed of 36 places in 163 ms of which 1 ms to minimize.
[2023-03-21 06:59:23] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 0 ms to minimize.
[2023-03-21 06:59:23] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 1 ms to minimize.
[2023-03-21 06:59:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 478 ms
[2023-03-21 06:59:23] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 1 ms to minimize.
[2023-03-21 06:59:23] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 1 ms to minimize.
[2023-03-21 06:59:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 313 ms
[2023-03-21 06:59:24] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 1 ms to minimize.
[2023-03-21 06:59:24] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 0 ms to minimize.
[2023-03-21 06:59:24] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 1 ms to minimize.
[2023-03-21 06:59:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 513 ms
[2023-03-21 06:59:24] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 1 ms to minimize.
[2023-03-21 06:59:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2023-03-21 06:59:24] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 4 ms to minimize.
[2023-03-21 06:59:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2023-03-21 06:59:24] [INFO ] After 2492ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 176 ms.
[2023-03-21 06:59:24] [INFO ] After 3068ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Finished Parikh walk after 3643 steps, including 217 resets, run visited all 2 properties in 18 ms. (steps per millisecond=202 )
Parikh walk visited 8 properties in 407 ms.
Able to resolve query QuasiLiveness after proving 268 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 80278 ms.
ITS solved all properties within timeout

BK_STOP 1679381966660

--------------------
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 QuasiLiveness -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="StigmergyCommit-PT-03b"
export BK_EXAMINATION="QuasiLiveness"
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 StigmergyCommit-PT-03b, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r469-smll-167912658600262"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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