Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 25K Apr 11 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 11 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 46K Apr 11 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 243K Apr 11 16:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.5K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 58K Apr 11 16:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 293K Apr 11 16:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 93K Apr 11 16:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 478K Apr 11 16:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 906K May 18 16:43 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 PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-00
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-01
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-02
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-03
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-04
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-05
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-06
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-07
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-08
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-09
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-10
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-11
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-12
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-13
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-14
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716914480453

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-28 16:41:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 16:41:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 16:41:22] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2024-05-28 16:41:22] [INFO ] Transformed 752 places.
[2024-05-28 16:41:22] [INFO ] Transformed 1572 transitions.
[2024-05-28 16:41:22] [INFO ] Parsed PT model containing 752 places and 1572 transitions and 7262 arcs in 267 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 16:41:22] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 16:41:22] [INFO ] Reduced 110 identical enabling conditions.
[2024-05-28 16:41:22] [INFO ] Reduced 40 identical enabling conditions.
[2024-05-28 16:41:22] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 16:41:22] [INFO ] Reduced 40 identical enabling conditions.
[2024-05-28 16:41:22] [INFO ] Reduced 110 identical enabling conditions.
[2024-05-28 16:41:22] [INFO ] Reduced 40 identical enabling conditions.
[2024-05-28 16:41:22] [INFO ] Reduced 110 identical enabling conditions.
[2024-05-28 16:41:22] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 16:41:22] [INFO ] Reduced 110 identical enabling conditions.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
RANDOM walk for 40000 steps (10 resets) in 2526 ms. (15 steps per ms) remains 8/16 properties
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 16:41:23] [INFO ] Flatten gal took : 427 ms
[2024-05-28 16:41:23] [INFO ] Flatten gal took : 268 ms
[2024-05-28 16:41:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7768634992860722573.gal : 99 ms
[2024-05-28 16:41:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality517698575115361764.prop : 52 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/ReachabilityCardinality7768634992860722573.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality517698575115361764.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 ...327
Loading property file /tmp/ReachabilityCardinality517698575115361764.prop.
BEST_FIRST walk for 40002 steps (8 resets) in 4374 ms. (9 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (10 resets) in 1364 ms. (29 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :7 after 23
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :23 after 41
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :41 after 241
BEST_FIRST walk for 40001 steps (10 resets) in 3392 ms. (11 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :241 after 247
BEST_FIRST walk for 40001 steps (8 resets) in 484 ms. (82 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :247 after 263
BEST_FIRST walk for 40002 steps (8 resets) in 1294 ms. (30 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (9 resets) in 564 ms. (70 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :263 after 983
BEST_FIRST walk for 40002 steps (11 resets) in 677 ms. (59 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :983 after 1073
BEST_FIRST walk for 40002 steps (10 resets) in 568 ms. (70 steps per ms) remains 8/8 properties
[2024-05-28 16:41:26] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2024-05-28 16:41:26] [INFO ] Computed 54 invariants in 70 ms
[2024-05-28 16:41:27] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :1073 after 1393
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :1393 after 2768
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/663 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/663 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 19/682 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/682 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/682 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-11 is UNSAT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-12 is UNSAT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-14 is UNSAT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-15 is UNSAT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 70/752 variables, 14/54 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 0/54 constraints. Problems are: Problem set: 4 solved, 4 unsolved
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :2768 after 7796
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2144/2144 variables, and 806 constraints, problems are : Problem set: 4 solved, 4 unsolved in 5043 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 752/752 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 8/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/645 variables, 7/7 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/645 variables, 23/30 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/645 variables, 0/30 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 25/670 variables, 8/38 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/670 variables, 1/39 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/670 variables, 0/39 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 82/752 variables, 15/54 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-05-28 16:41:38] [INFO ] Deduced a trap composed of 66 places in 271 ms of which 31 ms to minimize.
[2024-05-28 16:41:38] [INFO ] Deduced a trap composed of 66 places in 142 ms of which 4 ms to minimize.
[2024-05-28 16:41:38] [INFO ] Deduced a trap composed of 67 places in 190 ms of which 2 ms to minimize.
[2024-05-28 16:41:38] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 1 ms to minimize.
[2024-05-28 16:41:39] [INFO ] Deduced a trap composed of 66 places in 210 ms of which 1 ms to minimize.
[2024-05-28 16:41:39] [INFO ] Deduced a trap composed of 66 places in 148 ms of which 1 ms to minimize.
[2024-05-28 16:41:39] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:41:39] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 8/62 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 0/62 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2144/2144 variables, and 814 constraints, problems are : Problem set: 4 solved, 4 unsolved in 5027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 752/752 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 8/8 constraints]
After SMT, in 14104ms problems are : Problem set: 4 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 645 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Applied a total of 0 rules in 130 ms. Remains 752 /752 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2024-05-28 16:41:41] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-28 16:41:41] [INFO ] Invariant cache hit.
[2024-05-28 16:41:41] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :7796 after 24119
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-28 16:41:59] [INFO ] Deduced a trap composed of 65 places in 1159 ms of which 10 ms to minimize.
[2024-05-28 16:42:00] [INFO ] Deduced a trap composed of 66 places in 1108 ms of which 3 ms to minimize.
[2024-05-28 16:42:00] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 1 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 65536
SDD size :24119 after 94070
[2024-05-28 16:42:01] [INFO ] Deduced a trap composed of 66 places in 687 ms of which 0 ms to minimize.
[2024-05-28 16:42:01] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:42:01] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:42:01] [INFO ] Deduced a trap composed of 66 places in 53 ms of which 0 ms to minimize.
[2024-05-28 16:42:02] [INFO ] Deduced a trap composed of 66 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:42:02] [INFO ] Deduced a trap composed of 402 places in 381 ms of which 6 ms to minimize.
[2024-05-28 16:42:02] [INFO ] Deduced a trap composed of 65 places in 359 ms of which 4 ms to minimize.
[2024-05-28 16:42:03] [INFO ] Deduced a trap composed of 231 places in 318 ms of which 4 ms to minimize.
[2024-05-28 16:42:03] [INFO ] Deduced a trap composed of 229 places in 383 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 748/2144 variables, and 62 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20084 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 35/39 constraints, State Equation: 0/752 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/748 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-28 16:42:21] [INFO ] Deduced a trap composed of 65 places in 766 ms of which 1 ms to minimize.
[2024-05-28 16:42:22] [INFO ] Deduced a trap composed of 57 places in 282 ms of which 5 ms to minimize.
[2024-05-28 16:42:23] [INFO ] Deduced a trap composed of 425 places in 287 ms of which 4 ms to minimize.
[2024-05-28 16:42:24] [INFO ] Deduced a trap composed of 418 places in 307 ms of which 4 ms to minimize.
SMT process timed out in 42970ms, After SMT, problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 43025ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43214 ms. Remains : 752/752 places, 1412/1412 transitions.
RANDOM walk for 40000 steps (8 resets) in 1266 ms. (31 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 2792 ms. (14 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (10 resets) in 1722 ms. (23 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (9 resets) in 3022 ms. (13 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 493 ms. (80 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 154442 steps, run timeout after 6001 ms. (steps per millisecond=25 ) properties seen :0 out of 4
Probabilistic random walk after 154442 steps, saw 95360 distinct states, run finished after 6008 ms. (steps per millisecond=25 ) properties seen :0
[2024-05-28 16:42:33] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-28 16:42:33] [INFO ] Invariant cache hit.
[2024-05-28 16:42:33] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/645 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/645 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/645 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 25/670 variables, 8/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/670 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/670 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-04 is UNSAT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 82/752 variables, 15/54 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1392/2144 variables, 752/806 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2144 variables, 120/926 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2144 variables, 0/926 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2144/2144 variables, and 926 constraints, problems are : Problem set: 1 solved, 3 unsolved in 45027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 752/752 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 23/30 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-28 16:43:20] [INFO ] Deduced a trap composed of 3 places in 684 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 36/630 variables, 8/39 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-28 16:43:21] [INFO ] Deduced a trap composed of 66 places in 492 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/630 variables, 1/40 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/630 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 122/752 variables, 16/56 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-28 16:43:31] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 2 ms to minimize.
[2024-05-28 16:43:31] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 2/58 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-28 16:43:36] [INFO ] Deduced a trap composed of 65 places in 196 ms of which 3 ms to minimize.
[2024-05-28 16:43:36] [INFO ] Deduced a trap composed of 130 places in 228 ms of which 3 ms to minimize.
[2024-05-28 16:43:36] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 3 ms to minimize.
[2024-05-28 16:43:36] [INFO ] Deduced a trap composed of 65 places in 186 ms of which 4 ms to minimize.
[2024-05-28 16:43:37] [INFO ] Deduced a trap composed of 65 places in 155 ms of which 3 ms to minimize.
[2024-05-28 16:43:37] [INFO ] Deduced a trap composed of 66 places in 189 ms of which 9 ms to minimize.
[2024-05-28 16:43:37] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 1 ms to minimize.
[2024-05-28 16:43:37] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 1 ms to minimize.
[2024-05-28 16:43:37] [INFO ] Deduced a trap composed of 66 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/752 variables, 9/67 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,8 properties remain. new max is 131072
SDD size :94070 after 681174
At refinement iteration 10 (INCLUDED_ONLY) 0/752 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1392/2144 variables, 752/819 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2144 variables, 120/939 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2144/2144 variables, and 940 constraints, problems are : Problem set: 1 solved, 3 unsolved in 45018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 752/752 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 92003ms problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 594 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 752 transition count 1392
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 732 transition count 1392
Applied a total of 40 rules in 123 ms. Remains 732 /752 variables (removed 20) and now considering 1392/1412 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 732/752 places, 1392/1412 transitions.
RANDOM walk for 40000 steps (10 resets) in 1607 ms. (24 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (9 resets) in 2478 ms. (16 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 4486 ms. (8 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 579 ms. (68 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 119484 steps, run timeout after 6001 ms. (steps per millisecond=19 ) properties seen :0 out of 3
Probabilistic random walk after 119484 steps, saw 64991 distinct states, run finished after 6001 ms. (steps per millisecond=19 ) properties seen :0
[2024-05-28 16:44:14] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 732 cols
[2024-05-28 16:44:14] [INFO ] Computed 54 invariants in 45 ms
[2024-05-28 16:44:14] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 33/627 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 105/732 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/732 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1372/2104 variables, 732/786 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2104 variables, 120/906 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2104 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/2104 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2104/2104 variables, and 906 constraints, problems are : Problem set: 0 solved, 3 unsolved in 74324 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 732/732 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 33/627 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 105/732 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:45:46] [INFO ] Deduced a trap composed of 64 places in 115 ms of which 1 ms to minimize.
[2024-05-28 16:45:46] [INFO ] Deduced a trap composed of 64 places in 187 ms of which 2 ms to minimize.
[2024-05-28 16:45:46] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/732 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:45:54] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/732 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:46:03] [INFO ] Deduced a trap composed of 63 places in 396 ms of which 4 ms to minimize.
[2024-05-28 16:46:03] [INFO ] Deduced a trap composed of 63 places in 425 ms of which 5 ms to minimize.
[2024-05-28 16:46:03] [INFO ] Deduced a trap composed of 385 places in 357 ms of which 4 ms to minimize.
[2024-05-28 16:46:04] [INFO ] Deduced a trap composed of 63 places in 354 ms of which 4 ms to minimize.
[2024-05-28 16:46:04] [INFO ] Deduced a trap composed of 63 places in 357 ms of which 4 ms to minimize.
[2024-05-28 16:46:05] [INFO ] Deduced a trap composed of 64 places in 359 ms of which 4 ms to minimize.
[2024-05-28 16:46:05] [INFO ] Deduced a trap composed of 63 places in 601 ms of which 18 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/732 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-06 is UNSAT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (INCLUDED_ONLY) 0/732 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1372/2104 variables, 732/797 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2104 variables, 120/917 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2104 variables, 1/918 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2104 variables, 0/918 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2104/2104 variables, and 918 constraints, problems are : Problem set: 1 solved, 2 unsolved in 75024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 732/732 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 151116ms problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 390 out of 732 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 732/732 places, 1392/1392 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 732 transition count 1382
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 722 transition count 1382
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 20 place count 722 transition count 1314
Deduced a syphon composed of 68 places in 2 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 156 place count 654 transition count 1314
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 172 place count 646 transition count 1306
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 182 place count 646 transition count 1296
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 192 place count 636 transition count 1296
Applied a total of 192 rules in 296 ms. Remains 636 /732 variables (removed 96) and now considering 1296/1392 (removed 96) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 308 ms. Remains : 636/732 places, 1296/1392 transitions.
RANDOM walk for 40000 steps (12 resets) in 830 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (11 resets) in 3053 ms. (13 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (12 resets) in 233 ms. (170 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 92372 steps, run timeout after 3009 ms. (steps per millisecond=30 ) properties seen :0 out of 2
Probabilistic random walk after 92372 steps, saw 51376 distinct states, run finished after 3009 ms. (steps per millisecond=30 ) properties seen :0
[2024-05-28 16:46:49] [INFO ] Flow matrix only has 1276 transitions (discarded 20 similar events)
// Phase 1: matrix 1276 rows 636 cols
[2024-05-28 16:46:49] [INFO ] Computed 54 invariants in 34 ms
[2024-05-28 16:46:49] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/390 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 158/548 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/548 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 88/636 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/636 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1276/1912 variables, 636/690 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1912 variables, 120/810 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1912 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1912 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1912/1912 variables, and 810 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2569 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 636/636 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/390 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 16:46:53] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/390 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 158/548 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 16:46:53] [INFO ] Deduced a trap composed of 344 places in 331 ms of which 3 ms to minimize.
[2024-05-28 16:46:53] [INFO ] Deduced a trap composed of 281 places in 351 ms of which 5 ms to minimize.
[2024-05-28 16:46:54] [INFO ] Deduced a trap composed of 323 places in 287 ms of which 3 ms to minimize.
[2024-05-28 16:46:54] [INFO ] Deduced a trap composed of 289 places in 336 ms of which 3 ms to minimize.
[2024-05-28 16:46:55] [INFO ] Deduced a trap composed of 348 places in 414 ms of which 3 ms to minimize.
[2024-05-28 16:46:55] [INFO ] Deduced a trap composed of 347 places in 448 ms of which 3 ms to minimize.
[2024-05-28 16:46:56] [INFO ] Deduced a trap composed of 321 places in 430 ms of which 20 ms to minimize.
[2024-05-28 16:46:56] [INFO ] Deduced a trap composed of 327 places in 401 ms of which 3 ms to minimize.
[2024-05-28 16:46:56] [INFO ] Deduced a trap composed of 23 places in 335 ms of which 3 ms to minimize.
[2024-05-28 16:46:57] [INFO ] Deduced a trap composed of 382 places in 350 ms of which 4 ms to minimize.
[2024-05-28 16:46:57] [INFO ] Deduced a trap composed of 393 places in 352 ms of which 3 ms to minimize.
[2024-05-28 16:46:57] [INFO ] Deduced a trap composed of 384 places in 318 ms of which 3 ms to minimize.
[2024-05-28 16:46:58] [INFO ] Deduced a trap composed of 344 places in 245 ms of which 3 ms to minimize.
[2024-05-28 16:46:58] [INFO ] Deduced a trap composed of 392 places in 358 ms of which 4 ms to minimize.
[2024-05-28 16:46:58] [INFO ] Deduced a trap composed of 333 places in 344 ms of which 3 ms to minimize.
[2024-05-28 16:46:59] [INFO ] Deduced a trap composed of 168 places in 335 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 16/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 16:46:59] [INFO ] Deduced a trap composed of 463 places in 370 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 88/636 variables, 35/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 16:47:00] [INFO ] Deduced a trap composed of 53 places in 219 ms of which 3 ms to minimize.
[2024-05-28 16:47:00] [INFO ] Deduced a trap composed of 54 places in 198 ms of which 3 ms to minimize.
[2024-05-28 16:47:00] [INFO ] Deduced a trap composed of 54 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:47:00] [INFO ] Deduced a trap composed of 53 places in 108 ms of which 2 ms to minimize.
[2024-05-28 16:47:00] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:47:00] [INFO ] Deduced a trap composed of 55 places in 123 ms of which 1 ms to minimize.
[2024-05-28 16:47:01] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:47:01] [INFO ] Deduced a trap composed of 54 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:47:01] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/636 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/636 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1276/1912 variables, 636/717 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1912 variables, 120/837 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1912 variables, 1/838 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1912 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1912 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1912/1912 variables, and 838 constraints, problems are : Problem set: 0 solved, 2 unsolved in 41565 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 636/636 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 27/27 constraints]
After SMT, in 44670ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 517 ms.
Support contains 390 out of 636 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 636/636 places, 1296/1296 transitions.
Applied a total of 0 rules in 35 ms. Remains 636 /636 variables (removed 0) and now considering 1296/1296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 636/636 places, 1296/1296 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 636/636 places, 1296/1296 transitions.
Applied a total of 0 rules in 35 ms. Remains 636 /636 variables (removed 0) and now considering 1296/1296 (removed 0) transitions.
[2024-05-28 16:47:35] [INFO ] Flow matrix only has 1276 transitions (discarded 20 similar events)
[2024-05-28 16:47:35] [INFO ] Invariant cache hit.
[2024-05-28 16:47:35] [INFO ] Implicit Places using invariants in 327 ms returned [3, 85, 160, 231, 331, 366, 441, 484, 494, 570]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 334 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 626/636 places, 1296/1296 transitions.
Applied a total of 0 rules in 25 ms. Remains 626 /626 variables (removed 0) and now considering 1296/1296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 395 ms. Remains : 626/636 places, 1296/1296 transitions.
RANDOM walk for 40000 steps (12 resets) in 552 ms. (72 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 3106 ms. (12 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 210 ms. (189 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 83663 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 2
Probabilistic random walk after 83663 steps, saw 46745 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :0
[2024-05-28 16:47:39] [INFO ] Flow matrix only has 1276 transitions (discarded 20 similar events)
// Phase 1: matrix 1276 rows 626 cols
[2024-05-28 16:47:39] [INFO ] Computed 44 invariants in 15 ms
[2024-05-28 16:47:39] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/390 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 171/561 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/561 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 65/626 variables, 22/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/626 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1276/1902 variables, 626/670 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1902 variables, 120/790 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1902 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1902 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1902/1902 variables, and 790 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4908 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 626/626 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/390 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 16:47:46] [INFO ] Deduced a trap composed of 3 places in 396 ms of which 27 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/390 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 171/561 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 65/626 variables, 22/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 16:47:46] [INFO ] Deduced a trap composed of 55 places in 548 ms of which 19 ms to minimize.
[2024-05-28 16:47:47] [INFO ] Deduced a trap composed of 121 places in 424 ms of which 7 ms to minimize.
[2024-05-28 16:47:47] [INFO ] Deduced a trap composed of 55 places in 372 ms of which 4 ms to minimize.
[2024-05-28 16:47:48] [INFO ] Deduced a trap composed of 54 places in 316 ms of which 3 ms to minimize.
[2024-05-28 16:47:48] [INFO ] Deduced a trap composed of 55 places in 307 ms of which 3 ms to minimize.
[2024-05-28 16:47:48] [INFO ] Deduced a trap composed of 54 places in 355 ms of which 4 ms to minimize.
[2024-05-28 16:47:49] [INFO ] Deduced a trap composed of 54 places in 292 ms of which 4 ms to minimize.
[2024-05-28 16:47:49] [INFO ] Deduced a trap composed of 54 places in 293 ms of which 3 ms to minimize.
[2024-05-28 16:47:49] [INFO ] Deduced a trap composed of 302 places in 317 ms of which 4 ms to minimize.
[2024-05-28 16:47:50] [INFO ] Deduced a trap composed of 428 places in 319 ms of which 3 ms to minimize.
[2024-05-28 16:47:50] [INFO ] Deduced a trap composed of 54 places in 309 ms of which 3 ms to minimize.
[2024-05-28 16:47:51] [INFO ] Deduced a trap composed of 392 places in 436 ms of which 6 ms to minimize.
[2024-05-28 16:47:51] [INFO ] Deduced a trap composed of 55 places in 284 ms of which 3 ms to minimize.
[2024-05-28 16:47:51] [INFO ] Deduced a trap composed of 158 places in 357 ms of which 3 ms to minimize.
[2024-05-28 16:47:52] [INFO ] Deduced a trap composed of 380 places in 287 ms of which 4 ms to minimize.
[2024-05-28 16:47:52] [INFO ] Deduced a trap composed of 54 places in 333 ms of which 3 ms to minimize.
[2024-05-28 16:47:52] [INFO ] Deduced a trap composed of 294 places in 293 ms of which 4 ms to minimize.
[2024-05-28 16:47:53] [INFO ] Deduced a trap composed of 240 places in 302 ms of which 3 ms to minimize.
[2024-05-28 16:47:53] [INFO ] Deduced a trap composed of 255 places in 277 ms of which 3 ms to minimize.
[2024-05-28 16:47:53] [INFO ] Deduced a trap composed of 302 places in 320 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/626 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 16:47:54] [INFO ] Deduced a trap composed of 335 places in 360 ms of which 3 ms to minimize.
[2024-05-28 16:47:54] [INFO ] Deduced a trap composed of 324 places in 298 ms of which 3 ms to minimize.
[2024-05-28 16:47:55] [INFO ] Deduced a trap composed of 323 places in 283 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/626 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/626 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1276/1902 variables, 626/694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1902 variables, 120/814 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1902 variables, 1/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1902 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1902 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1902/1902 variables, and 815 constraints, problems are : Problem set: 0 solved, 2 unsolved in 61896 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 626/626 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 24/24 constraints]
After SMT, in 67931ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 20865 ms.
Support contains 390 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1296/1296 transitions.
Applied a total of 0 rules in 23 ms. Remains 626 /626 variables (removed 0) and now considering 1296/1296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 626/626 places, 1296/1296 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1296/1296 transitions.
Applied a total of 0 rules in 54 ms. Remains 626 /626 variables (removed 0) and now considering 1296/1296 (removed 0) transitions.
[2024-05-28 16:49:08] [INFO ] Flow matrix only has 1276 transitions (discarded 20 similar events)
[2024-05-28 16:49:08] [INFO ] Invariant cache hit.
[2024-05-28 16:49:08] [INFO ] Implicit Places using invariants in 474 ms returned []
[2024-05-28 16:49:08] [INFO ] Flow matrix only has 1276 transitions (discarded 20 similar events)
[2024-05-28 16:49:08] [INFO ] Invariant cache hit.
[2024-05-28 16:49:15] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 16:49:29] [INFO ] Implicit Places using invariants and state equation in 20321 ms returned []
Implicit Place search using SMT with State Equation took 20811 ms to find 0 implicit places.
[2024-05-28 16:49:29] [INFO ] Redundant transitions in 76 ms returned []
Running 1294 sub problems to find dead transitions.
[2024-05-28 16:49:29] [INFO ] Flow matrix only has 1276 transitions (discarded 20 similar events)
[2024-05-28 16:49:29] [INFO ] Invariant cache hit.
[2024-05-28 16:49:29] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1294 unsolved
[2024-05-28 16:49:46] [INFO ] Deduced a trap composed of 55 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:49:46] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 1 ms to minimize.
[2024-05-28 16:49:46] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2024-05-28 16:49:46] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:49:46] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 1 ms to minimize.
[2024-05-28 16:49:49] [INFO ] Deduced a trap composed of 54 places in 3012 ms of which 27 ms to minimize.
[2024-05-28 16:49:49] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 1 ms to minimize.
[2024-05-28 16:49:49] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:49:50] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 2 ms to minimize.
[2024-05-28 16:49:50] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:49:51] [INFO ] Deduced a trap composed of 47 places in 419 ms of which 6 ms to minimize.
[2024-05-28 16:49:51] [INFO ] Deduced a trap composed of 419 places in 453 ms of which 31 ms to minimize.
[2024-05-28 16:49:52] [INFO ] Deduced a trap composed of 344 places in 361 ms of which 5 ms to minimize.
[2024-05-28 16:49:53] [INFO ] Deduced a trap composed of 102 places in 364 ms of which 33 ms to minimize.
[2024-05-28 16:49:53] [INFO ] Deduced a trap composed of 196 places in 543 ms of which 20 ms to minimize.
[2024-05-28 16:49:54] [INFO ] Deduced a trap composed of 288 places in 444 ms of which 7 ms to minimize.
[2024-05-28 16:49:54] [INFO ] Deduced a trap composed of 305 places in 266 ms of which 3 ms to minimize.
[2024-05-28 16:49:55] [INFO ] Deduced a trap composed of 402 places in 336 ms of which 3 ms to minimize.
[2024-05-28 16:49:55] [INFO ] Deduced a trap composed of 285 places in 371 ms of which 3 ms to minimize.
[2024-05-28 16:49:56] [INFO ] Deduced a trap composed of 95 places in 191 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1294 unsolved
[2024-05-28 16:49:58] [INFO ] Deduced a trap composed of 300 places in 421 ms of which 3 ms to minimize.
[2024-05-28 16:49:58] [INFO ] Deduced a trap composed of 288 places in 347 ms of which 3 ms to minimize.
[2024-05-28 16:49:58] [INFO ] Deduced a trap composed of 383 places in 255 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1902 variables, and 63 constraints, problems are : Problem set: 0 solved, 1294 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/626 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1294/1294 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 23/63 constraints. Problems are: Problem set: 0 solved, 1294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1902 variables, and 63 constraints, problems are : Problem set: 0 solved, 1294 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/626 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1294 constraints, Known Traps: 23/23 constraints]
After SMT, in 61958ms problems are : Problem set: 0 solved, 1294 unsolved
Search for dead transitions found 0 dead transitions in 61972ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82939 ms. Remains : 626/626 places, 1296/1296 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 626 transition count 1276
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 1 with 20 rules applied. Total rules applied 40 place count 626 transition count 1256
Partial Free-agglomeration rule applied 28 times.
Drop transitions (Partial Free agglomeration) removed 28 transitions
Iterating global reduction 1 with 28 rules applied. Total rules applied 68 place count 626 transition count 1256
Applied a total of 68 rules in 145 ms. Remains 626 /626 variables (removed 0) and now considering 1256/1296 (removed 40) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1256 rows 626 cols
[2024-05-28 16:50:32] [INFO ] Computed 44 invariants in 41 ms
[2024-05-28 16:50:32] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-28 16:50:32] [INFO ] [Real]Absence check using 16 positive and 28 generalized place invariants in 28 ms returned sat
[2024-05-28 16:50:32] [INFO ] After 319ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 16:50:32] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2024-05-28 16:50:32] [INFO ] [Nat]Absence check using 16 positive and 28 generalized place invariants in 33 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-05-28 16:50:33] [INFO ] After 687ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :2
[2024-05-28 16:50:33] [INFO ] After 992ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-28 16:50:33] [INFO ] Flatten gal took : 135 ms
[2024-05-28 16:50:34] [INFO ] Flatten gal took : 89 ms
[2024-05-28 16:50:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11213759265677017331.gal : 15 ms
[2024-05-28 16:50:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1620863329763144455.prop : 10 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/ReachabilityCardinality11213759265677017331.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1620863329763144455.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/ReachabilityCardinality1620863329763144455.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 13
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :13 after 25
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :25 after 43
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :43 after 48
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :48 after 49
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :49 after 55
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :55 after 5939
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :5939 after 5959
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5959 after 6146
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6146 after 9895
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :9895 after 42077
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :42077 after 90117
Detected timeout of ITS tools.
[2024-05-28 16:50:49] [INFO ] Flatten gal took : 91 ms
[2024-05-28 16:50:49] [INFO ] Applying decomposition
[2024-05-28 16:50:49] [INFO ] Flatten gal took : 85 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/graph10260466417959735797.txt' '-o' '/tmp/graph10260466417959735797.bin' '-w' '/tmp/graph10260466417959735797.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10260466417959735797.bin' '-l' '-1' '-v' '-w' '/tmp/graph10260466417959735797.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:50:49] [INFO ] Decomposing Gal with order
[2024-05-28 16:50:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:50:50] [INFO ] Removed a total of 1360 redundant transitions.
[2024-05-28 16:50:50] [INFO ] Flatten gal took : 453 ms
[2024-05-28 16:50:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 195 labels/synchronizations in 76 ms.
[2024-05-28 16:50:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7523791110511920062.gal : 40 ms
[2024-05-28 16:50:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4949055242242268949.prop : 18 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/ReachabilityCardinality7523791110511920062.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4949055242242268949.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/ReachabilityCardinality4949055242242268949.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 15
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :15 after 27
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :27 after 99
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :99 after 179
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :179 after 493
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :493 after 585
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :585 after 1159
SDD proceeding with computation,8 properties remain. new max is 262144
SDD size :681174 after 4.38695e+06
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1159 after 1537
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 34588 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-28 16:51:06] [INFO ] Flatten gal took : 82 ms
[2024-05-28 16:51:06] [INFO ] Applying decomposition
[2024-05-28 16:51:06] [INFO ] Flatten gal took : 63 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/graph2554262445804092404.txt' '-o' '/tmp/graph2554262445804092404.bin' '-w' '/tmp/graph2554262445804092404.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2554262445804092404.bin' '-l' '-1' '-v' '-w' '/tmp/graph2554262445804092404.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:51:06] [INFO ] Decomposing Gal with order
[2024-05-28 16:51:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:51:06] [INFO ] Removed a total of 1008 redundant transitions.
[2024-05-28 16:51:06] [INFO ] Flatten gal took : 130 ms
[2024-05-28 16:51:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 252 labels/synchronizations in 41 ms.
[2024-05-28 16:51:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10627997160618994413.gal : 16 ms
[2024-05-28 16:51:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16299268001765489362.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/ReachabilityCardinality10627997160618994413.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16299268001765489362.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 ...309
Loading property file /tmp/ReachabilityCardinality16299268001765489362.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1 after 10
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :10 after 38
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :38 after 432
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :432 after 820
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :820 after 5328
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :5328 after 18930
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :18930 after 260943
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :260943 after 4.13788e+06
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :4.13788e+06 after 3.81817e+07
Detected timeout of ITS tools.
[2024-05-28 17:21:07] [INFO ] Flatten gal took : 144 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17294106027881731053
[2024-05-28 17:21:07] [INFO ] Computing symmetric may disable matrix : 1296 transitions.
[2024-05-28 17:21:07] [INFO ] Applying decomposition
[2024-05-28 17:21:07] [INFO ] Computation of Complete disable matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:21:07] [INFO ] Computing symmetric may enable matrix : 1296 transitions.
[2024-05-28 17:21:07] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:21:07] [INFO ] Flatten gal took : 130 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/graph6452188770542443639.txt' '-o' '/tmp/graph6452188770542443639.bin' '-w' '/tmp/graph6452188770542443639.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6452188770542443639.bin' '-l' '-1' '-v' '-w' '/tmp/graph6452188770542443639.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:21:07] [INFO ] Decomposing Gal with order
[2024-05-28 17:21:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:21:07] [INFO ] Removed a total of 1012 redundant transitions.
[2024-05-28 17:21:07] [INFO ] Flatten gal took : 105 ms
[2024-05-28 17:21:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 500 labels/synchronizations in 33 ms.
[2024-05-28 17:21:07] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4327931760034761435.gal : 8 ms
[2024-05-28 17:21:07] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9739018903065387780.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/ReachabilityFireability4327931760034761435.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability9739018903065387780.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
[2024-05-28 17:21:07] [INFO ] Computing Do-Not-Accords matrix : 1296 transitions.
[2024-05-28 17:21:08] [INFO ] Computation of Completed DNA matrix. took 56 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Loading property file /tmp/ReachabilityFireability9739018903065387780.prop.
[2024-05-28 17:21:08] [INFO ] Built C files in 797ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17294106027881731053
Running compilation step : cd /tmp/ltsmin17294106027881731053;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' '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'
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :5 after 5
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :10 after 17
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :17 after 21
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :21 after 29
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :29 after 2568
Compilation finished in 5190 ms.
Running link step : cd /tmp/ltsmin17294106027881731053;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 126 ms.
Running LTSmin : cd /tmp/ltsmin17294106027881731053;'/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' 'PolyORBLFPTS02J04T10ReachabilityFireability202403==true'
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2568 after 6411
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :6411 after 7789
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :7789 after 30937

BK_STOP 1716917559267

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ 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 ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S02J04T10"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PolyORBLF-PT-S02J04T10, 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 r290-tajo-171654446700239"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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