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-167813597300039.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-02b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597300039
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 6.4K Feb 26 13:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 13:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 13:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:12 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:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 13:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 26 13:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 13:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Feb 26 13:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 417K 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-02b-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678602560570

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-02b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 06:29:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 06:29:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 06:29:23] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2023-03-12 06:29:23] [INFO ] Transformed 1242 places.
[2023-03-12 06:29:23] [INFO ] Transformed 1621 transitions.
[2023-03-12 06:29:23] [INFO ] Found NUPN structural information;
[2023-03-12 06:29:23] [INFO ] Parsed PT model containing 1242 places and 1621 transitions and 5041 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 43 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 16) seen :4
FORMULA ASLink-PT-02b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 1621 rows 1242 cols
[2023-03-12 06:29:25] [INFO ] Computed 121 place invariants in 50 ms
[2023-03-12 06:29:26] [INFO ] After 783ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-12 06:29:27] [INFO ] [Nat]Absence check using 27 positive place invariants in 41 ms returned sat
[2023-03-12 06:29:27] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 110 ms returned sat
[2023-03-12 06:29:51] [INFO ] After 23566ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :5
[2023-03-12 06:29:51] [INFO ] After 23576ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :5
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-12 06:29:51] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :5
FORMULA ASLink-PT-02b-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02b-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02b-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02b-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 188 out of 1242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1242/1242 places, 1621/1621 transitions.
Drop transitions removed 175 transitions
Trivial Post-agglo rules discarded 175 transitions
Performed 175 trivial Post agglomeration. Transition count delta: 175
Iterating post reduction 0 with 175 rules applied. Total rules applied 175 place count 1242 transition count 1446
Reduce places removed 175 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 181 rules applied. Total rules applied 356 place count 1067 transition count 1440
Reduce places removed 1 places and 0 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Iterating post reduction 2 with 34 rules applied. Total rules applied 390 place count 1066 transition count 1407
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 35 rules applied. Total rules applied 425 place count 1033 transition count 1405
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 233 Pre rules applied. Total rules applied 425 place count 1033 transition count 1172
Deduced a syphon composed of 233 places in 3 ms
Ensure Unique test removed 16 places
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 4 with 482 rules applied. Total rules applied 907 place count 784 transition count 1172
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 4 with 12 rules applied. Total rules applied 919 place count 783 transition count 1161
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 930 place count 772 transition count 1161
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 930 place count 772 transition count 1157
Deduced a syphon composed of 4 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 940 place count 766 transition count 1157
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 940 place count 766 transition count 1155
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 944 place count 764 transition count 1155
Discarding 34 places :
Symmetric choice reduction at 6 with 34 rule applications. Total rules 978 place count 730 transition count 1121
Iterating global reduction 6 with 34 rules applied. Total rules applied 1012 place count 730 transition count 1121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1013 place count 730 transition count 1120
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 8 Pre rules applied. Total rules applied 1013 place count 730 transition count 1112
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 1029 place count 722 transition count 1112
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1030 place count 721 transition count 1103
Iterating global reduction 7 with 1 rules applied. Total rules applied 1031 place count 721 transition count 1103
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 7 with 106 rules applied. Total rules applied 1137 place count 667 transition count 1051
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 1139 place count 666 transition count 1050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1140 place count 665 transition count 1050
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1140 place count 665 transition count 1049
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1142 place count 664 transition count 1049
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1143 place count 663 transition count 1048
Ensure Unique test removed 1 places
Iterating global reduction 9 with 2 rules applied. Total rules applied 1145 place count 662 transition count 1048
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1146 place count 661 transition count 1047
Iterating global reduction 9 with 1 rules applied. Total rules applied 1147 place count 661 transition count 1047
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 9 with 2 rules applied. Total rules applied 1149 place count 661 transition count 1045
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1150 place count 660 transition count 1045
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1151 place count 660 transition count 1044
Free-agglomeration rule applied 3 times.
Iterating global reduction 11 with 3 rules applied. Total rules applied 1154 place count 660 transition count 1041
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 1157 place count 657 transition count 1041
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 12 with 3 rules applied. Total rules applied 1160 place count 657 transition count 1038
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 1163 place count 654 transition count 1038
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1164 place count 653 transition count 1037
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 1167 place count 650 transition count 1037
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 6 Pre rules applied. Total rules applied 1167 place count 650 transition count 1031
Deduced a syphon composed of 6 places in 9 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 14 with 13 rules applied. Total rules applied 1180 place count 643 transition count 1031
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 14 with 3 rules applied. Total rules applied 1183 place count 640 transition count 1031
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 1183 place count 640 transition count 1030
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 1185 place count 639 transition count 1030
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 15 with 6 rules applied. Total rules applied 1191 place count 636 transition count 1027
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 1192 place count 635 transition count 1026
Iterating global reduction 15 with 1 rules applied. Total rules applied 1193 place count 635 transition count 1026
Applied a total of 1193 rules in 684 ms. Remains 635 /1242 variables (removed 607) and now considering 1026/1621 (removed 595) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 686 ms. Remains : 635/1242 places, 1026/1621 transitions.
Incomplete random walk after 10000 steps, including 93 resets, run finished after 431 ms. (steps per millisecond=23 ) properties (out of 8) seen :2
FORMULA ASLink-PT-02b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1026 rows 635 cols
[2023-03-12 06:29:53] [INFO ] Computed 91 place invariants in 21 ms
[2023-03-12 06:29:53] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 06:29:53] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-12 06:29:53] [INFO ] [Nat]Absence check using 17 positive and 74 generalized place invariants in 33 ms returned sat
[2023-03-12 06:30:18] [INFO ] After 24639ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-12 06:30:18] [INFO ] State equation strengthened by 1 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 06:30:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 06:30:18] [INFO ] After 25043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
FORMULA ASLink-PT-02b-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 92 ms.
Support contains 149 out of 635 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 635/635 places, 1026/1026 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 635 transition count 1022
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 631 transition count 1021
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 630 transition count 1021
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 10 place count 630 transition count 1004
Deduced a syphon composed of 17 places in 9 ms
Ensure Unique test removed 2 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 46 place count 611 transition count 1004
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 610 transition count 1003
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 610 transition count 1003
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 49 place count 610 transition count 1002
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 7 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 69 place count 600 transition count 992
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 73 place count 600 transition count 988
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 77 place count 596 transition count 988
Applied a total of 77 rules in 123 ms. Remains 596 /635 variables (removed 39) and now considering 988/1026 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 596/635 places, 988/1026 transitions.
Incomplete random walk after 10000 steps, including 93 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 234726 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 234726 steps, saw 71396 distinct states, run finished after 3003 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 988 rows 596 cols
[2023-03-12 06:30:22] [INFO ] Computed 89 place invariants in 12 ms
[2023-03-12 06:30:23] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 06:30:23] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2023-03-12 06:30:23] [INFO ] [Nat]Absence check using 19 positive and 70 generalized place invariants in 17 ms returned sat
[2023-03-12 06:30:46] [INFO ] After 22781ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-12 06:30:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 06:30:48] [INFO ] After 1907ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-12 06:30:48] [INFO ] After 1908ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-12 06:30:48] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA ASLink-PT-02b-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 181 ms.
Support contains 148 out of 596 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 988/988 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 596 transition count 987
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 595 transition count 987
Applied a total of 2 rules in 34 ms. Remains 595 /596 variables (removed 1) and now considering 987/988 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 595/596 places, 987/988 transitions.
Incomplete random walk after 10000 steps, including 98 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 255112 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 255112 steps, saw 77862 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 987 rows 595 cols
[2023-03-12 06:30:51] [INFO ] Computed 89 place invariants in 9 ms
[2023-03-12 06:30:52] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 06:30:52] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-03-12 06:30:52] [INFO ] [Nat]Absence check using 19 positive and 70 generalized place invariants in 59 ms returned sat
[2023-03-12 06:31:14] [INFO ] After 21592ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 06:31:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 06:31:17] [INFO ] After 3028ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 06:31:17] [INFO ] After 3029ms 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 06:31:17] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 150 ms.
Support contains 148 out of 595 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 987/987 transitions.
Applied a total of 0 rules in 30 ms. Remains 595 /595 variables (removed 0) and now considering 987/987 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 595/595 places, 987/987 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 987/987 transitions.
Applied a total of 0 rules in 23 ms. Remains 595 /595 variables (removed 0) and now considering 987/987 (removed 0) transitions.
[2023-03-12 06:31:17] [INFO ] Invariant cache hit.
[2023-03-12 06:31:17] [INFO ] Implicit Places using invariants in 331 ms returned [26, 27, 69, 89, 114, 181, 185, 190, 206, 263, 352, 355, 371, 374, 389, 390, 391, 392, 439, 443, 464, 466, 469, 485, 491, 499, 505, 511, 517, 523, 530, 537, 543, 549, 593, 594]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 336 ms to find 36 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 559/595 places, 987/987 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 559 transition count 972
Reduce places removed 15 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 23 rules applied. Total rules applied 38 place count 544 transition count 964
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 46 place count 536 transition count 964
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 46 place count 536 transition count 955
Deduced a syphon composed of 9 places in 9 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 64 place count 527 transition count 955
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 74 place count 517 transition count 945
Iterating global reduction 3 with 10 rules applied. Total rules applied 84 place count 517 transition count 945
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 84 place count 517 transition count 944
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 516 transition count 944
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 89 place count 513 transition count 941
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 513 transition count 941
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 94 place count 511 transition count 939
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 511 transition count 939
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 3 with 32 rules applied. Total rules applied 128 place count 495 transition count 923
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 495 transition count 921
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 132 place count 493 transition count 921
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 136 place count 493 transition count 917
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 140 place count 489 transition count 917
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 142 place count 489 transition count 917
Applied a total of 142 rules in 128 ms. Remains 489 /559 variables (removed 70) and now considering 917/987 (removed 70) transitions.
// Phase 1: matrix 917 rows 489 cols
[2023-03-12 06:31:17] [INFO ] Computed 53 place invariants in 10 ms
[2023-03-12 06:31:17] [INFO ] Implicit Places using invariants in 199 ms returned [298, 309]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 200 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 487/595 places, 917/987 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 485 transition count 915
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 485 transition count 915
Applied a total of 4 rules in 16 ms. Remains 485 /487 variables (removed 2) and now considering 915/917 (removed 2) transitions.
// Phase 1: matrix 915 rows 485 cols
[2023-03-12 06:31:18] [INFO ] Computed 51 place invariants in 14 ms
[2023-03-12 06:31:18] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-03-12 06:31:18] [INFO ] Invariant cache hit.
[2023-03-12 06:31:18] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 06:31:19] [INFO ] Implicit Places using invariants and state equation in 943 ms returned []
Implicit Place search using SMT with State Equation took 1159 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 485/595 places, 915/987 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1862 ms. Remains : 485/595 places, 915/987 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 316348 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :{}
Probabilistic random walk after 316348 steps, saw 80419 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 06:31:22] [INFO ] Invariant cache hit.
[2023-03-12 06:31:23] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 06:31:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-12 06:31:23] [INFO ] [Nat]Absence check using 10 positive and 41 generalized place invariants in 17 ms returned sat
[2023-03-12 06:31:40] [INFO ] After 16898ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-12 06:31:40] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 06:31:46] [INFO ] After 6754ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-12 06:31:48] [INFO ] After 7915ms 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 06:31:48] [INFO ] After 25037ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA ASLink-PT-02b-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
FORMULA ASLink-PT-02b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 89 ms.
Support contains 102 out of 485 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 485/485 places, 915/915 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 485 transition count 906
Reduce places removed 9 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 12 rules applied. Total rules applied 21 place count 476 transition count 903
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 24 place count 473 transition count 903
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 24 place count 473 transition count 880
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 70 place count 450 transition count 880
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 449 transition count 880
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 74 place count 446 transition count 860
Iterating global reduction 4 with 3 rules applied. Total rules applied 77 place count 446 transition count 860
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 101 place count 434 transition count 848
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 434 transition count 847
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 106 place count 434 transition count 843
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 110 place count 430 transition count 843
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 111 place count 430 transition count 842
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 112 place count 429 transition count 842
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 114 place count 429 transition count 842
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 115 place count 428 transition count 841
Applied a total of 115 rules in 137 ms. Remains 428 /485 variables (removed 57) and now considering 841/915 (removed 74) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 428/485 places, 841/915 transitions.
Incomplete random walk after 10000 steps, including 110 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 411746 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :{}
Probabilistic random walk after 411746 steps, saw 114192 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 841 rows 428 cols
[2023-03-12 06:31:51] [INFO ] Computed 50 place invariants in 17 ms
[2023-03-12 06:31:51] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 06:31:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-12 06:31:51] [INFO ] [Nat]Absence check using 14 positive and 36 generalized place invariants in 19 ms returned sat
[2023-03-12 06:31:58] [INFO ] After 6696ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-12 06:31:58] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 06:32:07] [INFO ] After 9075ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :1 sat :0
[2023-03-12 06:32:07] [INFO ] After 15963ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
FORMULA ASLink-PT-02b-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 36 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 841/841 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 428 transition count 832
Reduce places removed 9 places and 0 transitions.
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 1 with 11 rules applied. Total rules applied 20 place count 419 transition count 830
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 418 transition count 830
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 21 place count 418 transition count 795
Deduced a syphon composed of 35 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 73 rules applied. Total rules applied 94 place count 380 transition count 795
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 379 transition count 795
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 99 place count 375 transition count 784
Iterating global reduction 4 with 4 rules applied. Total rules applied 103 place count 375 transition count 784
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 104 place count 374 transition count 776
Iterating global reduction 4 with 1 rules applied. Total rules applied 105 place count 374 transition count 776
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 106 place count 373 transition count 768
Iterating global reduction 4 with 1 rules applied. Total rules applied 107 place count 373 transition count 768
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 108 place count 372 transition count 760
Iterating global reduction 4 with 1 rules applied. Total rules applied 109 place count 372 transition count 760
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 110 place count 371 transition count 752
Iterating global reduction 4 with 1 rules applied. Total rules applied 111 place count 371 transition count 752
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 125 place count 364 transition count 745
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 128 place count 361 transition count 742
Iterating global reduction 4 with 3 rules applied. Total rules applied 131 place count 361 transition count 742
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 132 place count 360 transition count 741
Iterating global reduction 4 with 1 rules applied. Total rules applied 133 place count 360 transition count 741
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 359 transition count 740
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 359 transition count 740
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 136 place count 358 transition count 739
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 358 transition count 739
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 140 place count 358 transition count 736
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 143 place count 355 transition count 736
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 149 place count 355 transition count 730
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 155 place count 349 transition count 730
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 156 place count 348 transition count 729
Applied a total of 156 rules in 132 ms. Remains 348 /428 variables (removed 80) and now considering 729/841 (removed 112) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 348/428 places, 729/841 transitions.
Incomplete random walk after 10000 steps, including 160 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 696266 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :{}
Probabilistic random walk after 696266 steps, saw 218352 distinct states, run finished after 3001 ms. (steps per millisecond=232 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 729 rows 348 cols
[2023-03-12 06:32:10] [INFO ] Computed 46 place invariants in 14 ms
[2023-03-12 06:32:10] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 06:32:11] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2023-03-12 06:32:11] [INFO ] [Nat]Absence check using 16 positive and 30 generalized place invariants in 10 ms returned sat
[2023-03-12 06:32:13] [INFO ] After 2014ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 06:32:14] [INFO ] After 3810ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 762 ms.
[2023-03-12 06:32:15] [INFO ] After 4679ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 36 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 729/729 transitions.
Applied a total of 0 rules in 15 ms. Remains 348 /348 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 348/348 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 729/729 transitions.
Applied a total of 0 rules in 8 ms. Remains 348 /348 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-12 06:32:15] [INFO ] Invariant cache hit.
[2023-03-12 06:32:16] [INFO ] Implicit Places using invariants in 464 ms returned [1, 26, 98, 107, 113, 118, 129, 135, 226, 239, 269, 291]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 480 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 336/348 places, 729/729 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 336 transition count 718
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 325 transition count 718
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 22 place count 325 transition count 717
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 324 transition count 717
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 27 place count 321 transition count 714
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 321 transition count 714
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 319 transition count 712
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 319 transition count 712
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 318 transition count 711
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 318 transition count 711
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 64 place count 304 transition count 697
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 304 transition count 696
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 303 transition count 695
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 303 transition count 695
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 302 transition count 694
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 302 transition count 694
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 73 place count 302 transition count 690
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 77 place count 298 transition count 690
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 87 place count 298 transition count 680
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 97 place count 288 transition count 680
Applied a total of 97 rules in 89 ms. Remains 288 /336 variables (removed 48) and now considering 680/729 (removed 49) transitions.
// Phase 1: matrix 680 rows 288 cols
[2023-03-12 06:32:16] [INFO ] Computed 34 place invariants in 5 ms
[2023-03-12 06:32:16] [INFO ] Implicit Places using invariants in 251 ms returned [266, 270, 274, 278, 283, 287]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 254 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 282/348 places, 680/729 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 275 transition count 673
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 275 transition count 673
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 272 transition count 670
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 272 transition count 670
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 272 transition count 667
Applied a total of 23 rules in 18 ms. Remains 272 /282 variables (removed 10) and now considering 667/680 (removed 13) transitions.
// Phase 1: matrix 667 rows 272 cols
[2023-03-12 06:32:16] [INFO ] Computed 28 place invariants in 4 ms
[2023-03-12 06:32:16] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-12 06:32:16] [INFO ] Invariant cache hit.
[2023-03-12 06:32:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 06:32:17] [INFO ] Implicit Places using invariants and state equation in 658 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 272/348 places, 667/729 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1697 ms. Remains : 272/348 places, 667/729 transitions.
Incomplete random walk after 10000 steps, including 145 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 62 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 606361 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :{}
Probabilistic random walk after 606361 steps, saw 373462 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 06:32:20] [INFO ] Invariant cache hit.
[2023-03-12 06:32:20] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 06:32:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-12 06:32:20] [INFO ] [Nat]Absence check using 11 positive and 17 generalized place invariants in 31 ms returned sat
[2023-03-12 06:32:21] [INFO ] After 510ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 06:32:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 06:32:23] [INFO ] After 2847ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 06:32:24] [INFO ] After 3096ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 184 ms.
[2023-03-12 06:32:24] [INFO ] After 3900ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 36 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 667/667 transitions.
Applied a total of 0 rules in 21 ms. Remains 272 /272 variables (removed 0) and now considering 667/667 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 272/272 places, 667/667 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 667/667 transitions.
Applied a total of 0 rules in 18 ms. Remains 272 /272 variables (removed 0) and now considering 667/667 (removed 0) transitions.
[2023-03-12 06:32:24] [INFO ] Invariant cache hit.
[2023-03-12 06:32:24] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-12 06:32:24] [INFO ] Invariant cache hit.
[2023-03-12 06:32:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 06:32:25] [INFO ] Implicit Places using invariants and state equation in 764 ms returned []
Implicit Place search using SMT with State Equation took 1032 ms to find 0 implicit places.
[2023-03-12 06:32:25] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-12 06:32:25] [INFO ] Invariant cache hit.
[2023-03-12 06:32:25] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1401 ms. Remains : 272/272 places, 667/667 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 272 transition count 666
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 271 transition count 666
Applied a total of 2 rules in 8 ms. Remains 271 /272 variables (removed 1) and now considering 666/667 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 666 rows 271 cols
[2023-03-12 06:32:25] [INFO ] Computed 28 place invariants in 12 ms
[2023-03-12 06:32:25] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 06:32:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-12 06:32:26] [INFO ] [Nat]Absence check using 11 positive and 17 generalized place invariants in 9 ms returned sat
[2023-03-12 06:32:26] [INFO ] After 372ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 06:32:26] [INFO ] After 516ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 487 ms.
[2023-03-12 06:32:27] [INFO ] After 1117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-12 06:32:27] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-12 06:32:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 272 places, 667 transitions and 2651 arcs took 8 ms.
[2023-03-12 06:32:27] [INFO ] Flatten gal took : 111 ms
Total runtime 184170 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/584/inv_0_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 163248 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16308744 kB

BK_TIME_CONFINEMENT_REACHED

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

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

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