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.r034-tall-177946842200763.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 CANInsertWithFailure-PT-080, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842200763
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 11K Mar 6 10:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 6 10:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 6 10:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 6 10:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Mar 15 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 6 10:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Mar 6 10:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 10:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Mar 6 10:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:55 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 39M 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 CANInsertWithFailure-PT-080-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779690955033

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-080
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 06:35:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 06:35:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 06:35:57] [INFO ] Load time of PNML (sax parser for PT used): 911 ms
[2026-05-25 06:35:57] [INFO ] Transformed 13764 places.
[2026-05-25 06:35:57] [INFO ] Transformed 38880 transitions.
[2026-05-25 06:35:57] [INFO ] Parsed PT model containing 13764 places and 38880 transitions and 104000 arcs in 1126 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 13764 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13764/13764 places, 38880/38880 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13763 transition count 38880
Applied a total of 1 rules in 4958 ms. Remains 13763 /13764 variables (removed 1) and now considering 38880/38880 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6958912075194071026.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1448524256952313339.kers'
[2026-05-25 06:36:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6958912075194071026.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1448524256952313339.kers]
Culled 0 columns in 16 ms.
// Phase 1: matrix 38880 rows 13763 cols 78400 entries
Finished phase 1 with 13601 SingleSign rule and 80 generalized
[2026-05-25 06:36:05] [INFO ] Computed 82 invariants in 2052 ms
Computed 82 P flows in 2053 ms.
Exported basis to /tmp/petrispot-output-1448524256952313339.kers
Total runtime 2078 ms.
[2026-05-25 06:36:27] [INFO ] Implicit Places using invariants in 24961 ms returned []
Implicit Place search using SMT only with invariants took 24992 ms to find 0 implicit places.
Running 38800 sub problems to find dead transitions.
[2026-05-25 06:36:28] [INFO ] Invariant cache hit.
[2026-05-25 06:36:28] [INFO ] State equation strengthened by 12720 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13762/52643 variables, and 80 constraints, problems are : Problem set: 0 solved, 38800 unsolved in 30853 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/13763 constraints, ReadFeed: 0/12720 constraints, PredecessorRefiner: 38800/38800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 13762/52643 variables, and 80 constraints, problems are : Problem set: 0 solved, 38800 unsolved in 30447 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/13763 constraints, ReadFeed: 0/12720 constraints, PredecessorRefiner: 0/38800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 212810ms problems are : Problem set: 0 solved, 38800 unsolved
Search for dead transitions found 0 dead transitions in 212993ms
Starting structural reductions in LTL mode, iteration 1 : 13763/13764 places, 38880/38880 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 243104 ms. Remains : 13763/13764 places, 38880/38880 transitions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3910 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2026-05-25 06:40:04] [INFO ] Invariant cache hit.
[2026-05-25 06:40:26] [INFO ] Implicit Places using invariants in 21487 ms returned []
Implicit Place search using SMT only with invariants took 21490 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 25409 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Support contains 45 out of 13763 places after structural reductions.
[2026-05-25 06:40:27] [INFO ] Flatten gal took : 1001 ms
[2026-05-25 06:40:28] [INFO ] Flatten gal took : 560 ms
[2026-05-25 06:40:29] [INFO ] Input system was already deterministic with 38880 transitions.
RANDOM walk for 40000 steps (18 resets) in 3697 ms. (10 steps per ms) remains 21/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
[2026-05-25 06:40:30] [INFO ] Invariant cache hit.
[2026-05-25 06:40:31] [INFO ] State equation strengthened by 12720 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 13570/13603 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13603/52643 variables, and 2 constraints, problems are : Problem set: 0 solved, 21 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/80 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/13763 constraints, ReadFeed: 0/12720 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 13570/13603 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
SMT process timed out in 10778ms, After SMT, problems are : Problem set: 0 solved, 21 unsolved
Fused 21 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 33 out of 13763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 13763 transition count 38322
Reduce places removed 558 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 559 rules applied. Total rules applied 1117 place count 13205 transition count 38321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1118 place count 13204 transition count 38321
Performed 6302 Post agglomeration using F-continuation condition.Transition count delta: 6302
Deduced a syphon composed of 6302 places in 23 ms
Reduce places removed 6302 places and 0 transitions.
Iterating global reduction 3 with 12604 rules applied. Total rules applied 13722 place count 6902 transition count 32019
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13724 place count 6902 transition count 32017
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 13726 place count 6900 transition count 32017
Partial Free-agglomeration rule applied 6466 times.
Drop transitions (Partial Free agglomeration) removed 6466 transitions
Iterating global reduction 4 with 6466 rules applied. Total rules applied 20192 place count 6900 transition count 32017
Applied a total of 20192 rules in 13837 ms. Remains 6900 /13763 variables (removed 6863) and now considering 32017/38880 (removed 6863) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13839 ms. Remains : 6900/13763 places, 32017/38880 transitions.
RANDOM walk for 40000 steps (80 resets) in 2338 ms. (17 steps per ms) remains 10/21 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 10/10 properties
[2026-05-25 06:40:56] [INFO ] Flow matrix only has 32002 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14070483923854194934.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7073484258656666948.kers'
[2026-05-25 06:40:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14070483923854194934.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7073484258656666948.kers]
Culled 0 columns in 10 ms.
// Phase 1: matrix 32002 rows 6900 cols 64803 entries
Finished phase 1 with 6738 SingleSign rule and 80 generalized
[2026-05-25 06:40:57] [INFO ] Computed 82 invariants in 873 ms
Computed 82 P flows in 874 ms.
Exported basis to /tmp/petrispot-output-7073484258656666948.kers
Total runtime 901 ms.
[2026-05-25 06:40:57] [INFO ] State equation strengthened by 31615 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 6727/6740 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6740 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 156/6896 variables, 78/80 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6896 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/6898 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6898 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 32002/38900 variables, 6898/6980 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38900 variables, 31615/38595 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38900 variables, 0/38595 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SMT process timed out in 46174ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 6900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6900/6900 places, 32017/32017 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 12 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 6892 transition count 32009
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 28 place count 6892 transition count 32009
Applied a total of 28 rules in 6373 ms. Remains 6892 /6900 variables (removed 8) and now considering 32009/32017 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6374 ms. Remains : 6892/6900 places, 32009/32017 transitions.
RANDOM walk for 40000 steps (80 resets) in 2244 ms. (17 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
[2026-05-25 06:41:49] [INFO ] Flow matrix only has 32006 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8205257439822108091.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8462414867750173079.kers'
[2026-05-25 06:41:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8205257439822108091.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8462414867750173079.kers]
Culled 0 columns in 10 ms.
// Phase 1: matrix 32006 rows 6892 cols 64811 entries
Finished phase 1 with 6730 SingleSign rule and 80 generalized
[2026-05-25 06:41:50] [INFO ] Computed 82 invariants in 895 ms
Computed 82 P flows in 896 ms.
Exported basis to /tmp/petrispot-output-8462414867750173079.kers
Total runtime 922 ms.
[2026-05-25 06:41:51] [INFO ] State equation strengthened by 31655 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 6722/6732 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6732 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6732 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 156/6888 variables, 78/81 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6888 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/6890 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6890 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6890 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 32006/38896 variables, 6890/6975 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/38896 variables, 31655/38630 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 38896/38898 variables, and 38630 constraints, problems are : Problem set: 0 solved, 8 unsolved in 75054 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 6890/6892 constraints, ReadFeed: 31655/31655 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 6722/6732 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6732 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6732 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 156/6888 variables, 78/81 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6888 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/6890 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6890 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SMT process timed out in 157280ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 6892 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6892/6892 places, 32009/32009 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 6890 transition count 32007
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 5 place count 6890 transition count 32007
Applied a total of 5 rules in 5750 ms. Remains 6890 /6892 variables (removed 2) and now considering 32007/32009 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5750 ms. Remains : 6890/6892 places, 32007/32009 transitions.
Computed a total of 322 stabilizing places and 560 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F(p1)||X(X(X(F(p2)))))))'
Support contains 6 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3237 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1548299478006742278.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12888593349106974091.kers'
[2026-05-25 06:44:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1548299478006742278.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12888593349106974091.kers]
Culled 0 columns in 18 ms.
// Phase 1: matrix 38880 rows 13763 cols 78400 entries
Finished phase 1 with 13601 SingleSign rule and 80 generalized
[2026-05-25 06:44:38] [INFO ] Computed 82 invariants in 2069 ms
Computed 82 P flows in 2069 ms.
Exported basis to /tmp/petrispot-output-12888593349106974091.kers
Total runtime 2098 ms.
[2026-05-25 06:45:01] [INFO ] Implicit Places using invariants in 24631 ms returned []
Implicit Place search using SMT only with invariants took 24641 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 27883 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F(p1)||X(X(X(F(p2)))))))'
Stuttering acceptance computed with spot in 402 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-01
Product exploration explored 100000 steps with 53 reset in 2480 ms.
Product exploration explored 100000 steps with 51 reset in 2477 ms.
Computed a total of 322 stabilizing places and 560 stable transitions
Computed a total of 322 stabilizing places and 560 stable transitions
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (20 resets) in 1401 ms. (28 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
[2026-05-25 06:45:07] [INFO ] Invariant cache hit.
[2026-05-25 06:45:07] [INFO ] State equation strengthened by 12720 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 13597/13603 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13603 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 156/13759 variables, 78/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13759 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/13761 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13761 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SMT process timed out in 5152ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 13763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 557 transitions
Trivial Post-agglo rules discarded 557 transitions
Performed 557 trivial Post agglomeration. Transition count delta: 557
Iterating post reduction 0 with 557 rules applied. Total rules applied 557 place count 13763 transition count 38323
Reduce places removed 557 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 558 rules applied. Total rules applied 1115 place count 13206 transition count 38322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1116 place count 13205 transition count 38322
Performed 6319 Post agglomeration using F-continuation condition.Transition count delta: 6319
Deduced a syphon composed of 6319 places in 14 ms
Reduce places removed 6319 places and 0 transitions.
Iterating global reduction 3 with 12638 rules applied. Total rules applied 13754 place count 6886 transition count 32003
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13756 place count 6886 transition count 32001
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 13758 place count 6884 transition count 32001
Partial Free-agglomeration rule applied 6477 times.
Drop transitions (Partial Free agglomeration) removed 6477 transitions
Iterating global reduction 4 with 6477 rules applied. Total rules applied 20235 place count 6884 transition count 32001
Applied a total of 20235 rules in 11973 ms. Remains 6884 /13763 variables (removed 6879) and now considering 32001/38880 (removed 6879) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11974 ms. Remains : 6884/13763 places, 32001/38880 transitions.
RANDOM walk for 40000 steps (80 resets) in 1555 ms. (25 steps per ms) remains 0/4 properties
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Knowledge-based reduction took 18879 ms.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3304 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2026-05-25 06:45:29] [INFO ] Invariant cache hit.
[2026-05-25 06:45:53] [INFO ] Implicit Places using invariants in 23907 ms returned []
Implicit Place search using SMT only with invariants took 23919 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 27226 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Computed a total of 322 stabilizing places and 560 stable transitions
Computed a total of 322 stabilizing places and 560 stable transitions
Knowledge based reduction with 3 factoid took 43 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (18 resets) in 1310 ms. (30 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
[2026-05-25 06:45:53] [INFO ] Invariant cache hit.
[2026-05-25 06:45:53] [INFO ] State equation strengthened by 12720 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13597/13603 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13603 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 156/13759 variables, 78/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13759 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/13761 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13761 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 5116ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 13763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 557 transitions
Trivial Post-agglo rules discarded 557 transitions
Performed 557 trivial Post agglomeration. Transition count delta: 557
Iterating post reduction 0 with 557 rules applied. Total rules applied 557 place count 13763 transition count 38323
Reduce places removed 557 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 558 rules applied. Total rules applied 1115 place count 13206 transition count 38322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1116 place count 13205 transition count 38322
Performed 6319 Post agglomeration using F-continuation condition.Transition count delta: 6319
Deduced a syphon composed of 6319 places in 20 ms
Reduce places removed 6319 places and 0 transitions.
Iterating global reduction 3 with 12638 rules applied. Total rules applied 13754 place count 6886 transition count 32003
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13756 place count 6886 transition count 32001
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 13758 place count 6884 transition count 32001
Partial Free-agglomeration rule applied 6477 times.
Drop transitions (Partial Free agglomeration) removed 6477 transitions
Iterating global reduction 4 with 6477 rules applied. Total rules applied 20235 place count 6884 transition count 32001
Applied a total of 20235 rules in 12618 ms. Remains 6884 /13763 variables (removed 6879) and now considering 32001/38880 (removed 6879) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12620 ms. Remains : 6884/13763 places, 32001/38880 transitions.
RANDOM walk for 22923 steps (46 resets) in 1122 ms. (20 steps per ms) remains 0/3 properties
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Knowledge-based reduction took 19349 ms.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 52 reset in 1977 ms.
Product exploration explored 100000 steps with 49 reset in 2066 ms.
Spot run failed in 82 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin10150321092287190215
[2026-05-25 06:46:17] [INFO ] Built C files in 363ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10150321092287190215
Running compilation step : cd /tmp/ltsmin10150321092287190215;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' '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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10150321092287190215;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' '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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10150321092287190215;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' '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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 6 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3092 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2026-05-25 06:46:23] [INFO ] Invariant cache hit.
[2026-05-25 06:46:45] [INFO ] Implicit Places using invariants in 21693 ms returned []
Implicit Place search using SMT only with invariants took 21696 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 24790 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Built C files in :
/tmp/ltsmin13286593072661574989
[2026-05-25 06:46:45] [INFO ] Built C files in 267ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13286593072661574989
Running compilation step : cd /tmp/ltsmin13286593072661574989;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' '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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13286593072661574989;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' '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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13286593072661574989;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' '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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-25 06:46:49] [INFO ] Flatten gal took : 529 ms
[2026-05-25 06:46:50] [INFO ] Flatten gal took : 560 ms
[2026-05-25 06:46:50] [INFO ] Time to serialize gal into /tmp/LTL3822892780585816804.gal : 172 ms
[2026-05-25 06:46:50] [INFO ] Time to serialize properties into /tmp/LTL4262095810181236144.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3822892780585816804.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11034889286368633018.hoa' '-atoms' '/tmp/LTL4262095810181236144.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4262095810181236144.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11034889286368633018.hoa
Detected timeout of ITS tools.
[2026-05-25 06:47:06] [INFO ] Flatten gal took : 440 ms
[2026-05-25 06:47:06] [INFO ] Flatten gal took : 448 ms
[2026-05-25 06:47:07] [INFO ] Time to serialize gal into /tmp/LTL14616256033643035812.gal : 105 ms
[2026-05-25 06:47:07] [INFO ] Time to serialize properties into /tmp/LTL3363834103938495368.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14616256033643035812.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3363834103938495368.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((("(Node0ID>Node38requestsent61)")||(F("(Node75requestsent9<=Node46GiveAnswer15)")))||(X(X(X(F("(Node23requestsent76>Node76reques...172
Formula 0 simplified : F(!"(Node0ID>Node38requestsent61)" & G!"(Node75requestsent9<=Node46GiveAnswer15)" & XXXG!"(Node23requestsent76>Node76requestsent69)"...156
Detected timeout of ITS tools.
[2026-05-25 06:47:22] [INFO ] Flatten gal took : 419 ms
[2026-05-25 06:47:22] [INFO ] Applying decomposition
[2026-05-25 06:47:23] [INFO ] Flatten gal took : 573 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/graph7776258655774424372.txt' '-o' '/tmp/graph7776258655774424372.bin' '-w' '/tmp/graph7776258655774424372.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7776258655774424372.bin' '-l' '-1' '-v' '-w' '/tmp/graph7776258655774424372.weights' '-q' '0' '-e' '0.001'
[2026-05-25 06:47:24] [INFO ] Decomposing Gal with order
[2026-05-25 06:47:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 06:47:29] [INFO ] Removed a total of 19248 redundant transitions.
[2026-05-25 06:47:29] [INFO ] Flatten gal took : 2831 ms
[2026-05-25 06:47:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 12476 labels/synchronizations in 2767 ms.
[2026-05-25 06:47:35] [INFO ] Time to serialize gal into /tmp/LTL5559670159060201986.gal : 149 ms
[2026-05-25 06:47:35] [INFO ] Time to serialize properties into /tmp/LTL2546703483768049502.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5559670159060201986.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2546703483768049502.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((("(gu318.Node0ID>gu318.Node38requestsent61)")||(F("(gu320.Node75requestsent9<=gu320.Node46GiveAnswer15)")))||(X(X(X(F("(gu321.No...208
Formula 0 simplified : F(!"(gu318.Node0ID>gu318.Node38requestsent61)" & G!"(gu320.Node75requestsent9<=gu320.Node46GiveAnswer15)" & XXXG!"(gu321.Node23reque...192
Detected timeout of ITS tools.
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-01 finished in 197020 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)&&(p2||G(F(p3)))&&p0)))'
Support contains 5 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 557 transitions
Trivial Post-agglo rules discarded 557 transitions
Performed 557 trivial Post agglomeration. Transition count delta: 557
Iterating post reduction 0 with 557 rules applied. Total rules applied 557 place count 13763 transition count 38323
Reduce places removed 557 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 558 rules applied. Total rules applied 1115 place count 13206 transition count 38322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1116 place count 13205 transition count 38322
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1116 place count 13205 transition count 38321
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1118 place count 13204 transition count 38321
Performed 6315 Post agglomeration using F-continuation condition.Transition count delta: 6315
Deduced a syphon composed of 6315 places in 12 ms
Reduce places removed 6315 places and 0 transitions.
Iterating global reduction 3 with 12630 rules applied. Total rules applied 13748 place count 6889 transition count 32006
Applied a total of 13748 rules in 8817 ms. Remains 6889 /13763 variables (removed 6874) and now considering 32006/38880 (removed 6874) transitions.
[2026-05-25 06:47:59] [INFO ] Flow matrix only has 25847 transitions (discarded 6159 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10337123528770366323.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13220714173919484911.kers'
[2026-05-25 06:47:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10337123528770366323.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13220714173919484911.kers]
Culled 0 columns in 8 ms.
// Phase 1: matrix 25847 rows 6889 cols 52256 entries
Finished phase 1 with 6727 SingleSign rule and 80 generalized
[2026-05-25 06:48:00] [INFO ] Computed 82 invariants in 752 ms
Computed 82 P flows in 754 ms.
Exported basis to /tmp/petrispot-output-13220714173919484911.kers
Total runtime 768 ms.
[2026-05-25 06:48:10] [INFO ] Implicit Places using invariants in 11665 ms returned []
Implicit Place search using SMT only with invariants took 11669 ms to find 0 implicit places.
Running 31926 sub problems to find dead transitions.
[2026-05-25 06:48:11] [INFO ] Flow matrix only has 25847 transitions (discarded 6159 similar events)
[2026-05-25 06:48:11] [INFO ] Invariant cache hit.
[2026-05-25 06:48:11] [INFO ] State equation strengthened by 19113 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/6888 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 31926 unsolved
SMT process timed out in 117242ms, After SMT, problems are : Problem set: 0 solved, 31926 unsolved
Search for dead transitions found 0 dead transitions in 117311ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6889/13763 places, 32006/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 137879 ms. Remains : 6889/13763 places, 32006/38880 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)&&(p2||G(F(p3)))&&p0)))'
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-02
Stuttering criterion allowed to conclude after 385 steps with 0 reset in 17 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-02 finished in 138263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 6320 Post agglomeration using F-continuation condition.Transition count delta: 6320
Deduced a syphon composed of 6320 places in 21 ms
Reduce places removed 6320 places and 0 transitions.
Iterating global reduction 2 with 12640 rules applied. Total rules applied 13760 place count 6883 transition count 32000
Applied a total of 13760 rules in 7953 ms. Remains 6883 /13763 variables (removed 6880) and now considering 32000/38880 (removed 6880) transitions.
[2026-05-25 06:50:16] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16836859686807689149.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7194465887801167781.kers'
[2026-05-25 06:50:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16836859686807689149.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7194465887801167781.kers]
Culled 0 columns in 9 ms.
// Phase 1: matrix 25838 rows 6883 cols 52236 entries
Finished phase 1 with 6721 SingleSign rule and 80 generalized
[2026-05-25 06:50:17] [INFO ] Computed 82 invariants in 749 ms
Computed 82 P flows in 750 ms.
Exported basis to /tmp/petrispot-output-7194465887801167781.kers
Total runtime 772 ms.
[2026-05-25 06:50:28] [INFO ] Implicit Places using invariants in 12137 ms returned []
Implicit Place search using SMT only with invariants took 12141 ms to find 0 implicit places.
Running 31920 sub problems to find dead transitions.
[2026-05-25 06:50:28] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
[2026-05-25 06:50:28] [INFO ] Invariant cache hit.
[2026-05-25 06:50:29] [INFO ] State equation strengthened by 19118 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6882 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 31920 unsolved
SMT process timed out in 121795ms, After SMT, problems are : Problem set: 0 solved, 31920 unsolved
Search for dead transitions found 0 dead transitions in 121846ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6883/13763 places, 32000/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 141993 ms. Remains : 6883/13763 places, 32000/38880 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-03
Stuttering criterion allowed to conclude after 441 steps with 0 reset in 18 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-03 finished in 142149 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))||X(G(p2))))'
Support contains 5 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3185 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2706941486264745616.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3233026315419483987.kers'
[2026-05-25 06:52:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2706941486264745616.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3233026315419483987.kers]
Culled 0 columns in 18 ms.
// Phase 1: matrix 38880 rows 13763 cols 78400 entries
Finished phase 1 with 13601 SingleSign rule and 80 generalized
[2026-05-25 06:52:36] [INFO ] Computed 82 invariants in 2057 ms
Computed 82 P flows in 2058 ms.
Exported basis to /tmp/petrispot-output-3233026315419483987.kers
Total runtime 2090 ms.
[2026-05-25 06:52:58] [INFO ] Implicit Places using invariants in 24655 ms returned []
Implicit Place search using SMT only with invariants took 24660 ms to find 0 implicit places.
Running 38800 sub problems to find dead transitions.
[2026-05-25 06:52:58] [INFO ] Invariant cache hit.
[2026-05-25 06:52:58] [INFO ] State equation strengthened by 12720 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13762/52643 variables, and 80 constraints, problems are : Problem set: 0 solved, 38800 unsolved in 30494 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/13763 constraints, ReadFeed: 0/12720 constraints, PredecessorRefiner: 38800/38800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 13762/52643 variables, and 80 constraints, problems are : Problem set: 0 solved, 38800 unsolved in 30476 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/13763 constraints, ReadFeed: 0/12720 constraints, PredecessorRefiner: 0/38800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 213752ms problems are : Problem set: 0 solved, 38800 unsolved
Search for dead transitions found 0 dead transitions in 213829ms
Finished structural reductions in LTL mode , in 1 iterations and 241746 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))||X(G(p2))))'
Stuttering acceptance computed with spot in 227 ms :[true, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 5152 ms.
Product exploration explored 100000 steps with 50000 reset in 4858 ms.
Computed a total of 322 stabilizing places and 560 stable transitions
Computed a total of 322 stabilizing places and 560 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 21 factoid took 19 ms. Proved property starting from automaton with 7 states, 14 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 103 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-04 finished in 252195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(((p0 U p1)&&X(p2))) U X(p3)))'
Support contains 5 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3054 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2026-05-25 06:56:46] [INFO ] Invariant cache hit.
[2026-05-25 06:57:08] [INFO ] Implicit Places using invariants in 22069 ms returned []
Implicit Place search using SMT only with invariants took 22073 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 25129 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(((p0 U p1)&&X(p2))) U X(p3)))'
Stuttering acceptance computed with spot in 328 ms :[(NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-06
Stuttering criterion allowed to conclude after 2083 steps with 1 reset in 43 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-06 finished in 25607 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(X(X(p1)))) U ((!p1&&X(p2)) U G(p0))))'
Support contains 6 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 2970 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2026-05-25 06:57:11] [INFO ] Invariant cache hit.
[2026-05-25 06:57:35] [INFO ] Implicit Places using invariants in 23778 ms returned []
Implicit Place search using SMT only with invariants took 23782 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 26754 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(X(X(p1)))) U ((!p1&&X(p2)) U G(p0))))'
Stuttering acceptance computed with spot in 1117 ms :[(NOT p0), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-08
Product exploration explored 100000 steps with 24919 reset in 3554 ms.
Product exploration explored 100000 steps with 25006 reset in 3568 ms.
Computed a total of 322 stabilizing places and 560 stable transitions
Computed a total of 322 stabilizing places and 560 stable transitions
Knowledge based reduction with 32 factoid took 297 ms. Reduced automaton from 26 states, 58 edges and 3 AP (stutter sensitive) to 26 states, 58 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (17 resets) in 2088 ms. (19 steps per ms) remains 13/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 321 ms. (124 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 13/13 properties
[2026-05-25 06:57:45] [INFO ] Invariant cache hit.
[2026-05-25 06:57:45] [INFO ] State equation strengthened by 12720 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 13595/13601 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13601 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 158/13759 variables, 79/80 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13759/52643 variables, and 80 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/13763 constraints, ReadFeed: 0/12720 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 13595/13601 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
SMT process timed out in 10532ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 13763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 6317 Post agglomeration using F-continuation condition.Transition count delta: 6317
Deduced a syphon composed of 6317 places in 17 ms
Reduce places removed 6317 places and 0 transitions.
Iterating global reduction 2 with 12634 rules applied. Total rules applied 13754 place count 6886 transition count 32003
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13755 place count 6886 transition count 32002
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13756 place count 6885 transition count 32002
Partial Free-agglomeration rule applied 6478 times.
Drop transitions (Partial Free agglomeration) removed 6478 transitions
Iterating global reduction 3 with 6478 rules applied. Total rules applied 20234 place count 6885 transition count 32002
Applied a total of 20234 rules in 12011 ms. Remains 6885 /13763 variables (removed 6878) and now considering 32002/38880 (removed 6878) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12015 ms. Remains : 6885/13763 places, 32002/38880 transitions.
RANDOM walk for 40000 steps (80 resets) in 2264 ms. (17 steps per ms) remains 8/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 8/8 properties
[2026-05-25 06:58:09] [INFO ] Flow matrix only has 31999 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6888271476839058994.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5159118913718044831.kers'
[2026-05-25 06:58:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6888271476839058994.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5159118913718044831.kers]
Culled 0 columns in 10 ms.
// Phase 1: matrix 31999 rows 6885 cols 64716 entries
Finished phase 1 with 6723 SingleSign rule and 80 generalized
[2026-05-25 06:58:10] [INFO ] Computed 82 invariants in 874 ms
Computed 82 P flows in 875 ms.
Exported basis to /tmp/petrispot-output-5159118913718044831.kers
Total runtime 902 ms.
[2026-05-25 06:58:10] [INFO ] State equation strengthened by 31748 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 6717/6723 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6723 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 158/6881 variables, 79/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6881 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/6883 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6883 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 31999/38882 variables, 6883/6965 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 38882/38884 variables, and 38713 constraints, problems are : Problem set: 0 solved, 8 unsolved in 45098 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 6883/6885 constraints, ReadFeed: 31748/31748 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 6717/6723 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6723 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6723 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6723 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6723 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6723 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 158/6881 variables, 79/160 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6881 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 2/6883 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/6883 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6883/38884 variables, and 163 constraints, problems are : Problem set: 0 solved, 8 unsolved in 45024 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/6885 constraints, ReadFeed: 0/31748 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 81/81 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 91170ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 6885 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6885/6885 places, 32002/32002 transitions.
Applied a total of 0 rules in 1910 ms. Remains 6885 /6885 variables (removed 0) and now considering 32002/32002 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1911 ms. Remains : 6885/6885 places, 32002/32002 transitions.
Knowledge based reduction with 32 factoid took 492 ms. Reduced automaton from 26 states, 58 edges and 3 AP (stutter sensitive) to 26 states, 58 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1156 ms :[(NOT p0), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p0), (NOT p0)]
Knowledge-based reduction took 120058 ms.
Stuttering acceptance computed with spot in 1181 ms :[(NOT p0), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p0), (NOT p0)]
Support contains 6 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3097 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2091832365062600917.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4165936395367648554.kers'
[2026-05-25 06:59:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2091832365062600917.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4165936395367648554.kers]
Culled 0 columns in 18 ms.
// Phase 1: matrix 38880 rows 13763 cols 78400 entries
Finished phase 1 with 13601 SingleSign rule and 80 generalized
[2026-05-25 06:59:50] [INFO ] Computed 82 invariants in 2063 ms
Computed 82 P flows in 2065 ms.
Exported basis to /tmp/petrispot-output-4165936395367648554.kers
Total runtime 2096 ms.
[2026-05-25 07:00:12] [INFO ] Implicit Places using invariants in 24429 ms returned []
Implicit Place search using SMT only with invariants took 24446 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 27546 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Computed a total of 322 stabilizing places and 560 stable transitions
Computed a total of 322 stabilizing places and 560 stable transitions
Knowledge based reduction with 32 factoid took 295 ms. Reduced automaton from 26 states, 58 edges and 3 AP (stutter sensitive) to 26 states, 58 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (20 resets) in 1295 ms. (30 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 67905 steps, run timeout after 3003 ms. (steps per millisecond=22 ) properties seen :0 out of 18
Probabilistic random walk after 67905 steps, saw 66764 distinct states, run finished after 3013 ms. (steps per millisecond=22 ) properties seen :0
[2026-05-25 07:00:16] [INFO ] Invariant cache hit.
[2026-05-25 07:00:16] [INFO ] State equation strengthened by 12720 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 13595/13601 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13601/52643 variables, and 3 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5074 ms.
Refiners :[Positive P Invariants (semi-flows): 1/80 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/13763 constraints, ReadFeed: 0/12720 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 13595/13601 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13601 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 13601/52643 variables, and 8 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/80 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/13763 constraints, ReadFeed: 0/12720 constraints, PredecessorRefiner: 0/18 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10291ms problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 13763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 6317 Post agglomeration using F-continuation condition.Transition count delta: 6317
Deduced a syphon composed of 6317 places in 15 ms
Reduce places removed 6317 places and 0 transitions.
Iterating global reduction 2 with 12634 rules applied. Total rules applied 13754 place count 6886 transition count 32003
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13755 place count 6886 transition count 32002
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13756 place count 6885 transition count 32002
Partial Free-agglomeration rule applied 6478 times.
Drop transitions (Partial Free agglomeration) removed 6478 transitions
Iterating global reduction 3 with 6478 rules applied. Total rules applied 20234 place count 6885 transition count 32002
Applied a total of 20234 rules in 12120 ms. Remains 6885 /13763 variables (removed 6878) and now considering 32002/38880 (removed 6878) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12123 ms. Remains : 6885/13763 places, 32002/38880 transitions.
RANDOM walk for 40000 steps (80 resets) in 1697 ms. (23 steps per ms) remains 3/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 3/3 properties
[2026-05-25 07:00:39] [INFO ] Flow matrix only has 31999 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3167000432807014103.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6226126882066317307.kers'
[2026-05-25 07:00:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3167000432807014103.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6226126882066317307.kers]
Culled 0 columns in 10 ms.
// Phase 1: matrix 31999 rows 6885 cols 64716 entries
Finished phase 1 with 6723 SingleSign rule and 80 generalized
[2026-05-25 07:00:40] [INFO ] Computed 82 invariants in 872 ms
Computed 82 P flows in 872 ms.
Exported basis to /tmp/petrispot-output-6226126882066317307.kers
Total runtime 899 ms.
[2026-05-25 07:00:40] [INFO ] State equation strengthened by 31748 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6717/6723 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6723 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 158/6881 variables, 79/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6881 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/6883 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6883 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 31999/38882 variables, 6883/6965 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 38882/38884 variables, and 38713 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45098 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 6883/6885 constraints, ReadFeed: 31748/31748 constraints, PredecessorRefiner: 3/3 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6717/6723 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6723 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6723 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 158/6881 variables, 79/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6881 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/6883 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6883 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6883 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 31999/38882 variables, 6883/6968 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 38882/38884 variables, and 38716 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45045 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 6883/6885 constraints, ReadFeed: 31748/31748 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 91180ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 6885 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6885/6885 places, 32002/32002 transitions.
Applied a total of 0 rules in 1869 ms. Remains 6885 /6885 variables (removed 0) and now considering 32002/32002 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1869 ms. Remains : 6885/6885 places, 32002/32002 transitions.
Knowledge based reduction with 32 factoid took 539 ms. Reduced automaton from 26 states, 58 edges and 3 AP (stutter sensitive) to 26 states, 58 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 901 ms :[(NOT p0), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p0), (NOT p0)]
Knowledge-based reduction took 121417 ms.
Stuttering acceptance computed with spot in 929 ms :[(NOT p0), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 898 ms :[(NOT p0), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25041 reset in 3455 ms.
Product exploration explored 100000 steps with 25034 reset in 3469 ms.
Spot run failed in 49 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin15192152415605435601
[2026-05-25 07:02:23] [INFO ] Built C files in 255ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15192152415605435601
Running compilation step : cd /tmp/ltsmin15192152415605435601;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' '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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15192152415605435601;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' '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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15192152415605435601;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' '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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 6 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3094 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4886623139528192115.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15783046130379160978.kers'
[2026-05-25 07:02:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4886623139528192115.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15783046130379160978.kers]
Culled 0 columns in 18 ms.
// Phase 1: matrix 38880 rows 13763 cols 78400 entries
Finished phase 1 with 13601 SingleSign rule and 80 generalized
[2026-05-25 07:02:31] [INFO ] Computed 82 invariants in 2069 ms
Computed 82 P flows in 2070 ms.
Exported basis to /tmp/petrispot-output-15783046130379160978.kers
Total runtime 2099 ms.
[2026-05-25 07:02:53] [INFO ] Implicit Places using invariants in 24347 ms returned []
Implicit Place search using SMT only with invariants took 24349 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 27446 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Built C files in :
/tmp/ltsmin8947775542873702567
[2026-05-25 07:02:54] [INFO ] Built C files in 223ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8947775542873702567
Running compilation step : cd /tmp/ltsmin8947775542873702567;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' '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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8947775542873702567;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' '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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8947775542873702567;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' '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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-25 07:02:58] [INFO ] Flatten gal took : 936 ms
[2026-05-25 07:02:58] [INFO ] Flatten gal took : 603 ms
[2026-05-25 07:02:59] [INFO ] Time to serialize gal into /tmp/LTL9707990096022931156.gal : 126 ms
[2026-05-25 07:02:59] [INFO ] Time to serialize properties into /tmp/LTL4434667883728481070.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9707990096022931156.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4340828154879658829.hoa' '-atoms' '/tmp/LTL4434667883728481070.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4434667883728481070.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4340828154879658829.hoa
Detected timeout of ITS tools.
[2026-05-25 07:03:15] [INFO ] Flatten gal took : 595 ms
[2026-05-25 07:03:15] [INFO ] Flatten gal took : 591 ms
[2026-05-25 07:03:15] [INFO ] Time to serialize gal into /tmp/LTL11285143516527113296.gal : 116 ms
[2026-05-25 07:03:15] [INFO ] Time to serialize properties into /tmp/LTL17808521901276156674.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11285143516527113296.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17808521901276156674.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((("(Node33GiveAnswer47<=Node10requestsent58)")U(X(X(X("(Node43GiveAnswer49>Node8requestsent67)")))))U((("(Node43GiveAnswer49<=Node8...274
Formula 0 simplified : (!"(Node33GiveAnswer47<=Node10requestsent58)" R XXX!"(Node43GiveAnswer49>Node8requestsent67)") R ((!"(Node43GiveAnswer49<=Node8reque...263
Detected timeout of ITS tools.
[2026-05-25 07:03:31] [INFO ] Flatten gal took : 479 ms
[2026-05-25 07:03:31] [INFO ] Applying decomposition
[2026-05-25 07:03:31] [INFO ] Flatten gal took : 524 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/graph12372146496497789762.txt' '-o' '/tmp/graph12372146496497789762.bin' '-w' '/tmp/graph12372146496497789762.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12372146496497789762.bin' '-l' '-1' '-v' '-w' '/tmp/graph12372146496497789762.weights' '-q' '0' '-e' '0.001'
[2026-05-25 07:03:33] [INFO ] Decomposing Gal with order
[2026-05-25 07:03:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 07:03:38] [INFO ] Removed a total of 19252 redundant transitions.
[2026-05-25 07:03:38] [INFO ] Flatten gal took : 2569 ms
[2026-05-25 07:03:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 12484 labels/synchronizations in 2819 ms.
[2026-05-25 07:03:44] [INFO ] Time to serialize gal into /tmp/LTL5503678086991213351.gal : 123 ms
[2026-05-25 07:03:44] [INFO ] Time to serialize properties into /tmp/LTL13749055639958679980.ltl : 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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5503678086991213351.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13749055639958679980.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((("(gu320.Node33GiveAnswer47<=gu320.Node10requestsent58)")U(X(X(X("(gu319.Node43GiveAnswer49>gu319.Node8requestsent67)")))))U((("(g...334
Formula 0 simplified : (!"(gu320.Node33GiveAnswer47<=gu320.Node10requestsent58)" R XXX!"(gu319.Node43GiveAnswer49>gu319.Node8requestsent67)") R ((!"(gu319....323
Detected timeout of ITS tools.
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-08 finished in 410445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0&&G(p1)))&&F(p2))))'
Support contains 4 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3785 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2026-05-25 07:04:02] [INFO ] Invariant cache hit.
[2026-05-25 07:04:25] [INFO ] Implicit Places using invariants in 22902 ms returned []
Implicit Place search using SMT only with invariants took 22909 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 26698 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0&&G(p1)))&&F(p2))))'
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-09
Stuttering criterion allowed to conclude after 2022 steps with 0 reset in 62 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-09 finished in 27113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 6319 Post agglomeration using F-continuation condition.Transition count delta: 6319
Deduced a syphon composed of 6319 places in 16 ms
Reduce places removed 6319 places and 0 transitions.
Iterating global reduction 2 with 12638 rules applied. Total rules applied 13758 place count 6884 transition count 32001
Applied a total of 13758 rules in 7953 ms. Remains 6884 /13763 variables (removed 6879) and now considering 32001/38880 (removed 6879) transitions.
[2026-05-25 07:04:34] [INFO ] Flow matrix only has 25840 transitions (discarded 6161 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17305194422028879682.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10039718405917419180.kers'
[2026-05-25 07:04:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17305194422028879682.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10039718405917419180.kers]
Culled 0 columns in 8 ms.
// Phase 1: matrix 25840 rows 6884 cols 52240 entries
Finished phase 1 with 6722 SingleSign rule and 80 generalized
[2026-05-25 07:04:34] [INFO ] Computed 82 invariants in 733 ms
Computed 82 P flows in 734 ms.
Exported basis to /tmp/petrispot-output-10039718405917419180.kers
Total runtime 752 ms.
[2026-05-25 07:04:46] [INFO ] Implicit Places using invariants in 12261 ms returned []
Implicit Place search using SMT only with invariants took 12267 ms to find 0 implicit places.
Running 31921 sub problems to find dead transitions.
[2026-05-25 07:04:46] [INFO ] Flow matrix only has 25840 transitions (discarded 6161 similar events)
[2026-05-25 07:04:46] [INFO ] Invariant cache hit.
[2026-05-25 07:04:46] [INFO ] State equation strengthened by 19117 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/6883 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 31921 unsolved
SMT process timed out in 137053ms, After SMT, problems are : Problem set: 0 solved, 31921 unsolved
Search for dead transitions found 0 dead transitions in 137103ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6884/13763 places, 32001/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 157374 ms. Remains : 6884/13763 places, 32001/38880 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-11
Product exploration explored 100000 steps with 248 reset in 2767 ms.
Product exploration explored 100000 steps with 249 reset in 2801 ms.
Computed a total of 243 stabilizing places and 400 stable transitions
Computed a total of 243 stabilizing places and 400 stable transitions
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (96 resets) in 1651 ms. (24 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 58802 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 1
Probabilistic random walk after 58802 steps, saw 46743 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
[2026-05-25 07:07:13] [INFO ] Flow matrix only has 25840 transitions (discarded 6161 similar events)
[2026-05-25 07:07:13] [INFO ] Invariant cache hit.
[2026-05-25 07:07:13] [INFO ] State equation strengthened by 19117 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6721/6722 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6722 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6722 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 158/6880 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6880 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/6882 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 16863ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 6884 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 6884 transition count 32000
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 6883 transition count 32000
Partial Free-agglomeration rule applied 6481 times.
Drop transitions (Partial Free agglomeration) removed 6481 transitions
Iterating global reduction 1 with 6481 rules applied. Total rules applied 6483 place count 6883 transition count 32000
Applied a total of 6483 rules in 5575 ms. Remains 6883 /6884 variables (removed 1) and now considering 32000/32001 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5576 ms. Remains : 6883/6884 places, 32000/32001 transitions.
RANDOM walk for 21118 steps (42 resets) in 867 ms. (24 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 26738 ms.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 6884 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 1542 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
[2026-05-25 07:07:37] [INFO ] Flow matrix only has 25840 transitions (discarded 6161 similar events)
[2026-05-25 07:07:37] [INFO ] Invariant cache hit.
[2026-05-25 07:07:49] [INFO ] Implicit Places using invariants in 12305 ms returned []
Implicit Place search using SMT only with invariants took 12308 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13851 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Computed a total of 243 stabilizing places and 400 stable transitions
Computed a total of 243 stabilizing places and 400 stable transitions
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (97 resets) in 1664 ms. (24 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 58540 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 1
Probabilistic random walk after 58540 steps, saw 46708 distinct states, run finished after 3002 ms. (steps per millisecond=19 ) properties seen :0
[2026-05-25 07:07:53] [INFO ] Flow matrix only has 25840 transitions (discarded 6161 similar events)
[2026-05-25 07:07:53] [INFO ] Invariant cache hit.
[2026-05-25 07:07:53] [INFO ] State equation strengthened by 19117 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6721/6722 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6722 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6722 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 158/6880 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6880 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/6882 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 17391ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 6884 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 6884 transition count 32000
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 6883 transition count 32000
Partial Free-agglomeration rule applied 6481 times.
Drop transitions (Partial Free agglomeration) removed 6481 transitions
Iterating global reduction 1 with 6481 rules applied. Total rules applied 6483 place count 6883 transition count 32000
Applied a total of 6483 rules in 5127 ms. Remains 6883 /6884 variables (removed 1) and now considering 32000/32001 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5128 ms. Remains : 6883/6884 places, 32000/32001 transitions.
RANDOM walk for 37555 steps (76 resets) in 1555 ms. (24 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 26922 ms.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 247 reset in 3247 ms.
Product exploration explored 100000 steps with 247 reset in 2879 ms.
Built C files in :
/tmp/ltsmin14174255317482832394
[2026-05-25 07:08:23] [INFO ] Too many transitions (32001) to apply POR reductions. Disabling POR matrices.
[2026-05-25 07:08:23] [INFO ] Built C files in 179ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14174255317482832394
Running compilation step : cd /tmp/ltsmin14174255317482832394;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' '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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14174255317482832394;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' '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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14174255317482832394;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' '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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 1 out of 6884 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6884/6884 places, 32001/32001 transitions.
Applied a total of 0 rules in 1481 ms. Remains 6884 /6884 variables (removed 0) and now considering 32001/32001 (removed 0) transitions.
[2026-05-25 07:08:27] [INFO ] Flow matrix only has 25840 transitions (discarded 6161 similar events)
[2026-05-25 07:08:27] [INFO ] Invariant cache hit.
[2026-05-25 07:08:39] [INFO ] Implicit Places using invariants in 11239 ms returned []
Implicit Place search using SMT only with invariants took 11244 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12727 ms. Remains : 6884/6884 places, 32001/32001 transitions.
Built C files in :
/tmp/ltsmin16066712050243129699
[2026-05-25 07:08:39] [INFO ] Too many transitions (32001) to apply POR reductions. Disabling POR matrices.
[2026-05-25 07:08:39] [INFO ] Built C files in 169ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16066712050243129699
Running compilation step : cd /tmp/ltsmin16066712050243129699;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' '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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16066712050243129699;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' '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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16066712050243129699;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' '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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-25 07:08:43] [INFO ] Flatten gal took : 392 ms
[2026-05-25 07:08:43] [INFO ] Flatten gal took : 448 ms
[2026-05-25 07:08:43] [INFO ] Time to serialize gal into /tmp/LTL16791134905219844866.gal : 105 ms
[2026-05-25 07:08:43] [INFO ] Time to serialize properties into /tmp/LTL3093211226866753665.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16791134905219844866.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6950406926443289858.hoa' '-atoms' '/tmp/LTL3093211226866753665.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3093211226866753665.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6950406926443289858.hoa
Detected timeout of ITS tools.
[2026-05-25 07:08:59] [INFO ] Flatten gal took : 465 ms
[2026-05-25 07:09:00] [INFO ] Flatten gal took : 347 ms
[2026-05-25 07:09:00] [INFO ] Time to serialize gal into /tmp/LTL10791382592486286094.gal : 111 ms
[2026-05-25 07:09:00] [INFO ] Time to serialize properties into /tmp/LTL15432722885455750426.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10791382592486286094.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15432722885455750426.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(Node11GiveAnswer48<1)"))))
Formula 0 simplified : FG!"(Node11GiveAnswer48<1)"
Detected timeout of ITS tools.
[2026-05-25 07:09:15] [INFO ] Flatten gal took : 343 ms
[2026-05-25 07:09:15] [INFO ] Applying decomposition
[2026-05-25 07:09:15] [INFO ] Flatten gal took : 369 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/graph12780118214914208544.txt' '-o' '/tmp/graph12780118214914208544.bin' '-w' '/tmp/graph12780118214914208544.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12780118214914208544.bin' '-l' '-1' '-v' '-w' '/tmp/graph12780118214914208544.weights' '-q' '0' '-e' '0.001'
[2026-05-25 07:09:16] [INFO ] Decomposing Gal with order
[2026-05-25 07:09:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 07:09:20] [INFO ] Removed a total of 25394 redundant transitions.
[2026-05-25 07:09:21] [INFO ] Flatten gal took : 3633 ms
[2026-05-25 07:09:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 18802 labels/synchronizations in 5389 ms.
[2026-05-25 07:09:27] [INFO ] Time to serialize gal into /tmp/LTL13123636600475992396.gal : 111 ms
[2026-05-25 07:09:27] [INFO ] Time to serialize properties into /tmp/LTL15753462160984087342.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13123636600475992396.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15753462160984087342.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("(u49.Node11GiveAnswer48<1)"))))
Formula 0 simplified : FG!"(u49.Node11GiveAnswer48<1)"
Detected timeout of ITS tools.
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-11 finished in 315888 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((F(p1)&&(G(p2) U p3)))))'
Support contains 7 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 2986 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17095618098775795018.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9635262629527876828.kers'
[2026-05-25 07:09:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17095618098775795018.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9635262629527876828.kers]
Culled 0 columns in 17 ms.
// Phase 1: matrix 38880 rows 13763 cols 78400 entries
Finished phase 1 with 13601 SingleSign rule and 80 generalized
[2026-05-25 07:09:47] [INFO ] Computed 82 invariants in 2059 ms
Computed 82 P flows in 2059 ms.
Exported basis to /tmp/petrispot-output-9635262629527876828.kers
Total runtime 2088 ms.
[2026-05-25 07:10:09] [INFO ] Implicit Places using invariants in 24746 ms returned []
Implicit Place search using SMT only with invariants took 24752 ms to find 0 implicit places.
Running 38800 sub problems to find dead transitions.
[2026-05-25 07:10:10] [INFO ] Invariant cache hit.
[2026-05-25 07:10:10] [INFO ] State equation strengthened by 12720 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13762/52643 variables, and 80 constraints, problems are : Problem set: 0 solved, 38800 unsolved in 30487 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/13763 constraints, ReadFeed: 0/12720 constraints, PredecessorRefiner: 38800/38800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 13762/52643 variables, and 80 constraints, problems are : Problem set: 0 solved, 38800 unsolved in 30480 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/13763 constraints, ReadFeed: 0/12720 constraints, PredecessorRefiner: 0/38800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 226068ms problems are : Problem set: 0 solved, 38800 unsolved
Search for dead transitions found 0 dead transitions in 226124ms
Finished structural reductions in LTL mode , in 1 iterations and 253924 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((F(p1)&&(G(p2) U p3)))))'
Stuttering acceptance computed with spot in 510 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), true, (NOT p1), (NOT p2), (NOT p3), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-13
Stuttering criterion allowed to conclude after 2273 steps with 0 reset in 67 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-13 finished in 254650 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Support contains 4 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3291 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2026-05-25 07:14:00] [INFO ] Invariant cache hit.
[2026-05-25 07:14:22] [INFO ] Implicit Places using invariants in 22148 ms returned []
Implicit Place search using SMT only with invariants took 22151 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 25444 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Stuttering acceptance computed with spot in 142 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-15 finished in 25694 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F(p1)||X(X(X(F(p2)))))))'
Spot run failed in 42 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(X(X(p1)))) U ((!p1&&X(p2)) U G(p0))))'
Spot run failed in 47 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Spot run failed in 42 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-25 07:14:23] [INFO ] Flatten gal took : 544 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11183667233365628960
[2026-05-25 07:14:23] [INFO ] Too many transitions (38880) to apply POR reductions. Disabling POR matrices.
[2026-05-25 07:14:23] [INFO ] Built C files in 218ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11183667233365628960
Running compilation step : cd /tmp/ltsmin11183667233365628960;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '240' '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'
[2026-05-25 07:14:23] [INFO ] Applying decomposition
[2026-05-25 07:14:24] [INFO ] Flatten gal took : 532 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/graph9304877549003223743.txt' '-o' '/tmp/graph9304877549003223743.bin' '-w' '/tmp/graph9304877549003223743.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9304877549003223743.bin' '-l' '-1' '-v' '-w' '/tmp/graph9304877549003223743.weights' '-q' '0' '-e' '0.001'
[2026-05-25 07:14:26] [INFO ] Decomposing Gal with order
[2026-05-25 07:14:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 07:14:30] [INFO ] Removed a total of 19264 redundant transitions.
[2026-05-25 07:14:31] [INFO ] Flatten gal took : 2421 ms
[2026-05-25 07:14:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 12485 labels/synchronizations in 2773 ms.
[2026-05-25 07:14:37] [INFO ] Time to serialize gal into /tmp/LTLCardinality11665043180191636545.gal : 134 ms
[2026-05-25 07:14:37] [INFO ] Time to serialize properties into /tmp/LTLCardinality9053690991856241021.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11665043180191636545.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9053690991856241021.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 3 LTL properties
Checking formula 0 : !((G((("(gu0.Node0ID>gu0.Node38requestsent61)")||(F("(gu322.Node75requestsent9<=gu322.Node46GiveAnswer15)")))||(X(X(X(F("(gu324.Node23...204
Formula 0 simplified : F(!"(gu0.Node0ID>gu0.Node38requestsent61)" & G!"(gu322.Node75requestsent9<=gu322.Node46GiveAnswer15)" & XXXG!"(gu324.Node23requestse...188
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11183667233365628960;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '240' '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' killed by timeout after 240 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11183667233365628960;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '240' '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' killed by timeout after 240 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)

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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="CANInsertWithFailure-PT-080"
export BK_EXAMINATION="LTLCardinality"
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 CANInsertWithFailure-PT-080, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r034-tall-177946842200763"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-080.tgz
mv CANInsertWithFailure-PT-080 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;