Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r223-tall-171649610700087.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is JoinFreeModules-PT-2000, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649610700087
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.6M
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 14:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 11 14:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 11 14:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 11 14:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 6.2M May 18 16:42 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 JoinFreeModules-PT-2000-ReachabilityFireability-2024-00
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-2024-01
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-2024-02
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-2024-03
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-2024-04
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-2024-05
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-2024-06
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-2024-07
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-2024-08
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-2024-09
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-2024-10
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-2024-11
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-2024-12
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-2024-13
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-2024-14
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716508364197

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-2000
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 23:52:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 23:52:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 23:52:45] [INFO ] Load time of PNML (sax parser for PT used): 488 ms
[2024-05-23 23:52:45] [INFO ] Transformed 10001 places.
[2024-05-23 23:52:45] [INFO ] Transformed 16001 transitions.
[2024-05-23 23:52:46] [INFO ] Parsed PT model containing 10001 places and 16001 transitions and 46002 arcs in 650 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 41034 steps (8 resets) in 4403 ms. (9 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4693 ms. (8 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3936 ms. (10 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3829 ms. (10 steps per ms) remains 8/9 properties
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 4803 ms. (8 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5496 ms. (7 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4136 ms. (9 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3921 ms. (10 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3781 ms. (10 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3948 ms. (10 steps per ms) remains 8/8 properties
// Phase 1: matrix 16001 rows 10000 cols
[2024-05-23 23:52:57] [INFO ] Computed 2000 invariants in 83 ms
[2024-05-23 23:52:57] [INFO ] State equation strengthened by 2000 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 300/375 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 600/975 variables, 375/450 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/975 variables, 75/525 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/975 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/975 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 975/26001 variables, and 525 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1180 ms.
Refiners :[Positive P Invariants (semi-flows): 75/2000 constraints, State Equation: 375/10000 constraints, ReadFeed: 75/2000 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 300/375 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 23:52:59] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 16 ms to minimize.
[2024-05-23 23:52:59] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
[2024-05-23 23:52:59] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2024-05-23 23:52:59] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 2 ms to minimize.
[2024-05-23 23:52:59] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 2 ms to minimize.
[2024-05-23 23:52:59] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-23 23:52:59] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-23 23:52:59] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-23 23:53:00] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 2 ms to minimize.
[2024-05-23 23:53:00] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-05-23 23:53:00] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 9 ms to minimize.
[2024-05-23 23:53:00] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-23 23:53:00] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-05-23 23:53:00] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-23 23:53:00] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-23 23:53:00] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-23 23:53:00] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-23 23:53:00] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-05-23 23:53:00] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-23 23:53:00] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 23:53:00] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2024-05-23 23:53:00] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-23 23:53:00] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-23 23:53:01] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-23 23:53:01] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-23 23:53:01] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-23 23:53:01] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2024-05-23 23:53:01] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-23 23:53:01] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-05-23 23:53:01] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-23 23:53:01] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 4 ms to minimize.
[2024-05-23 23:53:01] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-23 23:53:01] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-23 23:53:01] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-23 23:53:01] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-23 23:53:01] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2024-05-23 23:53:01] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-23 23:53:01] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2024-05-23 23:53:01] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-05-23 23:53:01] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 23:53:01] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2024-05-23 23:53:02] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2024-05-23 23:53:02] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 600/975 variables, 375/493 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/975 variables, 75/568 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/975 variables, 8/576 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 23:53:03] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-23 23:53:03] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2024-05-23 23:53:03] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2024-05-23 23:53:03] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-23 23:53:03] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-23 23:53:03] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s155 0)
(s156 0)
(s157 1997)
(s158 6)
(s159 0)
(s170 3)
(s171 0)
(s172 2000)
(s173 0)
(s174 0)
(s185 1)
(s186 2001)
(s187 1)
(s188 0)
(s189 0)
(s355 2)
(s356 0)
(s357 2001)
(s358 0)
(s359 0)
(s360 2)
(s361 1)
(s362 2000)
(s363 0)
(s364 0)
(s550 0)
(s551 0)
(s552 0)
(s553 2002)
(s554 1)
(s685 1)
(s686 2002)
(s687 0)
(s688 0)
(s689 0)
(s745 0)
(s746 1999)
(s747 0)
(s748 4)
(s749 0)
(s1025 2)
(s1026 1)
(s1027 0)
(s1028 0)
(s1029 2000)
(s1595 1)
(s1596 0)
(s1597 1999)
(s1598 3)
(s1599 0)
(s1980 0)
(s1981 0)
(s1982 2001)
(s1983 1)
(s1984 1)
(s2105 0)
(s2106 0)
(s2107 0)
(s2108 1003)
(s2109 1000)
(s2255 1)
(s2256 2)
(s2257 2000)
(s2258 0)
(s2259 0)
(s2300 2)
(s2301 1582)
(s2302 419)
(s2303 0)
(s2304 0)
(s2380 2)
(s2381 1)
(s2382 2000)
(s2383 0)
(s2384 0)
(s2450 1)
(s2451 0)
(s2452 1)
(s2453 1002)
(s2454 999)
(s2550 4)
(s2551 2)
(s2552 0)
(s2553 3)
(s2554 1994)
(s2665 2)
(s2666 1)
(s2667 2000)
(s2668 0)
(s2669 0)
(s2740 0)
(s2741 1997)
(s2742 1)
(s2743 0)
(s2744 5)
(s2780 2)
(s2781 1)
(s2782 2000)
(s2783 0)
(s2784 0)
(s2845 0)
(s2846 1996)
(s2847 1)
(s2848 6)
(s2849 0)
(s2890 0)
(s2891 0)
(s2892 0)
(s2893 2002)
(s2894 1)
(s3010 2)
(s3011 1)
(s3012 2000)
(s3013 0)
(s3014 0)
(s3065 0)
(s3066 0)
(s3067 0)
(s3068 1011)
(s3069 992)
(s3075 0)
(s3076 0)
(s3077 0)
(s3078 1003)
(s3079 1000)
(s3085 2)
(s3086 1)
(s3087 2000)
(s3088 0)
(s3089 0)
(s3455 0)
(s3456 1)
(s3457 0)
(s3458 1)
(s3459 2001)
(s3465 0)
(s3466 0)
(s3467 1991)
(s3468 0)
(s3469 12)
(s3475 0)
(s3476 0)
(s3477 1996)
(s3478 4)
(s3479 3)
(s3525 5)
(s3526 0)
(s3527 1998)
(s3528 0)
(s3529 0)
(s3590 1827)
(s3591 173)
(s3592 3)
(s3593 0)
(s3594 0)
(s3735 5)
(s3736 0)
(s3737 1998)
(s3738 0)
(s3739 0)
(s4090 2002)
(s4091 0)
(s4092 1)
(s4093 0)
(s4094 0)
(s4140 2)
(s4141 1)
(s4142 0)
(s4143 0)
(s4144 2000)
(s4190 2)
(s4191 1993)
(s4192 8)
(s4193 0)
(s4194 0)
(s4230 1)
(s4231 0)
(s4232 1)
(s4233 2001)
(s4234 0)
(s4250 2)
(s4251 0)
(s4252 2001)
(s4253 0)
(s4254 0)
(s4305 0)
(s4306 2000)
(s4307 0)
(s4308 3)
(s4309 0)
(s4390 1)
(s4391 2001)
(s4392 1)
(s4393 0)
(s4394 0)
(s4530 2)
(s4531 2001)
(s4532 0)
(s4533 0)
(s4534 0)
(s4555 2)
(s4556 1)
(s4557 2000)
(s4558 0)
(s4559 0)
(s4585 7)
(s4586 0)
(s4587 0)
(s4588 0)
(s4589 1996)
(s4810 2)
(s4811 1)
(s4812 2000)
(s4813 0)
(s4814 0)
(s4875 2)
(s4876 1)
(s4877 0)
(s4878 0)
(s4879 2000)
(s4900 1)
(s4901 0)
(s4902 1)
(s4903 2001)
(s4904 0)
(s5160 2)
(s5161 2001)
(s5162 0)
(s5163 0)
(s5164 0)
(s5575 0)
(s5576 2000)
(s5577 0)
(s5578 3)
(s5579 0)
(s5825 4)
(s5826 0)
(s5827 0)
(s5828 998)
(s5829 1001)
(s5850 2)
(s5851 2001)
(s5852 0)
(s5853 0)
(s5854 0)
(s6165 2)
(s6166 1)
(s6167 0)
(s6168 0)
(s6169 2000)
(s6235 1)
(s6236 0)
(s6237 1999)
(s6238 0)
(s6239 3)
(s6345 1)
(s6346 0)
(s6347 0)
(s6348 1001)
(s6349 1001)
(s6555 2)
(s6556 1)
(s6557 0)
(s6558 0)
(s6559 2000)
(s6605 2)
(s6606 2001)
(s6607 0)
(s6608 0)
(s6609 0)
(s6855 4)
(s6856 0)
(s6857 1999)
(s6858 0)
(s6859 0)
(s6915 2)
(s6916 1997)
(s6917 0)
(s6918 2)
(s6919 2)
(s6935 2)
(s6936 1)
(s6937 2000)
(s6938 0)
(s6939 0)
(s7035 1991)
(s7036 0)
(s7037 0)
(s7038 0)
(s7039 12)
(s7055 2)
(s7056 1)
(s7057 2000)
(s7058 0)
(s7059 0)
(s7215 2)
(s7216 4)
(s7217 2)
(s7218 0)
(s7219 1995)
(s7420 1)
(s7421 0)
(s7422 2002)
(s7423 0)
(s7424 0)
(s7510 0)
(s7511 9)
(s7512 0)
(s7513 1002)
(s7514 992)
(s7725 2)
(s7726 1)
(s7727 2000)
(s7728 0)
(s7729 0)
(s7835 2)
(s7836 1)
(s7837 2000)
(s7838 0)
(s7839 0)
(s7895 2002)
(s7896 0)
(s7897 1)
(s7898 0)
(s7899 0)
(s7920 0)
(s7921 0)
(s7922 1)
(s7923 0)
(s7924 2002)
(s8245 0)
(s8246 0)
(s8247 0)
(s8248 1003)
(s8249 1000)
(s8455 3)
(s8456 2000)
(s8457 0)
(s8458 0)
(s8459 0)
(s8560 3)
(s8561 0)
(s8562 2000)
(s8563 0)
(s8564 0)
(s8905 1)
(s8906 0)
(s8907 1995)
(s8908 5)
(s8909 2)
(s8955 0)
(s8956 2000)
(s8957 0)
(s8958 3)
(s8959timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 975/26001 variables, and 582 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 75/2000 constraints, State Equation: 375/10000 constraints, ReadFeed: 75/2000 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 49/49 constraints]
After SMT, in 6514ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 75 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 375 are kept as prefixes of interest. Removing 9625 places using SCC suffix rule.25 ms
Discarding 9625 places :
Also discarding 15400 output transitions
Drop transitions (Output transitions of discarded places.) removed 15400 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 375 transition count 600
Applied a total of 2 rules in 119 ms. Remains 375 /10000 variables (removed 9625) and now considering 600/16001 (removed 15401) transitions.
Running 450 sub problems to find dead transitions.
// Phase 1: matrix 600 rows 375 cols
[2024-05-23 23:53:04] [INFO ] Computed 75 invariants in 3 ms
[2024-05-23 23:53:04] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 1 (OVERLAPS) 75/375 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 3 (OVERLAPS) 600/975 variables, 375/450 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/975 variables, 75/525 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/975 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 975/975 variables, and 525 constraints, problems are : Problem set: 0 solved, 450 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, State Equation: 375/375 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 450/450 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 450 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 1 (OVERLAPS) 75/375 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 3 (OVERLAPS) 600/975 variables, 375/450 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/975 variables, 75/525 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/975 variables, 450/975 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-05-23 23:53:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-23 23:53:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-23 23:53:33] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-23 23:53:34] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-23 23:53:34] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 975/975 variables, and 980 constraints, problems are : Problem set: 0 solved, 450 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, State Equation: 375/375 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 450/450 constraints, Known Traps: 5/5 constraints]
After SMT, in 40122ms problems are : Problem set: 0 solved, 450 unsolved
Search for dead transitions found 0 dead transitions in 40128ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40264 ms. Remains : 375/10000 places, 600/16001 transitions.
RANDOM walk for 41037 steps (8 resets) in 190 ms. (214 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 341 ms. (116 steps per ms) remains 7/8 properties
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 273 ms. (146 steps per ms) remains 6/7 properties
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 312 ms. (127 steps per ms) remains 5/6 properties
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 344 ms. (115 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 4/5 properties
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 3/4 properties
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 3/3 properties
[2024-05-23 23:53:45] [INFO ] Invariant cache hit.
[2024-05-23 23:53:45] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 120/150 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 240/390 variables, 150/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 30/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/390 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/975 variables, and 210 constraints, problems are : Problem set: 0 solved, 3 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 30/75 constraints, State Equation: 150/375 constraints, ReadFeed: 30/75 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 120/150 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 23:53:45] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-23 23:53:45] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-23 23:53:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-23 23:53:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-23 23:53:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-23 23:53:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-23 23:53:45] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-23 23:53:45] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-23 23:53:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-23 23:53:45] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-23 23:53:45] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-23 23:53:45] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-23 23:53:45] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-23 23:53:45] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-23 23:53:45] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-23 23:53:45] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 16/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 240/390 variables, 150/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 30/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/390 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/975 variables, and 229 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1260 ms.
Refiners :[Positive P Invariants (semi-flows): 30/75 constraints, State Equation: 150/375 constraints, ReadFeed: 30/75 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 16/16 constraints]
After SMT, in 1456ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 49765 steps, including 0 resets, run visited all 3 properties in 1052 ms. (steps per millisecond=47 )
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2024-14 FALSE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 1065 ms.
All properties solved without resorting to model-checking.
Total runtime 62316 ms.
ITS solved all properties within timeout

BK_STOP 1716508427717

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

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="JoinFreeModules-PT-2000"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is JoinFreeModules-PT-2000, 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 r223-tall-171649610700087"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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