Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r018-smll-177946788000142.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is AutonomousCar-PT-09b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946788000142
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.8K Mar 5 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Mar 5 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 5 16:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 5 16:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 5 16:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Mar 5 16:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Mar 5 16:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Mar 5 16:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 865K Mar 3 18:30 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 AutonomousCar-PT-09b-ReachabilityCardinality-2024-00
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-01
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-02
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-03
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-04
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-05
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-06
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-07
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-08
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-09
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-10
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-11
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-12
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-13
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-14
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779518126803

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-09b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-23 06:35:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 06:35:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 06:35:29] [INFO ] Load time of PNML (sax parser for PT used): 296 ms
[2026-05-23 06:35:29] [INFO ] Transformed 391 places.
[2026-05-23 06:35:29] [INFO ] Transformed 1554 transitions.
[2026-05-23 06:35:29] [INFO ] Found NUPN structural information;
[2026-05-23 06:35:29] [INFO ] Parsed PT model containing 391 places and 1554 transitions and 16243 arcs in 486 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (330 resets) in 3219 ms. (12 steps per ms) remains 4/11 properties
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (48 resets) in 514 ms. (77 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (49 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (49 resets) in 232 ms. (171 steps per ms) remains 3/4 properties
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (45 resets) in 372 ms. (107 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17250468082531933887.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4474292324895400284.kers'
[2026-05-23 06:35:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17250468082531933887.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4474292324895400284.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 1554 rows 391 cols 16243 entries
Finished phase 1 with 377 SingleSign rule and 0 generalized
[2026-05-23 06:35:30] [INFO ] Computed 14 invariants in 23 ms
Computed 14 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-4474292324895400284.kers
Total runtime 31 ms.
Excessive predecessor constraint size, skipping predecessor.
[2026-05-23 06:35:30] [INFO ] Flatten gal took : 900 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2026-05-23 06:35:31] [INFO ] Flatten gal took : 239 ms
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2026-05-23 06:35:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2481980905222439048.gal : 251 ms
[2026-05-23 06:35:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6986141609484456891.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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2481980905222439048.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6986141609484456891.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.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
At refinement iteration 2 (OVERLAPS) 346/391 variables, 14/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 346/405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Loading property file /tmp/ReachabilityCardinality6986141609484456891.prop.
At refinement iteration 5 (OVERLAPS) 1554/1945 variables, 391/796 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1945 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/1945 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1945/1945 variables, and 796 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1729 ms.
Refiners :[Domain max(s): 391/391 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 391/391 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
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 346/391 variables, 14/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :4 after 5
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :5 after 6
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :6 after 26
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :26 after 57
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :57 after 71
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 346/405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :71 after 5631
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :5631 after 5.68099e+06
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :5.68099e+06 after 5.71048e+06
SMT process timed out in 7712ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 45 out of 391 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 391/391 places, 1554/1554 transitions.
Graph (trivial) has 298 edges and 391 vertex of which 2 / 391 are part of one of the 1 SCC in 14 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1701 edges and 390 vertex of which 387 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.36 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 123 rules applied. Total rules applied 125 place count 387 transition count 1427
Reduce places removed 122 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 147 rules applied. Total rules applied 272 place count 265 transition count 1402
Reduce places removed 14 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 25 rules applied. Total rules applied 297 place count 251 transition count 1391
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 308 place count 240 transition count 1391
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 308 place count 240 transition count 1373
Deduced a syphon composed of 18 places in 5 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 344 place count 222 transition count 1373
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 371 place count 195 transition count 1346
Iterating global reduction 4 with 27 rules applied. Total rules applied 398 place count 195 transition count 1346
Ensure Unique test removed 326 transitions
Reduce isomorphic transitions removed 326 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 327 rules applied. Total rules applied 725 place count 195 transition count 1019
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 727 place count 194 transition count 1018
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 728 place count 193 transition count 1018
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 728 place count 193 transition count 1017
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 730 place count 192 transition count 1017
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 737 place count 185 transition count 962
Iterating global reduction 7 with 7 rules applied. Total rules applied 744 place count 185 transition count 962
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 747 place count 185 transition count 959
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 749 place count 184 transition count 958
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 750 place count 183 transition count 958
Performed 38 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 10 with 76 rules applied. Total rules applied 826 place count 145 transition count 918
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 831 place count 140 transition count 868
Iterating global reduction 10 with 5 rules applied. Total rules applied 836 place count 140 transition count 868
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 842 place count 140 transition count 862
Free-agglomeration rule applied 16 times.
Iterating global reduction 10 with 16 rules applied. Total rules applied 858 place count 140 transition count 846
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 10 with 16 rules applied. Total rules applied 874 place count 124 transition count 846
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 877 place count 124 transition count 843
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 880 place count 124 transition count 843
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 881 place count 123 transition count 833
Iterating global reduction 11 with 1 rules applied. Total rules applied 882 place count 123 transition count 833
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 883 place count 123 transition count 833
Applied a total of 883 rules in 864 ms. Remains 123 /391 variables (removed 268) and now considering 833/1554 (removed 721) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 877 ms. Remains : 123/391 places, 833/1554 transitions.
RANDOM walk for 40000 steps (893 resets) in 903 ms. (44 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (111 resets) in 259 ms. (153 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (111 resets) in 211 ms. (188 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (115 resets) in 1010 ms. (39 steps per ms) remains 3/3 properties
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :5.71048e+06 after 7.26849e+06
Interrupted probabilistic random walk after 502930 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :0 out of 3
Probabilistic random walk after 502930 steps, saw 76485 distinct states, run finished after 3012 ms. (steps per millisecond=166 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15129324035041325542.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10633833850765214358.kers'
[2026-05-23 06:35:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15129324035041325542.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10633833850765214358.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 833 rows 123 cols 11773 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-23 06:35:42] [INFO ] Computed 14 invariants in 7 ms
Computed 14 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-10633833850765214358.kers
Total runtime 11 ms.
[2026-05-23 06:35:42] [INFO ] State equation strengthened by 219 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 78/123 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 833/956 variables, 123/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/956 variables, 219/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/956 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/956 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 956/956 variables, and 356 constraints, problems are : Problem set: 0 solved, 3 unsolved in 559 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 123/123 constraints, ReadFeed: 219/219 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
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 78/123 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :7.26849e+06 after 4.23982e+07
Problem AutonomousCar-PT-09b-ReachabilityCardinality-2024-00 is UNSAT
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 19/33 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 833/956 variables, 123/156 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/956 variables, 219/375 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/956 variables, 1/376 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/956 variables, 1/377 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/956 variables, 6/383 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/956 variables, 0/383 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/956 variables, 0/383 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 956/956 variables, and 383 constraints, problems are : Problem set: 1 solved, 2 unsolved in 10880 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 123/123 constraints, ReadFeed: 219/219 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 11505ms problems are : Problem set: 1 solved, 2 unsolved
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :4.23982e+07 after 1.66076e+09
Parikh walk visited 0 properties in 777 ms.
Support contains 23 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 833/833 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 123 transition count 819
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 30 place count 109 transition count 817
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 34 place count 108 transition count 814
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 36 place count 106 transition count 814
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 36 place count 106 transition count 813
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 38 place count 105 transition count 813
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 40 place count 103 transition count 811
Iterating global reduction 4 with 2 rules applied. Total rules applied 42 place count 103 transition count 811
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 58 place count 95 transition count 803
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 63 place count 95 transition count 798
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 77 place count 90 transition count 789
Applied a total of 77 rules in 141 ms. Remains 90 /123 variables (removed 33) and now considering 789/833 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 90/123 places, 789/833 transitions.
RANDOM walk for 40000 steps (32 resets) in 202 ms. (197 steps per ms) remains 1/2 properties
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (108 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5957741471909442035.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10078306545044867555.kers'
[2026-05-23 06:35:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5957741471909442035.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10078306545044867555.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 789 rows 90 cols 11649 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-23 06:35:55] [INFO ] Computed 14 invariants in 8 ms
Computed 14 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-10078306545044867555.kers
Total runtime 11 ms.
[2026-05-23 06:35:55] [INFO ] State equation strengthened by 210 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/88 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2/90 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 789/879 variables, 90/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/879 variables, 210/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/879 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/879 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 879/879 variables, and 316 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1523 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 90/90 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/88 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/90 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 789/879 variables, 90/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/879 variables, 210/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/879 variables, 6/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/879 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/879 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 879/879 variables, and 334 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6819 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 90/90 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 8393ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 119 ms.
Support contains 22 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 789/789 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 90 transition count 788
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 89 transition count 787
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 88 transition count 787
Applied a total of 4 rules in 55 ms. Remains 88 /90 variables (removed 2) and now considering 787/789 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 88/90 places, 787/789 transitions.
RANDOM walk for 40000 steps (28 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (125 resets) in 207 ms. (192 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 903522 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :0 out of 1
Probabilistic random walk after 903522 steps, saw 132568 distinct states, run finished after 3001 ms. (steps per millisecond=301 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18234643525165948701.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4234826958700259102.kers'
[2026-05-23 06:36:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18234643525165948701.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4234826958700259102.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 787 rows 88 cols 11645 entries
Finished phase 1 with 74 SingleSign rule and 0 generalized
[2026-05-23 06:36:07] [INFO ] Computed 14 invariants in 6 ms
Computed 14 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-4234826958700259102.kers
Total runtime 9 ms.
[2026-05-23 06:36:07] [INFO ] State equation strengthened by 210 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/86 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/88 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 787/875 variables, 88/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/875 variables, 210/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/875 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/875 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 875/875 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1483 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 88/88 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/86 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :1.66076e+09 after 1.95214e+10
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/88 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 787/875 variables, 88/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/875 variables, 210/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/875 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/875 variables, 5/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/875 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/875 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 875/875 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2904 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 88/88 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 4430ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 131 ms.
Support contains 22 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 787/787 transitions.
Applied a total of 0 rules in 44 ms. Remains 88 /88 variables (removed 0) and now considering 787/787 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 88/88 places, 787/787 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 787/787 transitions.
Applied a total of 0 rules in 39 ms. Remains 88 /88 variables (removed 0) and now considering 787/787 (removed 0) transitions.
[2026-05-23 06:36:11] [INFO ] Invariant cache hit.
[2026-05-23 06:36:12] [INFO ] Implicit Places using invariants in 513 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 539 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 87/88 places, 787/787 transitions.
Applied a total of 0 rules in 39 ms. Remains 87 /87 variables (removed 0) and now considering 787/787 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 618 ms. Remains : 87/88 places, 787/787 transitions.
RANDOM walk for 40000 steps (51 resets) in 207 ms. (192 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (120 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 962513 steps, run timeout after 3001 ms. (steps per millisecond=320 ) properties seen :0 out of 1
Probabilistic random walk after 962513 steps, saw 139496 distinct states, run finished after 3001 ms. (steps per millisecond=320 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8251044849935414579.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3699495014157266666.kers'
[2026-05-23 06:36:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8251044849935414579.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3699495014157266666.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 787 rows 87 cols 11644 entries
Finished phase 1 with 74 SingleSign rule and 0 generalized
[2026-05-23 06:36:15] [INFO ] Computed 13 invariants in 6 ms
Computed 13 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-3699495014157266666.kers
Total runtime 8 ms.
[2026-05-23 06:36:15] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/85 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/87 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 787/874 variables, 87/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/874 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/874 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/874 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 874/874 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1964 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 87/87 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/85 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/87 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 787/874 variables, 87/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/874 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/874 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/874 variables, 5/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/874 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/874 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 874/874 variables, and 111 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1923 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 87/87 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 3922ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 129 ms.
Support contains 22 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 787/787 transitions.
Applied a total of 0 rules in 37 ms. Remains 87 /87 variables (removed 0) and now considering 787/787 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 87/87 places, 787/787 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 787/787 transitions.
Applied a total of 0 rules in 37 ms. Remains 87 /87 variables (removed 0) and now considering 787/787 (removed 0) transitions.
[2026-05-23 06:36:19] [INFO ] Invariant cache hit.
[2026-05-23 06:36:19] [INFO ] Implicit Places using invariants in 342 ms returned []
[2026-05-23 06:36:19] [INFO ] Invariant cache hit.
[2026-05-23 06:36:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 06:36:20] [INFO ] Implicit Places using invariants and state equation in 651 ms returned [78, 86]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1016 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 85/87 places, 787/787 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 84 transition count 786
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 84 transition count 786
Applied a total of 3 rules in 87 ms. Remains 84 /85 variables (removed 1) and now considering 786/787 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1094121838461200361.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10765005236457515818.kers'
[2026-05-23 06:36:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1094121838461200361.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10765005236457515818.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 786 rows 84 cols 11637 entries
Finished phase 1 with 73 SingleSign rule and 0 generalized
[2026-05-23 06:36:20] [INFO ] Computed 11 invariants in 6 ms
Computed 11 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-10765005236457515818.kers
Total runtime 10 ms.
[2026-05-23 06:36:21] [INFO ] Implicit Places using invariants in 322 ms returned []
[2026-05-23 06:36:21] [INFO ] Invariant cache hit.
[2026-05-23 06:36:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 06:36:21] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 922 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 84/87 places, 786/787 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2063 ms. Remains : 84/87 places, 786/787 transitions.
RANDOM walk for 40000 steps (87 resets) in 926 ms. (43 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (115 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 975421 steps, run timeout after 3001 ms. (steps per millisecond=325 ) properties seen :0 out of 1
Probabilistic random walk after 975421 steps, saw 141305 distinct states, run finished after 3002 ms. (steps per millisecond=324 ) properties seen :0
[2026-05-23 06:36:24] [INFO ] Invariant cache hit.
[2026-05-23 06:36:24] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/79 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 784/863 variables, 79/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/863 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/863 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/870 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/870 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/870 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/870 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 870/870 variables, and 99 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1373 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/79 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 784/863 variables, 79/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/863 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/863 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/863 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/870 variables, 5/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/870 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/870 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/870 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/870 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 870/870 variables, and 108 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1988 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 3387ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 124 ms.
Support contains 22 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 786/786 transitions.
Applied a total of 0 rules in 39 ms. Remains 84 /84 variables (removed 0) and now considering 786/786 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 84/84 places, 786/786 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 786/786 transitions.
Applied a total of 0 rules in 34 ms. Remains 84 /84 variables (removed 0) and now considering 786/786 (removed 0) transitions.
[2026-05-23 06:36:28] [INFO ] Invariant cache hit.
[2026-05-23 06:36:28] [INFO ] Implicit Places using invariants in 307 ms returned []
[2026-05-23 06:36:28] [INFO ] Invariant cache hit.
[2026-05-23 06:36:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 06:36:29] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 906 ms to find 0 implicit places.
[2026-05-23 06:36:29] [INFO ] Redundant transitions in 75 ms returned []
Running 785 sub problems to find dead transitions.
[2026-05-23 06:36:29] [INFO ] Invariant cache hit.
[2026-05-23 06:36:29] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 785 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 785 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 785 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 785 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 84/870 variables, and 51 constraints, problems are : Problem set: 0 solved, 785 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/84 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 785/63 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 785 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 785 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 785 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 40/51 constraints. Problems are: Problem set: 0 solved, 785 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 785 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 785 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 785 unsolved
Problem TDEAD705 is UNSAT
Problem TDEAD785 is UNSAT
At refinement iteration 6 (OVERLAPS) 786/870 variables, 84/139 constraints. Problems are: Problem set: 2 solved, 783 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/870 variables, 2/141 constraints. Problems are: Problem set: 2 solved, 783 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/870 variables, 62/203 constraints. Problems are: Problem set: 2 solved, 783 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 870/870 variables, and 203 constraints, problems are : Problem set: 2 solved, 783 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 784/63 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61654ms problems are : Problem set: 2 solved, 783 unsolved
Search for dead transitions found 2 dead transitions in 61670ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 84/84 places, 784/786 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 84 transition count 783
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 83 transition count 783
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 82 transition count 782
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 82 transition count 782
Applied a total of 4 rules in 53 ms. Remains 82 /84 variables (removed 2) and now considering 782/784 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16192380856669128548.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13631296459943819670.kers'
[2026-05-23 06:37:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16192380856669128548.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13631296459943819670.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 782 rows 82 cols 11623 entries
Finished phase 1 with 70 SingleSign rule and 0 generalized
[2026-05-23 06:37:31] [INFO ] Computed 12 invariants in 8 ms
Computed 12 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-13631296459943819670.kers
Total runtime 12 ms.
[2026-05-23 06:37:31] [INFO ] Implicit Places using invariants in 333 ms returned []
[2026-05-23 06:37:31] [INFO ] Invariant cache hit.
[2026-05-23 06:37:32] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 889 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 82/84 places, 782/786 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 63681 ms. Remains : 82/84 places, 782/786 transitions.
RANDOM walk for 40000 steps (50 resets) in 159 ms. (250 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (114 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1039903 steps, run timeout after 3001 ms. (steps per millisecond=346 ) properties seen :0 out of 1
Probabilistic random walk after 1039903 steps, saw 149405 distinct states, run finished after 3001 ms. (steps per millisecond=346 ) properties seen :0
[2026-05-23 06:37:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/82 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 782/864 variables, 82/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/864 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/864 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 864/864 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 822 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/82 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 782/864 variables, 82/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/864 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/864 variables, 8/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/864 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/864 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 864/864 variables, and 106 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2918 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 3779ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 121 ms.
Support contains 22 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 782/782 transitions.
Applied a total of 0 rules in 35 ms. Remains 82 /82 variables (removed 0) and now considering 782/782 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 82/82 places, 782/782 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 782/782 transitions.
Applied a total of 0 rules in 34 ms. Remains 82 /82 variables (removed 0) and now considering 782/782 (removed 0) transitions.
[2026-05-23 06:37:39] [INFO ] Invariant cache hit.
[2026-05-23 06:37:39] [INFO ] Implicit Places using invariants in 293 ms returned []
[2026-05-23 06:37:39] [INFO ] Invariant cache hit.
[2026-05-23 06:37:40] [INFO ] Implicit Places using invariants and state equation in 569 ms returned []
Implicit Place search using SMT with State Equation took 865 ms to find 0 implicit places.
[2026-05-23 06:37:40] [INFO ] Redundant transitions in 142 ms returned []
Running 781 sub problems to find dead transitions.
[2026-05-23 06:37:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 781 unsolved
SMT process timed out in 31542ms, After SMT, problems are : Problem set: 0 solved, 781 unsolved
Search for dead transitions found 0 dead transitions in 31550ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32604 ms. Remains : 82/82 places, 782/782 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-23 06:38:12] [INFO ] Flatten gal took : 212 ms
[2026-05-23 06:38:12] [INFO ] Applying decomposition
[2026-05-23 06:38:12] [INFO ] Flatten gal took : 197 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1771475872132522958.txt' '-o' '/tmp/graph1771475872132522958.bin' '-w' '/tmp/graph1771475872132522958.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1771475872132522958.bin' '-l' '-1' '-v' '-w' '/tmp/graph1771475872132522958.weights' '-q' '0' '-e' '0.001'
[2026-05-23 06:38:13] [INFO ] Decomposing Gal with order
[2026-05-23 06:38:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 06:38:14] [INFO ] Removed a total of 6011 redundant transitions.
[2026-05-23 06:38:14] [INFO ] Flatten gal took : 755 ms
[2026-05-23 06:38:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 71 ms.
[2026-05-23 06:38:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1378418493382416643.gal : 16 ms
[2026-05-23 06:38:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10521980396104393608.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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1378418493382416643.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10521980396104393608.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality10521980396104393608.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 2
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2 after 32
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :32 after 2.10724e+14
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2.10724e+14 after 2.68761e+14
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2.68761e+14 after 2.69037e+14
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.69037e+14 after 2.69289e+14
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.69289e+14 after 2.83679e+14
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.83679e+14 after 3.04386e+14
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3.04386e+14 after 3.2735e+14
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3.2735e+14 after 3.59856e+14
Detected timeout of ITS tools.
[2026-05-23 07:08:14] [INFO ] Flatten gal took : 103 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15505713853716190299
[2026-05-23 07:08:14] [INFO ] Computing symmetric may disable matrix : 782 transitions.
[2026-05-23 07:08:14] [INFO ] Applying decomposition
[2026-05-23 07:08:15] [INFO ] Flatten gal took : 194 ms
[2026-05-23 07:08:15] [INFO ] Computation of Complete disable matrix. took 284 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 07:08:15] [INFO ] Computing symmetric may enable matrix : 782 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17225615697378383588.txt' '-o' '/tmp/graph17225615697378383588.bin' '-w' '/tmp/graph17225615697378383588.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17225615697378383588.bin' '-l' '-1' '-v' '-w' '/tmp/graph17225615697378383588.weights' '-q' '0' '-e' '0.001'
[2026-05-23 07:08:15] [INFO ] Decomposing Gal with order
[2026-05-23 07:08:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 07:08:15] [INFO ] Computation of Complete enable matrix. took 408 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 07:08:15] [INFO ] Removed a total of 6025 redundant transitions.
[2026-05-23 07:08:15] [INFO ] Flatten gal took : 163 ms
[2026-05-23 07:08:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 66 ms.
[2026-05-23 07:08:16] [INFO ] Computing Do-Not-Accords matrix : 782 transitions.
[2026-05-23 07:08:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15158544716553121954.gal : 8 ms
[2026-05-23 07:08:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10650136364646138020.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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15158544716553121954.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10650136364646138020.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality10650136364646138020.prop.
[2026-05-23 07:08:16] [INFO ] Computation of Completed DNA matrix. took 116 ms. Total solver calls (SAT/UNSAT): 0(0/0)
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 113
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :113 after 329
[2026-05-23 07:08:16] [INFO ] Built C files in 1541ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15505713853716190299
Running compilation step : cd /tmp/ltsmin15505713853716190299;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Reachability property AutonomousCar-PT-09b-ReachabilityCardinality-2024-12 is true.
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 17 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\_mod\_flat,7.14248e+08,3.09083,96372,3192,107,82831,979,1024,811813,100,6849,0
Total reachable state count : 714248008

Verifying 1 reachability properties.
Reachability property AutonomousCar-PT-09b-ReachabilityCardinality-2024-12 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutonomousCar-PT-09b-ReachabilityCardinality-2024-12,15360,3.2252,96372,44,28,82831,979,1115,811813,116,6849,0
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1970860 ms.

BK_STOP 1779520099437

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-09b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r018-smll-177946788000142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-09b.tgz
mv AutonomousCar-PT-09b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;