fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r142-tall-174876812200247
Last Updated
June 24, 2025

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
0.000 3600000.00 0.00 0.00 FT?T?TFFFTTTTT?F normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812200247.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is NoC3x3-PT-6B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812200247
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 956K
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 552K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2025-00
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2025-01
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2025-02
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2025-03
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2025-04
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2025-05
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2025-06
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2025-07
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2025-08
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2025-09
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2025-10
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2025-11
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2025-12
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2025-13
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2025-14
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748840478821

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
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
ReachabilityFireability PT
Running Version 202505121319
[2025-06-02 05:01:20] [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]
[2025-06-02 05:01:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:01:20] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2025-06-02 05:01:20] [INFO ] Transformed 1544 places.
[2025-06-02 05:01:20] [INFO ] Transformed 2229 transitions.
[2025-06-02 05:01:20] [INFO ] Found NUPN structural information;
[2025-06-02 05:01:20] [INFO ] Parsed PT model containing 1544 places and 2229 transitions and 6663 arcs in 252 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (89 resets) in 1825 ms. (21 steps per ms) remains 6/16 properties
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (10 resets) in 411 ms. (97 steps per ms) remains 6/6 properties
[2025-06-02 05:01:21] [INFO ] Flatten gal took : 330 ms
BEST_FIRST walk for 40004 steps (11 resets) in 357 ms. (111 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 287 ms. (138 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (11 resets) in 146 ms. (272 steps per ms) remains 5/6 properties
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2025-06-02 05:01:21] [INFO ] Flatten gal took : 300 ms
BEST_FIRST walk for 40003 steps (8 resets) in 269 ms. (148 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (11 resets) in 287 ms. (138 steps per ms) remains 5/5 properties
[2025-06-02 05:01:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9657636915273879794.gal : 101 ms
[2025-06-02 05:01:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3117938518464810819.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9657636915273879794.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3117938518464810819.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
// Phase 1: matrix 2229 rows 1544 cols
[2025-06-02 05:01:21] [INFO ] Computed 66 invariants in 25 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Loading property file /tmp/ReachabilityCardinality3117938518464810819.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1416/1528 variables, 65/177 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1528 variables, 1416/1593 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1528 variables, 0/1593 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 16/1544 variables, 1/1594 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1544 variables, 16/1610 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1544 variables, 0/1610 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :6 after 14
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :14 after 26
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :26 after 33
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :33 after 43
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :43 after 129
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :129 after 399
At refinement iteration 8 (OVERLAPS) 2229/3773 variables, 1544/3154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3773 variables, 0/3154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :399 after 23599
At refinement iteration 10 (OVERLAPS) 0/3773 variables, 0/3154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :23599 after 1.84272e+06
After SMT solving in domain Real declared 3773/3773 variables, and 3154 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2834 ms.
Refiners :[Domain max(s): 1544/1544 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1544/1544 constraints, PredecessorRefiner: 5/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1416/1528 variables, 65/177 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1528 variables, 1416/1593 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :1.84272e+06 after 1.85753e+06
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:01:26] [INFO ] Deduced a trap composed of 115 places in 482 ms of which 146 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1528 variables, 1/1594 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :1.85753e+06 after 1.50644e+08
At refinement iteration 5 (INCLUDED_ONLY) 0/1528 variables, 0/1594 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 16/1544 variables, 1/1595 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1544 variables, 16/1611 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1544 variables, 0/1611 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :1.50644e+08 after 4.04598e+08
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3773/3773 variables, and 3155 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5018 ms.
Refiners :[Domain max(s): 1544/1544 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1544/1544 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7998ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 112 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 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1544 transition count 2029
Reduce places removed 200 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 206 rules applied. Total rules applied 406 place count 1344 transition count 2023
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 412 place count 1338 transition count 2023
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 412 place count 1338 transition count 1965
Deduced a syphon composed of 58 places in 8 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 528 place count 1280 transition count 1965
Discarding 258 places :
Symmetric choice reduction at 3 with 258 rule applications. Total rules 786 place count 1022 transition count 1707
Iterating global reduction 3 with 258 rules applied. Total rules applied 1044 place count 1022 transition count 1707
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 1044 place count 1022 transition count 1684
Deduced a syphon composed of 23 places in 13 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 1090 place count 999 transition count 1684
Discarding 90 places :
Symmetric choice reduction at 3 with 90 rule applications. Total rules 1180 place count 909 transition count 1434
Iterating global reduction 3 with 90 rules applied. Total rules applied 1270 place count 909 transition count 1434
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1312 place count 867 transition count 1345
Iterating global reduction 3 with 42 rules applied. Total rules applied 1354 place count 867 transition count 1345
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1368 place count 853 transition count 1317
Iterating global reduction 3 with 14 rules applied. Total rules applied 1382 place count 853 transition count 1317
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1389 place count 846 transition count 1303
Iterating global reduction 3 with 7 rules applied. Total rules applied 1396 place count 846 transition count 1303
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1398 place count 844 transition count 1299
Iterating global reduction 3 with 2 rules applied. Total rules applied 1400 place count 844 transition count 1299
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1402 place count 842 transition count 1295
Iterating global reduction 3 with 2 rules applied. Total rules applied 1404 place count 842 transition count 1295
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1407 place count 842 transition count 1292
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 3 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 4 with 224 rules applied. Total rules applied 1631 place count 730 transition count 1180
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1633 place count 728 transition count 1170
Iterating global reduction 4 with 2 rules applied. Total rules applied 1635 place count 728 transition count 1170
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 1837 place count 627 transition count 1209
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 1895 place count 598 transition count 1228
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 1919 place count 598 transition count 1204
Free-agglomeration rule applied 26 times.
Iterating global reduction 4 with 26 rules applied. Total rules applied 1945 place count 598 transition count 1178
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 34 rules applied. Total rules applied 1979 place count 572 transition count 1170
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1981 place count 572 transition count 1168
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1983 place count 572 transition count 1168
Applied a total of 1983 rules in 896 ms. Remains 572 /1544 variables (removed 972) and now considering 1168/2229 (removed 1061) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 903 ms. Remains : 572/1544 places, 1168/2229 transitions.
RANDOM walk for 40000 steps (179 resets) in 909 ms. (43 steps per ms) remains 4/5 properties
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (15 resets) in 161 ms. (246 steps per ms) remains 3/4 properties
FORMULA NoC3x3-PT-6B-ReachabilityFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (13 resets) in 156 ms. (254 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (13 resets) in 172 ms. (231 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (18 resets) in 169 ms. (235 steps per ms) remains 3/3 properties
[2025-06-02 05:01:31] [INFO ] Flow matrix only has 1165 transitions (discarded 3 similar events)
// Phase 1: matrix 1165 rows 572 cols
[2025-06-02 05:01:31] [INFO ] Computed 66 invariants in 11 ms
[2025-06-02 05:01:31] [INFO ] State equation strengthened by 54 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 491/566 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/572 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/572 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1165/1737 variables, 572/638 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1737 variables, 54/692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1737 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1737 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1737/1737 variables, and 692 constraints, problems are : Problem set: 0 solved, 3 unsolved in 518 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 572/572 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 491/566 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/572 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/572 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1165/1737 variables, 572/638 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1737 variables, 54/692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1737 variables, 1/693 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1737 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1737 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1737/1737 variables, and 693 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1900 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 572/572 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2465ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1195 ms.
Support contains 75 out of 572 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 572/572 places, 1168/1168 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 572 transition count 1166
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 570 transition count 1166
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 570 transition count 1161
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 565 transition count 1161
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 559 transition count 1149
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 559 transition count 1149
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 58 place count 543 transition count 1133
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 541 transition count 1127
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 541 transition count 1127
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 74 place count 535 transition count 1129
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 82 place count 535 transition count 1121
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 85 place count 532 transition count 1091
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 532 transition count 1091
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 91 place count 532 transition count 1088
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 94 place count 529 transition count 1088
Applied a total of 94 rules in 109 ms. Remains 529 /572 variables (removed 43) and now considering 1088/1168 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 529/572 places, 1088/1168 transitions.
RANDOM walk for 40000 steps (191 resets) in 349 ms. (114 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (17 resets) in 171 ms. (232 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (17 resets) in 208 ms. (191 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (18 resets) in 153 ms. (259 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 232705 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 3
Probabilistic random walk after 232705 steps, saw 160725 distinct states, run finished after 3007 ms. (steps per millisecond=77 ) properties seen :0
// Phase 1: matrix 1088 rows 529 cols
[2025-06-02 05:01:38] [INFO ] Computed 66 invariants in 7 ms
[2025-06-02 05:01:38] [INFO ] State equation strengthened by 54 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 448/523 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/523 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/529 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/529 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1088/1617 variables, 529/595 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1617 variables, 54/649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1617 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1617 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1617/1617 variables, and 649 constraints, problems are : Problem set: 0 solved, 3 unsolved in 512 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 529/529 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 448/523 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/523 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/529 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/529 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1088/1617 variables, 529/595 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1617 variables, 54/649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1617 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:01:39] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1617 variables, 1/651 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1617 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1617 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1617/1617 variables, and 651 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1878 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 529/529 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2420ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 780 ms.
Support contains 75 out of 529 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 529/529 places, 1088/1088 transitions.
Applied a total of 0 rules in 14 ms. Remains 529 /529 variables (removed 0) and now considering 1088/1088 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 529/529 places, 1088/1088 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 529/529 places, 1088/1088 transitions.
Applied a total of 0 rules in 24 ms. Remains 529 /529 variables (removed 0) and now considering 1088/1088 (removed 0) transitions.
[2025-06-02 05:01:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:01:41] [INFO ] Implicit Places using invariants in 242 ms returned [399, 443]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 252 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 527/529 places, 1088/1088 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 522 transition count 1083
Applied a total of 10 rules in 26 ms. Remains 522 /527 variables (removed 5) and now considering 1083/1088 (removed 5) transitions.
// Phase 1: matrix 1083 rows 522 cols
[2025-06-02 05:01:41] [INFO ] Computed 64 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:01:41] [INFO ] Implicit Places using invariants in 219 ms returned []
[2025-06-02 05:01:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:01:42] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-02 05:01:42] [INFO ] Implicit Places using invariants and state equation in 793 ms returned []
Implicit Place search using SMT with State Equation took 1016 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 522/529 places, 1083/1088 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1320 ms. Remains : 522/529 places, 1083/1088 transitions.
RANDOM walk for 40000 steps (196 resets) in 241 ms. (165 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (14 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (20 resets) in 111 ms. (357 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (15 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 231512 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 3
Probabilistic random walk after 231512 steps, saw 197495 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
[2025-06-02 05:01:45] [INFO ] Invariant cache hit.
[2025-06-02 05:01:45] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 441/516 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/516 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/522 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1083/1605 variables, 522/586 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1605 variables, 55/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1605 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1605 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1605/1605 variables, and 641 constraints, problems are : Problem set: 0 solved, 3 unsolved in 536 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, State Equation: 522/522 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 441/516 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/516 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/522 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1083/1605 variables, 522/586 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1605 variables, 55/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1605 variables, 1/642 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:01:48] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1605 variables, 1/643 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:01:48] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1605 variables, 1/644 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1605 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1605 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1605/1605 variables, and 644 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2670 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, State Equation: 522/522 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3260ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 899 ms.
Support contains 75 out of 522 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 1083/1083 transitions.
Applied a total of 0 rules in 13 ms. Remains 522 /522 variables (removed 0) and now considering 1083/1083 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 522/522 places, 1083/1083 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 1083/1083 transitions.
Applied a total of 0 rules in 13 ms. Remains 522 /522 variables (removed 0) and now considering 1083/1083 (removed 0) transitions.
[2025-06-02 05:01:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:01:50] [INFO ] Implicit Places using invariants in 230 ms returned []
[2025-06-02 05:01:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:01:50] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-02 05:01:51] [INFO ] Implicit Places using invariants and state equation in 782 ms returned []
Implicit Place search using SMT with State Equation took 1015 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:01:51] [INFO ] Redundant transitions in 77 ms returned []
Running 1081 sub problems to find dead transitions.
[2025-06-02 05:01:51] [INFO ] Invariant cache hit.
[2025-06-02 05:01:51] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 1 (OVERLAPS) 1/522 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:15] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:15] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:15] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:15] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:15] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:16] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:16] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:16] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:16] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:16] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:16] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:17] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:17] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:17] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:17] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:17] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:18] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:19] [INFO ] Deduced a trap composed of 14 places in 224 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:19] [INFO ] Deduced a trap composed of 16 places in 225 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:19] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 522/1605 variables, and 84 constraints, problems are : Problem set: 0 solved, 1081 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, State Equation: 0/522 constraints, ReadFeed: 0/55 constraints, PredecessorRefiner: 1081/1081 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1081 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 1 (OVERLAPS) 1/522 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:30] [INFO ] Deduced a trap composed of 27 places in 170 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:30] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:32] [INFO ] Deduced a trap composed of 14 places in 243 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:32] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:32] [INFO ] Deduced a trap composed of 20 places in 221 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:32] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:33] [INFO ] Deduced a trap composed of 31 places in 203 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:33] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:33] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:33] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:35] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:35] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:35] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:36] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:36] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:39] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:39] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:41] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:41] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/522 variables, 19/103 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:50] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 8 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 1)
(s37 0)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 1)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 1)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 1)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 1)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 1)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 1)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 1)
(s164 1)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 1)
(s175 1)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 1)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 1)
(s203 0)
(s204 1)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 1)
(s222 1)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 1)
(s237 1)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 1)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 1)
(s280 0)
(s281 0)
(s282 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 522/1605 variables, and 104 constraints, problems are : Problem set: 0 solved, 1081 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, State Equation: 0/522 constraints, ReadFeed: 0/55 constraints, PredecessorRefiner: 0/1081 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60377ms problems are : Problem set: 0 solved, 1081 unsolved
Search for dead transitions found 0 dead transitions in 60383ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61503 ms. Remains : 522/522 places, 1083/1083 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 2101 edges and 522 vertex of which 517 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 517 transition count 1082
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 516 transition count 1082
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 33 place count 501 transition count 1067
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 57 place count 501 transition count 1043
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 65 place count 501 transition count 1043
Applied a total of 65 rules in 47 ms. Remains 501 /522 variables (removed 21) and now considering 1043/1083 (removed 40) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1043 rows 501 cols
[2025-06-02 05:02:51] [INFO ] Computed 59 invariants in 9 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 05:02:51] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 05:02:51] [INFO ] [Nat]Absence check using 59 positive place invariants in 12 ms returned sat
[2025-06-02 05:02:52] [INFO ] After 472ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2025-06-02 05:02:52] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-02 05:02:52] [INFO ] After 254ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:52] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:52] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 2 ms to minimize.
[2025-06-02 05:02:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 215 ms
TRAPS : Iteration 1
[2025-06-02 05:02:53] [INFO ] After 988ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2025-06-02 05:02:53] [INFO ] After 1762ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2025-06-02 05:02:53] [INFO ] Flatten gal took : 45 ms
[2025-06-02 05:02:53] [INFO ] Flatten gal took : 40 ms
[2025-06-02 05:02:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8410716482862191394.gal : 9 ms
[2025-06-02 05:02:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2037928629261610868.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8410716482862191394.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2037928629261610868.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality2037928629261610868.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :4 after 7
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :7 after 13
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :13 after 37
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :37 after 99
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :99 after 414
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :414 after 942
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :942 after 8397
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :8397 after 1.47668e+07
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1.47668e+07 after 2.28586e+07
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :2.28586e+07 after 2.52675e+09
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :2.52675e+09 after 1.46468e+10
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :1.46468e+10 after 4.96183e+10
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :4.96183e+10 after 4.67881e+12
Detected timeout of ITS tools.
[2025-06-02 05:03:08] [INFO ] Flatten gal took : 35 ms
[2025-06-02 05:03:08] [INFO ] Applying decomposition
[2025-06-02 05:03:08] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1942524960635588946.txt' '-o' '/tmp/graph1942524960635588946.bin' '-w' '/tmp/graph1942524960635588946.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1942524960635588946.bin' '-l' '-1' '-v' '-w' '/tmp/graph1942524960635588946.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:03:09] [INFO ] Decomposing Gal with order
[2025-06-02 05:03:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:03:09] [INFO ] Removed a total of 644 redundant transitions.
[2025-06-02 05:03:09] [INFO ] Flatten gal took : 370 ms
[2025-06-02 05:03:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 518 labels/synchronizations in 64 ms.
[2025-06-02 05:03:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11716391195502949436.gal : 31 ms
[2025-06-02 05:03:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4379873095673459506.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11716391195502949436.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4379873095673459506.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality4379873095673459506.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1 after 34
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :34 after 406
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :406 after 69238
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :69238 after 3.62906e+06
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :3.62906e+06 after 4.47403e+09
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :4.47403e+09 after 1.21695e+13
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :1.21695e+13 after 2.05887e+15
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :2.05887e+15 after 1.03538e+17
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :1.03538e+17 after 2.25874e+23
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 33508 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 05:03:25] [INFO ] Flatten gal took : 53 ms
[2025-06-02 05:03:25] [INFO ] Applying decomposition
[2025-06-02 05:03:25] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph142036761650309282.txt' '-o' '/tmp/graph142036761650309282.bin' '-w' '/tmp/graph142036761650309282.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph142036761650309282.bin' '-l' '-1' '-v' '-w' '/tmp/graph142036761650309282.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:03:25] [INFO ] Decomposing Gal with order
[2025-06-02 05:03:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:03:25] [INFO ] Removed a total of 2024 redundant transitions.
[2025-06-02 05:03:25] [INFO ] Flatten gal took : 110 ms
[2025-06-02 05:03:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 134 labels/synchronizations in 57 ms.
[2025-06-02 05:03:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3863647539330150057.gal : 17 ms
[2025-06-02 05:03:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17591828093600749234.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3863647539330150057.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17591828093600749234.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality17591828093600749234.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :10 after 58
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :56366 after 2.09146e+09
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :2.09146e+09 after 4.54143e+10
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :4.54143e+10 after 1.95711e+14
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :1.95711e+14 after 3.81689e+18
Detected timeout of ITS tools.
[2025-06-02 05:33:29] [INFO ] Flatten gal took : 381 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15803408663861842258
[2025-06-02 05:33:30] [INFO ] Applying decomposition
[2025-06-02 05:33:30] [INFO ] Computing symmetric may disable matrix : 1083 transitions.
[2025-06-02 05:33:30] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 05:33:30] [INFO ] Computing symmetric may enable matrix : 1083 transitions.
[2025-06-02 05:33:30] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 05:33:30] [INFO ] Flatten gal took : 256 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18133600339946447663.txt' '-o' '/tmp/graph18133600339946447663.bin' '-w' '/tmp/graph18133600339946447663.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18133600339946447663.bin' '-l' '-1' '-v' '-w' '/tmp/graph18133600339946447663.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:33:32] [INFO ] Computing Do-Not-Accords matrix : 1083 transitions.
[2025-06-02 05:33:32] [INFO ] Decomposing Gal with order
[2025-06-02 05:33:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:33:32] [INFO ] Computation of Completed DNA matrix. took 48 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 05:33:33] [INFO ] Built C files in 2789ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15803408663861842258
Running compilation step : cd /tmp/ltsmin15803408663861842258;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-02 05:33:33] [INFO ] Removed a total of 668 redundant transitions.
[2025-06-02 05:33:33] [INFO ] Flatten gal took : 444 ms
[2025-06-02 05:33:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 537 labels/synchronizations in 65 ms.
[2025-06-02 05:33:33] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability14815493810074635280.gal : 14 ms
[2025-06-02 05:33:33] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9417760651235491514.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability14815493810074635280.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability9417760651235491514.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability9417760651235491514.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1 after 19
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :19 after 3337
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :3337 after 342865
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :342865 after 2.93014e+07
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :2.93014e+07 after 1.99835e+08
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1.99835e+08 after 2.71916e+16
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :2.71916e+16 after 1.11075e+18
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :1.11075e+18 after 1.09475e+19
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :1.09475e+19 after 7.95437e+20
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :7.95437e+20 after 5.19175e+21
Compilation finished in 61387 ms.
Running link step : cd /tmp/ltsmin15803408663861842258;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin15803408663861842258;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'NoC3x3PT6BReachabilityFireability202502==true'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin15803408663861842258;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'NoC3x3PT6BReachabilityFireability202502==true'
Running LTSmin : cd /tmp/ltsmin15803408663861842258;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'NoC3x3PT6BReachabilityFireability202504==true'
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :5.19175e+21 after 9.26181e+25
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin15803408663861842258;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'NoC3x3PT6BReachabilityFireability202504==true'
Running LTSmin : cd /tmp/ltsmin15803408663861842258;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'NoC3x3PT6BReachabilityFireability202514==true'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin15803408663861842258;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'NoC3x3PT6BReachabilityFireability202514==true'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin15803408663861842258;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'NoC3x3PT6BReachabilityFireability202502==true'
SDD proceeding with computation,3 properties remain. new max is 131072
SDD size :9.26181e+25 after 1.13009e+26

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
+ [[ 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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="NoC3x3-PT-6B"
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-5832"
echo " Executing tool itstools"
echo " Input is NoC3x3-PT-6B, 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 r142-tall-174876812200247"
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 [ "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.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 ;