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.r533-tall-167987252900014.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 Anderson-PT-06, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r533-tall-167987252900014
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 14K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Mar 23 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 302K Mar 31 16:48 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 Liveness

=== Now, execution of the tool begins

BK_START 1680815490810

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=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-06
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-06 21:11:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2023-04-06 21:11:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 21:11:32] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2023-04-06 21:11:32] [INFO ] Transformed 229 places.
[2023-04-06 21:11:32] [INFO ] Transformed 600 transitions.
[2023-04-06 21:11:32] [INFO ] Found NUPN structural information;
[2023-04-06 21:11:32] [INFO ] Parsed PT model containing 229 places and 600 transitions and 2280 arcs in 131 ms.
Built sparse matrix representations for Structural reductions in 8 ms.25705KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 229/229 places, 600/600 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 39 ms. Remains 229 /229 variables (removed 0) and now considering 600/600 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 39 ms. Remains : 229/229 places, 600/600 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 229/229 places, 600/600 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 27 ms. Remains 229 /229 variables (removed 0) and now considering 600/600 (removed 0) transitions.
// Phase 1: matrix 600 rows 229 cols
[2023-04-06 21:11:32] [INFO ] Computed 15 invariants in 29 ms
[2023-04-06 21:11:33] [INFO ] Implicit Places using invariants in 338 ms returned []
[2023-04-06 21:11:33] [INFO ] Invariant cache hit.
[2023-04-06 21:11:33] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-04-06 21:11:33] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
[2023-04-06 21:11:33] [INFO ] Redundant transitions in 32 ms returned []
[2023-04-06 21:11:33] [INFO ] Invariant cache hit.
[2023-04-06 21:11:33] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 1091 ms. Remains : 229/229 places, 600/600 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1644 ms (no deadlock found). (steps per millisecond=760 )
Random directed walk for 1250001 steps, including 0 resets, run took 1559 ms (no deadlock found). (steps per millisecond=801 )
[2023-04-06 21:11:36] [INFO ] Invariant cache hit.
[2023-04-06 21:11:37] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-04-06 21:11:37] [INFO ] [Real]Absence check using 7 positive and 8 generalized place invariants in 111 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 229/229 places, 600/600 transitions.
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 30 Pre rules applied. Total rules applied 0 place count 229 transition count 570
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 199 transition count 570
Applied a total of 60 rules in 17 ms. Remains 199 /229 variables (removed 30) and now considering 570/600 (removed 30) transitions.
// Phase 1: matrix 570 rows 199 cols
[2023-04-06 21:11:37] [INFO ] Computed 15 invariants in 12 ms
[2023-04-06 21:11:37] [INFO ] Implicit Places using invariants in 262 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 265 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 198/229 places, 570/600 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 198 transition count 534
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 162 transition count 534
Applied a total of 72 rules in 5 ms. Remains 162 /198 variables (removed 36) and now considering 534/570 (removed 36) transitions.
// Phase 1: matrix 534 rows 162 cols
[2023-04-06 21:11:37] [INFO ] Computed 14 invariants in 4 ms
[2023-04-06 21:11:37] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-04-06 21:11:37] [INFO ] Invariant cache hit.
[2023-04-06 21:11:37] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-04-06 21:11:38] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 162/229 places, 534/600 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1136 ms. Remains : 162/229 places, 534/600 transitions.
Initial state reduction rules removed 6 formulas.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 613 ms. (steps per millisecond=16 ) properties (out of 528) seen :369
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) 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 159) seen :0
Running SMT prover for 159 properties.
[2023-04-06 21:11:39] [INFO ] Invariant cache hit.
[2023-04-06 21:11:39] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-04-06 21:11:39] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 5 ms returned sat
[2023-04-06 21:11:46] [INFO ] After 6916ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:159
[2023-04-06 21:11:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-04-06 21:11:46] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 10 ms returned sat
[2023-04-06 21:11:52] [INFO ] After 5164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :159
[2023-04-06 21:11:52] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-04-06 21:11:57] [INFO ] After 5530ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :0 sat :159
[2023-04-06 21:12:04] [INFO ] Deduced a trap composed of 51 places in 98 ms of which 4 ms to minimize.
[2023-04-06 21:12:04] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 1 ms to minimize.
[2023-04-06 21:12:04] [INFO ] Deduced a trap composed of 80 places in 82 ms of which 1 ms to minimize.
[2023-04-06 21:12:04] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 2 ms to minimize.
[2023-04-06 21:12:04] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 1 ms to minimize.
[2023-04-06 21:12:04] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 0 ms to minimize.
[2023-04-06 21:12:04] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 0 ms to minimize.
[2023-04-06 21:12:04] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 1 ms to minimize.
[2023-04-06 21:12:05] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 1 ms to minimize.
[2023-04-06 21:12:05] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 1 ms to minimize.
[2023-04-06 21:12:05] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 1 ms to minimize.
[2023-04-06 21:12:05] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 0 ms to minimize.
[2023-04-06 21:12:05] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 0 ms to minimize.
[2023-04-06 21:12:05] [INFO ] Deduced a trap composed of 55 places in 94 ms of which 1 ms to minimize.
[2023-04-06 21:12:06] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 0 ms to minimize.
[2023-04-06 21:12:06] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 0 ms to minimize.
[2023-04-06 21:12:06] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 0 ms to minimize.
[2023-04-06 21:12:06] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 0 ms to minimize.
[2023-04-06 21:12:06] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 0 ms to minimize.
[2023-04-06 21:12:07] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 1 ms to minimize.
[2023-04-06 21:12:08] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 0 ms to minimize.
[2023-04-06 21:12:08] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 1 ms to minimize.
[2023-04-06 21:12:08] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 1 ms to minimize.
[2023-04-06 21:12:08] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 0 ms to minimize.
[2023-04-06 21:12:08] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 0 ms to minimize.
[2023-04-06 21:12:09] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 0 ms to minimize.
[2023-04-06 21:12:09] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 1 ms to minimize.
[2023-04-06 21:12:10] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 1 ms to minimize.
[2023-04-06 21:12:10] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 1 ms to minimize.
[2023-04-06 21:12:10] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 0 ms to minimize.
[2023-04-06 21:12:11] [INFO ] Deduced a trap composed of 32 places in 90 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: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:399)
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)
[2023-04-06 21:12:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-04-06 21:12:11] [INFO ] After 25098ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:159
Parikh walk visited 22 properties in 670 ms.
Support contains 67 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 534/534 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 144 transition count 516
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 144 transition count 516
Applied a total of 36 rules in 25 ms. Remains 144 /162 variables (removed 18) and now considering 516/534 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 144/162 places, 516/534 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 18958 ms. (steps per millisecond=52 ) properties (out of 137) seen :116
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 454 ms. (steps per millisecond=220 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 706 ms. (steps per millisecond=141 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 487 ms. (steps per millisecond=205 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 100000 steps, including 2 resets, run finished after 447 ms. (steps per millisecond=223 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 374 ms. (steps per millisecond=267 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 363 ms. (steps per millisecond=275 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 100000 steps, including 2 resets, run finished after 363 ms. (steps per millisecond=275 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 100000 steps, including 2 resets, run finished after 325 ms. (steps per millisecond=307 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 100000 steps, including 2 resets, run finished after 399 ms. (steps per millisecond=250 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 317 ms. (steps per millisecond=315 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 333 ms. (steps per millisecond=300 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 311 ms. (steps per millisecond=321 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 299 ms. (steps per millisecond=334 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 279 ms. (steps per millisecond=358 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 254 ms. (steps per millisecond=393 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=423 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=523 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 100000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=1515 ) properties (out of 2) seen :1
Finished Best-First random walk after 11349 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=1418 )
Parikh walk visited 0 properties in 0 ms.
Able to resolve query QuasiLiveness after proving 534 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 229/229 places, 600/600 transitions.
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 30 Pre rules applied. Total rules applied 0 place count 229 transition count 570
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 199 transition count 570
Applied a total of 60 rules in 19 ms. Remains 199 /229 variables (removed 30) and now considering 570/600 (removed 30) transitions.
// Phase 1: matrix 570 rows 199 cols
[2023-04-06 21:12:37] [INFO ] Computed 15 invariants in 5 ms
[2023-04-06 21:12:37] [INFO ] Implicit Places using invariants in 255 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 256 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 198/229 places, 570/600 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 198 transition count 534
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 162 transition count 534
Applied a total of 72 rules in 7 ms. Remains 162 /198 variables (removed 36) and now considering 534/570 (removed 36) transitions.
// Phase 1: matrix 534 rows 162 cols
[2023-04-06 21:12:37] [INFO ] Computed 14 invariants in 2 ms
[2023-04-06 21:12:37] [INFO ] Implicit Places using invariants in 293 ms returned []
[2023-04-06 21:12:37] [INFO ] Invariant cache hit.
[2023-04-06 21:12:37] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-04-06 21:12:38] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 895 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 162/229 places, 534/600 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1178 ms. Remains : 162/229 places, 534/600 transitions.
Unable to solve all queries for examination Liveness. Remains :534 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 534 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 65968 ms.
starting LoLA
BK_INPUT Anderson-PT-06
BK_EXAMINATION: Liveness
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution
GlobalProperty: Liveness

FORMULA Liveness TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1680815707680

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -timeout 180 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/model.pnml
lola: LAUNCH SYMM
lola: reporting
lola: not produced: 540
lola: reporting
lola: not produced: 540
lola: reporting
lola: not produced: 540
lola: reporting
lola: not produced: 540
lola: reporting
lola: not produced: 540
lola: reporting
lola: not produced: 540
lola: reporting
lola: not produced: 540
lola: reporting
lola: not produced: 540
lola: reporting
lola: not produced: 540
lola: reporting
lola: not produced: 540
lola: reporting
lola: not produced: 540
lola: reporting
lola: not produced: 540
lola: reporting
lola: not produced: 540
lola: reporting
lola: not produced: 540
lola: reporting
lola: not produced: 540
lola: reporting
lola: not produced: 540
lola: ..... ncs_to_p1_0_3_3: true
lola: reporting
lola: not produced: 539
lola: goal oriented search: 1
lola: reporting
lola: not produced: 539
lola: goal oriented search: 1
lola: reporting
lola: not produced: 539
lola: goal oriented search: 1
lola: reporting
lola: not produced: 539
lola: goal oriented search: 1
lola: reporting
lola: not produced: 539
lola: goal oriented search: 1
lola: reporting
lola: not produced: 539
lola: goal oriented search: 1
lola: reporting
lola: not produced: 539
lola: goal oriented search: 1
lola: reporting
lola: not produced: 539
lola: goal oriented search: 1
lola: reporting
lola: not produced: 539
lola: goal oriented search: 1
lola: reporting
lola: not produced: 539
lola: goal oriented search: 1
lola: reporting
lola: not produced: 539
lola: goal oriented search: 1
lola: reporting
lola: not produced: 539
lola: goal oriented search: 1
lola: reporting
lola: not produced: 539
lola: goal oriented search: 1
lola: The net is live

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="Anderson-PT-06"
export BK_EXAMINATION="Liveness"
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 Anderson-PT-06, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r533-tall-167987252900014"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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