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

About the Execution of LTSMin+red for ASLink-PT-08a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15856.224 2218768.00 8296159.00 72.70 FFFTT?FTTFFTF?TT 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.r009-oct2-167813597500127.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 ltsminxred
Input is ASLink-PT-08a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597500127
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.6K Feb 26 13:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 13:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 13:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 13:09 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 25K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 7.4K Feb 26 13:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 13:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 13:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 13:10 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 757K 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-08a-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-08a-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-08a-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-08a-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-08a-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-08a-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-08a-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-08a-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-08a-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-08a-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-08a-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-08a-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-08a-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-08a-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-08a-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-08a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678614150769

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-08a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 09:42:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 09:42:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 09:42:33] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2023-03-12 09:42:33] [INFO ] Transformed 1796 places.
[2023-03-12 09:42:33] [INFO ] Transformed 2646 transitions.
[2023-03-12 09:42:33] [INFO ] Found NUPN structural information;
[2023-03-12 09:42:33] [INFO ] Parsed PT model containing 1796 places and 2646 transitions and 9934 arcs in 236 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Incomplete random walk after 10000 steps, including 51 resets, run finished after 540 ms. (steps per millisecond=18 ) properties (out of 16) seen :3
FORMULA ASLink-PT-08a-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08a-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08a-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 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 5 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 2618 rows 1796 cols
[2023-03-12 09:42:35] [INFO ] Computed 346 place invariants in 119 ms
[2023-03-12 09:42:37] [INFO ] [Real]Absence check using 85 positive place invariants in 137 ms returned sat
[2023-03-12 09:42:37] [INFO ] [Real]Absence check using 85 positive and 261 generalized place invariants in 131 ms returned sat
[2023-03-12 09:42:37] [INFO ] After 1513ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-12 09:42:38] [INFO ] [Nat]Absence check using 85 positive place invariants in 58 ms returned sat
[2023-03-12 09:42:38] [INFO ] [Nat]Absence check using 85 positive and 261 generalized place invariants in 243 ms returned sat
[2023-03-12 09:43:02] [INFO ] After 23114ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :4
[2023-03-12 09:43:02] [INFO ] After 23120ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :4
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-12 09:43:02] [INFO ] After 25040ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :4
FORMULA ASLink-PT-08a-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-08a-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-08a-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-08a-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-08a-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-08a-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 225 out of 1796 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1796/1796 places, 2618/2618 transitions.
Ensure Unique test removed 32 places
Discarding 15 places :
Implicit places reduction removed 15 places
Drop transitions removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 179 rules applied. Total rules applied 179 place count 1749 transition count 2486
Reduce places removed 132 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 142 rules applied. Total rules applied 321 place count 1617 transition count 2476
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 331 place count 1607 transition count 2476
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 153 Pre rules applied. Total rules applied 331 place count 1607 transition count 2323
Deduced a syphon composed of 153 places in 17 ms
Ensure Unique test removed 54 places
Reduce places removed 207 places and 0 transitions.
Iterating global reduction 3 with 360 rules applied. Total rules applied 691 place count 1400 transition count 2323
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 692 place count 1400 transition count 2322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 693 place count 1399 transition count 2322
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 700 place count 1392 transition count 2282
Iterating global reduction 5 with 7 rules applied. Total rules applied 707 place count 1392 transition count 2282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 711 place count 1391 transition count 2279
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 713 place count 1389 transition count 2279
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 714 place count 1388 transition count 2271
Iterating global reduction 7 with 1 rules applied. Total rules applied 715 place count 1388 transition count 2271
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 8 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 7 with 86 rules applied. Total rules applied 801 place count 1345 transition count 2228
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 804 place count 1345 transition count 2225
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 807 place count 1342 transition count 2225
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 814 place count 1342 transition count 2225
Applied a total of 814 rules in 933 ms. Remains 1342 /1796 variables (removed 454) and now considering 2225/2618 (removed 393) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 935 ms. Remains : 1342/1796 places, 2225/2618 transitions.
Incomplete random walk after 10000 steps, including 83 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 129136 steps, run timeout after 3003 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 129136 steps, saw 30154 distinct states, run finished after 3007 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2225 rows 1342 cols
[2023-03-12 09:43:07] [INFO ] Computed 244 place invariants in 64 ms
[2023-03-12 09:43:07] [INFO ] After 419ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 09:43:08] [INFO ] [Nat]Absence check using 64 positive place invariants in 95 ms returned sat
[2023-03-12 09:43:08] [INFO ] [Nat]Absence check using 64 positive and 180 generalized place invariants in 195 ms returned sat
[2023-03-12 09:43:32] [INFO ] After 23748ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :3
[2023-03-12 09:43:32] [INFO ] State equation strengthened by 40 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-12 09:43:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 09:43:32] [INFO ] After 25043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
FORMULA ASLink-PT-08a-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-08a-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-08a-ReachabilityFireability-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 370 ms.
Support contains 178 out of 1342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1342/1342 places, 2225/2225 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 1342 transition count 2224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1341 transition count 2224
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 2 place count 1341 transition count 2215
Deduced a syphon composed of 9 places in 4 ms
Ensure Unique test removed 6 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 26 place count 1326 transition count 2215
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 1324 transition count 2208
Ensure Unique test removed 1 places
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 1323 transition count 2208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 with 2 rules applied. Total rules applied 33 place count 1323 transition count 2206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 34 place count 1322 transition count 2206
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 38 place count 1320 transition count 2204
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 39 place count 1320 transition count 2203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 40 place count 1319 transition count 2203
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 41 place count 1319 transition count 2203
Applied a total of 41 rules in 381 ms. Remains 1319 /1342 variables (removed 23) and now considering 2203/2225 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 381 ms. Remains : 1319/1342 places, 2203/2225 transitions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :1
FORMULA ASLink-PT-08a-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 2203 rows 1319 cols
[2023-03-12 09:43:34] [INFO ] Computed 237 place invariants in 24 ms
[2023-03-12 09:43:34] [INFO ] After 302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 09:43:35] [INFO ] [Nat]Absence check using 63 positive place invariants in 20 ms returned sat
[2023-03-12 09:43:35] [INFO ] [Nat]Absence check using 63 positive and 174 generalized place invariants in 125 ms returned sat
[2023-03-12 09:43:52] [INFO ] After 17074ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 09:43:52] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-12 09:43:59] [INFO ] After 7229ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:43:59] [INFO ] After 7231ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-12 09:43:59] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 164 ms.
Support contains 148 out of 1319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1319/1319 places, 2203/2203 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 1319 transition count 2202
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1318 transition count 2202
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 0 with 2 rules applied. Total rules applied 4 place count 1317 transition count 2201
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 1317 transition count 2200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 1316 transition count 2200
Applied a total of 6 rules in 142 ms. Remains 1316 /1319 variables (removed 3) and now considering 2200/2203 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 1316/1319 places, 2200/2203 transitions.
Incomplete random walk after 10000 steps, including 76 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 149514 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 149514 steps, saw 34620 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2200 rows 1316 cols
[2023-03-12 09:44:03] [INFO ] Computed 237 place invariants in 25 ms
[2023-03-12 09:44:03] [INFO ] After 267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 09:44:04] [INFO ] [Nat]Absence check using 61 positive place invariants in 71 ms returned sat
[2023-03-12 09:44:04] [INFO ] [Nat]Absence check using 61 positive and 176 generalized place invariants in 137 ms returned sat
[2023-03-12 09:44:19] [INFO ] After 15403ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-12 09:44:19] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-12 09:44:28] [INFO ] After 9049ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-12 09:44:28] [INFO ] After 9055ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-12 09:44:28] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA ASLink-PT-08a-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 571 ms.
Support contains 69 out of 1316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1316/1316 places, 2200/2200 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 1315 transition count 2188
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 1303 transition count 2188
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 25 place count 1303 transition count 2178
Deduced a syphon composed of 10 places in 3 ms
Ensure Unique test removed 6 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 51 place count 1287 transition count 2178
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 1286 transition count 2172
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 1286 transition count 2172
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 2 with 10 rules applied. Total rules applied 63 place count 1281 transition count 2167
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 66 place count 1281 transition count 2164
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 69 place count 1278 transition count 2164
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 1278 transition count 2164
Applied a total of 70 rules in 270 ms. Remains 1278 /1316 variables (removed 38) and now considering 2164/2200 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 1278/1316 places, 2164/2200 transitions.
Incomplete random walk after 10000 steps, including 80 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 154906 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 154906 steps, saw 42911 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2164 rows 1278 cols
[2023-03-12 09:44:32] [INFO ] Computed 230 place invariants in 26 ms
[2023-03-12 09:44:33] [INFO ] After 257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 09:44:33] [INFO ] [Nat]Absence check using 63 positive place invariants in 26 ms returned sat
[2023-03-12 09:44:33] [INFO ] [Nat]Absence check using 63 positive and 167 generalized place invariants in 134 ms returned sat
[2023-03-12 09:44:39] [INFO ] After 5402ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 09:44:39] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-12 09:44:51] [INFO ] After 12005ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 09:44:58] [INFO ] After 19175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-12 09:44:58] [INFO ] After 25074ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 715 ms.
Support contains 69 out of 1278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1278/1278 places, 2164/2164 transitions.
Applied a total of 0 rules in 48 ms. Remains 1278 /1278 variables (removed 0) and now considering 2164/2164 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 1278/1278 places, 2164/2164 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1278/1278 places, 2164/2164 transitions.
Applied a total of 0 rules in 36 ms. Remains 1278 /1278 variables (removed 0) and now considering 2164/2164 (removed 0) transitions.
[2023-03-12 09:44:59] [INFO ] Invariant cache hit.
[2023-03-12 09:45:00] [INFO ] Implicit Places using invariants in 1673 ms returned [1, 19, 20, 22, 32, 50, 68, 150, 163, 164, 165, 166, 167, 185, 203, 283, 296, 297, 298, 299, 300, 336, 417, 430, 431, 432, 433, 453, 471, 510, 554, 567, 568, 569, 570, 571, 589, 607, 687, 700, 701, 702, 703, 704, 722, 740, 820, 835, 836, 837, 838, 839, 857, 875, 956, 971, 972, 973, 974, 975, 993, 1011, 1091, 1096, 1107, 1108, 1109, 1110, 1111, 1146, 1149, 1167, 1168, 1169, 1170, 1182, 1188, 1194, 1200, 1206, 1218, 1224, 1230, 1236, 1242]
Discarding 85 places :
Implicit Place search using SMT only with invariants took 1692 ms to find 85 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1193/1278 places, 2164/2164 transitions.
Drop transitions removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 109 place count 1193 transition count 2055
Reduce places removed 109 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 125 rules applied. Total rules applied 234 place count 1084 transition count 2039
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 250 place count 1068 transition count 2039
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 250 place count 1068 transition count 1975
Deduced a syphon composed of 64 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 129 rules applied. Total rules applied 379 place count 1003 transition count 1975
Discarding 19 places :
Implicit places reduction removed 19 places
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 3 with 40 rules applied. Total rules applied 419 place count 984 transition count 1954
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 22 rules applied. Total rules applied 441 place count 963 transition count 1953
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 442 place count 962 transition count 1953
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 442 place count 962 transition count 1952
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 444 place count 961 transition count 1952
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 458 place count 947 transition count 1938
Iterating global reduction 6 with 14 rules applied. Total rules applied 472 place count 947 transition count 1938
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 475 place count 947 transition count 1935
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 478 place count 944 transition count 1932
Iterating global reduction 7 with 3 rules applied. Total rules applied 481 place count 944 transition count 1932
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 484 place count 941 transition count 1929
Iterating global reduction 7 with 3 rules applied. Total rules applied 487 place count 941 transition count 1929
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 488 place count 940 transition count 1928
Iterating global reduction 7 with 1 rules applied. Total rules applied 489 place count 940 transition count 1928
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 490 place count 939 transition count 1927
Iterating global reduction 7 with 1 rules applied. Total rules applied 491 place count 939 transition count 1927
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 492 place count 938 transition count 1926
Iterating global reduction 7 with 1 rules applied. Total rules applied 493 place count 938 transition count 1926
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 2 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 7 with 122 rules applied. Total rules applied 615 place count 877 transition count 1865
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 622 place count 870 transition count 1858
Iterating global reduction 7 with 7 rules applied. Total rules applied 629 place count 870 transition count 1858
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 635 place count 870 transition count 1852
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 641 place count 870 transition count 1846
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 652 place count 864 transition count 1841
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 9 with 27 rules applied. Total rules applied 679 place count 864 transition count 1814
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 9 with 28 rules applied. Total rules applied 707 place count 836 transition count 1814
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 708 place count 836 transition count 1813
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 10 with 22 rules applied. Total rules applied 730 place count 836 transition count 1813
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 732 place count 836 transition count 1813
Applied a total of 732 rules in 655 ms. Remains 836 /1193 variables (removed 357) and now considering 1813/2164 (removed 351) transitions.
// Phase 1: matrix 1813 rows 836 cols
[2023-03-12 09:45:01] [INFO ] Computed 124 place invariants in 26 ms
[2023-03-12 09:45:02] [INFO ] Implicit Places using invariants in 1017 ms returned [73, 91, 97, 100, 103, 106, 107, 159, 176, 182, 185, 187, 188, 193, 194, 247, 268, 277, 283, 284, 289, 290, 369, 375, 378, 380, 381, 386, 391, 392, 444, 461, 467, 470, 472, 474, 479, 533, 550, 556, 559, 561, 562, 567, 568, 639, 646, 649, 652, 658, 665, 717, 734, 740, 743, 745, 746]
Discarding 57 places :
Implicit Place search using SMT only with invariants took 1022 ms to find 57 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 779/1278 places, 1813/2164 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 779 transition count 1812
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 778 transition count 1812
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 24 place count 756 transition count 1790
Iterating global reduction 2 with 22 rules applied. Total rules applied 46 place count 756 transition count 1790
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 55 place count 747 transition count 1781
Iterating global reduction 2 with 9 rules applied. Total rules applied 64 place count 747 transition count 1781
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 745 transition count 1779
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 745 transition count 1779
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 744 transition count 1778
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 744 transition count 1778
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 100 place count 729 transition count 1763
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 728 transition count 1761
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 728 transition count 1761
Free-agglomeration rule applied 24 times.
Iterating global reduction 2 with 24 rules applied. Total rules applied 126 place count 728 transition count 1737
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 150 place count 704 transition count 1737
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 154 place count 704 transition count 1733
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 158 place count 700 transition count 1733
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 159 place count 700 transition count 1733
Applied a total of 159 rules in 280 ms. Remains 700 /779 variables (removed 79) and now considering 1733/1813 (removed 80) transitions.
// Phase 1: matrix 1733 rows 700 cols
[2023-03-12 09:45:02] [INFO ] Computed 67 place invariants in 12 ms
[2023-03-12 09:45:03] [INFO ] Implicit Places using invariants in 480 ms returned []
[2023-03-12 09:45:03] [INFO ] Invariant cache hit.
[2023-03-12 09:45:03] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 09:45:05] [INFO ] Implicit Places using invariants and state equation in 2397 ms returned []
Implicit Place search using SMT with State Equation took 2901 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 700/1278 places, 1733/2164 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6596 ms. Remains : 700/1278 places, 1733/2164 transitions.
Incomplete random walk after 10000 steps, including 163 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 162347 steps, run timeout after 3008 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 162347 steps, saw 119006 distinct states, run finished after 3009 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 09:45:08] [INFO ] Invariant cache hit.
[2023-03-12 09:45:09] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 09:45:09] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-12 09:45:09] [INFO ] [Nat]Absence check using 14 positive and 53 generalized place invariants in 44 ms returned sat
[2023-03-12 09:45:20] [INFO ] After 11058ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 09:45:20] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 09:45:29] [INFO ] After 9229ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 09:45:34] [INFO ] After 13722ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-12 09:45:34] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 112 ms.
Support contains 69 out of 700 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 700/700 places, 1733/1733 transitions.
Applied a total of 0 rules in 21 ms. Remains 700 /700 variables (removed 0) and now considering 1733/1733 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 700/700 places, 1733/1733 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 700/700 places, 1733/1733 transitions.
Applied a total of 0 rules in 30 ms. Remains 700 /700 variables (removed 0) and now considering 1733/1733 (removed 0) transitions.
[2023-03-12 09:45:34] [INFO ] Invariant cache hit.
[2023-03-12 09:45:34] [INFO ] Implicit Places using invariants in 569 ms returned []
[2023-03-12 09:45:34] [INFO ] Invariant cache hit.
[2023-03-12 09:45:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 09:45:37] [INFO ] Implicit Places using invariants and state equation in 2447 ms returned []
Implicit Place search using SMT with State Equation took 3046 ms to find 0 implicit places.
[2023-03-12 09:45:37] [INFO ] Redundant transitions in 169 ms returned []
[2023-03-12 09:45:37] [INFO ] Invariant cache hit.
[2023-03-12 09:45:38] [INFO ] Dead Transitions using invariants and state equation in 1005 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4276 ms. Remains : 700/700 places, 1733/1733 transitions.
Applied a total of 0 rules in 24 ms. Remains 700 /700 variables (removed 0) and now considering 1733/1733 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-12 09:45:38] [INFO ] Invariant cache hit.
[2023-03-12 09:45:38] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 09:45:38] [INFO ] [Nat]Absence check using 14 positive place invariants in 29 ms returned sat
[2023-03-12 09:45:39] [INFO ] [Nat]Absence check using 14 positive and 53 generalized place invariants in 25 ms returned sat
[2023-03-12 09:45:44] [INFO ] After 5297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 09:45:46] [INFO ] Deduced a trap composed of 19 places in 234 ms of which 9 ms to minimize.
[2023-03-12 09:45:46] [INFO ] Deduced a trap composed of 36 places in 209 ms of which 1 ms to minimize.
[2023-03-12 09:45:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 650 ms
[2023-03-12 09:45:55] [INFO ] After 16517ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 947 ms.
[2023-03-12 09:45:56] [INFO ] After 17816ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:45:56] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2023-03-12 09:45:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 700 places, 1733 transitions and 7005 arcs took 9 ms.
[2023-03-12 09:45:57] [INFO ] Flatten gal took : 206 ms
Total runtime 203528 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/560/inv_0_ --invariant=/tmp/560/inv_1_ --inv-par
Could not compute solution for formula : ASLink-PT-08a-ReachabilityFireability-05
Could not compute solution for formula : ASLink-PT-08a-ReachabilityFireability-13

BK_STOP 1678616369537

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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
mcc2023
rfs formula name ASLink-PT-08a-ReachabilityFireability-05
rfs formula type EF
rfs formula formula --invariant=/tmp/560/inv_0_
rfs formula name ASLink-PT-08a-ReachabilityFireability-13
rfs formula type EF
rfs formula formula --invariant=/tmp/560/inv_1_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 700 places, 1733 transitions and 7005 arcs
pnml2lts-sym: Petri net ASLink_PT_08a analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.020 real 0.020 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 1733->1724 groups
pnml2lts-sym: Regrouping took 0.690 real 0.690 user 0.000 sys
pnml2lts-sym: state vector length is 700; there are 1724 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done

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-08a"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ASLink-PT-08a, 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 r009-oct2-167813597500127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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