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.r158-smll-171636266400206.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 itstools
Input is EisenbergMcGuire-PT-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-smll-171636266400206
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.1M 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 EisenbergMcGuire-PT-10-ReachabilityCardinality-2024-00
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-2024-01
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-2024-02
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-2024-03
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-2023-04
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-2024-05
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-2023-06
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-2023-07
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-2024-08
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-2024-09
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-2024-10
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-2024-11
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-2023-12
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-2024-13
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-2024-14
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716569682463

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-24 16:54:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 16:54:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 16:54:45] [INFO ] Load time of PNML (sax parser for PT used): 822 ms
[2024-05-24 16:54:45] [INFO ] Transformed 1090 places.
[2024-05-24 16:54:45] [INFO ] Transformed 5200 transitions.
[2024-05-24 16:54:45] [INFO ] Found NUPN structural information;
[2024-05-24 16:54:45] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 1177 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2892 ms. (13 steps per ms) remains 7/14 properties
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 552 ms. (72 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 537 ms. (74 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 7/7 properties
[2024-05-24 16:54:47] [INFO ] Flow matrix only has 2330 transitions (discarded 2870 similar events)
// Phase 1: matrix 2330 rows 1090 cols
[2024-05-24 16:54:47] [INFO ] Computed 31 invariants in 46 ms
[2024-05-24 16:54:48] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2024-05-24 16:54:48] [INFO ] Flatten gal took : 942 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 16:54:48] [INFO ] Flatten gal took : 557 ms
[2024-05-24 16:54:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13235638926926404720.gal : 183 ms
[2024-05-24 16:54:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4838831010730945375.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13235638926926404720.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4838831010730945375.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
At refinement iteration 2 (OVERLAPS) 976/1073 variables, 21/118 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1073 variables, 976/1094 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1073 variables, 0/1094 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 17/1090 variables, 10/1104 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1090 variables, 17/1121 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1090 variables, 0/1121 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Loading property file /tmp/ReachabilityCardinality4838831010730945375.prop.
At refinement iteration 8 (OVERLAPS) 2330/3420 variables, 1090/2211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3420 variables, 1246/3457 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3420 variables, 0/3457 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/3420 variables, 0/3457 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3420/3420 variables, and 3457 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4359 ms.
Refiners :[Domain max(s): 1090/1090 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1090/1090 constraints, ReadFeed: 1246/1246 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 976/1073 variables, 21/118 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1073 variables, 976/1094 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 16:54:54] [INFO ] Deduced a trap composed of 63 places in 591 ms of which 65 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1073 variables, 1/1095 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1073 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 17/1090 variables, 10/1105 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1090 variables, 17/1122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :8 after 10
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :10 after 12
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :12 after 14
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :14 after 15
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :15 after 77
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :77 after 155
[2024-05-24 16:54:56] [INFO ] Deduced a trap composed of 3 places in 1174 ms of which 12 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :155 after 280
[2024-05-24 16:54:57] [INFO ] Deduced a trap composed of 3 places in 1001 ms of which 11 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :280 after 1831
[2024-05-24 16:54:58] [INFO ] Deduced a trap composed of 3 places in 1007 ms of which 10 ms to minimize.
SMT process timed out in 10310ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 97 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1090 transition count 5191
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 1081 transition count 5191
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 18 place count 1081 transition count 4941
Deduced a syphon composed of 250 places in 7 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 518 place count 831 transition count 4941
Discarding 82 places :
Symmetric choice reduction at 2 with 82 rule applications. Total rules 600 place count 749 transition count 4121
Iterating global reduction 2 with 82 rules applied. Total rules applied 682 place count 749 transition count 4121
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 12 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 826 place count 677 transition count 4049
Applied a total of 826 rules in 820 ms. Remains 677 /1090 variables (removed 413) and now considering 4049/5200 (removed 1151) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 838 ms. Remains : 677/1090 places, 4049/5200 transitions.
RANDOM walk for 40000 steps (8 resets) in 535 ms. (74 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 7/7 properties
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :1831 after 4300
Interrupted probabilistic random walk after 119768 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :2 out of 7
Probabilistic random walk after 119768 steps, saw 91626 distinct states, run finished after 3007 ms. (steps per millisecond=39 ) properties seen :2
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-2023-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-24 16:55:02] [INFO ] Flow matrix only has 1179 transitions (discarded 2870 similar events)
// Phase 1: matrix 1179 rows 677 cols
[2024-05-24 16:55:02] [INFO ] Computed 31 invariants in 16 ms
[2024-05-24 16:55:02] [INFO ] State equation strengthened by 508 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 577/660 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/660 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 17/677 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/677 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1179/1856 variables, 677/708 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1856 variables, 508/1216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1856 variables, 0/1216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1856 variables, 0/1216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1856/1856 variables, and 1216 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1478 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 677/677 constraints, ReadFeed: 508/508 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 577/660 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/660 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 17/677 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 16:55:05] [INFO ] Deduced a trap composed of 3 places in 630 ms of which 6 ms to minimize.
[2024-05-24 16:55:05] [INFO ] Deduced a trap composed of 35 places in 660 ms of which 6 ms to minimize.
[2024-05-24 16:55:06] [INFO ] Deduced a trap composed of 22 places in 663 ms of which 7 ms to minimize.
[2024-05-24 16:55:07] [INFO ] Deduced a trap composed of 3 places in 661 ms of which 6 ms to minimize.
[2024-05-24 16:55:07] [INFO ] Deduced a trap composed of 3 places in 493 ms of which 5 ms to minimize.
[2024-05-24 16:55:08] [INFO ] Deduced a trap composed of 24 places in 414 ms of which 4 ms to minimize.
[2024-05-24 16:55:08] [INFO ] Deduced a trap composed of 3 places in 192 ms of which 3 ms to minimize.
[2024-05-24 16:55:08] [INFO ] Deduced a trap composed of 33 places in 480 ms of which 4 ms to minimize.
[2024-05-24 16:55:08] [INFO ] Deduced a trap composed of 78 places in 137 ms of which 1 ms to minimize.
[2024-05-24 16:55:09] [INFO ] Deduced a trap composed of 25 places in 342 ms of which 4 ms to minimize.
[2024-05-24 16:55:09] [INFO ] Deduced a trap composed of 3 places in 394 ms of which 4 ms to minimize.
[2024-05-24 16:55:10] [INFO ] Deduced a trap composed of 39 places in 335 ms of which 4 ms to minimize.
[2024-05-24 16:55:10] [INFO ] Deduced a trap composed of 3 places in 202 ms of which 2 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :4300 after 39492
[2024-05-24 16:55:11] [INFO ] Deduced a trap composed of 148 places in 719 ms of which 6 ms to minimize.
[2024-05-24 16:55:11] [INFO ] Deduced a trap composed of 34 places in 737 ms of which 6 ms to minimize.
[2024-05-24 16:55:12] [INFO ] Deduced a trap composed of 122 places in 735 ms of which 5 ms to minimize.
[2024-05-24 16:55:13] [INFO ] Deduced a trap composed of 97 places in 757 ms of which 6 ms to minimize.
[2024-05-24 16:55:13] [INFO ] Deduced a trap composed of 143 places in 608 ms of which 6 ms to minimize.
[2024-05-24 16:55:14] [INFO ] Deduced a trap composed of 35 places in 199 ms of which 2 ms to minimize.
[2024-05-24 16:55:14] [INFO ] Deduced a trap composed of 35 places in 685 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/677 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 16:55:15] [INFO ] Deduced a trap composed of 45 places in 740 ms of which 6 ms to minimize.
[2024-05-24 16:55:16] [INFO ] Deduced a trap composed of 24 places in 729 ms of which 6 ms to minimize.
[2024-05-24 16:55:17] [INFO ] Deduced a trap composed of 3 places in 748 ms of which 6 ms to minimize.
[2024-05-24 16:55:17] [INFO ] Deduced a trap composed of 142 places in 741 ms of which 6 ms to minimize.
[2024-05-24 16:55:18] [INFO ] Deduced a trap composed of 15 places in 746 ms of which 6 ms to minimize.
[2024-05-24 16:55:19] [INFO ] Deduced a trap composed of 91 places in 738 ms of which 6 ms to minimize.
[2024-05-24 16:55:19] [INFO ] Deduced a trap composed of 26 places in 317 ms of which 4 ms to minimize.
[2024-05-24 16:55:20] [INFO ] Deduced a trap composed of 156 places in 733 ms of which 7 ms to minimize.
[2024-05-24 16:55:21] [INFO ] Deduced a trap composed of 111 places in 734 ms of which 6 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :39492 after 80899
[2024-05-24 16:55:22] [INFO ] Deduced a trap composed of 120 places in 749 ms of which 7 ms to minimize.
[2024-05-24 16:55:22] [INFO ] Deduced a trap composed of 83 places in 744 ms of which 12 ms to minimize.
[2024-05-24 16:55:23] [INFO ] Deduced a trap composed of 21 places in 741 ms of which 6 ms to minimize.
[2024-05-24 16:55:23] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 3 ms to minimize.
[2024-05-24 16:55:24] [INFO ] Deduced a trap composed of 3 places in 181 ms of which 2 ms to minimize.
[2024-05-24 16:55:24] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 1 ms to minimize.
[2024-05-24 16:55:24] [INFO ] Deduced a trap composed of 30 places in 242 ms of which 3 ms to minimize.
[2024-05-24 16:55:25] [INFO ] Deduced a trap composed of 26 places in 678 ms of which 5 ms to minimize.
[2024-05-24 16:55:25] [INFO ] Deduced a trap composed of 3 places in 594 ms of which 6 ms to minimize.
[2024-05-24 16:55:26] [INFO ] Deduced a trap composed of 33 places in 674 ms of which 6 ms to minimize.
[2024-05-24 16:55:27] [INFO ] Deduced a trap composed of 54 places in 670 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/677 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 16:55:27] [INFO ] Deduced a trap composed of 66 places in 172 ms of which 2 ms to minimize.
[2024-05-24 16:55:27] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 2 ms to minimize.
[2024-05-24 16:55:28] [INFO ] Deduced a trap composed of 110 places in 602 ms of which 5 ms to minimize.
[2024-05-24 16:55:28] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 2 ms to minimize.
[2024-05-24 16:55:28] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
Problem EisenbergMcGuire-PT-10-ReachabilityCardinality-2023-07 is UNSAT
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-2023-07 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-24 16:55:28] [INFO ] Deduced a trap composed of 13 places in 249 ms of which 3 ms to minimize.
[2024-05-24 16:55:28] [INFO ] Deduced a trap composed of 70 places in 121 ms of which 2 ms to minimize.
[2024-05-24 16:55:29] [INFO ] Deduced a trap composed of 34 places in 603 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 8/79 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-24 16:55:29] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/677 variables, 1/80 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-24 16:55:30] [INFO ] Deduced a trap composed of 70 places in 724 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/677 variables, 1/81 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/677 variables, 0/81 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1179/1856 variables, 677/758 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1856 variables, 508/1266 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1856 variables, 4/1270 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1856 variables, 0/1270 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-24 16:55:32] [INFO ] Deduced a trap composed of 130 places in 669 ms of which 6 ms to minimize.
[2024-05-24 16:55:33] [INFO ] Deduced a trap composed of 133 places in 624 ms of which 18 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/1856 variables, 2/1272 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1856 variables, 0/1272 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-24 16:55:34] [INFO ] Deduced a trap composed of 64 places in 126 ms of which 2 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/1856 variables, 1/1273 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1856 variables, 0/1273 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/1856 variables, 0/1273 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1856/1856 variables, and 1273 constraints, problems are : Problem set: 1 solved, 4 unsolved in 31724 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 677/677 constraints, ReadFeed: 508/508 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 53/53 constraints]
After SMT, in 33313ms problems are : Problem set: 1 solved, 4 unsolved
Parikh walk visited 0 properties in 3810 ms.
Support contains 57 out of 677 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 677/677 places, 4049/4049 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 677 transition count 4048
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 676 transition count 4048
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 2 place count 676 transition count 4023
Deduced a syphon composed of 25 places in 4 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 52 place count 651 transition count 4023
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 649 transition count 4003
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 649 transition count 4003
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 64 place count 645 transition count 3999
Applied a total of 64 rules in 344 ms. Remains 645 /677 variables (removed 32) and now considering 3999/4049 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 344 ms. Remains : 645/677 places, 3999/4049 transitions.
RANDOM walk for 40000 steps (8 resets) in 338 ms. (117 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 149149 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 4
Probabilistic random walk after 149149 steps, saw 111281 distinct states, run finished after 3002 ms. (steps per millisecond=49 ) properties seen :0
[2024-05-24 16:55:43] [INFO ] Flow matrix only has 1129 transitions (discarded 2870 similar events)
// Phase 1: matrix 1129 rows 645 cols
[2024-05-24 16:55:43] [INFO ] Computed 31 invariants in 7 ms
[2024-05-24 16:55:43] [INFO ] State equation strengthened by 490 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 570/627 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/627 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 18/645 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 16:55:43] [INFO ] Deduced a trap composed of 3 places in 212 ms of which 2 ms to minimize.
[2024-05-24 16:55:44] [INFO ] Deduced a trap composed of 3 places in 276 ms of which 3 ms to minimize.
[2024-05-24 16:55:44] [INFO ] Deduced a trap composed of 3 places in 306 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/645 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 16:55:44] [INFO ] Deduced a trap composed of 23 places in 312 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/645 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1129/1774 variables, 645/680 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1774 variables, 490/1170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1774 variables, 0/1170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1774 variables, 0/1170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1774/1774 variables, and 1170 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2379 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 645/645 constraints, ReadFeed: 490/490 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 570/627 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/627 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 18/645 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/645 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 16:55:46] [INFO ] Deduced a trap composed of 3 places in 711 ms of which 6 ms to minimize.
[2024-05-24 16:55:47] [INFO ] Deduced a trap composed of 3 places in 716 ms of which 6 ms to minimize.
[2024-05-24 16:55:48] [INFO ] Deduced a trap composed of 128 places in 715 ms of which 6 ms to minimize.
[2024-05-24 16:55:48] [INFO ] Deduced a trap composed of 32 places in 650 ms of which 6 ms to minimize.
[2024-05-24 16:55:49] [INFO ] Deduced a trap composed of 104 places in 706 ms of which 5 ms to minimize.
[2024-05-24 16:55:50] [INFO ] Deduced a trap composed of 136 places in 700 ms of which 6 ms to minimize.
[2024-05-24 16:55:50] [INFO ] Deduced a trap composed of 27 places in 239 ms of which 3 ms to minimize.
[2024-05-24 16:55:50] [INFO ] Deduced a trap composed of 3 places in 240 ms of which 3 ms to minimize.
[2024-05-24 16:55:50] [INFO ] Deduced a trap composed of 73 places in 138 ms of which 2 ms to minimize.
[2024-05-24 16:55:51] [INFO ] Deduced a trap composed of 62 places in 692 ms of which 5 ms to minimize.
[2024-05-24 16:55:52] [INFO ] Deduced a trap composed of 76 places in 700 ms of which 5 ms to minimize.
[2024-05-24 16:55:53] [INFO ] Deduced a trap composed of 53 places in 707 ms of which 6 ms to minimize.
[2024-05-24 16:55:53] [INFO ] Deduced a trap composed of 33 places in 645 ms of which 6 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 65536
SDD size :80899 after 220751
[2024-05-24 16:55:54] [INFO ] Deduced a trap composed of 76 places in 230 ms of which 3 ms to minimize.
[2024-05-24 16:55:54] [INFO ] Deduced a trap composed of 51 places in 704 ms of which 5 ms to minimize.
[2024-05-24 16:55:55] [INFO ] Deduced a trap composed of 114 places in 699 ms of which 5 ms to minimize.
[2024-05-24 16:55:56] [INFO ] Deduced a trap composed of 38 places in 688 ms of which 6 ms to minimize.
[2024-05-24 16:55:56] [INFO ] Deduced a trap composed of 34 places in 186 ms of which 2 ms to minimize.
[2024-05-24 16:55:57] [INFO ] Deduced a trap composed of 30 places in 709 ms of which 5 ms to minimize.
[2024-05-24 16:55:57] [INFO ] Deduced a trap composed of 3 places in 694 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/645 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 16:55:58] [INFO ] Deduced a trap composed of 110 places in 704 ms of which 6 ms to minimize.
[2024-05-24 16:55:59] [INFO ] Deduced a trap composed of 78 places in 696 ms of which 6 ms to minimize.
[2024-05-24 16:55:59] [INFO ] Deduced a trap composed of 4 places in 637 ms of which 5 ms to minimize.
[2024-05-24 16:56:00] [INFO ] Deduced a trap composed of 39 places in 724 ms of which 6 ms to minimize.
[2024-05-24 16:56:01] [INFO ] Deduced a trap composed of 154 places in 695 ms of which 6 ms to minimize.
[2024-05-24 16:56:02] [INFO ] Deduced a trap composed of 81 places in 703 ms of which 6 ms to minimize.
[2024-05-24 16:56:02] [INFO ] Deduced a trap composed of 56 places in 212 ms of which 3 ms to minimize.
[2024-05-24 16:56:02] [INFO ] Deduced a trap composed of 18 places in 233 ms of which 3 ms to minimize.
[2024-05-24 16:56:02] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 2 ms to minimize.
[2024-05-24 16:56:03] [INFO ] Deduced a trap composed of 116 places in 627 ms of which 6 ms to minimize.
[2024-05-24 16:56:04] [INFO ] Deduced a trap composed of 109 places in 647 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1129/1774 variables, 645/711 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1774 variables, 490/1201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1774 variables, 4/1205 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1774 variables, 0/1205 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 16:56:05] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/1774 variables, 1/1206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1774 variables, 0/1206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1774 variables, 0/1206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1774/1774 variables, and 1206 constraints, problems are : Problem set: 0 solved, 4 unsolved in 21292 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 645/645 constraints, ReadFeed: 490/490 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 36/36 constraints]
After SMT, in 23734ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2385 ms.
Support contains 57 out of 645 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 645/645 places, 3999/3999 transitions.
Applied a total of 0 rules in 191 ms. Remains 645 /645 variables (removed 0) and now considering 3999/3999 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 645/645 places, 3999/3999 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 645/645 places, 3999/3999 transitions.
Applied a total of 0 rules in 209 ms. Remains 645 /645 variables (removed 0) and now considering 3999/3999 (removed 0) transitions.
[2024-05-24 16:56:09] [INFO ] Flow matrix only has 1129 transitions (discarded 2870 similar events)
[2024-05-24 16:56:09] [INFO ] Invariant cache hit.
[2024-05-24 16:56:10] [INFO ] Implicit Places using invariants in 992 ms returned []
[2024-05-24 16:56:10] [INFO ] Flow matrix only has 1129 transitions (discarded 2870 similar events)
[2024-05-24 16:56:10] [INFO ] Invariant cache hit.
[2024-05-24 16:56:11] [INFO ] State equation strengthened by 490 read => feed constraints.
[2024-05-24 16:56:17] [INFO ] Implicit Places using invariants and state equation in 6281 ms returned []
Implicit Place search using SMT with State Equation took 7286 ms to find 0 implicit places.
[2024-05-24 16:56:17] [INFO ] Redundant transitions in 357 ms returned []
Running 3989 sub problems to find dead transitions.
[2024-05-24 16:56:17] [INFO ] Flow matrix only has 1129 transitions (discarded 2870 similar events)
[2024-05-24 16:56:17] [INFO ] Invariant cache hit.
[2024-05-24 16:56:17] [INFO ] State equation strengthened by 490 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/645 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3989 unsolved
SMT process timed out in 34493ms, After SMT, problems are : Problem set: 0 solved, 3989 unsolved
Search for dead transitions found 0 dead transitions in 34549ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42441 ms. Remains : 645/645 places, 3999/3999 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3575 edges and 645 vertex of which 89 / 645 are part of one of the 10 SCC in 15 ms
Free SCC test removed 79 places
Drop transitions (Empty/Sink Transition effects.) removed 286 transitions
Ensure Unique test removed 2853 transitions
Reduce isomorphic transitions removed 3139 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 111 place count 566 transition count 750
Reduce places removed 110 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 124 rules applied. Total rules applied 235 place count 456 transition count 736
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 249 place count 442 transition count 736
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 249 place count 442 transition count 726
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 269 place count 432 transition count 726
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 156
Deduced a syphon composed of 156 places in 1 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 3 with 312 rules applied. Total rules applied 581 place count 276 transition count 570
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 3 with 72 rules applied. Total rules applied 653 place count 276 transition count 498
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 659 place count 273 transition count 515
Drop transitions (Redundant composition of simpler transitions.) removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 4 with 35 rules applied. Total rules applied 694 place count 273 transition count 480
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 700 place count 270 transition count 484
Free-agglomeration rule applied 54 times.
Iterating global reduction 4 with 54 rules applied. Total rules applied 754 place count 270 transition count 430
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 4 with 54 rules applied. Total rules applied 808 place count 216 transition count 430
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 811 place count 216 transition count 427
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 816 place count 216 transition count 427
Applied a total of 816 rules in 141 ms. Remains 216 /645 variables (removed 429) and now considering 427/3999 (removed 3572) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 427 rows 216 cols
[2024-05-24 16:56:52] [INFO ] Computed 31 invariants in 4 ms
[2024-05-24 16:56:52] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned sat
[2024-05-24 16:56:52] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2024-05-24 16:56:52] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 16:56:52] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2024-05-24 16:56:52] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2024-05-24 16:56:52] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-24 16:56:52] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-24 16:56:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2024-05-24 16:56:52] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-24 16:56:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
TRAPS : Iteration 1
[2024-05-24 16:56:53] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-24 16:56:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
TRAPS : Iteration 2
[2024-05-24 16:56:53] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-24 16:56:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2024-05-24 16:56:53] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-24 16:56:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
TRAPS : Iteration 3
[2024-05-24 16:56:53] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-24 16:56:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
TRAPS : Iteration 4
[2024-05-24 16:56:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-24 16:56:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
TRAPS : Iteration 5
[2024-05-24 16:56:53] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-24 16:56:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
TRAPS : Iteration 6
[2024-05-24 16:56:54] [INFO ] After 1702ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-24 16:56:54] [INFO ] After 1930ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2024-05-24 16:56:54] [INFO ] Flatten gal took : 19 ms
[2024-05-24 16:56:54] [INFO ] Flatten gal took : 18 ms
[2024-05-24 16:56:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14890456965914411182.gal : 6 ms
[2024-05-24 16:56:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6612566055254380286.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14890456965914411182.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6612566055254380286.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality6612566055254380286.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 42
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :42 after 48
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :48 after 2730
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :2730 after 14448
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :14448 after 17580
Reachability property EisenbergMcGuire-PT-10-ReachabilityCardinality-2023-04 is true.
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :17580 after 1.8216e+06
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1.8216e+06 after 5.94441e+06
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :5.94441e+06 after 6.19256e+06
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :6.19256e+06 after 9.63072e+06
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :9.63072e+06 after 2.35052e+07
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :2.35052e+07 after 4.09445e+07
Reachability property EisenbergMcGuire-PT-10-ReachabilityCardinality-2024-09 is true.
SDD proceeding with computation,7 properties remain. new max is 131072
SDD size :220751 after 1.87863e+06
Detected timeout of ITS tools.
[2024-05-24 16:57:09] [INFO ] Flatten gal took : 17 ms
[2024-05-24 16:57:09] [INFO ] Applying decomposition
[2024-05-24 16:57:09] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10882459082103710833.txt' '-o' '/tmp/graph10882459082103710833.bin' '-w' '/tmp/graph10882459082103710833.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10882459082103710833.bin' '-l' '-1' '-v' '-w' '/tmp/graph10882459082103710833.weights' '-q' '0' '-e' '0.001'
[2024-05-24 16:57:09] [INFO ] Decomposing Gal with order
[2024-05-24 16:57:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 16:57:09] [INFO ] Removed a total of 419 redundant transitions.
[2024-05-24 16:57:09] [INFO ] Flatten gal took : 100 ms
[2024-05-24 16:57:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 27 ms.
[2024-05-24 16:57:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8049375155915421691.gal : 12 ms
[2024-05-24 16:57:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4327221233230151749.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8049375155915421691.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4327221233230151749.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality4327221233230151749.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 23
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :23 after 1200
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1200 after 3.55655e+07
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.46336e+13,0.149547,7056,285,55,4008,767,947,4769,166,1918,0
Total reachable state count : 34633557504000

Verifying 2 reachability properties.
Reachability property EisenbergMcGuire-PT-10-ReachabilityCardinality-2024-03 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
EisenbergMcGuire-PT-10-ReachabilityCardinality-2024-03,2.55528e+07,0.152135,7056,129,43,4008,767,967,4769,172,1918,107
Reachability property EisenbergMcGuire-PT-10-ReachabilityCardinality-2024-05 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
EisenbergMcGuire-PT-10-ReachabilityCardinality-2024-05,1260,0.156467,7056,112,35,4008,767,1007,4769,175,1918,628
Over-approximation ignoring read arcs solved 0 properties in 17996 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-24 16:57:10] [INFO ] Flatten gal took : 235 ms
[2024-05-24 16:57:10] [INFO ] Applying decomposition
[2024-05-24 16:57:10] [INFO ] Flatten gal took : 212 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4368289334204642927.txt' '-o' '/tmp/graph4368289334204642927.bin' '-w' '/tmp/graph4368289334204642927.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4368289334204642927.bin' '-l' '-1' '-v' '-w' '/tmp/graph4368289334204642927.weights' '-q' '0' '-e' '0.001'
[2024-05-24 16:57:11] [INFO ] Decomposing Gal with order
[2024-05-24 16:57:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 16:57:12] [INFO ] Removed a total of 10881 redundant transitions.
[2024-05-24 16:57:12] [INFO ] Flatten gal took : 612 ms
[2024-05-24 16:57:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 395 labels/synchronizations in 155 ms.
[2024-05-24 16:57:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6614695078841079879.gal : 48 ms
[2024-05-24 16:57:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14633005563564522621.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6614695078841079879.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14633005563564522621.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality14633005563564522621.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 2
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :2 after 2
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :2 after 2
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :2 after 4
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :4 after 4
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :4 after 16
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :16 after 96
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :96 after 240
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :240 after 4123
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :4123 after 12176
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :12176 after 3.03902e+07
ITS-tools command line returned an error code 137
[2024-05-24 17:08:54] [INFO ] Flatten gal took : 133 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9981781252900331532
[2024-05-24 17:08:54] [INFO ] Too many transitions (3999) to apply POR reductions. Disabling POR matrices.
[2024-05-24 17:08:54] [INFO ] Applying decomposition
[2024-05-24 17:08:55] [INFO ] Built C files in 124ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9981781252900331532
Running compilation step : cd /tmp/ltsmin9981781252900331532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-24 17:08:55] [INFO ] Flatten gal took : 195 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4570001325576439249.txt' '-o' '/tmp/graph4570001325576439249.bin' '-w' '/tmp/graph4570001325576439249.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4570001325576439249.bin' '-l' '-1' '-v' '-w' '/tmp/graph4570001325576439249.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:08:55] [INFO ] Decomposing Gal with order
[2024-05-24 17:08:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:08:56] [INFO ] Removed a total of 8812 redundant transitions.
[2024-05-24 17:08:56] [INFO ] Flatten gal took : 425 ms
[2024-05-24 17:08:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 1029 labels/synchronizations in 198 ms.
[2024-05-24 17:08:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1823275580981765857.gal : 33 ms
[2024-05-24 17:08:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16974075130448405022.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1823275580981765857.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16974075130448405022.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality16974075130448405022.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 159
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :159 after 35497
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :35497 after 84553
Compilation finished in 23509 ms.
Running link step : cd /tmp/ltsmin9981781252900331532;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin9981781252900331532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'EisenbergMcGuirePT10ReachabilityCardinality202403==true'
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :84553 after 2.89421e+07
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :2.89421e+07 after 2.913e+07
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :2.913e+07 after 3.09555e+07
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :3.09555e+07 after 6.22434e+07
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin9981781252900331532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'EisenbergMcGuirePT10ReachabilityCardinality202403==true'
Running LTSmin : cd /tmp/ltsmin9981781252900331532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'EisenbergMcGuirePT10ReachabilityCardinality202304==true'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin9981781252900331532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'EisenbergMcGuirePT10ReachabilityCardinality202304==true'
Running LTSmin : cd /tmp/ltsmin9981781252900331532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'EisenbergMcGuirePT10ReachabilityCardinality202405==true'
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :6.22434e+07 after 1.19259e+08
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin9981781252900331532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'EisenbergMcGuirePT10ReachabilityCardinality202405==true'
Running LTSmin : cd /tmp/ltsmin9981781252900331532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'EisenbergMcGuirePT10ReachabilityCardinality202409==true'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin9981781252900331532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'EisenbergMcGuirePT10ReachabilityCardinality202409==true'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin9981781252900331532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'EisenbergMcGuirePT10ReachabilityCardinality202403==true'
Detected timeout of ITS tools.
[2024-05-24 17:33:40] [INFO ] Applying decomposition
[2024-05-24 17:33:40] [INFO ] Flatten gal took : 465 ms
[2024-05-24 17:33:40] [INFO ] Decomposing Gal with order
[2024-05-24 17:33:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:33:41] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to p07_0 in partition [turn_1, p39_1],[p34_1_8, p33_1_9, p37_1_9],[p27_1, critical_section_1],[flag_1_idle, flag_1_waiting, flag_1_active, p04_1, p08_1_1],[p08_1_4, p12_1_3],[p18_1_9, p19_1_8],[p34_0_9, p33_0_0],[p27_0, critical_section_0],[p33_0_1, p37_0_1, p37_0_2, p37_0_3, p37_0_4, p37_0_5, p37_0_6, p37_0_7, p37_0_8, p37_0_9],[turn_0, p39_0],[flag_6_idle, flag_6_waiting, flag_6_active, p04_6, p08_6_6],[p08_6_2, p09_6_2],[flag_0_idle, flag_0_waiting, flag_0_active],[p04_0, p19_0_2, p19_0_3],[p08_0_3, p09_0_3],[p08_0_9, p12_0_2],[p08_0_0, p15_0],[p08_2_2, p12_2_1],[p08_2_9, p12_2_0],[flag_2_idle, flag_2_waiting, flag_2_active],[p04_2, p18_2_5, p19_2_4],[p18_2_8, p19_2_7],[flag_3_idle, flag_3_waiting, flag_3_active, p04_3],[p08_3_2, p10_3_2],[p08_3_9, p12_3_8],[p19_3_5, p19_3_6],[p07_7, p08_7_1, p08_7_8, p10_7_3],[p08_7_9, p09_7_9],[p08_7_7, p12_7_6],[flag_7_idle, flag_7_waiting, flag_7_active],[p04_7, p18_7_8, p19_7_7],[flag_8_idle, flag_8_waiting, flag_8_active, p04_8, p08_8_8],[p08_8_1, p12_8_0],[p19_8_1, p19_8_2],[p19_8_6, p19_8_7],[flag_4_idle, flag_4_waiting, flag_4_active],[p04_4, p19_4_7],[p07_4, p10_4_0, p10_4_6, p12_4_5],[p17_4, p19_4_6],[turn_4, p27_4, p39_4, critical_section_4],[flag_5_idle, flag_5_waiting, flag_5_active],[p08_5_1, p08_5_2, p08_5_5, p10_5_7],[p04_5, p17_5, p18_5_0],[p19_5_8, p19_5_9],[turn_5, p34_5_4, p27_5, p39_5, critical_section_5],[p34_2_6, p37_2_0, p37_2_1, p37_2_7, p37_2_8, p37_2_9],[turn_2, p27_2, p39_2, critical_section_2],[p08_9_6, p12_9_1, p12_9_6],[p08_9_5, p08_9_9, p10_9_7],[flag_9_idle, flag_9_waiting, flag_9_active],[p04_9, p19_9_0, p19_9_1],[p34_3_6, p34_3_7],[p34_3_5, p33_3_6, p37_3_6],[turn_3, p34_3_4, p27_3, p37_3_4, p39_3],[p33_3_8, p37_3_0, p37_3_1, p37_3_2, p37_3_8, p37_3_9],[p34_7_8, p37_7_0, p37_7_1, p37_7_2, p37_7_3, p37_7_4, p37_7_5, p37_7_6, p37_7_9, p39_7],[turn_7, p27_7, critical_section_7],[turn_8, p27_8, p39_8, critical_section_8],[p33_8_3, p37_8_3, p37_8_4, p37_8_5, p37_8_6, p37_8_7],[p34_9_1, p37_9_2, p37_9_3, p37_9_4],[turn_9, p34_9_0, p27_9, p37_9_0, p39_9],[p33_9_6, p37_9_6, p37_9_7, p37_9_8],[p34_9_4, p37_9_5],[p33_6_1, p37_6_1, p37_6_2, p37_6_3, p37_6_4, p37_6_5],[turn_6, p27_6, p39_6, critical_section_6],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1234)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-24 17:33:41] [INFO ] Flatten gal took : 236 ms
[2024-05-24 17:33:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8296581848739823036.gal : 72 ms
[2024-05-24 17:33:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10095480243310235707.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8296581848739823036.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10095480243310235707.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10095480243310235707.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :8 after 10
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :10 after 31
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :31 after 38
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :38 after 56
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :56 after 87
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :87 after 117
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :117 after 440
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :440 after 854
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :854 after 1811
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1811 after 9607
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :9607 after 23067
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :23067 after 111688
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :111688 after 319545
SDD proceeding with computation,4 properties remain. new max is 131072
SDD size :319545 after 514444
SDD proceeding with computation,4 properties remain. new max is 262144
SDD size :514444 after 2.83362e+06
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin9981781252900331532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'EisenbergMcGuirePT10ReachabilityCardinality202403==true'
Running LTSmin : cd /tmp/ltsmin9981781252900331532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'EisenbergMcGuirePT10ReachabilityCardinality202304==true'

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-10"
export BK_EXAMINATION="ReachabilityCardinality"
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-5568"
echo " Executing tool itstools"
echo " Input is EisenbergMcGuire-PT-10, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r158-smll-171636266400206"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-10.tgz
mv EisenbergMcGuire-PT-10 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;