fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r246-tall-171654352100646
Last Updated
July 7, 2024

About the Execution of ITS-Tools for NoC3x3-PT-6B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16193.016 3600000.00 12491024.00 1794.10 TFFTTFFTFTTFFF?F normal

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.r246-tall-171654352100646.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 NoC3x3-PT-6B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654352100646
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 211K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 552K 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 NoC3x3-PT-6B-ReachabilityCardinality-2024-00
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-01
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-02
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-03
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-04
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-05
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-06
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-07
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-08
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-09
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-10
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-11
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-12
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2023-13
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-14
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716707449152

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-6B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-26 07:10:50] [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-26 07:10:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 07:10:50] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2024-05-26 07:10:50] [INFO ] Transformed 1544 places.
[2024-05-26 07:10:50] [INFO ] Transformed 2229 transitions.
[2024-05-26 07:10:50] [INFO ] Found NUPN structural information;
[2024-05-26 07:10:50] [INFO ] Parsed PT model containing 1544 places and 2229 transitions and 6663 arcs in 262 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (88 resets) in 1810 ms. (22 steps per ms) remains 4/13 properties
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-26 07:10:51] [INFO ] Flatten gal took : 301 ms
BEST_FIRST walk for 40003 steps (10 resets) in 491 ms. (81 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (11 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
[2024-05-26 07:10:51] [INFO ] Flatten gal took : 150 ms
[2024-05-26 07:10:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10561805492438128102.gal : 91 ms
[2024-05-26 07:10:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9641082014549353243.prop : 4 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/ReachabilityCardinality10561805492438128102.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9641082014549353243.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

BEST_FIRST walk for 40004 steps (11 resets) in 1105 ms. (36 steps per ms) remains 4/4 properties
/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
BEST_FIRST walk for 40003 steps (12 resets) in 282 ms. (141 steps per ms) remains 4/4 properties
// Phase 1: matrix 2229 rows 1544 cols
[2024-05-26 07:10:52] [INFO ] Computed 66 invariants in 29 ms
Loading property file /tmp/ReachabilityCardinality9641082014549353243.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem NoC3x3-PT-6B-ReachabilityCardinality-2023-13 is UNSAT
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2023-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1288/1405 variables, 54/171 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1405 variables, 1288/1459 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1405 variables, 0/1459 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 139/1544 variables, 12/1471 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1544 variables, 139/1610 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1544 variables, 0/1610 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :6 after 14
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :14 after 26
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :26 after 33
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :33 after 43
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :43 after 129
At refinement iteration 8 (OVERLAPS) 2229/3773 variables, 1544/3154 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :129 after 399
At refinement iteration 9 (INCLUDED_ONLY) 0/3773 variables, 0/3154 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/3773 variables, 0/3154 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3773/3773 variables, and 3154 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1967 ms.
Refiners :[Domain max(s): 1544/1544 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1544/1544 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1275/1365 variables, 50/140 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1365 variables, 1275/1415 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :399 after 23599
[2024-05-26 07:10:54] [INFO ] Deduced a trap composed of 76 places in 415 ms of which 54 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :23599 after 1.84272e+06
[2024-05-26 07:10:55] [INFO ] Deduced a trap composed of 131 places in 377 ms of which 7 ms to minimize.
[2024-05-26 07:10:55] [INFO ] Deduced a trap composed of 124 places in 272 ms of which 5 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1.84272e+06 after 1.85753e+06
[2024-05-26 07:10:55] [INFO ] Deduced a trap composed of 130 places in 233 ms of which 4 ms to minimize.
[2024-05-26 07:10:56] [INFO ] Deduced a trap composed of 173 places in 227 ms of which 4 ms to minimize.
[2024-05-26 07:10:56] [INFO ] Deduced a trap composed of 172 places in 203 ms of which 4 ms to minimize.
[2024-05-26 07:10:56] [INFO ] Deduced a trap composed of 164 places in 279 ms of which 5 ms to minimize.
[2024-05-26 07:10:56] [INFO ] Deduced a trap composed of 103 places in 153 ms of which 3 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :1.85753e+06 after 1.50644e+08
[2024-05-26 07:10:57] [INFO ] Deduced a trap composed of 133 places in 218 ms of which 3 ms to minimize.
[2024-05-26 07:10:57] [INFO ] Deduced a trap composed of 67 places in 149 ms of which 3 ms to minimize.
[2024-05-26 07:10:57] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1365 variables, 11/1426 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1365 variables, 0/1426 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 179/1544 variables, 16/1442 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1544 variables, 179/1621 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-26 07:10:58] [INFO ] Deduced a trap composed of 95 places in 299 ms of which 5 ms to minimize.
[2024-05-26 07:10:58] [INFO ] Deduced a trap composed of 85 places in 289 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1544 variables, 2/1623 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1544 variables, 0/1623 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3773/3773 variables, and 3167 constraints, problems are : Problem set: 1 solved, 3 unsolved in 5011 ms.
Refiners :[Domain max(s): 1544/1544 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1544/1544 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 13/13 constraints]
After SMT, in 7183ms problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 90 out of 1544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1544/1544 places, 2229/2229 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 186 transitions
Trivial Post-agglo rules discarded 186 transitions
Performed 186 trivial Post agglomeration. Transition count delta: 186
Iterating post reduction 0 with 186 rules applied. Total rules applied 186 place count 1544 transition count 2043
Reduce places removed 186 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 199 rules applied. Total rules applied 385 place count 1358 transition count 2030
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 398 place count 1345 transition count 2030
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 398 place count 1345 transition count 1972
Deduced a syphon composed of 58 places in 4 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 514 place count 1287 transition count 1972
Discarding 258 places :
Symmetric choice reduction at 3 with 258 rule applications. Total rules 772 place count 1029 transition count 1714
Iterating global reduction 3 with 258 rules applied. Total rules applied 1030 place count 1029 transition count 1714
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 1030 place count 1029 transition count 1690
Deduced a syphon composed of 24 places in 10 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 1078 place count 1005 transition count 1690
SDD proceeding with computation,4 properties remain. new max is 32768
Discarding 89 places :
Symmetric choice reduction at 3 with 89 rule applications. Total rules 1167 place count 916 transition count 1433
Iterating global reduction 3 with 89 rules applied. Total rules applied 1256 place count 916 transition count 1433
SDD size :1.50644e+08 after 4.04598e+08
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 1292 place count 880 transition count 1357
Iterating global reduction 3 with 36 rules applied. Total rules applied 1328 place count 880 transition count 1357
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1340 place count 868 transition count 1333
Iterating global reduction 3 with 12 rules applied. Total rules applied 1352 place count 868 transition count 1333
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1358 place count 862 transition count 1321
Iterating global reduction 3 with 6 rules applied. Total rules applied 1364 place count 862 transition count 1321
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1365 place count 861 transition count 1319
Iterating global reduction 3 with 1 rules applied. Total rules applied 1366 place count 861 transition count 1319
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 300 rules applied. Total rules applied 1666 place count 711 transition count 1169
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1668 place count 709 transition count 1149
Iterating global reduction 3 with 2 rules applied. Total rules applied 1670 place count 709 transition count 1149
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 1872 place count 608 transition count 1199
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 1922 place count 583 transition count 1211
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 1939 place count 583 transition count 1194
Free-agglomeration rule applied 28 times.
Iterating global reduction 3 with 28 rules applied. Total rules applied 1967 place count 583 transition count 1166
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 2003 place count 555 transition count 1158
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 2006 place count 555 transition count 1155
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 2008 place count 555 transition count 1155
Applied a total of 2008 rules in 719 ms. Remains 555 /1544 variables (removed 989) and now considering 1155/2229 (removed 1074) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 744 ms. Remains : 555/1544 places, 1155/2229 transitions.
RANDOM walk for 40000 steps (213 resets) in 1078 ms. (37 steps per ms) remains 2/3 properties
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (13 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (13 resets) in 192 ms. (207 steps per ms) remains 2/2 properties
[2024-05-26 07:11:00] [INFO ] Flow matrix only has 1150 transitions (discarded 5 similar events)
// Phase 1: matrix 1150 rows 555 cols
[2024-05-26 07:11:00] [INFO ] Computed 66 invariants in 8 ms
[2024-05-26 07:11:00] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 406/488 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 67/555 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1150/1705 variables, 555/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1705 variables, 56/677 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1705 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1705 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1705/1705 variables, and 677 constraints, problems are : Problem set: 0 solved, 2 unsolved in 551 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 555/555 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 406/488 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 67/555 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 07:11:01] [INFO ] Deduced a trap composed of 29 places in 180 ms of which 3 ms to minimize.
[2024-05-26 07:11:01] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 4 ms to minimize.
[2024-05-26 07:11:01] [INFO ] Deduced a trap composed of 66 places in 165 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1150/1705 variables, 555/624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1705 variables, 56/680 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1705 variables, 2/682 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 07:11:03] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1705 variables, 1/683 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1705 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1705 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1705/1705 variables, and 683 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2872 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 555/555 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 3473ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1025 ms.
Support contains 82 out of 555 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 555/555 places, 1155/1155 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 555 transition count 1153
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 553 transition count 1153
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 553 transition count 1152
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 552 transition count 1152
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 550 transition count 1145
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 550 transition count 1145
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 549 transition count 1144
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 546 transition count 1145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 545 transition count 1141
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 545 transition count 1141
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 545 transition count 1140
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 544 transition count 1132
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 544 transition count 1132
Applied a total of 23 rules in 94 ms. Remains 544 /555 variables (removed 11) and now considering 1132/1155 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 544/555 places, 1132/1155 transitions.
RANDOM walk for 40000 steps (175 resets) in 339 ms. (117 steps per ms) remains 1/2 properties
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (14 resets) in 200 ms. (199 steps per ms) remains 1/1 properties
[2024-05-26 07:11:05] [INFO ] Flow matrix only has 1129 transitions (discarded 3 similar events)
// Phase 1: matrix 1129 rows 544 cols
[2024-05-26 07:11:05] [INFO ] Computed 66 invariants in 6 ms
[2024-05-26 07:11:05] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 367/427 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 117/544 variables, 23/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/544 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1129/1673 variables, 544/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1673 variables, 56/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1673 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1673 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1673/1673 variables, and 666 constraints, problems are : Problem set: 0 solved, 1 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 544/544 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 367/427 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 117/544 variables, 23/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 07:11:05] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/544 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/544 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1129/1673 variables, 544/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1673 variables, 56/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1673 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1673 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1673 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1673/1673 variables, and 668 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2017 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 544/544 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2423ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 196 ms.
Support contains 60 out of 544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 544/544 places, 1132/1132 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 544 transition count 1130
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 542 transition count 1130
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 542 transition count 1125
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 537 transition count 1125
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 531 transition count 1110
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 531 transition count 1110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 531 transition count 1109
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 41 place count 524 transition count 1102
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 44 place count 521 transition count 1096
Iterating global reduction 3 with 3 rules applied. Total rules applied 47 place count 521 transition count 1096
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 59 place count 515 transition count 1098
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 61 place count 513 transition count 1090
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 513 transition count 1090
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 65 place count 511 transition count 1082
Iterating global reduction 3 with 2 rules applied. Total rules applied 67 place count 511 transition count 1082
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 70 place count 511 transition count 1079
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 77 place count 511 transition count 1072
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 80 place count 508 transition count 1051
Iterating global reduction 4 with 3 rules applied. Total rules applied 83 place count 508 transition count 1051
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 508 transition count 1050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 85 place count 507 transition count 1050
Applied a total of 85 rules in 100 ms. Remains 507 /544 variables (removed 37) and now considering 1050/1132 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 507/544 places, 1050/1132 transitions.
RANDOM walk for 40000 steps (233 resets) in 316 ms. (126 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (15 resets) in 195 ms. (204 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 310387 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 1
Probabilistic random walk after 310387 steps, saw 97165 distinct states, run finished after 3005 ms. (steps per millisecond=103 ) properties seen :0
[2024-05-26 07:11:10] [INFO ] Flow matrix only has 1047 transitions (discarded 3 similar events)
// Phase 1: matrix 1047 rows 507 cols
[2024-05-26 07:11:10] [INFO ] Computed 66 invariants in 5 ms
[2024-05-26 07:11:10] [INFO ] State equation strengthened by 55 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 340/400 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 107/507 variables, 23/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/507 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1047/1554 variables, 507/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1554 variables, 55/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1554 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1554 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1554/1554 variables, and 628 constraints, problems are : Problem set: 0 solved, 1 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 507/507 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 340/400 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 07:11:11] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 107/507 variables, 23/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 07:11:11] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/507 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1047/1554 variables, 507/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1554 variables, 55/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1554 variables, 1/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1554 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1554 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1554/1554 variables, and 631 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1991 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 507/507 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 2385ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 102 ms.
Support contains 60 out of 507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 1050/1050 transitions.
Applied a total of 0 rules in 14 ms. Remains 507 /507 variables (removed 0) and now considering 1050/1050 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 507/507 places, 1050/1050 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 1050/1050 transitions.
Applied a total of 0 rules in 13 ms. Remains 507 /507 variables (removed 0) and now considering 1050/1050 (removed 0) transitions.
[2024-05-26 07:11:13] [INFO ] Flow matrix only has 1047 transitions (discarded 3 similar events)
[2024-05-26 07:11:13] [INFO ] Invariant cache hit.
[2024-05-26 07:11:13] [INFO ] Implicit Places using invariants in 269 ms returned [19, 57, 115, 157, 231, 338, 393, 434, 485]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 276 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 498/507 places, 1050/1050 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 476 transition count 1028
Applied a total of 44 rules in 20 ms. Remains 476 /498 variables (removed 22) and now considering 1028/1050 (removed 22) transitions.
[2024-05-26 07:11:13] [INFO ] Flow matrix only has 1025 transitions (discarded 3 similar events)
// Phase 1: matrix 1025 rows 476 cols
[2024-05-26 07:11:13] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 07:11:13] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-26 07:11:13] [INFO ] Flow matrix only has 1025 transitions (discarded 3 similar events)
[2024-05-26 07:11:13] [INFO ] Invariant cache hit.
[2024-05-26 07:11:14] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-26 07:11:14] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 845 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 476/507 places, 1028/1050 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1154 ms. Remains : 476/507 places, 1028/1050 transitions.
RANDOM walk for 40000 steps (238 resets) in 216 ms. (184 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (16 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 265898 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 1
Probabilistic random walk after 265898 steps, saw 117957 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
[2024-05-26 07:11:17] [INFO ] Flow matrix only has 1025 transitions (discarded 3 similar events)
[2024-05-26 07:11:17] [INFO ] Invariant cache hit.
[2024-05-26 07:11:17] [INFO ] State equation strengthened by 59 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 319/379 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 97/476 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1025/1501 variables, 476/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1501 variables, 59/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1501 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1501 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1501/1501 variables, and 592 constraints, problems are : Problem set: 0 solved, 1 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 476/476 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 319/379 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 97/476 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1025/1501 variables, 476/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1501 variables, 59/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1501 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 07:11:19] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1501 variables, 1/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 07:11:19] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1501 variables, 1/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1501 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1501 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1501/1501 variables, and 595 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1864 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 476/476 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 2214ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 112 ms.
Support contains 60 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 1028/1028 transitions.
Applied a total of 0 rules in 10 ms. Remains 476 /476 variables (removed 0) and now considering 1028/1028 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 476/476 places, 1028/1028 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 1028/1028 transitions.
Applied a total of 0 rules in 10 ms. Remains 476 /476 variables (removed 0) and now considering 1028/1028 (removed 0) transitions.
[2024-05-26 07:11:20] [INFO ] Flow matrix only has 1025 transitions (discarded 3 similar events)
[2024-05-26 07:11:20] [INFO ] Invariant cache hit.
[2024-05-26 07:11:20] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-26 07:11:20] [INFO ] Flow matrix only has 1025 transitions (discarded 3 similar events)
[2024-05-26 07:11:20] [INFO ] Invariant cache hit.
[2024-05-26 07:11:20] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-26 07:11:20] [INFO ] Implicit Places using invariants and state equation in 665 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
[2024-05-26 07:11:21] [INFO ] Redundant transitions in 57 ms returned []
Running 1024 sub problems to find dead transitions.
[2024-05-26 07:11:21] [INFO ] Flow matrix only has 1025 transitions (discarded 3 similar events)
[2024-05-26 07:11:21] [INFO ] Invariant cache hit.
[2024-05-26 07:11:21] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1024 unsolved
At refinement iteration 1 (OVERLAPS) 1/476 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 1024 unsolved
[2024-05-26 07:11:35] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-05-26 07:11:35] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 2 ms to minimize.
[2024-05-26 07:11:36] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-05-26 07:11:36] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-26 07:11:36] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-26 07:11:39] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 3 ms to minimize.
[2024-05-26 07:11:39] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-05-26 07:11:39] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-26 07:11:39] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-26 07:11:40] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2024-05-26 07:11:40] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-05-26 07:11:42] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 3 ms to minimize.
[2024-05-26 07:11:42] [INFO ] Deduced a trap composed of 66 places in 101 ms of which 7 ms to minimize.
[2024-05-26 07:11:45] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-05-26 07:11:45] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 2 ms to minimize.
[2024-05-26 07:11:45] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 2 ms to minimize.
[2024-05-26 07:11:45] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/476 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 1024 unsolved
[2024-05-26 07:11:49] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 476/1501 variables, and 75 constraints, problems are : Problem set: 0 solved, 1024 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/476 constraints, ReadFeed: 0/59 constraints, PredecessorRefiner: 1024/1024 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1024 unsolved
At refinement iteration 1 (OVERLAPS) 1/476 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 1024 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/476 variables, 18/75 constraints. Problems are: Problem set: 0 solved, 1024 unsolved
[2024-05-26 07:12:03] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1024 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1024 unsolved
At refinement iteration 5 (OVERLAPS) 1025/1501 variables, 476/552 constraints. Problems are: Problem set: 0 solved, 1024 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1501 variables, 59/611 constraints. Problems are: Problem set: 0 solved, 1024 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1501 variables, 1024/1635 constraints. Problems are: Problem set: 0 solved, 1024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1501/1501 variables, and 1635 constraints, problems are : Problem set: 0 solved, 1024 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 476/476 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1024/1024 constraints, Known Traps: 19/19 constraints]
After SMT, in 60667ms problems are : Problem set: 0 solved, 1024 unsolved
Search for dead transitions found 0 dead transitions in 60679ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61662 ms. Remains : 476/476 places, 1028/1028 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 476 transition count 1025
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 1 with 17 rules applied. Total rules applied 20 place count 476 transition count 1008
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 476 transition count 1008
Applied a total of 25 rules in 31 ms. Remains 476 /476 variables (removed 0) and now considering 1008/1028 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1008 rows 476 cols
[2024-05-26 07:12:21] [INFO ] Computed 57 invariants in 8 ms
[2024-05-26 07:12:21] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 07:12:21] [INFO ] [Nat]Absence check using 57 positive place invariants in 10 ms returned sat
[2024-05-26 07:12:22] [INFO ] After 371ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-26 07:12:22] [INFO ] After 535ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-26 07:12:22] [INFO ] After 729ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-26 07:12:22] [INFO ] Flatten gal took : 66 ms
[2024-05-26 07:12:22] [INFO ] Flatten gal took : 41 ms
[2024-05-26 07:12:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1006759315153686271.gal : 14 ms
[2024-05-26 07:12:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12479792093839387063.prop : 0 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/ReachabilityCardinality1006759315153686271.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12479792093839387063.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/ReachabilityCardinality12479792093839387063.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 88
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :88 after 272
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :272 after 722
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :722 after 2868
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2868 after 16072
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :16072 after 352905
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :352905 after 2.50454e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.50454e+06 after 9.04071e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :9.04071e+06 after 6.55849e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :6.55849e+08 after 1.83121e+10
Detected timeout of ITS tools.
[2024-05-26 07:12:37] [INFO ] Flatten gal took : 82 ms
[2024-05-26 07:12:37] [INFO ] Applying decomposition
[2024-05-26 07:12:37] [INFO ] Flatten gal took : 40 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/graph15923529490460105289.txt' '-o' '/tmp/graph15923529490460105289.bin' '-w' '/tmp/graph15923529490460105289.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15923529490460105289.bin' '-l' '-1' '-v' '-w' '/tmp/graph15923529490460105289.weights' '-q' '0' '-e' '0.001'
[2024-05-26 07:12:38] [INFO ] Decomposing Gal with order
[2024-05-26 07:12:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 07:12:38] [INFO ] Removed a total of 727 redundant transitions.
[2024-05-26 07:12:38] [INFO ] Flatten gal took : 123 ms
[2024-05-26 07:12:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 546 labels/synchronizations in 29 ms.
[2024-05-26 07:12:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8398748973312045179.gal : 12 ms
[2024-05-26 07:12:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18441791752978307995.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/ReachabilityCardinality8398748973312045179.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18441791752978307995.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/ReachabilityCardinality18441791752978307995.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 35
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :35 after 987
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :987 after 2517
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2517 after 7991
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :7991 after 3.47598e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3.47598e+07 after 4.55787e+10
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.55787e+10 after 7.46998e+11
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7.46998e+11 after 1.73105e+12
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.73105e+12 after 5.2939e+13
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5.2939e+13 after 2.8065e+14
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.8065e+14 after 2.15752e+16
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31820 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-26 07:12:53] [INFO ] Flatten gal took : 65 ms
[2024-05-26 07:12:53] [INFO ] Applying decomposition
[2024-05-26 07:12:53] [INFO ] Flatten gal took : 62 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/graph8781174542862070827.txt' '-o' '/tmp/graph8781174542862070827.bin' '-w' '/tmp/graph8781174542862070827.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8781174542862070827.bin' '-l' '-1' '-v' '-w' '/tmp/graph8781174542862070827.weights' '-q' '0' '-e' '0.001'
[2024-05-26 07:12:53] [INFO ] Decomposing Gal with order
[2024-05-26 07:12:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 07:12:54] [INFO ] Removed a total of 2061 redundant transitions.
[2024-05-26 07:12:54] [INFO ] Flatten gal took : 125 ms
[2024-05-26 07:12:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 156 labels/synchronizations in 60 ms.
[2024-05-26 07:12:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5390246764778074534.gal : 22 ms
[2024-05-26 07:12:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2825422501416899817.prop : 0 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/ReachabilityCardinality5390246764778074534.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2825422501416899817.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/ReachabilityCardinality2825422501416899817.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :10 after 157
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :56366 after 2.59165e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.59165e+06 after 4.75733e+13
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.75733e+13 after 8.68199e+18
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :8.68199e+18 after 6.7662e+19
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6.7662e+19 after 7.09488e+25
ITS-tools command line returned an error code 137
[2024-05-26 07:22:22] [INFO ] Flatten gal took : 35 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14128700034483064127
[2024-05-26 07:22:22] [INFO ] Applying decomposition
[2024-05-26 07:22:22] [INFO ] Flatten gal took : 71 ms
[2024-05-26 07:22:22] [INFO ] Computing symmetric may disable matrix : 1028 transitions.
[2024-05-26 07:22:22] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:22:22] [INFO ] Computing symmetric may enable matrix : 1028 transitions.
[2024-05-26 07:22:22] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph10895156735105219563.txt' '-o' '/tmp/graph10895156735105219563.bin' '-w' '/tmp/graph10895156735105219563.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10895156735105219563.bin' '-l' '-1' '-v' '-w' '/tmp/graph10895156735105219563.weights' '-q' '0' '-e' '0.001'
[2024-05-26 07:22:22] [INFO ] Decomposing Gal with order
[2024-05-26 07:22:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 07:22:22] [INFO ] Removed a total of 678 redundant transitions.
[2024-05-26 07:22:22] [INFO ] Computing Do-Not-Accords matrix : 1028 transitions.
[2024-05-26 07:22:22] [INFO ] Flatten gal took : 62 ms
[2024-05-26 07:22:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 577 labels/synchronizations in 12 ms.
[2024-05-26 07:22:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3009586192386000855.gal : 8 ms
[2024-05-26 07:22:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10060878840382289902.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/ReachabilityCardinality3009586192386000855.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10060878840382289902.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
[2024-05-26 07:22:22] [INFO ] Computation of Completed DNA matrix. took 88 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 07:22:22] [INFO ] Built C files in 453ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14128700034483064127
Running compilation step : cd /tmp/ltsmin14128700034483064127;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' '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'
Loading property file /tmp/ReachabilityCardinality10060878840382289902.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7 after 145
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :145 after 241
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :241 after 385
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :385 after 397
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :397 after 787
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :787 after 5.84514e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.84514e+08 after 8.42124e+10
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :8.42124e+10 after 8.9226e+11
Compilation finished in 3945 ms.
Running link step : cd /tmp/ltsmin14128700034483064127;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin14128700034483064127;'/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' 'NoC3x3PT6BReachabilityCardinality202414==true'
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :8.9226e+11 after 3.17581e+18
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3.17581e+18 after 5.32146e+18
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :5.32146e+18 after 8.41235e+19
Detected timeout of ITS tools.
[2024-05-26 07:46:13] [INFO ] Applying decomposition
[2024-05-26 07:46:13] [INFO ] Flatten gal took : 94 ms
[2024-05-26 07:46:13] [INFO ] Decomposing Gal with order
[2024-05-26 07:46:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 07:46:13] [INFO ] Removed a total of 832 redundant transitions.
[2024-05-26 07:46:13] [INFO ] Flatten gal took : 187 ms
[2024-05-26 07:46:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 609 labels/synchronizations in 57 ms.
[2024-05-26 07:46:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17935687222044243135.gal : 26 ms
[2024-05-26 07:46:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9526279618001584643.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/ReachabilityCardinality17935687222044243135.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9526279618001584643.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/ReachabilityCardinality9526279618001584643.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 177
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :177 after 433
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :433 after 473
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :473 after 1561
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1561 after 1.64227e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.64227e+07 after 1.02104e+10
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.02104e+10 after 5.1229e+11
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5.1229e+11 after 9.97493e+19
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :9.97493e+19 after 9.98385e+19
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :9.98385e+19 after 2.10048e+20
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.10048e+20 after 3.4338e+20
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :3.4338e+20 after 3.55163e+20
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :3.55163e+20 after 1.57061e+21
Detected timeout of ITS tools.
[2024-05-26 08:10:04] [INFO ] Flatten gal took : 87 ms
[2024-05-26 08:10:04] [INFO ] Input system was already deterministic with 1028 transitions.
[2024-05-26 08:10:04] [INFO ] Transformed 476 places.
[2024-05-26 08:10:04] [INFO ] Transformed 1028 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-26 08:10:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14188931097709965221.gal : 13 ms
[2024-05-26 08:10:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5421408776500125885.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/ReachabilityCardinality14188931097709965221.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5421408776500125885.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...374
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityCardinality5421408776500125885.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 17
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :17 after 55
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :55 after 57
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :57 after 77
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :77 after 217
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :217 after 457
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :457 after 3637
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3637 after 10649
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :10649 after 22717
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :22717 after 216925
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :216925 after 9.51786e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :9.51786e+06 after 1.21639e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.21639e+08 after 3.40213e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :3.40213e+09 after 1.65355e+10

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="NoC3x3-PT-6B"
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 NoC3x3-PT-6B, 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 r246-tall-171654352100646"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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