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.r007-oct2-167813595100159.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ASLink-PT-10a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-oct2-167813595100159
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 9.9K Feb 26 13:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 13:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 13:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 13:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 26 13:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:30 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 920K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678343261858

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-10a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 06:27:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 06:27:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 06:27:44] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2023-03-09 06:27:44] [INFO ] Transformed 2186 places.
[2023-03-09 06:27:44] [INFO ] Transformed 3192 transitions.
[2023-03-09 06:27:44] [INFO ] Found NUPN structural information;
[2023-03-09 06:27:44] [INFO ] Parsed PT model containing 2186 places and 3192 transitions and 11972 arcs in 251 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 34 transitions
Reduce redundant transitions removed 34 transitions.
Incomplete random walk after 10000 steps, including 46 resets, run finished after 553 ms. (steps per millisecond=18 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 97507 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97507 steps, saw 27419 distinct states, run finished after 3003 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 3158 rows 2186 cols
[2023-03-09 06:27:48] [INFO ] Computed 422 place invariants in 243 ms
[2023-03-09 06:27:50] [INFO ] [Real]Absence check using 105 positive place invariants in 100 ms returned sat
[2023-03-09 06:27:50] [INFO ] [Real]Absence check using 105 positive and 317 generalized place invariants in 288 ms returned sat
[2023-03-09 06:27:50] [INFO ] After 1821ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-09 06:27:52] [INFO ] [Nat]Absence check using 105 positive place invariants in 57 ms returned sat
[2023-03-09 06:27:52] [INFO ] [Nat]Absence check using 105 positive and 317 generalized place invariants in 252 ms returned sat
[2023-03-09 06:28:15] [INFO ] After 22690ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :12
[2023-03-09 06:28:15] [INFO ] After 22709ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :12
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-09 06:28:15] [INFO ] After 25037ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :12
FORMULA ASLink-PT-10a-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-10a-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 16 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 750 ms.
Support contains 177 out of 2186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2186/2186 places, 3158/3158 transitions.
Ensure Unique test removed 38 places
Discarding 19 places :
Implicit places reduction removed 19 places
Drop transitions removed 177 transitions
Trivial Post-agglo rules discarded 177 transitions
Performed 177 trivial Post agglomeration. Transition count delta: 177
Iterating post reduction 0 with 234 rules applied. Total rules applied 234 place count 2129 transition count 2981
Reduce places removed 177 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 184 rules applied. Total rules applied 418 place count 1952 transition count 2974
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 425 place count 1945 transition count 2974
Performed 191 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 191 Pre rules applied. Total rules applied 425 place count 1945 transition count 2783
Deduced a syphon composed of 191 places in 5 ms
Ensure Unique test removed 76 places
Reduce places removed 267 places and 0 transitions.
Iterating global reduction 3 with 458 rules applied. Total rules applied 883 place count 1678 transition count 2783
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 884 place count 1678 transition count 2782
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 885 place count 1677 transition count 2782
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 894 place count 1668 transition count 2735
Ensure Unique test removed 1 places
Iterating global reduction 5 with 10 rules applied. Total rules applied 904 place count 1667 transition count 2735
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 910 place count 1666 transition count 2730
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 913 place count 1663 transition count 2730
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 5 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 7 with 106 rules applied. Total rules applied 1019 place count 1610 transition count 2677
Free-agglomeration rule applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 1024 place count 1610 transition count 2672
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1029 place count 1605 transition count 2672
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1037 place count 1605 transition count 2664
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 1045 place count 1597 transition count 2664
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 1052 place count 1597 transition count 2664
Applied a total of 1052 rules in 815 ms. Remains 1597 /2186 variables (removed 589) and now considering 2664/3158 (removed 494) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 816 ms. Remains : 1597/2186 places, 2664/3158 transitions.
Incomplete random walk after 10000 steps, including 76 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 14) seen :1
FORMULA ASLink-PT-10a-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 13) seen :1
FORMULA ASLink-PT-10a-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 12 properties.
// Phase 1: matrix 2664 rows 1597 cols
[2023-03-09 06:28:18] [INFO ] Computed 287 place invariants in 114 ms
[2023-03-09 06:28:19] [INFO ] After 500ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-09 06:28:19] [INFO ] [Nat]Absence check using 83 positive place invariants in 52 ms returned sat
[2023-03-09 06:28:20] [INFO ] [Nat]Absence check using 83 positive and 204 generalized place invariants in 292 ms returned sat
[2023-03-09 06:28:42] [INFO ] After 22100ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :7
[2023-03-09 06:28:42] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-09 06:28:44] [INFO ] After 1869ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :4 sat :6
[2023-03-09 06:28:44] [INFO ] After 1869ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :6
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-09 06:28:44] [INFO ] After 25040ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :6
FORMULA ASLink-PT-10a-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-10a-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-10a-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-10a-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 964 ms.
Support contains 75 out of 1597 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1597/1597 places, 2664/2664 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1595 transition count 2656
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 18 place count 1587 transition count 2656
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 18 place count 1587 transition count 2643
Deduced a syphon composed of 13 places in 4 ms
Ensure Unique test removed 4 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 48 place count 1570 transition count 2643
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 51 place count 1567 transition count 2623
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 1567 transition count 2623
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1566 transition count 2615
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1566 transition count 2615
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 68 place count 1560 transition count 2609
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 1560 transition count 2608
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 1559 transition count 2608
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 1559 transition count 2606
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 1557 transition count 2606
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 79 place count 1557 transition count 2606
Applied a total of 79 rules in 592 ms. Remains 1557 /1597 variables (removed 40) and now considering 2606/2664 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 593 ms. Remains : 1557/1597 places, 2606/2664 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 127723 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 127723 steps, saw 33348 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2606 rows 1557 cols
[2023-03-09 06:28:49] [INFO ] Computed 281 place invariants in 25 ms
[2023-03-09 06:28:50] [INFO ] After 376ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-09 06:28:50] [INFO ] [Nat]Absence check using 77 positive place invariants in 35 ms returned sat
[2023-03-09 06:28:50] [INFO ] [Nat]Absence check using 77 positive and 204 generalized place invariants in 75 ms returned sat
[2023-03-09 06:29:15] [INFO ] After 24158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 06:29:15] [INFO ] State equation strengthened by 58 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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.Application.startNoEx(Application.java:902)
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-09 06:29:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 06:29:15] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 453 ms.
Support contains 75 out of 1557 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1557/1557 places, 2606/2606 transitions.
Applied a total of 0 rules in 49 ms. Remains 1557 /1557 variables (removed 0) and now considering 2606/2606 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 1557/1557 places, 2606/2606 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1557/1557 places, 2606/2606 transitions.
Applied a total of 0 rules in 54 ms. Remains 1557 /1557 variables (removed 0) and now considering 2606/2606 (removed 0) transitions.
[2023-03-09 06:29:15] [INFO ] Invariant cache hit.
[2023-03-09 06:29:17] [INFO ] Implicit Places using invariants in 1430 ms returned [1, 19, 20, 22, 32, 50, 68, 120, 150, 163, 164, 165, 166, 167, 185, 203, 283, 298, 299, 300, 301, 302, 320, 338, 408, 420, 433, 434, 435, 436, 437, 455, 473, 553, 568, 569, 570, 571, 572, 590, 608, 690, 704, 705, 706, 707, 727, 745, 825, 840, 845, 846, 847, 865, 883, 963, 976, 977, 978, 979, 1017, 1098, 1113, 1114, 1115, 1117, 1153, 1233, 1246, 1247, 1248, 1249, 1250, 1268, 1286, 1346, 1371, 1376, 1387, 1388, 1389, 1390, 1391, 1425, 1428, 1446, 1447, 1448, 1449, 1461, 1467, 1473, 1479, 1485, 1491, 1497, 1503, 1509, 1515, 1521]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 1435 ms to find 100 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1457/1557 places, 2606/2606 transitions.
Drop transitions removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 1457 transition count 2479
Reduce places removed 127 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 142 rules applied. Total rules applied 269 place count 1330 transition count 2464
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 284 place count 1315 transition count 2464
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 70 Pre rules applied. Total rules applied 284 place count 1315 transition count 2394
Deduced a syphon composed of 70 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 141 rules applied. Total rules applied 425 place count 1244 transition count 2394
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 3 with 45 rules applied. Total rules applied 470 place count 1222 transition count 2371
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 4 with 23 rules applied. Total rules applied 493 place count 1199 transition count 2371
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 493 place count 1199 transition count 2370
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 495 place count 1198 transition count 2370
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 513 place count 1180 transition count 2352
Iterating global reduction 5 with 18 rules applied. Total rules applied 531 place count 1180 transition count 2352
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 535 place count 1180 transition count 2348
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 535 place count 1180 transition count 2347
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 537 place count 1179 transition count 2347
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 542 place count 1174 transition count 2342
Iterating global reduction 6 with 5 rules applied. Total rules applied 547 place count 1174 transition count 2342
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 549 place count 1174 transition count 2340
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 552 place count 1171 transition count 2337
Iterating global reduction 7 with 3 rules applied. Total rules applied 555 place count 1171 transition count 2337
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 556 place count 1170 transition count 2336
Iterating global reduction 7 with 1 rules applied. Total rules applied 557 place count 1170 transition count 2336
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 558 place count 1169 transition count 2335
Iterating global reduction 7 with 1 rules applied. Total rules applied 559 place count 1169 transition count 2335
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 560 place count 1168 transition count 2334
Iterating global reduction 7 with 1 rules applied. Total rules applied 561 place count 1168 transition count 2334
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 2 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 7 with 130 rules applied. Total rules applied 691 place count 1103 transition count 2269
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 699 place count 1095 transition count 2261
Iterating global reduction 7 with 8 rules applied. Total rules applied 707 place count 1095 transition count 2261
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 712 place count 1095 transition count 2256
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 713 place count 1095 transition count 2255
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 715 place count 1094 transition count 2254
Free-agglomeration rule applied 8 times.
Iterating global reduction 8 with 8 rules applied. Total rules applied 723 place count 1094 transition count 2246
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 738 place count 1086 transition count 2239
Free-agglomeration rule (complex) applied 35 times.
Iterating global reduction 9 with 35 rules applied. Total rules applied 773 place count 1086 transition count 2204
Ensure Unique test removed 1 places
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 9 with 36 rules applied. Total rules applied 809 place count 1050 transition count 2204
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 810 place count 1050 transition count 2203
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 10 with 18 rules applied. Total rules applied 828 place count 1050 transition count 2203
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 830 place count 1050 transition count 2203
Applied a total of 830 rules in 1112 ms. Remains 1050 /1457 variables (removed 407) and now considering 2203/2606 (removed 403) transitions.
// Phase 1: matrix 2203 rows 1050 cols
[2023-03-09 06:29:18] [INFO ] Computed 157 place invariants in 52 ms
[2023-03-09 06:29:19] [INFO ] Implicit Places using invariants in 1002 ms returned [74, 100, 106, 109, 110, 163, 184, 190, 192, 195, 196, 201, 202, 254, 271, 277, 280, 285, 290, 292, 345, 362, 368, 371, 373, 374, 381, 434, 452, 458, 461, 463, 464, 469, 470, 548, 554, 557, 559, 560, 566, 573, 574, 630, 647, 653, 656, 658, 659, 664, 666, 723, 771, 777, 782, 783, 837, 858, 866, 872, 873, 878, 879, 931, 948, 963, 964]
Discarding 67 places :
Implicit Place search using SMT only with invariants took 1004 ms to find 67 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 983/1557 places, 2203/2606 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 983 transition count 2201
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 981 transition count 2201
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 25 place count 960 transition count 2180
Iterating global reduction 2 with 21 rules applied. Total rules applied 46 place count 960 transition count 2180
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 54 place count 952 transition count 2172
Iterating global reduction 2 with 8 rules applied. Total rules applied 62 place count 952 transition count 2172
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 950 transition count 2170
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 950 transition count 2170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 949 transition count 2169
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 949 transition count 2169
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 110 place count 928 transition count 2148
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 113 place count 925 transition count 2143
Iterating global reduction 2 with 3 rules applied. Total rules applied 116 place count 925 transition count 2143
Free-agglomeration rule applied 26 times.
Iterating global reduction 2 with 26 rules applied. Total rules applied 142 place count 925 transition count 2117
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 168 place count 899 transition count 2117
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 174 place count 899 transition count 2111
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 180 place count 893 transition count 2111
Applied a total of 180 rules in 258 ms. Remains 893 /983 variables (removed 90) and now considering 2111/2203 (removed 92) transitions.
// Phase 1: matrix 2111 rows 893 cols
[2023-03-09 06:29:19] [INFO ] Computed 90 place invariants in 30 ms
[2023-03-09 06:29:20] [INFO ] Implicit Places using invariants in 727 ms returned []
[2023-03-09 06:29:20] [INFO ] Invariant cache hit.
[2023-03-09 06:29:21] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 06:29:23] [INFO ] Implicit Places using invariants and state equation in 3302 ms returned []
Implicit Place search using SMT with State Equation took 4044 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 893/1557 places, 2111/2606 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 7908 ms. Remains : 893/1557 places, 2111/2606 transitions.
Incomplete random walk after 10000 steps, including 124 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 129468 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{2=1, 6=1, 7=1}
Probabilistic random walk after 129468 steps, saw 65956 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :3
FORMULA ASLink-PT-10a-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ASLink-PT-10a-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ASLink-PT-10a-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 5 properties.
[2023-03-09 06:29:27] [INFO ] Invariant cache hit.
[2023-03-09 06:29:27] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 06:29:27] [INFO ] [Nat]Absence check using 23 positive place invariants in 8 ms returned sat
[2023-03-09 06:29:27] [INFO ] [Nat]Absence check using 23 positive and 67 generalized place invariants in 25 ms returned sat
[2023-03-09 06:29:30] [INFO ] After 2713ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-09 06:29:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 06:29:44] [INFO ] After 14068ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-09 06:29:45] [INFO ] After 15303ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 6671 ms.
[2023-03-09 06:29:52] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 304 ms.
Support contains 27 out of 893 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 893/893 places, 2111/2111 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 893 transition count 2102
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 884 transition count 2102
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 18 place count 884 transition count 2098
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 880 transition count 2098
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 30 place count 876 transition count 2079
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 876 transition count 2079
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 875 transition count 2071
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 875 transition count 2071
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 874 transition count 2063
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 874 transition count 2063
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 873 transition count 2055
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 873 transition count 2055
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 872 transition count 2047
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 872 transition count 2047
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 871 transition count 2039
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 871 transition count 2039
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 870 transition count 2031
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 870 transition count 2031
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 869 transition count 2023
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 869 transition count 2023
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 868 transition count 2015
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 868 transition count 2015
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 867 transition count 2007
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 867 transition count 2007
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 866 transition count 1999
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 866 transition count 1999
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 865 transition count 1991
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 865 transition count 1991
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 864 transition count 1983
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 864 transition count 1983
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 863 transition count 1975
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 863 transition count 1975
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 74 place count 856 transition count 1968
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 855 transition count 1967
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 855 transition count 1967
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 855 transition count 1966
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 83 place count 855 transition count 1960
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 89 place count 849 transition count 1960
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 849 transition count 1960
Applied a total of 92 rules in 410 ms. Remains 849 /893 variables (removed 44) and now considering 1960/2111 (removed 151) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 410 ms. Remains : 849/893 places, 1960/2111 transitions.
Incomplete random walk after 10000 steps, including 152 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 119343 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 119343 steps, saw 82202 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1960 rows 849 cols
[2023-03-09 06:29:56] [INFO ] Computed 90 place invariants in 15 ms
[2023-03-09 06:29:56] [INFO ] After 325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 06:29:57] [INFO ] [Nat]Absence check using 25 positive place invariants in 6 ms returned sat
[2023-03-09 06:29:57] [INFO ] [Nat]Absence check using 25 positive and 65 generalized place invariants in 35 ms returned sat
[2023-03-09 06:30:07] [INFO ] After 10427ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 06:30:07] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-09 06:30:09] [INFO ] After 1598ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-09 06:30:10] [INFO ] Deduced a trap composed of 18 places in 218 ms of which 3 ms to minimize.
[2023-03-09 06:30:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 373 ms
[2023-03-09 06:30:11] [INFO ] After 3507ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2337 ms.
[2023-03-09 06:30:13] [INFO ] After 16590ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 656 ms.
Support contains 27 out of 849 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 849/849 places, 1960/1960 transitions.
Applied a total of 0 rules in 29 ms. Remains 849 /849 variables (removed 0) and now considering 1960/1960 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 849/849 places, 1960/1960 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 849/849 places, 1960/1960 transitions.
Applied a total of 0 rules in 23 ms. Remains 849 /849 variables (removed 0) and now considering 1960/1960 (removed 0) transitions.
[2023-03-09 06:30:14] [INFO ] Invariant cache hit.
[2023-03-09 06:30:14] [INFO ] Implicit Places using invariants in 734 ms returned [88, 308, 380, 462, 533, 634, 652, 777]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 740 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 841/849 places, 1960/1960 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 841 transition count 1950
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 831 transition count 1949
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 21 place count 831 transition count 1943
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 33 place count 825 transition count 1943
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 824 transition count 1942
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 824 transition count 1942
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 823 transition count 1941
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 823 transition count 1941
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 53 place count 815 transition count 1933
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 815 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 814 transition count 1931
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 814 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 813 transition count 1930
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 813 transition count 1930
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 813 transition count 1928
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 811 transition count 1928
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 811 transition count 1927
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 810 transition count 1927
Applied a total of 64 rules in 279 ms. Remains 810 /841 variables (removed 31) and now considering 1927/1960 (removed 33) transitions.
// Phase 1: matrix 1927 rows 810 cols
[2023-03-09 06:30:15] [INFO ] Computed 82 place invariants in 42 ms
[2023-03-09 06:30:16] [INFO ] Implicit Places using invariants in 1079 ms returned [441, 442, 587, 595, 601]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1081 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 805/849 places, 1927/1960 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 803 transition count 1925
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 803 transition count 1925
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 801 transition count 1923
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 801 transition count 1923
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 800 transition count 1922
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 800 transition count 1922
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 798 transition count 1920
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 17 place count 798 transition count 1917
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 20 place count 795 transition count 1917
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 795 transition count 1916
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 794 transition count 1916
Applied a total of 22 rules in 200 ms. Remains 794 /805 variables (removed 11) and now considering 1916/1927 (removed 11) transitions.
// Phase 1: matrix 1916 rows 794 cols
[2023-03-09 06:30:16] [INFO ] Computed 77 place invariants in 41 ms
[2023-03-09 06:30:17] [INFO ] Implicit Places using invariants in 795 ms returned []
[2023-03-09 06:30:17] [INFO ] Invariant cache hit.
[2023-03-09 06:30:18] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-09 06:30:20] [INFO ] Implicit Places using invariants and state equation in 3621 ms returned []
Implicit Place search using SMT with State Equation took 4431 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 794/849 places, 1916/1960 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6756 ms. Remains : 794/849 places, 1916/1960 transitions.
Incomplete random walk after 10000 steps, including 153 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 132552 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 132552 steps, saw 89514 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-09 06:30:24] [INFO ] Invariant cache hit.
[2023-03-09 06:30:24] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 06:30:24] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-09 06:30:24] [INFO ] [Nat]Absence check using 19 positive and 58 generalized place invariants in 40 ms returned sat
[2023-03-09 06:30:37] [INFO ] After 12649ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 06:30:37] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-09 06:30:43] [INFO ] After 5612ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-09 06:30:47] [INFO ] After 10065ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1973 ms.
[2023-03-09 06:30:49] [INFO ] After 25009ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 168 ms.
Support contains 27 out of 794 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 794/794 places, 1916/1916 transitions.
Applied a total of 0 rules in 22 ms. Remains 794 /794 variables (removed 0) and now considering 1916/1916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 794/794 places, 1916/1916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 794/794 places, 1916/1916 transitions.
Applied a total of 0 rules in 21 ms. Remains 794 /794 variables (removed 0) and now considering 1916/1916 (removed 0) transitions.
[2023-03-09 06:30:49] [INFO ] Invariant cache hit.
[2023-03-09 06:30:50] [INFO ] Implicit Places using invariants in 458 ms returned []
[2023-03-09 06:30:50] [INFO ] Invariant cache hit.
[2023-03-09 06:30:50] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-09 06:30:53] [INFO ] Implicit Places using invariants and state equation in 3451 ms returned []
Implicit Place search using SMT with State Equation took 3957 ms to find 0 implicit places.
[2023-03-09 06:30:53] [INFO ] Redundant transitions in 186 ms returned []
[2023-03-09 06:30:53] [INFO ] Invariant cache hit.
[2023-03-09 06:30:54] [INFO ] Dead Transitions using invariants and state equation in 791 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4984 ms. Remains : 794/794 places, 1916/1916 transitions.
Applied a total of 0 rules in 23 ms. Remains 794 /794 variables (removed 0) and now considering 1916/1916 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-09 06:30:54] [INFO ] Invariant cache hit.
[2023-03-09 06:30:54] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 06:30:54] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-03-09 06:30:55] [INFO ] [Nat]Absence check using 19 positive and 58 generalized place invariants in 36 ms returned sat
[2023-03-09 06:31:07] [INFO ] After 12436ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 06:31:07] [INFO ] Deduced a trap composed of 18 places in 233 ms of which 23 ms to minimize.
[2023-03-09 06:31:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 393 ms
[2023-03-09 06:31:08] [INFO ] After 13537ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1911 ms.
[2023-03-09 06:31:10] [INFO ] After 15705ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-09 06:31:10] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-09 06:31:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 794 places, 1916 transitions and 7830 arcs took 7 ms.
[2023-03-09 06:31:11] [INFO ] Flatten gal took : 220 ms
Total runtime 206644 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ASLink-PT-10a
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
ReachabilityFireability

FORMULA ASLink-PT-10a-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ASLink-PT-10a-ReachabilityFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ASLink-PT-10a-ReachabilityFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ASLink-PT-10a-ReachabilityFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ASLink-PT-10a-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678343473339

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 1.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 19 (type EXCL) for 9 ASLink-PT-10a-ReachabilityFireability-10
lola: time limit : 719 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 15 (type FNDP) for 9 ASLink-PT-10a-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 16 (type EQUN) for 9 ASLink-PT-10a-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 18 (type SRCH) for 9 ASLink-PT-10a-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/375/ReachabilityFireability-16.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
sara: place or transition ordering is non-deterministic

lola: FINISHED task # 16 (type EQUN) for ASLink-PT-10a-ReachabilityFireability-10
lola: result : true
lola: CANCELED task # 15 (type FNDP) for ASLink-PT-10a-ReachabilityFireability-10 (obsolete)
lola: CANCELED task # 18 (type SRCH) for ASLink-PT-10a-ReachabilityFireability-10 (obsolete)
lola: CANCELED task # 19 (type EXCL) for ASLink-PT-10a-ReachabilityFireability-10 (obsolete)
lola: LAUNCH task # 38 (type EXCL) for 12 ASLink-PT-10a-ReachabilityFireability-12
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 21 (type FNDP) for 0 ASLink-PT-10a-ReachabilityFireability-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 22 (type EQUN) for 0 ASLink-PT-10a-ReachabilityFireability-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 24 (type SRCH) for 0 ASLink-PT-10a-ReachabilityFireability-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 15 (type FNDP) for ASLink-PT-10a-ReachabilityFireability-10
lola: result : unknown
lola: fired transitions : 38192
lola: tried executions : 600
lola: time used : 1.000000
lola: memory pages used : 0
lola: FINISHED task # 21 (type FNDP) for ASLink-PT-10a-ReachabilityFireability-01
lola: result : true
lola: fired transitions : 145
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 22 (type EQUN) for ASLink-PT-10a-ReachabilityFireability-01 (obsolete)
lola: CANCELED task # 24 (type SRCH) for ASLink-PT-10a-ReachabilityFireability-01 (obsolete)
lola: LAUNCH task # 27 (type FNDP) for 6 ASLink-PT-10a-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 28 (type EQUN) for 6 ASLink-PT-10a-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 30 (type SRCH) for 6 ASLink-PT-10a-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/375/ReachabilityFireability-22.sara.
sara: try reading problem file /home/mcc/execution/375/ReachabilityFireability-28.sara.
lola: FINISHED task # 27 (type FNDP) for ASLink-PT-10a-ReachabilityFireability-06
lola: result : true
lola: fired transitions : 7080
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 28 (type EQUN) for ASLink-PT-10a-ReachabilityFireability-06 (obsolete)
lola: CANCELED task # 30 (type SRCH) for ASLink-PT-10a-ReachabilityFireability-06 (obsolete)
lola: LAUNCH task # 41 (type FNDP) for 3 ASLink-PT-10a-ReachabilityFireability-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 42 (type EQUN) for 3 ASLink-PT-10a-ReachabilityFireability-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 44 (type SRCH) for 3 ASLink-PT-10a-ReachabilityFireability-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 28 (type EQUN) for ASLink-PT-10a-ReachabilityFireability-06
lola: result : unknown
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 44 (type SRCH) for ASLink-PT-10a-ReachabilityFireability-03
lola: result : true
lola: markings : 176
lola: fired transitions : 175
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 41 (type FNDP) for ASLink-PT-10a-ReachabilityFireability-03 (obsolete)
lola: CANCELED task # 42 (type EQUN) for ASLink-PT-10a-ReachabilityFireability-03 (obsolete)
lola: LAUNCH task # 34 (type FNDP) for 12 ASLink-PT-10a-ReachabilityFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 35 (type EQUN) for 12 ASLink-PT-10a-ReachabilityFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 37 (type SRCH) for 12 ASLink-PT-10a-ReachabilityFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 41 (type FNDP) for ASLink-PT-10a-ReachabilityFireability-03
lola: result : true
lola: fired transitions : 174
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 37 (type SRCH) for ASLink-PT-10a-ReachabilityFireability-12
lola: result : true
lola: markings : 100
lola: fired transitions : 99
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 34 (type FNDP) for ASLink-PT-10a-ReachabilityFireability-12 (obsolete)
lola: CANCELED task # 35 (type EQUN) for ASLink-PT-10a-ReachabilityFireability-12 (obsolete)
lola: CANCELED task # 38 (type EXCL) for ASLink-PT-10a-ReachabilityFireability-12 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ASLink-PT-10a-ReachabilityFireability-01: EF true findpath
ASLink-PT-10a-ReachabilityFireability-03: AG false tandem / insertion
ASLink-PT-10a-ReachabilityFireability-06: EF true findpath
ASLink-PT-10a-ReachabilityFireability-10: EF true state equation
ASLink-PT-10a-ReachabilityFireability-12: AG false tandem / insertion


Time elapsed: 2 secs. Pages in use: 3

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="ASLink-PT-10a"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 ASLink-PT-10a, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-oct2-167813595100159"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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