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-167813595000127.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-08a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-oct2-167813595000127
=====================================================================

--------------------
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 1678341466196

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-08a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 05:57:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 05:57:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 05:57:48] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2023-03-09 05:57:48] [INFO ] Transformed 1796 places.
[2023-03-09 05:57:48] [INFO ] Transformed 2646 transitions.
[2023-03-09 05:57:48] [INFO ] Found NUPN structural information;
[2023-03-09 05:57:48] [INFO ] Parsed PT model containing 1796 places and 2646 transitions and 9934 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 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 52 resets, run finished after 458 ms. (steps per millisecond=21 ) 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 56 ms. (steps per millisecond=178 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 47 ms. (steps per millisecond=212 ) 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 5 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 5 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 40 ms. (steps per millisecond=250 ) 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 5 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 2618 rows 1796 cols
[2023-03-09 05:57:49] [INFO ] Computed 346 place invariants in 125 ms
[2023-03-09 05:57:51] [INFO ] [Real]Absence check using 85 positive place invariants in 21 ms returned sat
[2023-03-09 05:57:51] [INFO ] [Real]Absence check using 85 positive and 261 generalized place invariants in 189 ms returned sat
[2023-03-09 05:57:51] [INFO ] After 1183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-09 05:57:52] [INFO ] [Nat]Absence check using 85 positive place invariants in 26 ms returned sat
[2023-03-09 05:57:52] [INFO ] [Nat]Absence check using 85 positive and 261 generalized place invariants in 77 ms returned sat
[2023-03-09 05:58:16] [INFO ] After 23683ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :3
[2023-03-09 05:58:16] [INFO ] After 23694ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-09 05:58:16] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :3
FORMULA ASLink-PT-08a-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
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-07 TRUE 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 1 ms.
Support contains 178 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 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 187 rules applied. Total rules applied 187 place count 1749 transition count 2478
Reduce places removed 140 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 149 rules applied. Total rules applied 336 place count 1609 transition count 2469
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 345 place count 1600 transition count 2469
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 156 Pre rules applied. Total rules applied 345 place count 1600 transition count 2313
Deduced a syphon composed of 156 places in 5 ms
Ensure Unique test removed 60 places
Reduce places removed 216 places and 0 transitions.
Iterating global reduction 3 with 372 rules applied. Total rules applied 717 place count 1384 transition count 2313
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 718 place count 1384 transition count 2312
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 719 place count 1383 transition count 2312
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 728 place count 1374 transition count 2265
Ensure Unique test removed 1 places
Iterating global reduction 5 with 10 rules applied. Total rules applied 738 place count 1373 transition count 2265
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 744 place count 1372 transition count 2260
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 747 place count 1369 transition count 2260
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 748 place count 1368 transition count 2252
Iterating global reduction 7 with 1 rules applied. Total rules applied 749 place count 1368 transition count 2252
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 7 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 7 with 90 rules applied. Total rules applied 839 place count 1323 transition count 2207
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 843 place count 1323 transition count 2203
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 847 place count 1319 transition count 2203
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 855 place count 1319 transition count 2203
Applied a total of 855 rules in 728 ms. Remains 1319 /1796 variables (removed 477) and now considering 2203/2618 (removed 415) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 728 ms. Remains : 1319/1796 places, 2203/2618 transitions.
Incomplete random walk after 10000 steps, including 83 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 192352 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 192352 steps, saw 41881 distinct states, run finished after 3002 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2203 rows 1319 cols
[2023-03-09 05:58:20] [INFO ] Computed 237 place invariants in 68 ms
[2023-03-09 05:58:21] [INFO ] After 380ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 05:58:21] [INFO ] [Nat]Absence check using 63 positive place invariants in 20 ms returned sat
[2023-03-09 05:58:21] [INFO ] [Nat]Absence check using 63 positive and 174 generalized place invariants in 62 ms returned sat
[2023-03-09 05:58:46] [INFO ] After 24386ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-09 05:58:46] [INFO ] State equation strengthened by 41 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:58:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 05:58:46] [INFO ] After 25040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
FORMULA ASLink-PT-08a-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 61 ms.
Support contains 178 out of 1319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1319/1319 places, 2203/2203 transitions.
Applied a total of 0 rules in 51 ms. Remains 1319 /1319 variables (removed 0) and now considering 2203/2203 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 1319/1319 places, 2203/2203 transitions.
Incomplete random walk after 10000 steps, including 76 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 73 ms. (steps per millisecond=136 ) 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 :0
Interrupted probabilistic random walk after 191785 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 191785 steps, saw 41786 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-09 05:58:49] [INFO ] Invariant cache hit.
[2023-03-09 05:58:50] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 05:58:50] [INFO ] [Nat]Absence check using 63 positive place invariants in 107 ms returned sat
[2023-03-09 05:58:50] [INFO ] [Nat]Absence check using 63 positive and 174 generalized place invariants in 80 ms returned sat
[2023-03-09 05:59:15] [INFO ] After 24480ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 05:59:15] [INFO ] State equation strengthened by 41 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
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:59:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 05:59:15] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 145 ms.
Support contains 178 out of 1319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1319/1319 places, 2203/2203 transitions.
Applied a total of 0 rules in 62 ms. Remains 1319 /1319 variables (removed 0) and now considering 2203/2203 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 1319/1319 places, 2203/2203 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1319/1319 places, 2203/2203 transitions.
Applied a total of 0 rules in 74 ms. Remains 1319 /1319 variables (removed 0) and now considering 2203/2203 (removed 0) transitions.
[2023-03-09 05:59:15] [INFO ] Invariant cache hit.
[2023-03-09 05:59:16] [INFO ] Implicit Places using invariants in 869 ms returned [1, 19, 20, 22, 32, 50, 68, 129, 152, 167, 172, 173, 174, 192, 210, 291, 304, 305, 306, 307, 308, 344, 405, 430, 446, 447, 448, 449, 469, 487, 526, 550, 585, 586, 587, 588, 589, 607, 625, 708, 721, 722, 723, 724, 762, 844, 859, 860, 861, 862, 863, 881, 899, 965, 987, 1002, 1007, 1008, 1009, 1027, 1045, 1117, 1130, 1135, 1146, 1147, 1148, 1149, 1185, 1188, 1206, 1207, 1208, 1209, 1222, 1228, 1234, 1240, 1246, 1258, 1264, 1270, 1276]
Discarding 83 places :
Implicit Place search using SMT only with invariants took 873 ms to find 83 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1236/1319 places, 2203/2203 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 1236 transition count 2132
Reduce places removed 71 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 93 rules applied. Total rules applied 164 place count 1165 transition count 2110
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 186 place count 1143 transition count 2110
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 186 place count 1143 transition count 2052
Deduced a syphon composed of 58 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 117 rules applied. Total rules applied 303 place count 1084 transition count 2052
Discarding 14 places :
Implicit places reduction removed 14 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 20 rules applied. Total rules applied 323 place count 1070 transition count 2046
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 7 rules applied. Total rules applied 330 place count 1064 transition count 2045
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 331 place count 1063 transition count 2045
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 347 place count 1047 transition count 2029
Iterating global reduction 6 with 16 rules applied. Total rules applied 363 place count 1047 transition count 2029
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 371 place count 1039 transition count 2021
Iterating global reduction 6 with 8 rules applied. Total rules applied 379 place count 1039 transition count 2021
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 381 place count 1039 transition count 2019
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 386 place count 1034 transition count 2014
Iterating global reduction 7 with 5 rules applied. Total rules applied 391 place count 1034 transition count 2014
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 394 place count 1034 transition count 2011
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 395 place count 1033 transition count 2010
Iterating global reduction 8 with 1 rules applied. Total rules applied 396 place count 1033 transition count 2010
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 397 place count 1032 transition count 2009
Iterating global reduction 8 with 1 rules applied. Total rules applied 398 place count 1032 transition count 2009
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 399 place count 1031 transition count 2008
Iterating global reduction 8 with 1 rules applied. Total rules applied 400 place count 1031 transition count 2008
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 8 with 84 rules applied. Total rules applied 484 place count 989 transition count 1966
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 487 place count 986 transition count 1963
Iterating global reduction 8 with 3 rules applied. Total rules applied 490 place count 986 transition count 1963
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 491 place count 986 transition count 1962
Free-agglomeration rule applied 6 times.
Iterating global reduction 9 with 6 rules applied. Total rules applied 497 place count 986 transition count 1956
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 504 place count 980 transition count 1955
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 505 place count 980 transition count 1954
Free-agglomeration rule (complex) applied 38 times.
Iterating global reduction 10 with 38 rules applied. Total rules applied 543 place count 980 transition count 1916
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 10 with 38 rules applied. Total rules applied 581 place count 942 transition count 1916
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 582 place count 941 transition count 1915
Iterating global reduction 11 with 1 rules applied. Total rules applied 583 place count 941 transition count 1915
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 584 place count 941 transition count 1914
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 12 with 18 rules applied. Total rules applied 602 place count 941 transition count 1914
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 607 place count 941 transition count 1914
Applied a total of 607 rules in 593 ms. Remains 941 /1236 variables (removed 295) and now considering 1914/2203 (removed 289) transitions.
// Phase 1: matrix 1914 rows 941 cols
[2023-03-09 05:59:17] [INFO ] Computed 139 place invariants in 40 ms
[2023-03-09 05:59:17] [INFO ] Implicit Places using invariants in 521 ms returned [92, 103, 106, 109, 118, 193, 199, 202, 204, 206, 211, 212, 265, 286, 306, 307, 399, 410, 412, 413, 419, 424, 479, 500, 508, 511, 513, 515, 520, 580, 606, 615, 622, 623, 627, 632, 633, 707, 720, 723, 743, 799, 817, 824, 837]
Discarding 45 places :
Implicit Place search using SMT only with invariants took 525 ms to find 45 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 896/1319 places, 1914/2203 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 896 transition count 1911
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 893 transition count 1911
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 19 place count 880 transition count 1898
Iterating global reduction 2 with 13 rules applied. Total rules applied 32 place count 880 transition count 1898
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 37 place count 875 transition count 1893
Iterating global reduction 2 with 5 rules applied. Total rules applied 42 place count 875 transition count 1893
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 872 transition count 1890
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 872 transition count 1890
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 871 transition count 1889
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 871 transition count 1889
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 68 place count 862 transition count 1880
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 861 transition count 1878
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 861 transition count 1878
Free-agglomeration rule applied 19 times.
Iterating global reduction 2 with 19 rules applied. Total rules applied 89 place count 861 transition count 1859
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 108 place count 842 transition count 1859
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 842 transition count 1857
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 112 place count 840 transition count 1857
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 113 place count 840 transition count 1857
Applied a total of 113 rules in 240 ms. Remains 840 /896 variables (removed 56) and now considering 1857/1914 (removed 57) transitions.
// Phase 1: matrix 1857 rows 840 cols
[2023-03-09 05:59:17] [INFO ] Computed 94 place invariants in 15 ms
[2023-03-09 05:59:21] [INFO ] Implicit Places using invariants in 3550 ms returned []
[2023-03-09 05:59:21] [INFO ] Invariant cache hit.
[2023-03-09 05:59:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 05:59:23] [INFO ] Implicit Places using invariants and state equation in 1761 ms returned []
Implicit Place search using SMT with State Equation took 5312 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 840/1319 places, 1857/2203 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 7618 ms. Remains : 840/1319 places, 1857/2203 transitions.
Incomplete random walk after 10000 steps, including 100 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 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 17 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 156402 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 156402 steps, saw 112209 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-09 05:59:26] [INFO ] Invariant cache hit.
[2023-03-09 05:59:26] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 05:59:27] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-03-09 05:59:27] [INFO ] [Nat]Absence check using 21 positive and 73 generalized place invariants in 39 ms returned sat
[2023-03-09 05:59:37] [INFO ] After 10526ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-09 05:59:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 05:59:51] [INFO ] After 14166ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-09 05:59:51] [INFO ] After 14169ms 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-09 05:59:51] [INFO ] After 25025ms 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 4 Parikh solutions to 3 different solutions.
FORMULA ASLink-PT-08a-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 240 ms.
Support contains 69 out of 840 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 840/840 places, 1857/1857 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 839 transition count 1843
Reduce places removed 14 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 18 rules applied. Total rules applied 33 place count 825 transition count 1839
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 37 place count 821 transition count 1839
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 37 place count 821 transition count 1827
Deduced a syphon composed of 12 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 62 place count 808 transition count 1827
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 64 place count 806 transition count 1827
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 64 place count 806 transition count 1826
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 805 transition count 1826
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 72 place count 799 transition count 1815
Iterating global reduction 4 with 6 rules applied. Total rules applied 78 place count 799 transition count 1815
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 4 with 2 rules applied. Total rules applied 80 place count 799 transition count 1813
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 81 place count 798 transition count 1813
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 113 place count 782 transition count 1797
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 114 place count 782 transition count 1796
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 116 place count 780 transition count 1794
Iterating global reduction 7 with 2 rules applied. Total rules applied 118 place count 780 transition count 1794
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 119 place count 779 transition count 1793
Iterating global reduction 7 with 1 rules applied. Total rules applied 120 place count 779 transition count 1793
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 121 place count 779 transition count 1792
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 125 place count 779 transition count 1788
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 130 place count 775 transition count 1787
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 134 place count 775 transition count 1783
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 138 place count 771 transition count 1783
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 140 place count 771 transition count 1783
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 141 place count 771 transition count 1783
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 142 place count 770 transition count 1782
Iterating global reduction 9 with 1 rules applied. Total rules applied 143 place count 770 transition count 1782
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 144 place count 770 transition count 1781
Applied a total of 144 rules in 249 ms. Remains 770 /840 variables (removed 70) and now considering 1781/1857 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 249 ms. Remains : 770/840 places, 1781/1857 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 211133 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 211133 steps, saw 145723 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1781 rows 770 cols
[2023-03-09 05:59:55] [INFO ] Computed 90 place invariants in 14 ms
[2023-03-09 05:59:55] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 05:59:55] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-09 05:59:55] [INFO ] [Nat]Absence check using 19 positive and 71 generalized place invariants in 49 ms returned sat
[2023-03-09 05:59:59] [INFO ] After 3927ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 05:59:59] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 06:00:09] [INFO ] After 9489ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 06:00:20] [INFO ] After 20855ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-09 06:00:20] [INFO ] After 25011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 254 ms.
Support contains 69 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1781/1781 transitions.
Applied a total of 0 rules in 21 ms. Remains 770 /770 variables (removed 0) and now considering 1781/1781 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 770/770 places, 1781/1781 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1781/1781 transitions.
Applied a total of 0 rules in 19 ms. Remains 770 /770 variables (removed 0) and now considering 1781/1781 (removed 0) transitions.
[2023-03-09 06:00:21] [INFO ] Invariant cache hit.
[2023-03-09 06:00:21] [INFO ] Implicit Places using invariants in 476 ms returned [94, 105, 106, 158, 255, 348, 351, 356, 430, 448, 585, 601, 668, 670, 681, 761, 766]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 478 ms to find 17 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 753/770 places, 1781/1781 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 753 transition count 1772
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 744 transition count 1772
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 18 place count 744 transition count 1769
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 741 transition count 1769
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 28 place count 737 transition count 1765
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 737 transition count 1765
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 734 transition count 1762
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 734 transition count 1762
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 68 place count 719 transition count 1747
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 719 transition count 1746
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 718 transition count 1745
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 718 transition count 1745
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 717 transition count 1744
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 717 transition count 1744
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 74 place count 716 transition count 1743
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 716 transition count 1743
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 80 place count 716 transition count 1738
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 85 place count 711 transition count 1738
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 89 place count 711 transition count 1734
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 93 place count 707 transition count 1734
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 94 place count 707 transition count 1734
Applied a total of 94 rules in 239 ms. Remains 707 /753 variables (removed 46) and now considering 1734/1781 (removed 47) transitions.
// Phase 1: matrix 1734 rows 707 cols
[2023-03-09 06:00:21] [INFO ] Computed 73 place invariants in 11 ms
[2023-03-09 06:00:22] [INFO ] Implicit Places using invariants in 409 ms returned [91, 92, 242, 243, 546]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 424 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 702/770 places, 1734/1781 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 701 transition count 1733
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 701 transition count 1733
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 700 transition count 1732
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 700 transition count 1732
Applied a total of 5 rules in 60 ms. Remains 700 /702 variables (removed 2) and now considering 1732/1734 (removed 2) transitions.
// Phase 1: matrix 1732 rows 700 cols
[2023-03-09 06:00:22] [INFO ] Computed 68 place invariants in 22 ms
[2023-03-09 06:00:22] [INFO ] Implicit Places using invariants in 388 ms returned []
[2023-03-09 06:00:22] [INFO ] Invariant cache hit.
[2023-03-09 06:00:23] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 06:00:24] [INFO ] Implicit Places using invariants and state equation in 2034 ms returned []
Implicit Place search using SMT with State Equation took 2424 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 700/770 places, 1732/1781 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3644 ms. Remains : 700/770 places, 1732/1781 transitions.
Incomplete random walk after 10000 steps, including 151 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 235815 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 235815 steps, saw 163422 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-09 06:00:27] [INFO ] Invariant cache hit.
[2023-03-09 06:00:27] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 06:00:28] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-09 06:00:28] [INFO ] [Nat]Absence check using 14 positive and 54 generalized place invariants in 18 ms returned sat
[2023-03-09 06:00:39] [INFO ] After 11417ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 06:00:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 06:00:48] [INFO ] After 9111ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-09 06:00:48] [INFO ] After 20671ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 133 ms.
Support contains 69 out of 700 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 700/700 places, 1732/1732 transitions.
Applied a total of 0 rules in 19 ms. Remains 700 /700 variables (removed 0) and now considering 1732/1732 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 700/700 places, 1732/1732 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 700/700 places, 1732/1732 transitions.
Applied a total of 0 rules in 18 ms. Remains 700 /700 variables (removed 0) and now considering 1732/1732 (removed 0) transitions.
[2023-03-09 06:00:48] [INFO ] Invariant cache hit.
[2023-03-09 06:00:49] [INFO ] Implicit Places using invariants in 492 ms returned []
[2023-03-09 06:00:49] [INFO ] Invariant cache hit.
[2023-03-09 06:00:49] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 06:00:51] [INFO ] Implicit Places using invariants and state equation in 1736 ms returned []
Implicit Place search using SMT with State Equation took 2242 ms to find 0 implicit places.
[2023-03-09 06:00:51] [INFO ] Redundant transitions in 160 ms returned []
[2023-03-09 06:00:51] [INFO ] Invariant cache hit.
[2023-03-09 06:00:51] [INFO ] Dead Transitions using invariants and state equation in 563 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3008 ms. Remains : 700/700 places, 1732/1732 transitions.
Applied a total of 0 rules in 23 ms. Remains 700 /700 variables (removed 0) and now considering 1732/1732 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-09 06:00:51] [INFO ] Invariant cache hit.
[2023-03-09 06:00:51] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 06:00:52] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-03-09 06:00:52] [INFO ] [Nat]Absence check using 14 positive and 54 generalized place invariants in 46 ms returned sat
[2023-03-09 06:01:04] [INFO ] After 12400ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 06:01:11] [INFO ] After 18966ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5443 ms.
[2023-03-09 06:01:16] [INFO ] After 24652ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-09 06:01:16] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-09 06:01:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 700 places, 1732 transitions and 7004 arcs took 12 ms.
[2023-03-09 06:01:16] [INFO ] Flatten gal took : 164 ms
Total runtime 208860 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ASLink-PT-08a
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/365
ReachabilityFireability

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

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

BK_STOP 1678341678515

--------------------
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/365/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/365/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/365/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 1.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 # 10 (type EXCL) for 3 ASLink-PT-08a-ReachabilityFireability-13
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 6 (type FNDP) for 3 ASLink-PT-08a-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 7 (type EQUN) for 3 ASLink-PT-08a-ReachabilityFireability-13
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 9 (type SRCH) for 3 ASLink-PT-08a-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
sara: try reading problem file /home/mcc/execution/365/ReachabilityFireability-7.sara.
lola: FINISHED task # 6 (type FNDP) for ASLink-PT-08a-ReachabilityFireability-13
lola: result : true
lola: fired transitions : 13683
lola: tried executions : 154
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 7 (type EQUN) for ASLink-PT-08a-ReachabilityFireability-13 (obsolete)
lola: CANCELED task # 9 (type SRCH) for ASLink-PT-08a-ReachabilityFireability-13 (obsolete)
lola: CANCELED task # 10 (type EXCL) for ASLink-PT-08a-ReachabilityFireability-13 (obsolete)
lola: LAUNCH task # 16 (type EXCL) for 0 ASLink-PT-08a-ReachabilityFireability-05
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 12 (type FNDP) for 0 ASLink-PT-08a-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 13 (type EQUN) for 0 ASLink-PT-08a-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type SRCH) for 0 ASLink-PT-08a-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 7 (type EQUN) for ASLink-PT-08a-ReachabilityFireability-13
lola: result : unknown
lola: FINISHED task # 12 (type FNDP) for ASLink-PT-08a-ReachabilityFireability-05
lola: result : true
lola: fired transitions : 259
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 13 (type EQUN) for ASLink-PT-08a-ReachabilityFireability-05 (obsolete)
lola: CANCELED task # 15 (type SRCH) for ASLink-PT-08a-ReachabilityFireability-05 (obsolete)
lola: CANCELED task # 16 (type EXCL) for ASLink-PT-08a-ReachabilityFireability-05 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ASLink-PT-08a-ReachabilityFireability-05: EF true findpath
ASLink-PT-08a-ReachabilityFireability-13: EF true findpath


Time elapsed: 1 secs. Pages in use: 3

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-08a"
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-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 r007-oct2-167813595000127"
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 ;