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

About the Execution of ITS-Tools for ZombiesAndSurvivors-PT-Kneser210702005005

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 425884.00 0.00 0.00 FTFFFFFFFFTFFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931340200611.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is ZombiesAndSurvivors-PT-Kneser210702005005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931340200611
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 776K
-rw-r--r-- 1 mcc users 9.7K Jun 6 09:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Jun 6 09:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 6 09:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Jun 6 09:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Jun 6 12:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 12:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Jun 6 12:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 12:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 22K Jun 6 09:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 204K Jun 6 09:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Jun 6 09:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Jun 6 09:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 12:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Jun 6 12:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 19 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 177K Jun 5 20:08 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 ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-00
FORMULA_NAME ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-01
FORMULA_NAME ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-02
FORMULA_NAME ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-03
FORMULA_NAME ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-04
FORMULA_NAME ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-05
FORMULA_NAME ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-06
FORMULA_NAME ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-07
FORMULA_NAME ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-08
FORMULA_NAME ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-09
FORMULA_NAME ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-10
FORMULA_NAME ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-11
FORMULA_NAME ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-12
FORMULA_NAME ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-13
FORMULA_NAME ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-14
FORMULA_NAME ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749424919702

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ZombiesAndSurvivors-PT-Kneser210702005005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-08 23:22:00] [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]
[2025-06-08 23:22:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 23:22:01] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2025-06-08 23:22:01] [INFO ] Transformed 42 places.
[2025-06-08 23:22:01] [INFO ] Transformed 462 transitions.
[2025-06-08 23:22:01] [INFO ] Parsed PT model containing 42 places and 462 transitions and 966 arcs in 156 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 462/462 transitions.
Applied a total of 0 rules in 10 ms. Remains 42 /42 variables (removed 0) and now considering 462/462 (removed 0) transitions.
// Phase 1: matrix 462 rows 42 cols
[2025-06-08 23:22:01] [INFO ] Computed 0 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:22:01] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-06-08 23:22:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:22:01] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-08 23:22:01] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Running 442 sub problems to find dead transitions.
[2025-06-08 23:22:01] [INFO ] Invariant cache hit.
[2025-06-08 23:22:01] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (OVERLAPS) 462/504 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 40/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (OVERLAPS) 0/504 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 82 constraints, problems are : Problem set: 0 solved, 442 unsolved in 10847 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 442 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (OVERLAPS) 462/504 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 40/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 442/524 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/504 variables, and 524 constraints, problems are : Problem set: 0 solved, 442 unsolved in 30029 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41046ms problems are : Problem set: 0 solved, 442 unsolved
Search for dead transitions found 0 dead transitions in 41059ms
Finished structural reductions in LTL mode , in 1 iterations and 41409 ms. Remains : 42/42 places, 462/462 transitions.
Support contains 29 out of 42 places after structural reductions.
[2025-06-08 23:22:42] [INFO ] Flatten gal took : 38 ms
[2025-06-08 23:22:42] [INFO ] Flatten gal took : 17 ms
[2025-06-08 23:22:42] [INFO ] Input system was already deterministic with 462 transitions.
RANDOM walk for 39138 steps (8 resets) in 245 ms. (159 steps per ms) remains 0/29 properties
FORMULA ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 21 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 462/462 transitions.
Graph (trivial) has 360 edges and 42 vertex of which 39 / 42 are part of one of the 2 SCC in 1 ms
Free SCC test removed 37 places
Ensure Unique test removed 446 transitions
Reduce isomorphic transitions removed 446 transitions.
Applied a total of 1 rules in 12 ms. Remains 5 /42 variables (removed 37) and now considering 16/462 (removed 446) transitions.
[2025-06-08 23:22:43] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
// Phase 1: matrix 13 rows 5 cols
[2025-06-08 23:22:43] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:22:43] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-06-08 23:22:43] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
[2025-06-08 23:22:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:22:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-08 23:22:43] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 23:22:43] [INFO ] Redundant transitions in 1 ms returned []
Running 9 sub problems to find dead transitions.
[2025-06-08 23:22:43] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
[2025-06-08 23:22:43] [INFO ] Invariant cache hit.
[2025-06-08 23:22:43] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/17 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/18 variables, and 6 constraints, problems are : Problem set: 0 solved, 9 unsolved in 60 ms.
Refiners :[State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/17 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/17 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/18 variables, and 15 constraints, problems are : Problem set: 0 solved, 9 unsolved in 74 ms.
Refiners :[State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 138ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 138ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/42 places, 16/462 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 195 ms. Remains : 5/42 places, 16/462 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-00 finished in 448 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0&&X(X(X(X(p1)))))||G(p1))))'
Support contains 2 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 462/462 transitions.
Applied a total of 0 rules in 4 ms. Remains 42 /42 variables (removed 0) and now considering 462/462 (removed 0) transitions.
// Phase 1: matrix 462 rows 42 cols
[2025-06-08 23:22:43] [INFO ] Computed 0 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:22:43] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-08 23:22:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:22:44] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-08 23:22:44] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 442 sub problems to find dead transitions.
[2025-06-08 23:22:44] [INFO ] Invariant cache hit.
[2025-06-08 23:22:44] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (OVERLAPS) 462/504 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 40/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (OVERLAPS) 0/504 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 82 constraints, problems are : Problem set: 0 solved, 442 unsolved in 10425 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 442 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (OVERLAPS) 462/504 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 40/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 442/524 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/504 variables, and 524 constraints, problems are : Problem set: 0 solved, 442 unsolved in 30015 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40542ms problems are : Problem set: 0 solved, 442 unsolved
Search for dead transitions found 0 dead transitions in 40546ms
Finished structural reductions in LTL mode , in 1 iterations and 40675 ms. Remains : 42/42 places, 462/462 transitions.
Stuttering acceptance computed with spot in 610 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-01
Product exploration explored 100000 steps with 20000 reset in 347 ms.
Product exploration explored 100000 steps with 20000 reset in 234 ms.
Computed a total of 0 stabilizing places and 21 stable transitions
Computed a total of 0 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 7 factoid took 451 ms. Reduced automaton from 16 states, 48 edges and 2 AP (stutter sensitive) to 16 states, 48 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 672 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 15034 steps (3 resets) in 49 ms. (300 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 581 ms. Reduced automaton from 16 states, 48 edges and 2 AP (stutter sensitive) to 16 states, 48 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 661 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 702 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 462/462 transitions.
Applied a total of 0 rules in 8 ms. Remains 42 /42 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2025-06-08 23:23:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:23:28] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-08 23:23:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:23:29] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-08 23:23:29] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Running 442 sub problems to find dead transitions.
[2025-06-08 23:23:29] [INFO ] Invariant cache hit.
[2025-06-08 23:23:29] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (OVERLAPS) 462/504 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 40/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (OVERLAPS) 0/504 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 82 constraints, problems are : Problem set: 0 solved, 442 unsolved in 10459 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 442 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (OVERLAPS) 462/504 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 40/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 442/524 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/504 variables, and 524 constraints, problems are : Problem set: 0 solved, 442 unsolved in 30027 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40582ms problems are : Problem set: 0 solved, 442 unsolved
Search for dead transitions found 0 dead transitions in 40584ms
Finished structural reductions in LTL mode , in 1 iterations and 40700 ms. Remains : 42/42 places, 462/462 transitions.
Computed a total of 0 stabilizing places and 21 stable transitions
Computed a total of 0 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 7 factoid took 468 ms. Reduced automaton from 16 states, 48 edges and 2 AP (stutter sensitive) to 16 states, 48 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 693 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 21116 steps (5 resets) in 34 ms. (603 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 673 ms. Reduced automaton from 16 states, 48 edges and 2 AP (stutter sensitive) to 16 states, 48 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 662 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 645 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 717 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 20000 reset in 183 ms.
Product exploration explored 100000 steps with 20000 reset in 198 ms.
Built C files in :
/tmp/ltsmin17988222351661391993
[2025-06-08 23:24:14] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17988222351661391993
Running compilation step : cd /tmp/ltsmin17988222351661391993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 620 ms.
Running link step : cd /tmp/ltsmin17988222351661391993;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin17988222351661391993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8699585753801438788.hoa' '--buchi-type=spotba'
LTSmin run took 645 ms.
FORMULA ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-01 finished in 91573 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U p1)))'
Support contains 4 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 462/462 transitions.
Applied a total of 0 rules in 8 ms. Remains 42 /42 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2025-06-08 23:24:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:24:15] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-08 23:24:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:24:15] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-08 23:24:15] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 442 sub problems to find dead transitions.
[2025-06-08 23:24:15] [INFO ] Invariant cache hit.
[2025-06-08 23:24:15] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (OVERLAPS) 462/504 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 40/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (OVERLAPS) 0/504 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 82 constraints, problems are : Problem set: 0 solved, 442 unsolved in 10578 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 442 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (OVERLAPS) 462/504 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 40/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 442/524 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/504 variables, and 524 constraints, problems are : Problem set: 0 solved, 442 unsolved in 30017 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40660ms problems are : Problem set: 0 solved, 442 unsolved
Search for dead transitions found 0 dead transitions in 40662ms
Finished structural reductions in LTL mode , in 1 iterations and 40787 ms. Remains : 42/42 places, 462/462 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 375 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-03 finished in 41291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||(X(X(p1))&&F(p2))))))'
Support contains 5 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 462/462 transitions.
Applied a total of 0 rules in 5 ms. Remains 42 /42 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2025-06-08 23:24:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:24:56] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-06-08 23:24:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:24:56] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-08 23:24:56] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 442 sub problems to find dead transitions.
[2025-06-08 23:24:56] [INFO ] Invariant cache hit.
[2025-06-08 23:24:56] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (OVERLAPS) 462/504 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 40/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (OVERLAPS) 0/504 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 82 constraints, problems are : Problem set: 0 solved, 442 unsolved in 10595 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 442 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (OVERLAPS) 462/504 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 40/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 442/524 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/504 variables, and 524 constraints, problems are : Problem set: 0 solved, 442 unsolved in 30019 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40675ms problems are : Problem set: 0 solved, 442 unsolved
Search for dead transitions found 0 dead transitions in 40676ms
Finished structural reductions in LTL mode , in 1 iterations and 40786 ms. Remains : 42/42 places, 462/462 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (NOT p1), true]
Running random walk in product with property : ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1901 steps with 49 reset in 8 ms.
FORMULA ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-04 finished in 41006 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 462/462 transitions.
Graph (trivial) has 310 edges and 42 vertex of which 36 / 42 are part of one of the 2 SCC in 0 ms
Free SCC test removed 34 places
Ensure Unique test removed 424 transitions
Reduce isomorphic transitions removed 424 transitions.
Applied a total of 1 rules in 5 ms. Remains 8 /42 variables (removed 34) and now considering 38/462 (removed 424) transitions.
[2025-06-08 23:25:37] [INFO ] Flow matrix only has 32 transitions (discarded 6 similar events)
// Phase 1: matrix 32 rows 8 cols
[2025-06-08 23:25:37] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:25:37] [INFO ] Implicit Places using invariants in 15 ms returned []
[2025-06-08 23:25:37] [INFO ] Flow matrix only has 32 transitions (discarded 6 similar events)
[2025-06-08 23:25:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:25:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-08 23:25:37] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 23:25:37] [INFO ] Redundant transitions in 0 ms returned []
Running 28 sub problems to find dead transitions.
[2025-06-08 23:25:37] [INFO ] Flow matrix only has 32 transitions (discarded 6 similar events)
[2025-06-08 23:25:37] [INFO ] Invariant cache hit.
[2025-06-08 23:25:37] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 0/39 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/40 variables, and 9 constraints, problems are : Problem set: 0 solved, 28 unsolved in 120 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 0/39 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/40 variables, and 37 constraints, problems are : Problem set: 0 solved, 28 unsolved in 255 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 380ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 381ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/42 places, 38/462 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 443 ms. Remains : 8/42 places, 38/462 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 161 ms.
Product exploration explored 100000 steps with 0 reset in 130 ms.
Computed a total of 0 stabilizing places and 7 stable transitions
Computed a total of 0 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
RANDOM walk for 20363 steps (4 resets) in 46 ms. (433 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 6 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 38/38 transitions.
Applied a total of 0 rules in 2 ms. Remains 8 /8 variables (removed 0) and now considering 38/38 (removed 0) transitions.
[2025-06-08 23:25:38] [INFO ] Flow matrix only has 32 transitions (discarded 6 similar events)
[2025-06-08 23:25:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:25:38] [INFO ] Implicit Places using invariants in 15 ms returned []
[2025-06-08 23:25:38] [INFO ] Flow matrix only has 32 transitions (discarded 6 similar events)
[2025-06-08 23:25:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:25:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-08 23:25:38] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 23:25:38] [INFO ] Redundant transitions in 0 ms returned []
Running 28 sub problems to find dead transitions.
[2025-06-08 23:25:38] [INFO ] Flow matrix only has 32 transitions (discarded 6 similar events)
[2025-06-08 23:25:38] [INFO ] Invariant cache hit.
[2025-06-08 23:25:38] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 0/39 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/40 variables, and 9 constraints, problems are : Problem set: 0 solved, 28 unsolved in 108 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 0/39 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/40 variables, and 37 constraints, problems are : Problem set: 0 solved, 28 unsolved in 238 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 361ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 362ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 408 ms. Remains : 8/8 places, 38/38 transitions.
Computed a total of 0 stabilizing places and 7 stable transitions
Computed a total of 0 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 17050 steps (3 resets) in 9 ms. (1705 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 71 ms.
Product exploration explored 100000 steps with 0 reset in 169 ms.
Built C files in :
/tmp/ltsmin6923412352548419875
[2025-06-08 23:25:39] [INFO ] Computing symmetric may disable matrix : 38 transitions.
[2025-06-08 23:25:39] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 23:25:39] [INFO ] Computing symmetric may enable matrix : 38 transitions.
[2025-06-08 23:25:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 23:25:39] [INFO ] Computing Do-Not-Accords matrix : 38 transitions.
[2025-06-08 23:25:39] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 23:25:39] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6923412352548419875
Running compilation step : cd /tmp/ltsmin6923412352548419875;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 98 ms.
Running link step : cd /tmp/ltsmin6923412352548419875;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin6923412352548419875;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8087770968751012159.hoa' '--buchi-type=spotba'
LTSmin run took 174 ms.
FORMULA ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-06 finished in 2372 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X((p1 U (G(p1)||(p1&&(X(p2) U ((p2&&X(p2))||X(G(p2))))))))) U X((p0 U p3))))'
Support contains 6 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 462/462 transitions.
Applied a total of 0 rules in 6 ms. Remains 42 /42 variables (removed 0) and now considering 462/462 (removed 0) transitions.
// Phase 1: matrix 462 rows 42 cols
[2025-06-08 23:25:40] [INFO ] Computed 0 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:25:40] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-08 23:25:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:25:40] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-08 23:25:40] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 442 sub problems to find dead transitions.
[2025-06-08 23:25:40] [INFO ] Invariant cache hit.
[2025-06-08 23:25:40] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (OVERLAPS) 462/504 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 40/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (OVERLAPS) 0/504 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 82 constraints, problems are : Problem set: 0 solved, 442 unsolved in 10391 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 442 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (OVERLAPS) 462/504 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 40/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 442/524 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/504 variables, and 524 constraints, problems are : Problem set: 0 solved, 442 unsolved in 30011 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40474ms problems are : Problem set: 0 solved, 442 unsolved
Search for dead transitions found 0 dead transitions in 40475ms
Finished structural reductions in LTL mode , in 1 iterations and 40596 ms. Remains : 42/42 places, 462/462 transitions.
Stuttering acceptance computed with spot in 478 ms :[(NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), true, (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 286 steps with 130 reset in 0 ms.
FORMULA ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-07 finished in 41102 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 462/462 transitions.
Graph (trivial) has 400 edges and 42 vertex of which 41 / 42 are part of one of the 2 SCC in 1 ms
Free SCC test removed 39 places
Ensure Unique test removed 454 transitions
Reduce isomorphic transitions removed 454 transitions.
Applied a total of 1 rules in 8 ms. Remains 3 /42 variables (removed 39) and now considering 8/462 (removed 454) transitions.
[2025-06-08 23:26:21] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 3 cols
[2025-06-08 23:26:21] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:26:21] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-06-08 23:26:21] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
[2025-06-08 23:26:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:26:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-08 23:26:21] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 23:26:21] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-08 23:26:21] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
[2025-06-08 23:26:21] [INFO ] Invariant cache hit.
[2025-06-08 23:26:21] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/10 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 27 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 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
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/10 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 33 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 63ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/42 places, 8/462 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 114 ms. Remains : 3/42 places, 8/462 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-08
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-08 finished in 203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0)) U (p1 U p2))))'
Support contains 7 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 462/462 transitions.
Applied a total of 0 rules in 8 ms. Remains 42 /42 variables (removed 0) and now considering 462/462 (removed 0) transitions.
// Phase 1: matrix 462 rows 42 cols
[2025-06-08 23:26:21] [INFO ] Computed 0 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:26:21] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-08 23:26:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:26:21] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-08 23:26:21] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 442 sub problems to find dead transitions.
[2025-06-08 23:26:21] [INFO ] Invariant cache hit.
[2025-06-08 23:26:21] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (OVERLAPS) 462/504 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 40/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (OVERLAPS) 0/504 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 82 constraints, problems are : Problem set: 0 solved, 442 unsolved in 10390 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 442 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (OVERLAPS) 462/504 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 40/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 442/524 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/504 variables, and 524 constraints, problems are : Problem set: 0 solved, 442 unsolved in 30015 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40456ms problems are : Problem set: 0 solved, 442 unsolved
Search for dead transitions found 0 dead transitions in 40457ms
Finished structural reductions in LTL mode , in 1 iterations and 40576 ms. Remains : 42/42 places, 462/462 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p2), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 12961 steps with 6220 reset in 23 ms.
FORMULA ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-09 finished in 40819 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 462/462 transitions.
Applied a total of 0 rules in 5 ms. Remains 42 /42 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2025-06-08 23:27:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:27:02] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-08 23:27:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:27:02] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-08 23:27:02] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 442 sub problems to find dead transitions.
[2025-06-08 23:27:02] [INFO ] Invariant cache hit.
[2025-06-08 23:27:02] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (OVERLAPS) 462/504 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 40/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (OVERLAPS) 0/504 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 82 constraints, problems are : Problem set: 0 solved, 442 unsolved in 10439 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 442 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (OVERLAPS) 462/504 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 40/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 442/524 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/504 variables, and 524 constraints, problems are : Problem set: 0 solved, 442 unsolved in 30018 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40517ms problems are : Problem set: 0 solved, 442 unsolved
Search for dead transitions found 0 dead transitions in 40518ms
Finished structural reductions in LTL mode , in 1 iterations and 40623 ms. Remains : 42/42 places, 462/462 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 136 steps with 0 reset in 2 ms.
FORMULA ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-12 finished in 40738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&X(p1))) U ((!p2&&X((p0&&X(p1))))||X(G((p0&&X(p1)))))))'
Support contains 6 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 462/462 transitions.
Applied a total of 0 rules in 3 ms. Remains 42 /42 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2025-06-08 23:27:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:27:43] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-08 23:27:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:27:43] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-08 23:27:43] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 442 sub problems to find dead transitions.
[2025-06-08 23:27:43] [INFO ] Invariant cache hit.
[2025-06-08 23:27:43] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (OVERLAPS) 462/504 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 40/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (OVERLAPS) 0/504 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 82 constraints, problems are : Problem set: 0 solved, 442 unsolved in 10575 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 442 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (OVERLAPS) 462/504 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 40/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 442/524 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/504 variables, and 524 constraints, problems are : Problem set: 0 solved, 442 unsolved in 30018 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40654ms problems are : Problem set: 0 solved, 442 unsolved
Search for dead transitions found 0 dead transitions in 40655ms
Finished structural reductions in LTL mode , in 1 iterations and 40757 ms. Remains : 42/42 places, 462/462 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-13 finished in 40938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U (p1&&X(X((p2&&X(p3)))))))'
Support contains 4 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 462/462 transitions.
Applied a total of 0 rules in 4 ms. Remains 42 /42 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2025-06-08 23:28:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:28:24] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-08 23:28:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 23:28:24] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-08 23:28:24] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 442 sub problems to find dead transitions.
[2025-06-08 23:28:24] [INFO ] Invariant cache hit.
[2025-06-08 23:28:24] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (OVERLAPS) 462/504 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 40/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (OVERLAPS) 0/504 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 82 constraints, problems are : Problem set: 0 solved, 442 unsolved in 10558 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 442 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (OVERLAPS) 462/504 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 40/82 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 442/524 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/504 variables, and 524 constraints, problems are : Problem set: 0 solved, 442 unsolved in 30019 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40627ms problems are : Problem set: 0 solved, 442 unsolved
Search for dead transitions found 0 dead transitions in 40628ms
Finished structural reductions in LTL mode , in 1 iterations and 40729 ms. Remains : 42/42 places, 462/462 transitions.
Stuttering acceptance computed with spot in 499 ms :[(OR (NOT p1) (NOT p2) (NOT p3)), (NOT p0), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3)]
Running random walk in product with property : ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 309 ms.
Stack based approach found an accepted trace after 47 steps with 0 reset with depth 48 and stack size 48 in 1 ms.
FORMULA ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ZombiesAndSurvivors-PT-Kneser210702005005-LTLCardinality-15 finished in 41561 ms.
All properties solved by simple procedures.
Total runtime 424616 ms.

BK_STOP 1749425345586

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="ZombiesAndSurvivors-PT-Kneser210702005005"
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-5832"
echo " Executing tool itstools"
echo " Input is ZombiesAndSurvivors-PT-Kneser210702005005, 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 r254-tall-174931340200611"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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