fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r183-tall-167838870300362
Last Updated
May 14, 2023

About the Execution of LTSMin+red for FlexibleBarrier-PT-20b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1225.964 426467.00 514856.00 998.80 T normal

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.r183-tall-167838870300362.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 ltsminxred
Input is FlexibleBarrier-PT-20b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r183-tall-167838870300362
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.1K Feb 25 12:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 12:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 12:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 12:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Feb 25 12:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.5M 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1678552053010

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=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FlexibleBarrier-PT-20b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 16:27:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-11 16:27:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 16:27:34] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2023-03-11 16:27:34] [INFO ] Transformed 5372 places.
[2023-03-11 16:27:34] [INFO ] Transformed 6193 transitions.
[2023-03-11 16:27:34] [INFO ] Found NUPN structural information;
[2023-03-11 16:27:34] [INFO ] Parsed PT model containing 5372 places and 6193 transitions and 15575 arcs in 287 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 5372/5372 places, 6193/6193 transitions.
Graph (trivial) has 5310 edges and 5372 vertex of which 122 / 5372 are part of one of the 20 SCC in 17 ms
Free SCC test removed 102 places
Ensure Unique test removed 103 transitions
Reduce isomorphic transitions removed 103 transitions.
Drop transitions removed 1309 transitions
Trivial Post-agglo rules discarded 1309 transitions
Performed 1309 trivial Post agglomeration. Transition count delta: 1309
Iterating post reduction 0 with 1309 rules applied. Total rules applied 1310 place count 5270 transition count 4781
Reduce places removed 1309 places and 0 transitions.
Iterating post reduction 1 with 1309 rules applied. Total rules applied 2619 place count 3961 transition count 4781
Performed 380 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 380 Pre rules applied. Total rules applied 2619 place count 3961 transition count 4401
Deduced a syphon composed of 380 places in 21 ms
Reduce places removed 380 places and 0 transitions.
Iterating global reduction 2 with 760 rules applied. Total rules applied 3379 place count 3581 transition count 4401
Performed 2335 Post agglomeration using F-continuation condition.Transition count delta: 2335
Deduced a syphon composed of 2335 places in 1 ms
Reduce places removed 2335 places and 0 transitions.
Iterating global reduction 2 with 4670 rules applied. Total rules applied 8049 place count 1246 transition count 2066
Applied a total of 8049 rules in 625 ms. Remains 1246 /5372 variables (removed 4126) and now considering 2066/6193 (removed 4127) transitions.
[2023-03-11 16:27:35] [INFO ] Flow matrix only has 2007 transitions (discarded 59 similar events)
// Phase 1: matrix 2007 rows 1246 cols
[2023-03-11 16:27:35] [INFO ] Computed 22 place invariants in 92 ms
[2023-03-11 16:27:36] [INFO ] Implicit Places using invariants in 995 ms returned []
[2023-03-11 16:27:36] [INFO ] Flow matrix only has 2007 transitions (discarded 59 similar events)
[2023-03-11 16:27:36] [INFO ] Invariant cache hit.
[2023-03-11 16:27:36] [INFO ] State equation strengthened by 121 read => feed constraints.
[2023-03-11 16:27:38] [INFO ] Implicit Places using invariants and state equation in 2437 ms returned []
Implicit Place search using SMT with State Equation took 3459 ms to find 0 implicit places.
[2023-03-11 16:27:38] [INFO ] Flow matrix only has 2007 transitions (discarded 59 similar events)
[2023-03-11 16:27:38] [INFO ] Invariant cache hit.
[2023-03-11 16:27:39] [INFO ] Dead Transitions using invariants and state equation in 778 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 1246/5372 places, 2066/6193 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 4865 ms. Remains : 1246/5372 places, 2066/6193 transitions.
Discarding 1203 transitions out of 2066. Remains 863
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 394 resets, run finished after 903 ms. (steps per millisecond=11 ) properties (out of 862) seen :81
Running SMT prover for 781 properties.
[2023-03-11 16:27:40] [INFO ] Flow matrix only has 2007 transitions (discarded 59 similar events)
[2023-03-11 16:27:40] [INFO ] Invariant cache hit.
[2023-03-11 16:27:55] [INFO ] [Real]Absence check using 22 positive place invariants in 19 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
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-11 16:28:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 16:28:06] [INFO ] After 25016ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 781 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1163 out of 1246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1246/1246 places, 2066/2066 transitions.
Drop transitions removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 1246 transition count 2006
Free-agglomeration rule applied 21 times.
Iterating global reduction 1 with 21 rules applied. Total rules applied 81 place count 1246 transition count 1985
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 102 place count 1225 transition count 1985
Applied a total of 102 rules in 404 ms. Remains 1225 /1246 variables (removed 21) and now considering 1985/2066 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 404 ms. Remains : 1225/1246 places, 1985/2066 transitions.
Interrupted random walk after 428890 steps, including 17838 resets, run timeout after 30001 ms. (steps per millisecond=14 ) properties seen 25
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=1001 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=1001 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=1001 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=1001 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=1001 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=1001 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=1001 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=1001 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=1001 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=1001 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=1001 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 756) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=1001 ) properties (out of 756) seen :0
Probabilistic random walk after 1000001 steps, saw 319404 distinct states, run finished after 26158 ms. (steps per millisecond=38 ) properties seen :3
Running SMT prover for 753 properties.
// Phase 1: matrix 1985 rows 1225 cols
[2023-03-11 16:29:03] [INFO ] Computed 22 place invariants in 64 ms
[2023-03-11 16:29:17] [INFO ] [Real]Absence check using 22 positive place invariants in 23 ms returned sat
[2023-03-11 16:30:11] [INFO ] After 40547ms SMT Verify possible using state equation in real domain returned unsat :0 sat :729 real:24
[2023-03-11 16:30:11] [INFO ] State equation strengthened by 121 read => feed constraints.
[2023-03-11 16:30:52] [INFO ] After 41266ms SMT Verify possible using 121 Read/Feed constraints in real domain returned unsat :0 sat :57 real:696
[2023-03-11 16:30:58] [INFO ] After 46878ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:753
[2023-03-11 16:30:58] [INFO ] After 114008ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:753
[2023-03-11 16:31:11] [INFO ] [Nat]Absence check using 22 positive place invariants in 19 ms returned sat
[2023-03-11 16:32:00] [INFO ] After 37612ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :753
[2023-03-11 16:32:39] [INFO ] After 38201ms SMT Verify possible using 121 Read/Feed constraints in natural domain returned unsat :0 sat :753
[2023-03-11 16:33:46] [INFO ] After 105089ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :753
Attempting to minimize the solution found.
Minimization took 40588 ms.
[2023-03-11 16:34:26] [INFO ] After 208465ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :753
Parikh walk visited 707 properties in 8134 ms.
Support contains 105 out of 1225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1225/1225 places, 1985/1985 transitions.
Discarding 340 places :
Symmetric choice reduction at 0 with 340 rule applications. Total rules 340 place count 885 transition count 1645
Iterating global reduction 0 with 340 rules applied. Total rules applied 680 place count 885 transition count 1645
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 320 transitions.
Iterating post reduction 0 with 320 rules applied. Total rules applied 1000 place count 885 transition count 1325
Free-agglomeration rule applied 677 times with reduction of 1 identical transitions.
Iterating global reduction 1 with 677 rules applied. Total rules applied 1677 place count 885 transition count 647
Reduce places removed 677 places and 0 transitions.
Iterating post reduction 1 with 677 rules applied. Total rules applied 2354 place count 208 transition count 647
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2355 place count 207 transition count 646
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 100 edges and 206 vertex of which 40 / 206 are part of one of the 20 SCC in 1 ms
Free SCC test removed 20 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 2357 place count 186 transition count 646
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 3 with 40 rules applied. Total rules applied 2397 place count 186 transition count 606
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 2397 place count 186 transition count 586
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 2437 place count 166 transition count 586
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 2457 place count 166 transition count 566
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 2497 place count 146 transition count 546
Free-agglomeration rule applied 20 times.
Iterating global reduction 5 with 20 rules applied. Total rules applied 2517 place count 146 transition count 526
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 41 rules applied. Total rules applied 2558 place count 125 transition count 506
Drop transitions removed 302 transitions
Redundant transition composition rules discarded 302 transitions
Iterating global reduction 6 with 302 rules applied. Total rules applied 2860 place count 125 transition count 204
Applied a total of 2860 rules in 360 ms. Remains 125 /1225 variables (removed 1100) and now considering 204/1985 (removed 1781) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 361 ms. Remains : 125/1225 places, 204/1985 transitions.
Finished random walk after 434021 steps, including 20155 resets, run visited all 46 properties in 3026 ms. (steps per millisecond=143 )
Able to resolve query QuasiLiveness after proving 863 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK PARIKH_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 423788 ms.
ITS solved all properties within timeout

BK_STOP 1678552479477

--------------------
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="FlexibleBarrier-PT-20b"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is FlexibleBarrier-PT-20b, 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 r183-tall-167838870300362"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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