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

About the Execution of ITS-Tools for ASLink-PT-09b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1377.123 3600000.00 10245903.00 344.70 ??FFTFT?TFTFT??? normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813592700151.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 itstools
Input is ASLink-PT-09b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813592700151
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 5.9K Feb 26 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 13:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 13:06 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 1.3M 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-09b-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678504267964

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=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-09b
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-11 03:11:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 03:11:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:11:10] [INFO ] Load time of PNML (sax parser for PT used): 270 ms
[2023-03-11 03:11:10] [INFO ] Transformed 4014 places.
[2023-03-11 03:11:10] [INFO ] Transformed 4932 transitions.
[2023-03-11 03:11:10] [INFO ] Found NUPN structural information;
[2023-03-11 03:11:10] [INFO ] Parsed PT model containing 4014 places and 4932 transitions and 14960 arcs in 460 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2023-03-11 03:11:11] [INFO ] Flatten gal took : 423 ms
Incomplete random walk after 10000 steps, including 12 resets, run finished after 879 ms. (steps per millisecond=11 ) properties (out of 16) seen :2
FORMULA ASLink-PT-09b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 14) seen :0
[2023-03-11 03:11:12] [INFO ] Flatten gal took : 248 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
[2023-03-11 03:11:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality753372809246404414.gal : 82 ms
[2023-03-11 03:11:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6404000528066693575.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality753372809246404414.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6404000528066693575.prop' '--nowitness' '--gen-order' 'FOLLOW'
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 14) seen :0

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 4932 rows 4014 cols
Loading property file /tmp/ReachabilityCardinality6404000528066693575.prop.
[2023-03-11 03:11:13] [INFO ] Computed 394 place invariants in 149 ms
[2023-03-11 03:11:15] [INFO ] After 1831ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-11 03:11:16] [INFO ] [Nat]Absence check using 93 positive place invariants in 127 ms returned sat
[2023-03-11 03:11:17] [INFO ] [Nat]Absence check using 93 positive and 301 generalized place invariants in 260 ms returned sat
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :10 after 15
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :15 after 21
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :21 after 153
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :153 after 352
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :352 after 960
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :960 after 12499
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :12499 after 32460
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :32460 after 625239
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :625239 after 7.18249e+10
Invariant property ASLink-PT-09b-ReachabilityFireability-03 does not hold.
SDD proceeding with computation,15 properties remain. new max is 4096
SDD size :7.18249e+10 after 1.26402e+17
SDD proceeding with computation,15 properties remain. new max is 8192
SDD size :1.26402e+17 after 5.1114e+17
SDD proceeding with computation,15 properties remain. new max is 16384
SDD size :5.1114e+17 after 4.54517e+23
SDD proceeding with computation,15 properties remain. new max is 32768
SDD size :4.54517e+23 after 2.50509e+35
[2023-03-11 03:11:40] [INFO ] After 21895ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :12
[2023-03-11 03:11:40] [INFO ] After 21948ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :12
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-11 03:11:40] [INFO ] After 25119ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :12
FORMULA ASLink-PT-09b-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 272 out of 4014 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4014/4014 places, 4932/4932 transitions.
Drop transitions removed 765 transitions
Trivial Post-agglo rules discarded 765 transitions
Performed 765 trivial Post agglomeration. Transition count delta: 765
Iterating post reduction 0 with 765 rules applied. Total rules applied 765 place count 4014 transition count 4167
Reduce places removed 765 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 791 rules applied. Total rules applied 1556 place count 3249 transition count 4141
Reduce places removed 6 places and 0 transitions.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Iterating post reduction 2 with 65 rules applied. Total rules applied 1621 place count 3243 transition count 4082
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 69 rules applied. Total rules applied 1690 place count 3184 transition count 4072
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1692 place count 3182 transition count 4072
Performed 865 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 865 Pre rules applied. Total rules applied 1692 place count 3182 transition count 3207
Deduced a syphon composed of 865 places in 11 ms
Ensure Unique test removed 80 places
Reduce places removed 945 places and 0 transitions.
Iterating global reduction 5 with 1810 rules applied. Total rules applied 3502 place count 2237 transition count 3207
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 5 with 57 rules applied. Total rules applied 3559 place count 2225 transition count 3162
Reduce places removed 45 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 6 with 50 rules applied. Total rules applied 3609 place count 2180 transition count 3157
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 3614 place count 2175 transition count 3157
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 31 Pre rules applied. Total rules applied 3614 place count 2175 transition count 3126
Deduced a syphon composed of 31 places in 21 ms
Ensure Unique test removed 24 places
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 8 with 86 rules applied. Total rules applied 3700 place count 2120 transition count 3126
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 8 with 1 rules applied. Total rules applied 3701 place count 2119 transition count 3126
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 23 Pre rules applied. Total rules applied 3701 place count 2119 transition count 3103
Deduced a syphon composed of 23 places in 21 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 9 with 46 rules applied. Total rules applied 3747 place count 2096 transition count 3103
Discarding 124 places :
Symmetric choice reduction at 9 with 124 rule applications. Total rules 3871 place count 1972 transition count 2979
Iterating global reduction 9 with 124 rules applied. Total rules applied 3995 place count 1972 transition count 2979
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3996 place count 1972 transition count 2978
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 30 Pre rules applied. Total rules applied 3996 place count 1972 transition count 2948
Deduced a syphon composed of 30 places in 11 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 10 with 61 rules applied. Total rules applied 4057 place count 1941 transition count 2948
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 4057 place count 1941 transition count 2947
Deduced a syphon composed of 1 places in 11 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 4060 place count 1939 transition count 2947
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 4066 place count 1933 transition count 2911
Iterating global reduction 10 with 6 rules applied. Total rules applied 4072 place count 1933 transition count 2911
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 4 Pre rules applied. Total rules applied 4072 place count 1933 transition count 2907
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 4080 place count 1929 transition count 2907
Performed 220 Post agglomeration using F-continuation condition.Transition count delta: 220
Deduced a syphon composed of 220 places in 6 ms
Ensure Unique test removed 4 places
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 10 with 444 rules applied. Total rules applied 4524 place count 1705 transition count 2687
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 4525 place count 1704 transition count 2686
Ensure Unique test removed 1 places
Iterating global reduction 10 with 2 rules applied. Total rules applied 4527 place count 1703 transition count 2686
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 4528 place count 1702 transition count 2685
Iterating global reduction 10 with 1 rules applied. Total rules applied 4529 place count 1702 transition count 2685
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 10 with 2 rules applied. Total rules applied 4531 place count 1702 transition count 2683
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 4532 place count 1701 transition count 2683
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 4534 place count 1700 transition count 2692
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 4536 place count 1700 transition count 2690
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 12 with 4 rules applied. Total rules applied 4540 place count 1698 transition count 2688
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 4542 place count 1696 transition count 2688
Free-agglomeration rule applied 14 times.
Iterating global reduction 14 with 14 rules applied. Total rules applied 4556 place count 1696 transition count 2674
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 14 with 14 rules applied. Total rules applied 4570 place count 1682 transition count 2674
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 15 with 10 rules applied. Total rules applied 4580 place count 1682 transition count 2664
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 15 with 10 rules applied. Total rules applied 4590 place count 1672 transition count 2664
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 4591 place count 1672 transition count 2664
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 4592 place count 1671 transition count 2663
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 16 with 11 rules applied. Total rules applied 4603 place count 1662 transition count 2661
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 4605 place count 1660 transition count 2661
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 18 with 13 Pre rules applied. Total rules applied 4605 place count 1660 transition count 2648
Deduced a syphon composed of 13 places in 6 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 18 with 26 rules applied. Total rules applied 4631 place count 1647 transition count 2648
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 18 with 3 rules applied. Total rules applied 4634 place count 1644 transition count 2648
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 6 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 19 with 20 rules applied. Total rules applied 4654 place count 1634 transition count 2638
Discarding 2 places :
Symmetric choice reduction at 19 with 2 rule applications. Total rules 4656 place count 1632 transition count 2636
Iterating global reduction 19 with 2 rules applied. Total rules applied 4658 place count 1632 transition count 2636
Free-agglomeration rule applied 2 times.
Iterating global reduction 19 with 2 rules applied. Total rules applied 4660 place count 1632 transition count 2634
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 4662 place count 1630 transition count 2634
Applied a total of 4662 rules in 1984 ms. Remains 1630 /4014 variables (removed 2384) and now considering 2634/4932 (removed 2298) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1985 ms. Remains : 1630/4014 places, 2634/4932 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 466 ms. (steps per millisecond=21 ) properties (out of 13) seen :2
FORMULA ASLink-PT-09b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :1
FORMULA ASLink-PT-09b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2634 rows 1630 cols
[2023-03-11 03:11:43] [INFO ] Computed 256 place invariants in 61 ms
[2023-03-11 03:11:43] [INFO ] After 384ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-11 03:11:44] [INFO ] [Nat]Absence check using 63 positive place invariants in 27 ms returned sat
[2023-03-11 03:11:44] [INFO ] [Nat]Absence check using 63 positive and 193 generalized place invariants in 268 ms returned sat
[2023-03-11 03:12:08] [INFO ] After 23827ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2023-03-11 03:12:08] [INFO ] State equation strengthened by 8 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-11 03:12:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 03:12:08] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
FORMULA ASLink-PT-09b-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 109 ms.
Support contains 265 out of 1630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1630/1630 places, 2634/2634 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1630 transition count 2633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1629 transition count 2633
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1629 transition count 2632
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1628 transition count 2632
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 1628 transition count 2632
Applied a total of 5 rules in 136 ms. Remains 1628 /1630 variables (removed 2) and now considering 2632/2634 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 1628/1630 places, 2632/2634 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 137978 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 137978 steps, saw 32634 distinct states, run finished after 3005 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2632 rows 1628 cols
[2023-03-11 03:12:12] [INFO ] Computed 256 place invariants in 37 ms
[2023-03-11 03:12:13] [INFO ] After 563ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 03:12:14] [INFO ] [Nat]Absence check using 63 positive place invariants in 29 ms returned sat
[2023-03-11 03:12:14] [INFO ] [Nat]Absence check using 63 positive and 193 generalized place invariants in 94 ms returned sat
[2023-03-11 03:12:38] [INFO ] After 24047ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-11 03:12:38] [INFO ] State equation strengthened by 8 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-11 03:12:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 03:12:38] [INFO ] After 25057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA ASLink-PT-09b-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 56 ms.
Support contains 234 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 2632/2632 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1628 transition count 2626
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 1622 transition count 2626
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 12 place count 1622 transition count 2607
Deduced a syphon composed of 19 places in 5 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 50 place count 1603 transition count 2607
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 1602 transition count 2598
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 1602 transition count 2598
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 1601 transition count 2590
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 1601 transition count 2590
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1600 transition count 2582
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1600 transition count 2582
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 5 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 70 place count 1593 transition count 2575
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 1593 transition count 2575
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 1592 transition count 2574
Applied a total of 72 rules in 411 ms. Remains 1592 /1628 variables (removed 36) and now considering 2574/2632 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 411 ms. Remains : 1592/1628 places, 2574/2632 transitions.
Incomplete random walk after 10000 steps, including 44 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 104650 steps, run timeout after 3005 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104650 steps, saw 25902 distinct states, run finished after 3005 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2574 rows 1592 cols
[2023-03-11 03:12:43] [INFO ] Computed 256 place invariants in 23 ms
[2023-03-11 03:12:43] [INFO ] After 443ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 03:12:44] [INFO ] [Nat]Absence check using 64 positive place invariants in 47 ms returned sat
[2023-03-11 03:12:44] [INFO ] [Nat]Absence check using 64 positive and 192 generalized place invariants in 58 ms returned sat
[2023-03-11 03:13:08] [INFO ] After 24161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 03:13:08] [INFO ] State equation strengthened by 8 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-11 03:13:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 03:13:08] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 43 ms.
Support contains 234 out of 1592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1592/1592 places, 2574/2574 transitions.
Applied a total of 0 rules in 79 ms. Remains 1592 /1592 variables (removed 0) and now considering 2574/2574 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 1592/1592 places, 2574/2574 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1592/1592 places, 2574/2574 transitions.
Applied a total of 0 rules in 57 ms. Remains 1592 /1592 variables (removed 0) and now considering 2574/2574 (removed 0) transitions.
[2023-03-11 03:13:08] [INFO ] Invariant cache hit.
[2023-03-11 03:13:09] [INFO ] Implicit Places using invariants in 968 ms returned [1, 23, 24, 27, 40, 79, 164, 170, 184, 185, 213, 231, 308, 316, 317, 329, 333, 354, 372, 453, 480, 481, 483, 486, 503, 521, 595, 611, 615, 616, 627, 628, 629, 656, 676, 735, 788, 792, 793, 797, 835, 914, 929, 930, 977, 1017, 1048, 1051, 1063, 1075, 1091, 1092, 1095, 1118, 1136, 1195, 1206, 1218, 1223, 1236, 1237, 1239, 1261, 1280, 1345, 1356, 1382, 1383, 1400, 1401, 1446, 1451, 1471, 1472, 1474, 1493, 1499, 1507, 1513, 1519, 1525, 1531, 1543, 1549, 1555]
Discarding 85 places :
Implicit Place search using SMT only with invariants took 987 ms to find 85 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1507/1592 places, 2574/2574 transitions.
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 1507 transition count 2484
Reduce places removed 90 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 111 rules applied. Total rules applied 201 place count 1417 transition count 2463
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 221 place count 1397 transition count 2463
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 221 place count 1397 transition count 2433
Deduced a syphon composed of 30 places in 6 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 281 place count 1367 transition count 2433
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 3 with 4 rules applied. Total rules applied 285 place count 1363 transition count 2433
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 297 place count 1351 transition count 2421
Iterating global reduction 4 with 12 rules applied. Total rules applied 309 place count 1351 transition count 2421
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 309 place count 1351 transition count 2420
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 311 place count 1350 transition count 2420
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 316 place count 1345 transition count 2415
Iterating global reduction 4 with 5 rules applied. Total rules applied 321 place count 1345 transition count 2415
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 326 place count 1340 transition count 2408
Iterating global reduction 4 with 5 rules applied. Total rules applied 331 place count 1340 transition count 2408
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 334 place count 1340 transition count 2405
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 5 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 5 with 114 rules applied. Total rules applied 448 place count 1283 transition count 2348
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 453 place count 1278 transition count 2341
Iterating global reduction 5 with 5 rules applied. Total rules applied 458 place count 1278 transition count 2341
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 461 place count 1275 transition count 2338
Iterating global reduction 5 with 3 rules applied. Total rules applied 464 place count 1275 transition count 2338
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 466 place count 1275 transition count 2336
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 468 place count 1275 transition count 2334
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 470 place count 1273 transition count 2334
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 7 with 27 rules applied. Total rules applied 497 place count 1273 transition count 2307
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 7 with 27 rules applied. Total rules applied 524 place count 1246 transition count 2307
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 525 place count 1246 transition count 2306
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 8 with 17 rules applied. Total rules applied 542 place count 1246 transition count 2306
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 544 place count 1246 transition count 2306
Applied a total of 544 rules in 578 ms. Remains 1246 /1507 variables (removed 261) and now considering 2306/2574 (removed 268) transitions.
// Phase 1: matrix 2306 rows 1246 cols
[2023-03-11 03:13:10] [INFO ] Computed 167 place invariants in 34 ms
[2023-03-11 03:13:11] [INFO ] Implicit Places using invariants in 987 ms returned [90, 144, 253, 335, 365, 378, 383, 384, 439, 464, 476, 478, 597, 606, 615, 624, 625, 713, 721, 727, 730, 737, 738, 839, 860, 865, 944, 976, 978, 985, 986, 1236, 1242]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 991 ms to find 33 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1213/1592 places, 2306/2574 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1213 transition count 2304
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1211 transition count 2304
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 10 place count 1205 transition count 2298
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 1205 transition count 2298
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 1204 transition count 2297
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 1204 transition count 2297
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 1203 transition count 2296
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 1203 transition count 2296
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 5 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 34 place count 1196 transition count 2289
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 1196 transition count 2288
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 45 place count 1196 transition count 2278
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 55 place count 1186 transition count 2278
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 1186 transition count 2278
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 1186 transition count 2278
Applied a total of 58 rules in 327 ms. Remains 1186 /1213 variables (removed 27) and now considering 2278/2306 (removed 28) transitions.
// Phase 1: matrix 2278 rows 1186 cols
[2023-03-11 03:13:11] [INFO ] Computed 134 place invariants in 48 ms
[2023-03-11 03:13:12] [INFO ] Implicit Places using invariants in 766 ms returned []
[2023-03-11 03:13:12] [INFO ] Invariant cache hit.
[2023-03-11 03:13:13] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-11 03:13:14] [INFO ] Implicit Places using invariants and state equation in 1944 ms returned []
Implicit Place search using SMT with State Equation took 2712 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1186/1592 places, 2278/2574 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5652 ms. Remains : 1186/1592 places, 2278/2574 transitions.
Incomplete random walk after 10000 steps, including 61 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 107929 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 107929 steps, saw 72071 distinct states, run finished after 3002 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-11 03:13:18] [INFO ] Invariant cache hit.
[2023-03-11 03:13:18] [INFO ] After 282ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 03:13:18] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2023-03-11 03:13:18] [INFO ] [Nat]Absence check using 34 positive and 100 generalized place invariants in 83 ms returned sat
[2023-03-11 03:13:43] [INFO ] After 24288ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 03:13:43] [INFO ] State equation strengthened by 6 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-11 03:13:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 03:13:43] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 147 ms.
Support contains 234 out of 1186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1186/1186 places, 2278/2278 transitions.
Applied a total of 0 rules in 37 ms. Remains 1186 /1186 variables (removed 0) and now considering 2278/2278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 1186/1186 places, 2278/2278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1186/1186 places, 2278/2278 transitions.
Applied a total of 0 rules in 35 ms. Remains 1186 /1186 variables (removed 0) and now considering 2278/2278 (removed 0) transitions.
[2023-03-11 03:13:43] [INFO ] Invariant cache hit.
[2023-03-11 03:13:44] [INFO ] Implicit Places using invariants in 649 ms returned []
[2023-03-11 03:13:44] [INFO ] Invariant cache hit.
[2023-03-11 03:13:44] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-11 03:13:45] [INFO ] Implicit Places using invariants and state equation in 1235 ms returned []
Implicit Place search using SMT with State Equation took 1888 ms to find 0 implicit places.
[2023-03-11 03:13:45] [INFO ] Redundant transitions in 172 ms returned []
[2023-03-11 03:13:45] [INFO ] Invariant cache hit.
[2023-03-11 03:13:47] [INFO ] Dead Transitions using invariants and state equation in 1170 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3276 ms. Remains : 1186/1186 places, 2278/2278 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 1186 transition count 2267
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 1175 transition count 2267
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 1174 transition count 2266
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 1174 transition count 2266
Applied a total of 25 rules in 114 ms. Remains 1174 /1186 variables (removed 12) and now considering 2266/2278 (removed 12) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 2266 rows 1174 cols
[2023-03-11 03:13:47] [INFO ] Computed 134 place invariants in 30 ms
[2023-03-11 03:13:47] [INFO ] After 403ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 03:13:48] [INFO ] [Nat]Absence check using 35 positive place invariants in 24 ms returned sat
[2023-03-11 03:13:48] [INFO ] [Nat]Absence check using 35 positive and 99 generalized place invariants in 63 ms returned sat
[2023-03-11 03:14:34] [INFO ] After 45674ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-11 03:14:34] [INFO ] After 46106ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 138 ms.
[2023-03-11 03:14:34] [INFO ] After 47081ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
FORMULA ASLink-PT-09b-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
FORMULA ASLink-PT-09b-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 03:14:35] [INFO ] Flatten gal took : 281 ms
[2023-03-11 03:14:35] [INFO ] Applying decomposition
[2023-03-11 03:14:35] [INFO ] Flatten gal took : 165 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2646258326919520172.txt' '-o' '/tmp/graph2646258326919520172.bin' '-w' '/tmp/graph2646258326919520172.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2646258326919520172.bin' '-l' '-1' '-v' '-w' '/tmp/graph2646258326919520172.weights' '-q' '0' '-e' '0.001'
[2023-03-11 03:14:35] [INFO ] Decomposing Gal with order
[2023-03-11 03:14:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 03:14:36] [INFO ] Removed a total of 3501 redundant transitions.
[2023-03-11 03:14:37] [INFO ] Flatten gal took : 341 ms
[2023-03-11 03:14:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 111 ms.
[2023-03-11 03:14:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10015246567930848798.gal : 49 ms
[2023-03-11 03:14:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12484355787293274446.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10015246567930848798.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12484355787293274446.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality12484355787293274446.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :15 after 1.07465e+11
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-11 03:44:37] [INFO ] Flatten gal took : 131 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6327368169252460356
[2023-03-11 03:44:37] [INFO ] Too many transitions (2278) to apply POR reductions. Disabling POR matrices.
[2023-03-11 03:44:37] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6327368169252460356
[2023-03-11 03:44:37] [INFO ] Applying decomposition
[2023-03-11 03:44:37] [INFO ] Flatten gal took : 81 ms
Running compilation step : cd /tmp/ltsmin6327368169252460356;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '120' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9691510060547120653.txt' '-o' '/tmp/graph9691510060547120653.bin' '-w' '/tmp/graph9691510060547120653.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9691510060547120653.bin' '-l' '-1' '-v' '-w' '/tmp/graph9691510060547120653.weights' '-q' '0' '-e' '0.001'
[2023-03-11 03:44:38] [INFO ] Decomposing Gal with order
[2023-03-11 03:44:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 03:44:38] [INFO ] Removed a total of 3670 redundant transitions.
[2023-03-11 03:44:38] [INFO ] Flatten gal took : 139 ms
[2023-03-11 03:44:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 89 labels/synchronizations in 36 ms.
[2023-03-11 03:44:38] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability11890888801685239598.gal : 19 ms
[2023-03-11 03:44:38] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability8644208982101692174.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability11890888801685239598.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability8644208982101692174.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability8644208982101692174.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :2 after 42
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :42 after 412
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :412 after 56536
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :56536 after 1.00029e+14
Compilation finished in 5803 ms.
Running link step : cd /tmp/ltsmin6327368169252460356;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin6327368169252460356;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityFireability00==true'
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :1.52889e+19 after 1.70479e+19
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin6327368169252460356;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityFireability00==true'
Running LTSmin : cd /tmp/ltsmin6327368169252460356;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityFireability01==true'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin6327368169252460356;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityFireability01==true'
Running LTSmin : cd /tmp/ltsmin6327368169252460356;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT09bReachabilityFireability07==true'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 15294764 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16076524 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-09b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ASLink-PT-09b, 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 r005-oct2-167813592700151"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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