Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245688800095.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ASLink-PT-06a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245688800095
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.0K Apr 30 07:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 30 07:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 07:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 07:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 30 07:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 191K Apr 30 07:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 30 07:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 30 07:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 597K May 10 09:33 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-06a-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-06a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654264840015

Running Version 202205111006
[2022-06-03 14:00:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-03 14:00:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 14:00:41] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2022-06-03 14:00:41] [INFO ] Transformed 1406 places.
[2022-06-03 14:00:41] [INFO ] Transformed 2100 transitions.
[2022-06-03 14:00:41] [INFO ] Found NUPN structural information;
[2022-06-03 14:00:41] [INFO ] Parsed PT model containing 1406 places and 2100 transitions in 273 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 22 transitions
Reduce redundant transitions removed 22 transitions.
Incomplete random walk after 10000 steps, including 60 resets, run finished after 576 ms. (steps per millisecond=17 ) properties (out of 16) seen :4
FORMULA ASLink-PT-06a-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 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 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 12) seen :2
FORMULA ASLink-PT-06a-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06a-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2078 rows 1406 cols
[2022-06-03 14:00:43] [INFO ] Computed 270 place invariants in 165 ms
[2022-06-03 14:00:43] [INFO ] After 586ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-03 14:00:44] [INFO ] [Nat]Absence check using 66 positive place invariants in 20 ms returned sat
[2022-06-03 14:00:44] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 58 ms returned sat
[2022-06-03 14:01:08] [INFO ] After 24313ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-06-03 14:01:08] [INFO ] After 24322ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-06-03 14:01:08] [INFO ] After 25037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 10 Parikh solutions to 2 different solutions.
FORMULA ASLink-PT-06a-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-06a-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 6025 ms.
Support contains 186 out of 1406 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1406/1406 places, 2078/2078 transitions.
Ensure Unique test removed 24 places
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 144 rules applied. Total rules applied 144 place count 1370 transition count 1970
Reduce places removed 108 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 114 rules applied. Total rules applied 258 place count 1262 transition count 1964
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 264 place count 1256 transition count 1964
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 124 Pre rules applied. Total rules applied 264 place count 1256 transition count 1840
Deduced a syphon composed of 124 places in 2 ms
Ensure Unique test removed 47 places
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 3 with 295 rules applied. Total rules applied 559 place count 1085 transition count 1840
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 560 place count 1085 transition count 1839
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 561 place count 1084 transition count 1839
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 565 place count 1080 transition count 1825
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 570 place count 1079 transition count 1825
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 574 place count 1078 transition count 1822
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 575 place count 1077 transition count 1822
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 5 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 7 with 64 rules applied. Total rules applied 639 place count 1045 transition count 1790
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 640 place count 1045 transition count 1789
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 641 place count 1044 transition count 1789
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 645 place count 1044 transition count 1785
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 649 place count 1040 transition count 1785
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 654 place count 1040 transition count 1785
Applied a total of 654 rules in 530 ms. Remains 1040 /1406 variables (removed 366) and now considering 1785/2078 (removed 293) transitions.
Finished structural reductions, in 1 iterations. Remains : 1040/1406 places, 1785/2078 transitions.
Incomplete random walk after 1000000 steps, including 8030 resets, run finished after 27908 ms. (steps per millisecond=35 ) properties (out of 8) seen :0
Interrupted Best-First random walk after 759676 steps, including 986 resets, run timeout after 5001 ms. (steps per millisecond=151 ) properties seen 0
Interrupted Best-First random walk after 664375 steps, including 968 resets, run timeout after 5001 ms. (steps per millisecond=132 ) properties seen 0
Interrupted Best-First random walk after 803342 steps, including 1178 resets, run timeout after 5001 ms. (steps per millisecond=160 ) properties seen 0
Interrupted Best-First random walk after 626462 steps, including 914 resets, run timeout after 5001 ms. (steps per millisecond=125 ) properties seen 0
Interrupted Best-First random walk after 415662 steps, including 602 resets, run timeout after 5001 ms. (steps per millisecond=83 ) properties seen 0
Interrupted Best-First random walk after 618051 steps, including 880 resets, run timeout after 5001 ms. (steps per millisecond=123 ) properties seen 0
Interrupted Best-First random walk after 430405 steps, including 620 resets, run timeout after 5001 ms. (steps per millisecond=86 ) properties seen 0
Interrupted Best-First random walk after 389272 steps, including 559 resets, run timeout after 5001 ms. (steps per millisecond=77 ) properties seen 0
Interrupted probabilistic random walk after 8317783 steps, run timeout after 201001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 8317783 steps, saw 2524203 distinct states, run finished after 201003 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1785 rows 1040 cols
[2022-06-03 14:05:44] [INFO ] Computed 185 place invariants in 16 ms
[2022-06-03 14:05:45] [INFO ] After 715ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-03 14:05:45] [INFO ] [Nat]Absence check using 54 positive place invariants in 19 ms returned sat
[2022-06-03 14:05:45] [INFO ] [Nat]Absence check using 54 positive and 131 generalized place invariants in 56 ms returned sat
[2022-06-03 14:05:55] [INFO ] After 9795ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :3
[2022-06-03 14:05:55] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-03 14:06:09] [INFO ] After 13931ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :5 sat :2
[2022-06-03 14:06:18] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 5 ms to minimize.
[2022-06-03 14:06:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 275 ms
[2022-06-03 14:06:18] [INFO ] After 22574ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :1
Attempting to minimize the solution found.
Minimization took 9164 ms.
[2022-06-03 14:06:27] [INFO ] After 42010ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
FORMULA ASLink-PT-06a-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-06a-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-06a-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-06a-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-06a-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-06a-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 16053 ms.
Support contains 68 out of 1040 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1040/1040 places, 1785/1785 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 1040 transition count 1781
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 1036 transition count 1780
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 1035 transition count 1780
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 1035 transition count 1779
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 1034 transition count 1779
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 14 place count 1032 transition count 1767
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 1032 transition count 1767
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 22 place count 1029 transition count 1764
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 1029 transition count 1763
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 24 place count 1028 transition count 1763
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 28 place count 1028 transition count 1759
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 32 place count 1024 transition count 1759
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 34 place count 1024 transition count 1759
Applied a total of 34 rules in 628 ms. Remains 1024 /1040 variables (removed 16) and now considering 1759/1785 (removed 26) transitions.
Finished structural reductions, in 1 iterations. Remains : 1024/1040 places, 1759/1785 transitions.
Incomplete random walk after 1000000 steps, including 8550 resets, run finished after 13999 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1369 resets, run finished after 3824 ms. (steps per millisecond=261 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1491 resets, run finished after 3042 ms. (steps per millisecond=328 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 4464661 steps, run timeout after 60001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 4464661 steps, saw 1447504 distinct states, run finished after 60001 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1759 rows 1024 cols
[2022-06-03 14:08:05] [INFO ] Computed 185 place invariants in 154 ms
[2022-06-03 14:08:05] [INFO ] After 255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 14:08:05] [INFO ] [Nat]Absence check using 53 positive place invariants in 13 ms returned sat
[2022-06-03 14:08:05] [INFO ] [Nat]Absence check using 53 positive and 132 generalized place invariants in 37 ms returned sat
[2022-06-03 14:08:18] [INFO ] After 12697ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 14:08:18] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-03 14:08:22] [INFO ] After 3678ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 14:08:23] [INFO ] After 5143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1860 ms.
[2022-06-03 14:08:25] [INFO ] After 20000ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8112 ms.
Support contains 68 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1024/1024 places, 1759/1759 transitions.
Applied a total of 0 rules in 75 ms. Remains 1024 /1024 variables (removed 0) and now considering 1759/1759 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1024/1024 places, 1759/1759 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1024/1024 places, 1759/1759 transitions.
Applied a total of 0 rules in 39 ms. Remains 1024 /1024 variables (removed 0) and now considering 1759/1759 (removed 0) transitions.
// Phase 1: matrix 1759 rows 1024 cols
[2022-06-03 14:08:33] [INFO ] Computed 185 place invariants in 16 ms
[2022-06-03 14:08:43] [INFO ] Implicit Places using invariants in 10321 ms returned [1, 19, 20, 22, 51, 69, 134, 154, 167, 168, 169, 170, 171, 207, 290, 303, 308, 309, 310, 328, 346, 427, 440, 441, 442, 443, 444, 462, 480, 561, 574, 575, 576, 577, 597, 615, 667, 685, 699, 712, 713, 714, 715, 716, 734, 752, 832, 837, 848, 849, 850, 851, 852, 887, 889, 910, 911, 912, 926, 932, 939, 945, 951, 957, 963, 969, 975, 981]
Discarding 68 places :
Implicit Place search using SMT only with invariants took 10330 ms to find 68 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 956/1024 places, 1759/1759 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 956 transition count 1675
Reduce places removed 84 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 89 rules applied. Total rules applied 173 place count 872 transition count 1670
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 178 place count 867 transition count 1670
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 178 place count 867 transition count 1622
Deduced a syphon composed of 48 places in 3 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 274 place count 819 transition count 1622
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 17 rules applied. Total rules applied 291 place count 809 transition count 1615
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 298 place count 802 transition count 1615
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 298 place count 802 transition count 1614
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 300 place count 801 transition count 1614
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 312 place count 789 transition count 1602
Iterating global reduction 5 with 12 rules applied. Total rules applied 324 place count 789 transition count 1602
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 332 place count 781 transition count 1594
Iterating global reduction 5 with 8 rules applied. Total rules applied 340 place count 781 transition count 1594
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 5 with 100 rules applied. Total rules applied 440 place count 731 transition count 1544
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 443 place count 728 transition count 1541
Iterating global reduction 5 with 3 rules applied. Total rules applied 446 place count 728 transition count 1541
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 448 place count 728 transition count 1539
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 451 place count 728 transition count 1536
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 457 place count 725 transition count 1533
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 460 place count 725 transition count 1530
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 466 place count 722 transition count 1527
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 7 with 16 rules applied. Total rules applied 482 place count 722 transition count 1511
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 498 place count 706 transition count 1511
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 8 with 21 rules applied. Total rules applied 519 place count 706 transition count 1511
Applied a total of 519 rules in 528 ms. Remains 706 /956 variables (removed 250) and now considering 1511/1759 (removed 248) transitions.
// Phase 1: matrix 1511 rows 706 cols
[2022-06-03 14:08:44] [INFO ] Computed 107 place invariants in 12 ms
[2022-06-03 14:08:45] [INFO ] Implicit Places using invariants in 744 ms returned [76, 97, 111, 113, 114, 121, 122, 200, 209, 215, 220, 227, 228, 284, 301, 307, 310, 313, 314, 319, 320, 372, 389, 395, 398, 401, 402, 409, 464, 493, 496, 501, 506, 511, 512, 564, 581, 587, 590, 592, 593, 690, 693, 696, 699, 702]
Discarding 46 places :
Implicit Place search using SMT only with invariants took 747 ms to find 46 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 660/1024 places, 1511/1759 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 660 transition count 1506
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 655 transition count 1506
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 24 place count 641 transition count 1491
Iterating global reduction 2 with 14 rules applied. Total rules applied 38 place count 641 transition count 1491
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 641 transition count 1490
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 43 place count 637 transition count 1486
Iterating global reduction 3 with 4 rules applied. Total rules applied 47 place count 637 transition count 1486
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 636 transition count 1485
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 636 transition count 1485
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 73 place count 624 transition count 1473
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 75 place count 622 transition count 1469
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 622 transition count 1469
Free-agglomeration rule applied 14 times.
Iterating global reduction 3 with 14 rules applied. Total rules applied 91 place count 622 transition count 1455
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 105 place count 608 transition count 1455
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 107 place count 608 transition count 1453
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 109 place count 606 transition count 1453
Applied a total of 109 rules in 302 ms. Remains 606 /660 variables (removed 54) and now considering 1453/1511 (removed 58) transitions.
// Phase 1: matrix 1453 rows 606 cols
[2022-06-03 14:08:45] [INFO ] Computed 61 place invariants in 17 ms
[2022-06-03 14:08:46] [INFO ] Implicit Places using invariants in 527 ms returned []
// Phase 1: matrix 1453 rows 606 cols
[2022-06-03 14:08:46] [INFO ] Computed 61 place invariants in 20 ms
[2022-06-03 14:08:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-03 14:08:47] [INFO ] Implicit Places using invariants and state equation in 1568 ms returned []
Implicit Place search using SMT with State Equation took 2098 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 606/1024 places, 1453/1759 transitions.
Finished structural reductions, in 3 iterations. Remains : 606/1024 places, 1453/1759 transitions.
Incomplete random walk after 1000000 steps, including 13347 resets, run finished after 18897 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2654 resets, run finished after 2199 ms. (steps per millisecond=454 ) properties (out of 2) seen :1
FORMULA ASLink-PT-06a-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2960 resets, run finished after 1305 ms. (steps per millisecond=766 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1453 rows 606 cols
[2022-06-03 14:09:10] [INFO ] Computed 61 place invariants in 12 ms
[2022-06-03 14:09:10] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 14:09:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-06-03 14:09:10] [INFO ] [Nat]Absence check using 13 positive and 48 generalized place invariants in 18 ms returned sat
[2022-06-03 14:09:11] [INFO ] After 895ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 14:09:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-03 14:09:20] [INFO ] After 9014ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2022-06-03 14:09:20] [INFO ] After 10072ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 252 ms.
Support contains 18 out of 606 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 606/606 places, 1453/1453 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 606 transition count 1447
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 600 transition count 1446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 599 transition count 1446
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 14 place count 599 transition count 1441
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 25 place count 593 transition count 1441
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 25 place count 593 transition count 1440
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 592 transition count 1440
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 29 place count 590 transition count 1434
Ensure Unique test removed 1 places
Iterating global reduction 3 with 3 rules applied. Total rules applied 32 place count 589 transition count 1434
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 33 place count 589 transition count 1433
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 34 place count 588 transition count 1432
Iterating global reduction 4 with 1 rules applied. Total rules applied 35 place count 588 transition count 1432
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 36 place count 588 transition count 1431
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 37 place count 587 transition count 1431
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 38 place count 586 transition count 1430
Iterating global reduction 6 with 1 rules applied. Total rules applied 39 place count 586 transition count 1430
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 57 place count 577 transition count 1421
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 58 place count 576 transition count 1420
Iterating global reduction 6 with 1 rules applied. Total rules applied 59 place count 576 transition count 1420
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 60 place count 575 transition count 1419
Iterating global reduction 6 with 1 rules applied. Total rules applied 61 place count 575 transition count 1419
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 62 place count 574 transition count 1418
Iterating global reduction 6 with 1 rules applied. Total rules applied 63 place count 574 transition count 1418
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 64 place count 573 transition count 1417
Iterating global reduction 6 with 1 rules applied. Total rules applied 65 place count 573 transition count 1417
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 66 place count 573 transition count 1416
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 71 place count 573 transition count 1411
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 76 place count 568 transition count 1411
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 79 place count 568 transition count 1408
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 82 place count 565 transition count 1408
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 83 place count 565 transition count 1407
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 84 place count 565 transition count 1407
Applied a total of 84 rules in 453 ms. Remains 565 /606 variables (removed 41) and now considering 1407/1453 (removed 46) transitions.
Finished structural reductions, in 1 iterations. Remains : 565/606 places, 1407/1453 transitions.
Incomplete random walk after 1000000 steps, including 15118 resets, run finished after 3182 ms. (steps per millisecond=314 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3611 resets, run finished after 1448 ms. (steps per millisecond=690 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1886394 steps, run timeout after 12001 ms. (steps per millisecond=157 ) properties seen :{}
Probabilistic random walk after 1886394 steps, saw 740099 distinct states, run finished after 12001 ms. (steps per millisecond=157 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1407 rows 565 cols
[2022-06-03 14:09:37] [INFO ] Computed 59 place invariants in 12 ms
[2022-06-03 14:09:37] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 14:09:37] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-06-03 14:09:37] [INFO ] [Nat]Absence check using 14 positive and 45 generalized place invariants in 32 ms returned sat
[2022-06-03 14:09:39] [INFO ] After 1464ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 14:09:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-06-03 14:09:48] [INFO ] After 9016ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2022-06-03 14:09:48] [INFO ] After 10657ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 181 ms.
Support contains 18 out of 565 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 565/565 places, 1407/1407 transitions.
Applied a total of 0 rules in 34 ms. Remains 565 /565 variables (removed 0) and now considering 1407/1407 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 565/565 places, 1407/1407 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 565/565 places, 1407/1407 transitions.
Applied a total of 0 rules in 35 ms. Remains 565 /565 variables (removed 0) and now considering 1407/1407 (removed 0) transitions.
// Phase 1: matrix 1407 rows 565 cols
[2022-06-03 14:09:48] [INFO ] Computed 59 place invariants in 24 ms
[2022-06-03 14:09:49] [INFO ] Implicit Places using invariants in 578 ms returned [98, 184, 323, 324, 396, 540]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 582 ms to find 6 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 559/565 places, 1407/1407 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 559 transition count 1403
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 555 transition count 1403
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 8 place count 555 transition count 1400
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 552 transition count 1400
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 550 transition count 1398
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 550 transition count 1398
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 548 transition count 1396
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 548 transition count 1396
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 28 place count 545 transition count 1393
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 545 transition count 1391
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 543 transition count 1391
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 543 transition count 1390
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 34 place count 542 transition count 1390
Applied a total of 34 rules in 178 ms. Remains 542 /559 variables (removed 17) and now considering 1390/1407 (removed 17) transitions.
// Phase 1: matrix 1390 rows 542 cols
[2022-06-03 14:09:49] [INFO ] Computed 53 place invariants in 9 ms
[2022-06-03 14:09:58] [INFO ] Implicit Places using invariants in 9235 ms returned [171, 172, 536]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 9254 ms to find 3 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 539/565 places, 1390/1407 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 539 transition count 1389
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 538 transition count 1389
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 537 transition count 1387
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 537 transition count 1387
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 537 transition count 1386
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 536 transition count 1385
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8 place count 536 transition count 1384
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 9 place count 535 transition count 1384
Applied a total of 9 rules in 163 ms. Remains 535 /539 variables (removed 4) and now considering 1384/1390 (removed 6) transitions.
// Phase 1: matrix 1384 rows 535 cols
[2022-06-03 14:09:58] [INFO ] Computed 50 place invariants in 23 ms
[2022-06-03 14:09:59] [INFO ] Implicit Places using invariants in 510 ms returned []
// Phase 1: matrix 1384 rows 535 cols
[2022-06-03 14:09:59] [INFO ] Computed 50 place invariants in 13 ms
[2022-06-03 14:09:59] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-06-03 14:10:00] [INFO ] Implicit Places using invariants and state equation in 1146 ms returned []
Implicit Place search using SMT with State Equation took 1674 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 535/565 places, 1384/1407 transitions.
Finished structural reductions, in 3 iterations. Remains : 535/565 places, 1384/1407 transitions.
Incomplete random walk after 1000000 steps, including 14948 resets, run finished after 2930 ms. (steps per millisecond=341 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3702 resets, run finished after 1371 ms. (steps per millisecond=729 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1876124 steps, run timeout after 12001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 1876124 steps, saw 628541 distinct states, run finished after 12013 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1384 rows 535 cols
[2022-06-03 14:10:16] [INFO ] Computed 50 place invariants in 26 ms
[2022-06-03 14:10:16] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 14:10:17] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2022-06-03 14:10:17] [INFO ] [Nat]Absence check using 12 positive and 38 generalized place invariants in 20 ms returned sat
[2022-06-03 14:10:17] [INFO ] After 661ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 14:10:17] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-06-03 14:10:22] [INFO ] After 4966ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 14:10:27] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 2 ms to minimize.
[2022-06-03 14:10:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2642 ms
[2022-06-03 14:10:30] [INFO ] After 12372ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9020 ms.
[2022-06-03 14:10:39] [INFO ] After 22216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1077 ms.
Support contains 18 out of 535 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 535/535 places, 1384/1384 transitions.
Applied a total of 0 rules in 38 ms. Remains 535 /535 variables (removed 0) and now considering 1384/1384 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 535/535 places, 1384/1384 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 535/535 places, 1384/1384 transitions.
Applied a total of 0 rules in 31 ms. Remains 535 /535 variables (removed 0) and now considering 1384/1384 (removed 0) transitions.
// Phase 1: matrix 1384 rows 535 cols
[2022-06-03 14:10:40] [INFO ] Computed 50 place invariants in 17 ms
[2022-06-03 14:10:40] [INFO ] Implicit Places using invariants in 375 ms returned []
// Phase 1: matrix 1384 rows 535 cols
[2022-06-03 14:10:40] [INFO ] Computed 50 place invariants in 12 ms
[2022-06-03 14:10:41] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-06-03 14:10:42] [INFO ] Implicit Places using invariants and state equation in 1879 ms returned []
Implicit Place search using SMT with State Equation took 2275 ms to find 0 implicit places.
[2022-06-03 14:10:42] [INFO ] Redundant transitions in 87 ms returned []
// Phase 1: matrix 1384 rows 535 cols
[2022-06-03 14:10:42] [INFO ] Computed 50 place invariants in 15 ms
[2022-06-03 14:10:43] [INFO ] Dead Transitions using invariants and state equation in 885 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 535/535 places, 1384/1384 transitions.
Incomplete random walk after 1000000 steps, including 15058 resets, run finished after 3050 ms. (steps per millisecond=327 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3721 resets, run finished after 1345 ms. (steps per millisecond=743 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1965148 steps, run timeout after 12001 ms. (steps per millisecond=163 ) properties seen :{}
Probabilistic random walk after 1965148 steps, saw 684252 distinct states, run finished after 12001 ms. (steps per millisecond=163 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1384 rows 535 cols
[2022-06-03 14:11:00] [INFO ] Computed 50 place invariants in 13 ms
[2022-06-03 14:11:00] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 14:11:00] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-06-03 14:11:00] [INFO ] [Nat]Absence check using 12 positive and 38 generalized place invariants in 16 ms returned sat
[2022-06-03 14:11:00] [INFO ] After 701ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 14:11:00] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-06-03 14:11:06] [INFO ] After 5119ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 14:11:10] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 1 ms to minimize.
[2022-06-03 14:11:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2675 ms
[2022-06-03 14:11:13] [INFO ] After 12531ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9021 ms.
[2022-06-03 14:11:22] [INFO ] After 22394ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1101 ms.
Support contains 18 out of 535 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 535/535 places, 1384/1384 transitions.
Applied a total of 0 rules in 19 ms. Remains 535 /535 variables (removed 0) and now considering 1384/1384 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 535/535 places, 1384/1384 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 535/535 places, 1384/1384 transitions.
Applied a total of 0 rules in 18 ms. Remains 535 /535 variables (removed 0) and now considering 1384/1384 (removed 0) transitions.
// Phase 1: matrix 1384 rows 535 cols
[2022-06-03 14:11:23] [INFO ] Computed 50 place invariants in 9 ms
[2022-06-03 14:11:24] [INFO ] Implicit Places using invariants in 381 ms returned []
// Phase 1: matrix 1384 rows 535 cols
[2022-06-03 14:11:24] [INFO ] Computed 50 place invariants in 20 ms
[2022-06-03 14:11:24] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-06-03 14:11:25] [INFO ] Implicit Places using invariants and state equation in 1823 ms returned []
Implicit Place search using SMT with State Equation took 2226 ms to find 0 implicit places.
[2022-06-03 14:11:26] [INFO ] Redundant transitions in 180 ms returned []
// Phase 1: matrix 1384 rows 535 cols
[2022-06-03 14:11:26] [INFO ] Computed 50 place invariants in 22 ms
[2022-06-03 14:11:26] [INFO ] Dead Transitions using invariants and state equation in 686 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 535/535 places, 1384/1384 transitions.
Applied a total of 0 rules in 19 ms. Remains 535 /535 variables (removed 0) and now considering 1384/1384 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1384 rows 535 cols
[2022-06-03 14:11:26] [INFO ] Computed 50 place invariants in 8 ms
[2022-06-03 14:11:26] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 14:11:27] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-06-03 14:11:27] [INFO ] [Nat]Absence check using 12 positive and 38 generalized place invariants in 14 ms returned sat
[2022-06-03 14:11:27] [INFO ] After 530ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 14:11:32] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 1 ms to minimize.
[2022-06-03 14:11:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 295 ms
[2022-06-03 14:11:32] [INFO ] After 5689ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9056 ms.
[2022-06-03 14:11:41] [INFO ] After 14870ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2022-06-03 14:11:42] [INFO ] Flatten gal took : 302 ms
[2022-06-03 14:11:42] [INFO ] Flatten gal took : 162 ms
[2022-06-03 14:11:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14182701847850301418.gal : 69 ms
[2022-06-03 14:11:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16296429632050786748.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14182701847850301418.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16296429632050786748.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality16296429632050786748.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 13
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :13 after 45
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :45 after 329
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :329 after 22513
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :22513 after 2.35987e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.35987e+06 after 2.64521e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.64521e+06 after 2.68151e+06
Invariant property ASLink-PT-06a-ReachabilityFireability-03 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,4.33338e+06,5.17866,18656,2,12110,15,29507,6,0,3526,12815,0
Total reachable state count : 4333385

Verifying 1 reachability properties.
Invariant property ASLink-PT-06a-ReachabilityFireability-03 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ASLink-PT-06a-ReachabilityFireability-03,1,8.79928,18656,2,536,15,29507,7,0,3566,12815,0
[2022-06-03 14:11:51] [INFO ] Flatten gal took : 154 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14759256804371596734
[2022-06-03 14:11:52] [INFO ] Applying decomposition
[2022-06-03 14:11:52] [INFO ] Computing symmetric may disable matrix : 1384 transitions.
[2022-06-03 14:11:52] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 14:11:52] [INFO ] Computing symmetric may enable matrix : 1384 transitions.
[2022-06-03 14:11:52] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 14:11:52] [INFO ] Flatten gal took : 234 ms
[2022-06-03 14:11:52] [INFO ] Flatten gal took : 290 ms
[2022-06-03 14:11:52] [INFO ] Input system was already deterministic with 1384 transitions.
[2022-06-03 14:11:52] [INFO ] Computing Do-Not-Accords matrix : 1384 transitions.
[2022-06-03 14:11:52] [INFO ] Computation of Completed DNA matrix. took 113 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18004687385572288169.txt' '-o' '/tmp/graph18004687385572288169.bin' '-w' '/tmp/graph18004687385572288169.weights'
[2022-06-03 14:11:52] [INFO ] Built C files in 667ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14759256804371596734
Running compilation step : cd /tmp/ltsmin14759256804371596734;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18004687385572288169.bin' '-l' '-1' '-v' '-w' '/tmp/graph18004687385572288169.weights' '-q' '0' '-e' '0.001'
[2022-06-03 14:11:52] [INFO ] Decomposing Gal with order
[2022-06-03 14:11:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 14:11:53] [INFO ] Ran tautology test, simplified 0 / 1 in 805 ms.
[2022-06-03 14:11:53] [INFO ] BMC solution for property ASLink-PT-06a-ReachabilityFireability-03(UNSAT) depth K=0 took 86 ms
[2022-06-03 14:11:53] [INFO ] BMC solution for property ASLink-PT-06a-ReachabilityFireability-03(UNSAT) depth K=1 took 2 ms
[2022-06-03 14:11:53] [INFO ] Removed a total of 2862 redundant transitions.
[2022-06-03 14:11:53] [INFO ] Flatten gal took : 406 ms
[2022-06-03 14:11:53] [INFO ] BMC solution for property ASLink-PT-06a-ReachabilityFireability-03(UNSAT) depth K=2 took 212 ms
[2022-06-03 14:11:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 118 labels/synchronizations in 42 ms.
[2022-06-03 14:11:53] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability15031394672520650864.gal : 37 ms
[2022-06-03 14:11:53] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12848573682124930010.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability15031394672520650864.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12848573682124930010.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityFireability12848573682124930010.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 73
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :73 after 657
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :657 after 540289
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :540289 after 3.28675e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.53135e+08 after 1.5336e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.5336e+08 after 5.32276e+08
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 1384 rows 535 cols
[2022-06-03 14:11:54] [INFO ] Computed 50 place invariants in 10 ms
[2022-06-03 14:11:54] [INFO ] Computed 50 place invariants in 11 ms
[2022-06-03 14:11:55] [INFO ] Proved 535 variables to be positive in 1009 ms
[2022-06-03 14:11:55] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesASLink-PT-06a-ReachabilityFireability-03
[2022-06-03 14:11:55] [INFO ] KInduction solution for property ASLink-PT-06a-ReachabilityFireability-03(SAT) depth K=0 took 95 ms
Invariant property ASLink-PT-06a-ReachabilityFireability-03 does not hold.
FORMULA ASLink-PT-06a-ReachabilityFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.00691e+09,2.44264,71272,2467,1545,120501,15795,1768,199932,458,64825,0
Total reachable state count : 3006909325

Verifying 1 reachability properties.
Invariant property ASLink-PT-06a-ReachabilityFireability-03 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ASLink-PT-06a-ReachabilityFireability-03,2.57868e+06,2.5255,71272,525,497,120501,15795,1858,199932,493,64825,0
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-03 14:11:56] [WARNING] Interrupting SMT solver.
[2022-06-03 14:11:56] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:320)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-03 14:11:56] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
[2022-06-03 14:11:56] [WARNING] Unexpected error occurred while running SMT. Was verifying ASLink-PT-06a-ReachabilityFireability-03 K-induction depth 1
Exception in thread "Thread-7" java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:344)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:320)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
... 2 more
[2022-06-03 14:11:56] [WARNING] Unexpected error occurred while running SMT. Was verifying ASLink-PT-06a-ReachabilityFireability-03 SMT depth 3
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:411)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
... 2 more
[2022-06-03 14:11:56] [INFO ] During BMC, SMT solver timed out at depth 3
[2022-06-03 14:11:56] [INFO ] BMC solving timed out (3600000 secs) at depth 3
[2022-06-03 14:11:56] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
Total runtime 675274 ms.

BK_STOP 1654265516635

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-06a"
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-4028"
echo " Executing tool itstools"
echo " Input is ASLink-PT-06a, 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 r006-tajo-165245688800095"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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