Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r156-tall-174881253800343.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 PolyORBLF-COL-S04J06T06, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881253800343
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K 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.3K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-00
FORMULA_NAME PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-01
FORMULA_NAME PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-02
FORMULA_NAME PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-03
FORMULA_NAME PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-04
FORMULA_NAME PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-05
FORMULA_NAME PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-06
FORMULA_NAME PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-07
FORMULA_NAME PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-08
FORMULA_NAME PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-09
FORMULA_NAME PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-10
FORMULA_NAME PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-11
FORMULA_NAME PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-12
FORMULA_NAME PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-13
FORMULA_NAME PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-14
FORMULA_NAME PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748940553472

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J06T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
ReachabilityFireability COL
Running Version 202505121319
[2025-06-03 08:49:14] [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-03 08:49:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 08:49:14] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-03 08:49:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-03 08:49:15] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 681 ms
[2025-06-03 08:49:15] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 618 PT places and 3232.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
[2025-06-03 08:49:15] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2025-06-03 08:49:15] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Remains 1 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 490 steps (0 resets) in 33 ms. (14 steps per ms) remains 0/1 properties
[2025-06-03 08:49:15] [INFO ] Flatten gal took : 38 ms
[2025-06-03 08:49:15] [INFO ] Flatten gal took : 8 ms
[2025-06-03 08:49:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15695013595804680210.gal : 9 ms
[2025-06-03 08:49:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11117987448928334299.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/ReachabilityCardinality15695013595804680210.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11117987448928334299.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

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 ...330
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2025-06-03 08:49:15] [INFO ] Flatten gal took : 10 ms
[2025-06-03 08:49:15] [INFO ] Flatten gal took : 7 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-03 08:49:15] [INFO ] Flatten gal took : 8 ms
[2025-06-03 08:49:15] [INFO ] Flatten gal took : 9 ms
[2025-06-03 08:49:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8035779455616214022.gal : 7 ms
[2025-06-03 08:49:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4651087760030084817.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/ReachabilityCardinality8035779455616214022.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4651087760030084817.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
ITS runner timed out or was interrupted.
Loading property file /tmp/ReachabilityCardinality4651087760030084817.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,5,0.012782,4440,2,186,5,351,6,0,419,113,0
Total reachable state count : 5

ITS tools runner thread asked to quit. Dying gracefully.
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2025-06-03 08:49:15] [INFO ] Unfolded HLPN to a Petri net with 618 places and 3190 transitions 21570 arcs in 91 ms.
[2025-06-03 08:49:15] [INFO ] Unfolded 16 HLPN properties in 3 ms.
[2025-06-03 08:49:15] [INFO ] Reduced 1326 identical enabling conditions.
[2025-06-03 08:49:15] [INFO ] Reduced 1326 identical enabling conditions.
[2025-06-03 08:49:15] [INFO ] Reduced 264 identical enabling conditions.
[2025-06-03 08:49:15] [INFO ] Reduced 264 identical enabling conditions.
[2025-06-03 08:49:15] [INFO ] Reduced 1326 identical enabling conditions.
[2025-06-03 08:49:15] [INFO ] Reduced 36 identical enabling conditions.
[2025-06-03 08:49:15] [INFO ] Reduced 36 identical enabling conditions.
[2025-06-03 08:49:15] [INFO ] Reduced 1326 identical enabling conditions.
[2025-06-03 08:49:15] [INFO ] Reduced 264 identical enabling conditions.
[2025-06-03 08:49:15] [INFO ] Reduced 1326 identical enabling conditions.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
RANDOM walk for 40000 steps (10 resets) in 2173 ms. (18 steps per ms) remains 8/16 properties
FORMULA PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-03 08:49:16] [INFO ] Flatten gal took : 361 ms
[2025-06-03 08:49:16] [INFO ] Flatten gal took : 237 ms
[2025-06-03 08:49:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13067250156073374210.gal : 66 ms
[2025-06-03 08:49:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1745824280308040954.prop : 57 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/ReachabilityCardinality13067250156073374210.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1745824280308040954.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 ...329
BEST_FIRST walk for 40002 steps (8 resets) in 2134 ms. (18 steps per ms) remains 8/8 properties
Loading property file /tmp/ReachabilityCardinality1745824280308040954.prop.
BEST_FIRST walk for 40002 steps (9 resets) in 1531 ms. (26 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1566 ms. (25 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 898 ms. (44 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 3
BEST_FIRST walk for 40003 steps (8 resets) in 1777 ms. (22 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :7 after 12
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :12 after 14
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :14 after 24
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :24 after 29
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :29 after 256
BEST_FIRST walk for 40003 steps (16 resets) in 3462 ms. (11 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :256 after 957
BEST_FIRST walk for 40002 steps (8 resets) in 966 ms. (41 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (10 resets) in 797 ms. (50 steps per ms) remains 8/8 properties
[2025-06-03 08:49:20] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
// Phase 1: matrix 1540 rows 618 cols
[2025-06-03 08:49:20] [INFO ] Computed 54 invariants in 95 ms
[2025-06-03 08:49:20] [INFO ] State equation strengthened by 120 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :957 after 3813
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/600 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 6/606 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-00 is UNSAT
FORMULA PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/606 variables, 13/50 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/606 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-02 is UNSAT
FORMULA PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-04 is UNSAT
FORMULA PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-05 is UNSAT
FORMULA PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-13 is UNSAT
FORMULA PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-13 FALSE TECHNIQUES SMT_REFINEMENT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 618/2158 variables, and 54 constraints, problems are : Problem set: 5 solved, 3 unsolved in 5028 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 0/618 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 8/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 4/6 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/473 variables, 0/6 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 46/519 variables, 16/22 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/519 variables, 7/29 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/29 constraints. Problems are: Problem set: 5 solved, 3 unsolved
Problem PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-06 is UNSAT
FORMULA PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-06 TRUE TECHNIQUES SMT_REFINEMENT
Solver is answering 'unknown', stopping.
Problem PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-07 is UNSAT
FORMULA PolyORBLF-COL-S04J06T06-ReachabilityFireability-2025-07 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 618/2158 variables, and 54 constraints, problems are : Problem set: 6 solved, 2 unsolved in 3092 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 0/618 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8323ms problems are : Problem set: 6 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 294 out of 618 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 618/618 places, 1564/1564 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 618 transition count 1552
Reduce places removed 12 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 24 rules applied. Total rules applied 36 place count 606 transition count 1540
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 48 place count 594 transition count 1540
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 48 place count 594 transition count 1534
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 60 place count 588 transition count 1534
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 72 place count 582 transition count 1528
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 78 place count 582 transition count 1522
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 84 place count 576 transition count 1522
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 90 place count 576 transition count 1522
Applied a total of 90 rules in 246 ms. Remains 576 /618 variables (removed 42) and now considering 1522/1564 (removed 42) transitions.
Running 1518 sub problems to find dead transitions.
[2025-06-03 08:49:29] [INFO ] Flow matrix only has 1498 transitions (discarded 24 similar events)
// Phase 1: matrix 1498 rows 576 cols
[2025-06-03 08:49:29] [INFO ] Computed 54 invariants in 51 ms
[2025-06-03 08:49:29] [INFO ] State equation strengthened by 120 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :82717 after 835045
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1518 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:47] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 7 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :835045 after 1.00742e+06
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:48] [INFO ] Deduced a trap composed of 76 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:48] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:48] [INFO ] Deduced a trap composed of 76 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:50] [INFO ] Deduced a trap composed of 76 places in 357 ms of which 67 ms to minimize.
SMT process timed out in 21791ms, After SMT, problems are : Problem set: 0 solved, 1518 unsolved
Search for dead transitions found 0 dead transitions in 21800ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22060 ms. Remains : 576/618 places, 1522/1564 transitions.
RANDOM walk for 40000 steps (9 resets) in 290 ms. (137 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1402 ms. (28 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 254798 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 1
Probabilistic random walk after 254798 steps, saw 161869 distinct states, run finished after 3004 ms. (steps per millisecond=84 ) properties seen :0
[2025-06-03 08:49:54] [INFO ] Flow matrix only has 1498 transitions (discarded 24 similar events)
[2025-06-03 08:49:54] [INFO ] Invariant cache hit.
[2025-06-03 08:49:54] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 157/451 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/451 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 123/574 variables, 33/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/576 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1498/2074 variables, 576/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2074 variables, 120/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2074 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2074 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2074/2074 variables, and 750 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3372 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 576/576 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 157/451 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/451 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 123/574 variables, 33/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:58] [INFO ] Deduced a trap composed of 76 places in 61 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:58] [INFO ] Deduced a trap composed of 76 places in 54 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/576 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:49:58] [INFO ] Deduced a trap composed of 76 places in 62 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/576 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1498/2074 variables, 576/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2074 variables, 120/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:00] [INFO ] Deduced a trap composed of 15 places in 201 ms of which 18 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2074 variables, 1/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2074 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2074 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2074/2074 variables, and 754 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3554 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 576/576 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6944ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 81 ms.
Support contains 294 out of 576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 1522/1522 transitions.
Applied a total of 0 rules in 27 ms. Remains 576 /576 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 576/576 places, 1522/1522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 1522/1522 transitions.
Applied a total of 0 rules in 26 ms. Remains 576 /576 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2025-06-03 08:50:01] [INFO ] Flow matrix only has 1498 transitions (discarded 24 similar events)
[2025-06-03 08:50:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:50:02] [INFO ] Implicit Places using invariants in 602 ms returned []
[2025-06-03 08:50:02] [INFO ] Flow matrix only has 1498 transitions (discarded 24 similar events)
[2025-06-03 08:50:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:50:02] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 08:50:08] [INFO ] Implicit Places using invariants and state equation in 6280 ms returned []
Implicit Place search using SMT with State Equation took 6891 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 08:50:08] [INFO ] Redundant transitions in 83 ms returned []
Running 1518 sub problems to find dead transitions.
[2025-06-03 08:50:08] [INFO ] Flow matrix only has 1498 transitions (discarded 24 similar events)
[2025-06-03 08:50:08] [INFO ] Invariant cache hit.
[2025-06-03 08:50:08] [INFO ] State equation strengthened by 120 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1518 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:25] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:25] [INFO ] Deduced a trap composed of 76 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:25] [INFO ] Deduced a trap composed of 76 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:25] [INFO ] Deduced a trap composed of 76 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:26] [INFO ] Deduced a trap composed of 76 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-03 08:50:26] [INFO ] Deduced a trap composed of 76 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:26] [INFO ] Deduced a trap composed of 277 places in 386 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:27] [INFO ] Deduced a trap composed of 109 places in 323 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:28] [INFO ] Deduced a trap composed of 278 places in 365 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:29] [INFO ] Deduced a trap composed of 283 places in 412 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:33] [INFO ] Deduced a trap composed of 325 places in 411 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:34] [INFO ] Deduced a trap composed of 259 places in 395 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:36] [INFO ] Deduced a trap composed of 271 places in 425 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:50:36] [INFO ] Deduced a trap composed of 15 places in 333 ms of which 28 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 568/2074 variables, and 60 constraints, problems are : Problem set: 0 solved, 1518 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 17/21 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/576 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1518/1104 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1518 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/568 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 1518 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:00] [INFO ] Deduced a trap composed of 259 places in 388 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:01] [INFO ] Deduced a trap composed of 42 places in 372 ms of which 48 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/2074 variables, and 62 constraints, problems are : Problem set: 0 solved, 1518 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 17/21 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/576 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 414/1104 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61681ms problems are : Problem set: 0 solved, 1518 unsolved
Search for dead transitions found 0 dead transitions in 61685ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68698 ms. Remains : 576/576 places, 1522/1522 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 576 transition count 1498
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 36 place count 570 transition count 1510
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 60 place count 570 transition count 1486
Applied a total of 60 rules in 82 ms. Remains 570 /576 variables (removed 6) and now considering 1486/1522 (removed 36) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1486 rows 570 cols
[2025-06-03 08:51:10] [INFO ] Computed 54 invariants in 46 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-03 08:51:10] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-03 08:51:10] [INFO ] [Real]Absence check using 19 positive and 35 generalized place invariants in 36 ms returned sat
[2025-06-03 08:51:10] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-03 08:51:10] [INFO ] [Nat]Absence check using 19 positive place invariants in 4 ms returned sat
[2025-06-03 08:51:10] [INFO ] [Nat]Absence check using 19 positive and 35 generalized place invariants in 29 ms returned sat
[2025-06-03 08:51:12] [INFO ] After 1961ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:12] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:13] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 4 ms to minimize.
[2025-06-03 08:51:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 546 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:15] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:16] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:16] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 4 ms to minimize.
[2025-06-03 08:51:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2098 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:51:17] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 4 ms to minimize.
[2025-06-03 08:51:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
TRAPS : Iteration 3
[2025-06-03 08:51:18] [INFO ] After 7583ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-03 08:51:18] [INFO ] After 8018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-03 08:51:18] [INFO ] Flatten gal took : 76 ms
[2025-06-03 08:51:18] [INFO ] Flatten gal took : 74 ms
[2025-06-03 08:51:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15743824315446349125.gal : 14 ms
[2025-06-03 08:51:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16456597604660750442.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/ReachabilityCardinality15743824315446349125.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16456597604660750442.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 ...330
Loading property file /tmp/ReachabilityCardinality16456597604660750442.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :16 after 49
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :49 after 69
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :69 after 549
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :549 after 2009
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2009 after 2145
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2145 after 2503
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2503 after 2918
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2918 after 3398
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3398 after 31423
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :31423 after 165825
Detected timeout of ITS tools.
[2025-06-03 08:51:33] [INFO ] Flatten gal took : 63 ms
[2025-06-03 08:51:33] [INFO ] Applying decomposition
[2025-06-03 08:51:33] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph13993423013839297960.txt' '-o' '/tmp/graph13993423013839297960.bin' '-w' '/tmp/graph13993423013839297960.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13993423013839297960.bin' '-l' '-1' '-v' '-w' '/tmp/graph13993423013839297960.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:51:34] [INFO ] Decomposing Gal with order
[2025-06-03 08:51:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:51:34] [INFO ] Removed a total of 690 redundant transitions.
[2025-06-03 08:51:34] [INFO ] Flatten gal took : 303 ms
[2025-06-03 08:51:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 382 labels/synchronizations in 44 ms.
[2025-06-03 08:51:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8553605640256086608.gal : 21 ms
[2025-06-03 08:51:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16422025407787131655.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8553605640256086608.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16422025407787131655.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/ReachabilityCardinality16422025407787131655.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :16 after 16
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 16
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :16 after 16
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :16 after 16
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :16 after 16
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :16 after 16
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :16 after 16
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :16 after 16
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :16 after 16
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :48 after 3815
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 39620 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-03 08:51:49] [INFO ] Flatten gal took : 62 ms
[2025-06-03 08:51:49] [INFO ] Applying decomposition
[2025-06-03 08:51:49] [INFO ] Flatten gal took : 60 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/graph11890347230132056298.txt' '-o' '/tmp/graph11890347230132056298.bin' '-w' '/tmp/graph11890347230132056298.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11890347230132056298.bin' '-l' '-1' '-v' '-w' '/tmp/graph11890347230132056298.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:51:50] [INFO ] Decomposing Gal with order
[2025-06-03 08:51:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:51:50] [INFO ] Removed a total of 1187 redundant transitions.
[2025-06-03 08:51:50] [INFO ] Flatten gal took : 116 ms
[2025-06-03 08:51:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 199 labels/synchronizations in 29 ms.
[2025-06-03 08:51:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6212910414157341006.gal : 16 ms
[2025-06-03 08:51:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5464425699433712557.prop : 2 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/ReachabilityCardinality6212910414157341006.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5464425699433712557.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 ...307
Loading property file /tmp/ReachabilityCardinality5464425699433712557.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 :1 after 1
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :19 after 41
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :41 after 41
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :41 after 41
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :41 after 135
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1411 after 4674
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :4674 after 4674
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :4674 after 40589
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :160438 after 288602
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :288602 after 1.02749e+06
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :7.51271e+06 after 9.90033e+06
SDD proceeding with computation,1 properties remain. new max is 1048576
SDD size :9.90033e+06 after 1.0937e+07
SDD proceeding with computation,1 properties remain. new max is 2097152
SDD size :9.02221e+07 after 1.18098e+08
Detected timeout of ITS tools.
[2025-06-03 09:21:52] [INFO ] Flatten gal took : 535 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13602996673053723421
[2025-06-03 09:21:52] [INFO ] Too many transitions (1522) to apply POR reductions. Disabling POR matrices.
[2025-06-03 09:21:52] [INFO ] Applying decomposition
[2025-06-03 09:21:53] [INFO ] Built C files in 405ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13602996673053723421
Running compilation step : cd /tmp/ltsmin13602996673053723421;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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-03 09:21:53] [INFO ] Flatten gal took : 521 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/graph15866193823502103988.txt' '-o' '/tmp/graph15866193823502103988.bin' '-w' '/tmp/graph15866193823502103988.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15866193823502103988.bin' '-l' '-1' '-v' '-w' '/tmp/graph15866193823502103988.weights' '-q' '0' '-e' '0.001'
[2025-06-03 09:21:55] [INFO ] Decomposing Gal with order
[2025-06-03 09:21:55] [INFO ] Rewriting arrays to variables to allow decomposition.
Compilation finished in 5170 ms.
Running link step : cd /tmp/ltsmin13602996673053723421;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin13602996673053723421;'/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' 'PolyORBLFCOLS04J06T06ReachabilityFireability202501==true'
[2025-06-03 09:21:58] [INFO ] Removed a total of 886 redundant transitions.
[2025-06-03 09:21:59] [INFO ] Flatten gal took : 3139 ms
[2025-06-03 09:21:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 555 labels/synchronizations in 172 ms.
[2025-06-03 09:21:59] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability16353364906399953905.gal : 95 ms
[2025-06-03 09:21:59] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability7113054702839205164.prop : 11 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/ReachabilityFireability16353364906399953905.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability7113054702839205164.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/ReachabilityFireability7113054702839205164.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 31
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :31 after 46
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :46 after 48
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :48 after 52
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :52 after 58
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :58 after 3813
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3813 after 38472
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :38472 after 267270
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :267270 after 5.23676e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5.23676e+06 after 2.53486e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.34125e+07 after 3.48571e+07
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :6.08243e+07 after 6.08243e+07

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
++ 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.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="PolyORBLF-COL-S04J06T06"
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 PolyORBLF-COL-S04J06T06, 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 r156-tall-174881253800343"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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