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

About the Execution of LoLa+red for ASLink-PT-07b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
957.508 160711.00 224769.00 80.30 TTTFTTFFTTTFFTTT 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.r007-oct2-167813595000119.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-07b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-oct2-167813595000119
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.6K Feb 26 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 13:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 13:05 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.2K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 13:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 13:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 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.1M 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-07b-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678340817417

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-07b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 05:47:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 05:47:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 05:47:01] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2023-03-09 05:47:01] [INFO ] Transformed 3222 places.
[2023-03-09 05:47:01] [INFO ] Transformed 3986 transitions.
[2023-03-09 05:47:01] [INFO ] Found NUPN structural information;
[2023-03-09 05:47:01] [INFO ] Parsed PT model containing 3222 places and 3986 transitions and 12126 arcs in 431 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 14 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 16) seen :5
FORMULA ASLink-PT-07b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 3986 rows 3222 cols
[2023-03-09 05:47:02] [INFO ] Computed 316 place invariants in 138 ms
[2023-03-09 05:47:04] [INFO ] After 1855ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-09 05:47:05] [INFO ] [Nat]Absence check using 75 positive place invariants in 149 ms returned sat
[2023-03-09 05:47:06] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 216 ms returned sat
[2023-03-09 05:47:29] [INFO ] After 22209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-09 05:47:29] [INFO ] After 22223ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-09 05:47:29] [INFO ] After 25050ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 155 out of 3222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3222/3222 places, 3986/3986 transitions.
Drop transitions removed 681 transitions
Trivial Post-agglo rules discarded 681 transitions
Performed 681 trivial Post agglomeration. Transition count delta: 681
Iterating post reduction 0 with 681 rules applied. Total rules applied 681 place count 3222 transition count 3305
Reduce places removed 681 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 711 rules applied. Total rules applied 1392 place count 2541 transition count 3275
Reduce places removed 8 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 2 with 28 rules applied. Total rules applied 1420 place count 2533 transition count 3255
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 24 rules applied. Total rules applied 1444 place count 2513 transition count 3251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1445 place count 2512 transition count 3251
Performed 698 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 698 Pre rules applied. Total rules applied 1445 place count 2512 transition count 2553
Deduced a syphon composed of 698 places in 10 ms
Ensure Unique test removed 66 places
Reduce places removed 764 places and 0 transitions.
Iterating global reduction 5 with 1462 rules applied. Total rules applied 2907 place count 1748 transition count 2553
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 5 with 49 rules applied. Total rules applied 2956 place count 1738 transition count 2514
Reduce places removed 39 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 6 with 43 rules applied. Total rules applied 2999 place count 1699 transition count 2510
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 3003 place count 1695 transition count 2510
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 23 Pre rules applied. Total rules applied 3003 place count 1695 transition count 2487
Deduced a syphon composed of 23 places in 14 ms
Ensure Unique test removed 21 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 8 with 67 rules applied. Total rules applied 3070 place count 1651 transition count 2487
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 21 Pre rules applied. Total rules applied 3070 place count 1651 transition count 2466
Deduced a syphon composed of 21 places in 6 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 8 with 42 rules applied. Total rules applied 3112 place count 1630 transition count 2466
Discarding 97 places :
Symmetric choice reduction at 8 with 97 rule applications. Total rules 3209 place count 1533 transition count 2369
Iterating global reduction 8 with 97 rules applied. Total rules applied 3306 place count 1533 transition count 2369
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3307 place count 1533 transition count 2368
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 27 Pre rules applied. Total rules applied 3307 place count 1533 transition count 2341
Deduced a syphon composed of 27 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 9 with 55 rules applied. Total rules applied 3362 place count 1505 transition count 2341
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 3362 place count 1505 transition count 2340
Deduced a syphon composed of 1 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 3365 place count 1503 transition count 2340
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 3369 place count 1499 transition count 2316
Iterating global reduction 9 with 4 rules applied. Total rules applied 3373 place count 1499 transition count 2316
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 3 Pre rules applied. Total rules applied 3373 place count 1499 transition count 2313
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 3379 place count 1496 transition count 2313
Performed 174 Post agglomeration using F-continuation condition.Transition count delta: 174
Deduced a syphon composed of 174 places in 10 ms
Ensure Unique test removed 1 places
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 9 with 349 rules applied. Total rules applied 3728 place count 1321 transition count 2139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3730 place count 1320 transition count 2148
Free-agglomeration rule applied 9 times.
Iterating global reduction 9 with 9 rules applied. Total rules applied 3739 place count 1320 transition count 2139
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 3748 place count 1311 transition count 2139
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 10 with 8 rules applied. Total rules applied 3756 place count 1311 transition count 2131
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 3764 place count 1303 transition count 2131
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 3765 place count 1302 transition count 2130
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 11 with 6 rules applied. Total rules applied 3771 place count 1297 transition count 2129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 3772 place count 1296 transition count 2129
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 7 Pre rules applied. Total rules applied 3772 place count 1296 transition count 2122
Deduced a syphon composed of 7 places in 5 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 13 with 14 rules applied. Total rules applied 3786 place count 1289 transition count 2122
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 13 with 2 rules applied. Total rules applied 3788 place count 1287 transition count 2122
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 14 with 10 rules applied. Total rules applied 3798 place count 1282 transition count 2117
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 3799 place count 1281 transition count 2116
Iterating global reduction 14 with 1 rules applied. Total rules applied 3800 place count 1281 transition count 2116
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 3801 place count 1281 transition count 2115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 3802 place count 1280 transition count 2115
Applied a total of 3802 rules in 1491 ms. Remains 1280 /3222 variables (removed 1942) and now considering 2115/3986 (removed 1871) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1492 ms. Remains : 1280/3222 places, 2115/3986 transitions.
Incomplete random walk after 10000 steps, including 69 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 11) seen :1
FORMULA ASLink-PT-07b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 10) seen :1
FORMULA ASLink-PT-07b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2115 rows 1280 cols
[2023-03-09 05:47:31] [INFO ] Computed 209 place invariants in 39 ms
[2023-03-09 05:47:32] [INFO ] After 330ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-09 05:47:32] [INFO ] [Nat]Absence check using 57 positive place invariants in 29 ms returned sat
[2023-03-09 05:47:32] [INFO ] [Nat]Absence check using 57 positive and 152 generalized place invariants in 86 ms returned sat
[2023-03-09 05:47:57] [INFO ] After 23876ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-09 05:47:57] [INFO ] State equation strengthened by 21 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 05:47:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 05:47:57] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA ASLink-PT-07b-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 272 ms.
Support contains 94 out of 1280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1280/1280 places, 2115/2115 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1280 transition count 2112
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 1277 transition count 2110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 1275 transition count 2110
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 10 place count 1275 transition count 2075
Deduced a syphon composed of 35 places in 4 ms
Ensure Unique test removed 4 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 84 place count 1236 transition count 2075
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 86 place count 1235 transition count 2074
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 87 place count 1234 transition count 2074
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 117 place count 1219 transition count 2059
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 118 place count 1218 transition count 2053
Iterating global reduction 5 with 1 rules applied. Total rules applied 119 place count 1218 transition count 2053
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 5 with 2 rules applied. Total rules applied 121 place count 1217 transition count 2052
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 122 place count 1217 transition count 2051
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 123 place count 1216 transition count 2051
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 124 place count 1216 transition count 2051
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 128 place count 1212 transition count 2047
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 5 rules applied. Total rules applied 133 place count 1208 transition count 2046
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 134 place count 1207 transition count 2046
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 5 Pre rules applied. Total rules applied 134 place count 1207 transition count 2041
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 144 place count 1202 transition count 2041
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 8 with 3 rules applied. Total rules applied 147 place count 1199 transition count 2041
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 157 place count 1194 transition count 2036
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 160 place count 1191 transition count 2033
Iterating global reduction 9 with 3 rules applied. Total rules applied 163 place count 1191 transition count 2033
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 164 place count 1190 transition count 2032
Iterating global reduction 9 with 1 rules applied. Total rules applied 165 place count 1190 transition count 2032
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 166 place count 1190 transition count 2031
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 168 place count 1190 transition count 2029
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 170 place count 1188 transition count 2029
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 171 place count 1188 transition count 2029
Applied a total of 171 rules in 497 ms. Remains 1188 /1280 variables (removed 92) and now considering 2029/2115 (removed 86) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 497 ms. Remains : 1188/1280 places, 2029/2115 transitions.
Incomplete random walk after 10000 steps, including 83 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 137513 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 137513 steps, saw 46503 distinct states, run finished after 3004 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2029 rows 1188 cols
[2023-03-09 05:48:01] [INFO ] Computed 197 place invariants in 19 ms
[2023-03-09 05:48:02] [INFO ] After 277ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-09 05:48:02] [INFO ] [Nat]Absence check using 48 positive place invariants in 16 ms returned sat
[2023-03-09 05:48:02] [INFO ] [Nat]Absence check using 48 positive and 149 generalized place invariants in 45 ms returned sat
[2023-03-09 05:48:09] [INFO ] After 6699ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2023-03-09 05:48:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 05:48:20] [INFO ] After 11073ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :2 sat :6
[2023-03-09 05:48:27] [INFO ] After 17741ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-09 05:48:27] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
FORMULA ASLink-PT-07b-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-07b-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 660 ms.
Support contains 65 out of 1188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1188/1188 places, 2029/2029 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1188 transition count 2028
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1187 transition count 2028
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 2 place count 1187 transition count 2013
Deduced a syphon composed of 15 places in 4 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 32 place count 1172 transition count 2013
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 44 place count 1166 transition count 2007
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 1165 transition count 2001
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 1165 transition count 2001
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 1164 transition count 2001
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 3 with 2 rules applied. Total rules applied 49 place count 1163 transition count 2000
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 1162 transition count 1999
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 1162 transition count 1999
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 1162 transition count 1998
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 53 place count 1161 transition count 1998
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 54 place count 1161 transition count 1997
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 55 place count 1160 transition count 1997
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 57 place count 1158 transition count 1995
Applied a total of 57 rules in 255 ms. Remains 1158 /1188 variables (removed 30) and now considering 1995/2029 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 255 ms. Remains : 1158/1188 places, 1995/2029 transitions.
Incomplete random walk after 10000 steps, including 96 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 133282 steps, run timeout after 3013 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133282 steps, saw 32407 distinct states, run finished after 3013 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1995 rows 1158 cols
[2023-03-09 05:48:31] [INFO ] Computed 196 place invariants in 18 ms
[2023-03-09 05:48:31] [INFO ] After 263ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 05:48:32] [INFO ] [Nat]Absence check using 51 positive place invariants in 14 ms returned sat
[2023-03-09 05:48:32] [INFO ] [Nat]Absence check using 51 positive and 145 generalized place invariants in 69 ms returned sat
[2023-03-09 05:48:36] [INFO ] After 3791ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 05:48:36] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 05:48:39] [INFO ] After 3107ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 05:48:44] [INFO ] Deduced a trap composed of 75 places in 2023 ms of which 19 ms to minimize.
[2023-03-09 05:48:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2223 ms
[2023-03-09 05:48:44] [INFO ] After 8792ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 3538 ms.
[2023-03-09 05:48:48] [INFO ] After 16709ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 264 ms.
Support contains 65 out of 1158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1158/1158 places, 1995/1995 transitions.
Applied a total of 0 rules in 34 ms. Remains 1158 /1158 variables (removed 0) and now considering 1995/1995 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 1158/1158 places, 1995/1995 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1158/1158 places, 1995/1995 transitions.
Applied a total of 0 rules in 34 ms. Remains 1158 /1158 variables (removed 0) and now considering 1995/1995 (removed 0) transitions.
[2023-03-09 05:48:48] [INFO ] Invariant cache hit.
[2023-03-09 05:48:50] [INFO ] Implicit Places using invariants in 1408 ms returned [1, 18, 21, 26, 38, 57, 75, 152, 167, 168, 169, 187, 206, 227, 286, 287, 300, 301, 304, 322, 340, 379, 413, 418, 431, 432, 434, 452, 470, 511, 549, 564, 565, 568, 588, 606, 702, 703, 704, 705, 726, 744, 817, 827, 843, 844, 846, 863, 881, 958, 962, 963, 966, 978, 980, 981, 982, 1018, 1021, 1025, 1043, 1046, 1047, 1059, 1065, 1071, 1077, 1083, 1089, 1096, 1102, 1108, 1114, 1120]
Discarding 74 places :
Implicit Place search using SMT only with invariants took 1428 ms to find 74 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1084/1158 places, 1995/1995 transitions.
Drop transitions removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 116 place count 1084 transition count 1879
Reduce places removed 116 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 125 rules applied. Total rules applied 241 place count 968 transition count 1870
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 248 place count 961 transition count 1870
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 248 place count 961 transition count 1837
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 314 place count 928 transition count 1837
Discarding 2 places :
Implicit places reduction removed 2 places
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 3 rules applied. Total rules applied 317 place count 926 transition count 1836
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 319 place count 925 transition count 1835
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 320 place count 924 transition count 1835
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 331 place count 913 transition count 1824
Iterating global reduction 6 with 11 rules applied. Total rules applied 342 place count 913 transition count 1824
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 345 place count 910 transition count 1818
Iterating global reduction 6 with 3 rules applied. Total rules applied 348 place count 910 transition count 1818
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 349 place count 909 transition count 1817
Iterating global reduction 6 with 1 rules applied. Total rules applied 350 place count 909 transition count 1817
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 351 place count 908 transition count 1815
Iterating global reduction 6 with 1 rules applied. Total rules applied 352 place count 908 transition count 1815
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 2 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 6 with 140 rules applied. Total rules applied 492 place count 838 transition count 1745
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 495 place count 835 transition count 1741
Iterating global reduction 6 with 3 rules applied. Total rules applied 498 place count 835 transition count 1741
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 500 place count 835 transition count 1739
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 504 place count 833 transition count 1741
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 506 place count 833 transition count 1739
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 509 place count 831 transition count 1738
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 8 with 14 rules applied. Total rules applied 523 place count 831 transition count 1724
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 537 place count 817 transition count 1724
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 538 place count 817 transition count 1723
Partial Free-agglomeration rule applied 26 times.
Drop transitions removed 26 transitions
Iterating global reduction 9 with 26 rules applied. Total rules applied 564 place count 817 transition count 1723
Applied a total of 564 rules in 456 ms. Remains 817 /1084 variables (removed 267) and now considering 1723/1995 (removed 272) transitions.
// Phase 1: matrix 1723 rows 817 cols
[2023-03-09 05:48:50] [INFO ] Computed 120 place invariants in 28 ms
[2023-03-09 05:48:51] [INFO ] Implicit Places using invariants in 658 ms returned [97, 103, 106, 108, 111, 118, 119, 192, 198, 277, 297, 303, 306, 308, 315, 316, 391, 397, 400, 402, 492, 498, 501, 503, 507, 512, 513, 595, 601, 604, 606, 609, 616, 617, 672, 689, 700, 702, 795, 810]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 664 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 777/1158 places, 1723/1995 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 777 transition count 1722
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 776 transition count 1722
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 22 place count 756 transition count 1702
Iterating global reduction 2 with 20 rules applied. Total rules applied 42 place count 756 transition count 1702
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 751 transition count 1697
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 751 transition count 1697
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 70 place count 742 transition count 1688
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 742 transition count 1687
Free-agglomeration rule applied 19 times.
Iterating global reduction 2 with 19 rules applied. Total rules applied 90 place count 742 transition count 1668
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 109 place count 723 transition count 1668
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 111 place count 723 transition count 1666
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 113 place count 721 transition count 1666
Applied a total of 113 rules in 195 ms. Remains 721 /777 variables (removed 56) and now considering 1666/1723 (removed 57) transitions.
// Phase 1: matrix 1666 rows 721 cols
[2023-03-09 05:48:51] [INFO ] Computed 80 place invariants in 11 ms
[2023-03-09 05:48:52] [INFO ] Implicit Places using invariants in 531 ms returned []
[2023-03-09 05:48:52] [INFO ] Invariant cache hit.
[2023-03-09 05:48:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 05:48:53] [INFO ] Implicit Places using invariants and state equation in 1691 ms returned []
Implicit Place search using SMT with State Equation took 2224 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 721/1158 places, 1666/1995 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5002 ms. Remains : 721/1158 places, 1666/1995 transitions.
Incomplete random walk after 10000 steps, including 117 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 190298 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{2=1}
Probabilistic random walk after 190298 steps, saw 60650 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :1
FORMULA ASLink-PT-07b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 5 properties.
[2023-03-09 05:48:57] [INFO ] Invariant cache hit.
[2023-03-09 05:48:57] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 05:48:57] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-09 05:48:57] [INFO ] [Nat]Absence check using 14 positive and 66 generalized place invariants in 33 ms returned sat
[2023-03-09 05:48:59] [INFO ] After 1803ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-09 05:48:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 05:49:00] [INFO ] After 946ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-09 05:49:01] [INFO ] Deduced a trap composed of 24 places in 374 ms of which 13 ms to minimize.
[2023-03-09 05:49:02] [INFO ] Deduced a trap composed of 33 places in 341 ms of which 0 ms to minimize.
[2023-03-09 05:49:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 908 ms
[2023-03-09 05:49:03] [INFO ] After 3439ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 555 ms.
[2023-03-09 05:49:03] [INFO ] After 6102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 110 ms.
Support contains 64 out of 721 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 721/721 places, 1666/1666 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 721 transition count 1665
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 720 transition count 1665
Applied a total of 2 rules in 35 ms. Remains 720 /721 variables (removed 1) and now considering 1665/1666 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 720/721 places, 1665/1666 transitions.
Incomplete random walk after 10000 steps, including 116 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 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 21 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 192807 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 192807 steps, saw 74098 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1665 rows 720 cols
[2023-03-09 05:49:07] [INFO ] Computed 80 place invariants in 27 ms
[2023-03-09 05:49:07] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 05:49:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 43 ms returned sat
[2023-03-09 05:49:07] [INFO ] [Nat]Absence check using 13 positive and 67 generalized place invariants in 44 ms returned sat
[2023-03-09 05:49:13] [INFO ] After 5271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-09 05:49:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 05:49:17] [INFO ] After 4001ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-09 05:49:19] [INFO ] Deduced a trap composed of 25 places in 984 ms of which 1 ms to minimize.
[2023-03-09 05:49:20] [INFO ] Deduced a trap composed of 35 places in 191 ms of which 1 ms to minimize.
[2023-03-09 05:49:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1421 ms
[2023-03-09 05:49:20] [INFO ] After 7337ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1219 ms.
[2023-03-09 05:49:21] [INFO ] After 14239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 589 ms.
Support contains 64 out of 720 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 720/720 places, 1665/1665 transitions.
Applied a total of 0 rules in 20 ms. Remains 720 /720 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 720/720 places, 1665/1665 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 720/720 places, 1665/1665 transitions.
Applied a total of 0 rules in 21 ms. Remains 720 /720 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
[2023-03-09 05:49:22] [INFO ] Invariant cache hit.
[2023-03-09 05:49:22] [INFO ] Implicit Places using invariants in 363 ms returned []
[2023-03-09 05:49:22] [INFO ] Invariant cache hit.
[2023-03-09 05:49:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 05:49:24] [INFO ] Implicit Places using invariants and state equation in 2142 ms returned []
Implicit Place search using SMT with State Equation took 2507 ms to find 0 implicit places.
[2023-03-09 05:49:24] [INFO ] Redundant transitions in 141 ms returned []
[2023-03-09 05:49:24] [INFO ] Invariant cache hit.
[2023-03-09 05:49:25] [INFO ] Dead Transitions using invariants and state equation in 751 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3429 ms. Remains : 720/720 places, 1665/1665 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 720 transition count 1663
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 718 transition count 1663
Applied a total of 4 rules in 31 ms. Remains 718 /720 variables (removed 2) and now considering 1663/1665 (removed 2) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 1663 rows 718 cols
[2023-03-09 05:49:25] [INFO ] Computed 80 place invariants in 15 ms
[2023-03-09 05:49:25] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 05:49:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-09 05:49:26] [INFO ] [Nat]Absence check using 13 positive and 67 generalized place invariants in 100 ms returned sat
[2023-03-09 05:49:28] [INFO ] After 2512ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-09 05:49:30] [INFO ] Deduced a trap composed of 20 places in 318 ms of which 1 ms to minimize.
[2023-03-09 05:49:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 474 ms
[2023-03-09 05:49:30] [INFO ] After 4521ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 949 ms.
[2023-03-09 05:49:31] [INFO ] After 5964ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-09 05:49:31] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2023-03-09 05:49:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 720 places, 1665 transitions and 6635 arcs took 14 ms.
[2023-03-09 05:49:32] [INFO ] Flatten gal took : 154 ms
Total runtime 151699 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ASLink-PT-07b
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
ReachabilityFireability

FORMULA ASLink-PT-07b-ReachabilityFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ASLink-PT-07b-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ASLink-PT-07b-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ASLink-PT-07b-ReachabilityFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

BK_STOP 1678340978128

--------------------
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/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
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 3 ASLink-PT-07b-ReachabilityFireability-05
lola: time limit : 719 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 15 (type FNDP) for 3 ASLink-PT-07b-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 16 (type EQUN) for 3 ASLink-PT-07b-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 18 (type SRCH) for 3 ASLink-PT-07b-ReachabilityFireability-05
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
lola: FINISHED task # 15 (type FNDP) for ASLink-PT-07b-ReachabilityFireability-05
lola: result : true
lola: fired transitions : 69
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 16 (type EQUN) for ASLink-PT-07b-ReachabilityFireability-05 (obsolete)
lola: CANCELED task # 18 (type SRCH) for ASLink-PT-07b-ReachabilityFireability-05 (obsolete)
lola: CANCELED task # 19 (type EXCL) for ASLink-PT-07b-ReachabilityFireability-05 (obsolete)
lola: LAUNCH task # 25 (type EXCL) for 6 ASLink-PT-07b-ReachabilityFireability-09
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 21 (type FNDP) for 6 ASLink-PT-07b-ReachabilityFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 22 (type EQUN) for 6 ASLink-PT-07b-ReachabilityFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 24 (type SRCH) for 6 ASLink-PT-07b-ReachabilityFireability-09
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
lola: FINISHED task # 21 (type FNDP) for ASLink-PT-07b-ReachabilityFireability-09
lola: result : true
lola: fired transitions : 120
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 22 (type EQUN) for ASLink-PT-07b-ReachabilityFireability-09 (obsolete)
lola: CANCELED task # 24 (type SRCH) for ASLink-PT-07b-ReachabilityFireability-09 (obsolete)
lola: CANCELED task # 25 (type EXCL) for ASLink-PT-07b-ReachabilityFireability-09 (obsolete)
lola: LAUNCH task # 31 (type EXCL) for 12 ASLink-PT-07b-ReachabilityFireability-13
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 27 (type FNDP) for 12 ASLink-PT-07b-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 28 (type EQUN) for 12 ASLink-PT-07b-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 30 (type SRCH) for 12 ASLink-PT-07b-ReachabilityFireability-13
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
lola: FINISHED task # 30 (type SRCH) for ASLink-PT-07b-ReachabilityFireability-13
lola: result : true
lola: markings : 371
lola: fired transitions : 370
lola: time used : 0.000000
lola: memory pages used : 1
sara: try reading problem file /home/mcc/execution/373/ReachabilityFireability-16.sara.
lola: CANCELED task # 27 (type FNDP) for ASLink-PT-07b-ReachabilityFireability-13 (obsolete)
lola: CANCELED task # 28 (type EQUN) for ASLink-PT-07b-ReachabilityFireability-13 (obsolete)
lola: CANCELED task # 31 (type EXCL) for ASLink-PT-07b-ReachabilityFireability-13 (obsolete)
lola: LAUNCH task # 37 (type EXCL) for 0 ASLink-PT-07b-ReachabilityFireability-00
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 33 (type FNDP) for 0 ASLink-PT-07b-ReachabilityFireability-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 34 (type EQUN) for 0 ASLink-PT-07b-ReachabilityFireability-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 36 (type SRCH) for 0 ASLink-PT-07b-ReachabilityFireability-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/373/ReachabilityFireability-22.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/373/ReachabilityFireability-28.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: FINISHED task # 27 (type FNDP) for ASLink-PT-07b-ReachabilityFireability-13
lola: result : true
lola: fired transitions : 369
lola: tried executions : 1
lola: time used : 1.000000
lola: memory pages used : 0
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
sara: try reading problem file /home/mcc/execution/373/ReachabilityFireability-34.sara.
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 33 (type FNDP) for ASLink-PT-07b-ReachabilityFireability-00
lola: result : true
lola: fired transitions : 166357
lola: tried executions : 2171
lola: time used : 5.000000
lola: memory pages used : 0
lola: CANCELED task # 34 (type EQUN) for ASLink-PT-07b-ReachabilityFireability-00 (obsolete)
lola: CANCELED task # 36 (type SRCH) for ASLink-PT-07b-ReachabilityFireability-00 (obsolete)
lola: CANCELED task # 37 (type EXCL) for ASLink-PT-07b-ReachabilityFireability-00 (obsolete)
lola: LAUNCH task # 43 (type EXCL) for 9 ASLink-PT-07b-ReachabilityFireability-10
lola: time limit : 3594 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 39 (type FNDP) for 9 ASLink-PT-07b-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 40 (type EQUN) for 9 ASLink-PT-07b-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 42 (type SRCH) for 9 ASLink-PT-07b-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 34 (type EQUN) for ASLink-PT-07b-ReachabilityFireability-00
lola: result : unknown
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 39 (type FNDP) for ASLink-PT-07b-ReachabilityFireability-10
lola: result : true
lola: fired transitions : 298
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 40 (type EQUN) for ASLink-PT-07b-ReachabilityFireability-10 (obsolete)
lola: CANCELED task # 42 (type SRCH) for ASLink-PT-07b-ReachabilityFireability-10 (obsolete)
lola: CANCELED task # 43 (type EXCL) for ASLink-PT-07b-ReachabilityFireability-10 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ASLink-PT-07b-ReachabilityFireability-00: EF true findpath
ASLink-PT-07b-ReachabilityFireability-05: EF true findpath
ASLink-PT-07b-ReachabilityFireability-09: EF true findpath
ASLink-PT-07b-ReachabilityFireability-10: EF true findpath
ASLink-PT-07b-ReachabilityFireability-13: EF true tandem / insertion


Time elapsed: 6 secs. Pages in use: 4

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-07b"
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-07b, 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-167813595000119"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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