Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r508-tall-171654352100668.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is NoC3x3-PT-8A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654352100668
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 07:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 12 07:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 07:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 12 07:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 745K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-00
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-01
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-02
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-03
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-04
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-05
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-06
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-07
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-08
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-09
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-10
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-11
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-12
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-13
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-14
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717244559059

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-8A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:22:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:22:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:22:40] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2024-06-01 12:22:40] [INFO ] Transformed 317 places.
[2024-06-01 12:22:40] [INFO ] Transformed 4293 transitions.
[2024-06-01 12:22:40] [INFO ] Found NUPN structural information;
[2024-06-01 12:22:40] [INFO ] Parsed PT model containing 317 places and 4293 transitions and 9691 arcs in 269 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 3607 transitions
Reduce redundant transitions removed 3607 transitions.
FORMULA NoC3x3-PT-8A-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8A-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8A-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8A-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 686/686 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 261 transition count 562
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 261 transition count 562
Drop transitions (Redundant composition of simpler transitions.) removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 0 with 52 rules applied. Total rules applied 164 place count 261 transition count 510
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 173 place count 252 transition count 510
Applied a total of 173 rules in 62 ms. Remains 252 /317 variables (removed 65) and now considering 510/686 (removed 176) transitions.
// Phase 1: matrix 510 rows 252 cols
[2024-06-01 12:22:40] [INFO ] Computed 57 invariants in 21 ms
[2024-06-01 12:22:41] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-06-01 12:22:41] [INFO ] Invariant cache hit.
[2024-06-01 12:22:41] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2024-06-01 12:22:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (OVERLAPS) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 19716 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 25265 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
After SMT, in 45238ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 45272ms
Starting structural reductions in LTL mode, iteration 1 : 252/317 places, 510/686 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46001 ms. Remains : 252/317 places, 510/686 transitions.
Support contains 23 out of 252 places after structural reductions.
[2024-06-01 12:23:26] [INFO ] Flatten gal took : 74 ms
[2024-06-01 12:23:26] [INFO ] Flatten gal took : 39 ms
[2024-06-01 12:23:27] [INFO ] Input system was already deterministic with 510 transitions.
Reduction of identical properties reduced properties to check from 23 to 22
RANDOM walk for 9538 steps (1 resets) in 629 ms. (15 steps per ms) remains 0/22 properties
FORMULA NoC3x3-PT-8A-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(p0))&&F(p1))))'
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 6 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
[2024-06-01 12:23:27] [INFO ] Invariant cache hit.
[2024-06-01 12:23:27] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-06-01 12:23:27] [INFO ] Invariant cache hit.
[2024-06-01 12:23:28] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2024-06-01 12:23:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (OVERLAPS) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 19108 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 24799 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
After SMT, in 44091ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 44099ms
Finished structural reductions in LTL mode , in 1 iterations and 44507 ms. Remains : 252/252 places, 510/510 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 616 ms.
Product exploration explored 100000 steps with 33333 reset in 503 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 20 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-8A-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-8A-LTLFireability-00 finished in 46012 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
Support contains 3 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 4 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
[2024-06-01 12:24:13] [INFO ] Invariant cache hit.
[2024-06-01 12:24:13] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-06-01 12:24:13] [INFO ] Invariant cache hit.
[2024-06-01 12:24:14] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2024-06-01 12:24:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (OVERLAPS) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 18878 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 24501 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
After SMT, in 43502ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 43506ms
Finished structural reductions in LTL mode , in 1 iterations and 43908 ms. Remains : 252/252 places, 510/510 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-01 finished in 44097 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&(p0 U X(p1)))))))'
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 3 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
[2024-06-01 12:24:57] [INFO ] Invariant cache hit.
[2024-06-01 12:24:57] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-01 12:24:57] [INFO ] Invariant cache hit.
[2024-06-01 12:24:58] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2024-06-01 12:24:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (OVERLAPS) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 18711 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 24912 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
After SMT, in 43728ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 43732ms
Finished structural reductions in LTL mode , in 1 iterations and 44028 ms. Remains : 252/252 places, 510/510 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-02
Product exploration explored 100000 steps with 6 reset in 357 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-02 finished in 44596 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 3 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
[2024-06-01 12:25:42] [INFO ] Invariant cache hit.
[2024-06-01 12:25:42] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-01 12:25:42] [INFO ] Invariant cache hit.
[2024-06-01 12:25:42] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2024-06-01 12:25:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (OVERLAPS) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 18730 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 25097 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
After SMT, in 43939ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 43943ms
Finished structural reductions in LTL mode , in 1 iterations and 44268 ms. Remains : 252/252 places, 510/510 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-03 finished in 44359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&(p1 U (p2||G(p1))))))'
Support contains 3 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 2 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
[2024-06-01 12:26:26] [INFO ] Invariant cache hit.
[2024-06-01 12:26:26] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-01 12:26:26] [INFO ] Invariant cache hit.
[2024-06-01 12:26:27] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2024-06-01 12:26:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (OVERLAPS) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 19020 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 24053 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
After SMT, in 43192ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 43196ms
Finished structural reductions in LTL mode , in 1 iterations and 43497 ms. Remains : 252/252 places, 510/510 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-04 finished in 43680 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G(p0)) U (p1 U (p0&&F(p1)))))))'
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 3 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
[2024-06-01 12:27:10] [INFO ] Invariant cache hit.
[2024-06-01 12:27:10] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-01 12:27:10] [INFO ] Invariant cache hit.
[2024-06-01 12:27:10] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2024-06-01 12:27:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (OVERLAPS) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 18669 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 24179 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
After SMT, in 42964ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 42968ms
Finished structural reductions in LTL mode , in 1 iterations and 43260 ms. Remains : 252/252 places, 510/510 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 345 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-06 finished in 43822 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(X(G(p0)))&&(p1 U (p2||G(p1)))))))'
Support contains 3 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 3 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
[2024-06-01 12:27:54] [INFO ] Invariant cache hit.
[2024-06-01 12:27:54] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-01 12:27:54] [INFO ] Invariant cache hit.
[2024-06-01 12:27:54] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2024-06-01 12:27:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (OVERLAPS) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 18267 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 24907 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
After SMT, in 43284ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 43289ms
Finished structural reductions in LTL mode , in 1 iterations and 43581 ms. Remains : 252/252 places, 510/510 transitions.
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-08
Product exploration explored 100000 steps with 357 reset in 471 ms.
Stack based approach found an accepted trace after 52 steps with 0 reset with depth 53 and stack size 53 in 1 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-08 finished in 44356 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 510/510 transitions.
Graph (trivial) has 164 edges and 252 vertex of which 75 / 252 are part of one of the 33 SCC in 4 ms
Free SCC test removed 42 places
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 200 transition count 345
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 66 place count 176 transition count 345
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 112 place count 153 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 136 transitions
Redundant transition composition rules discarded 136 transitions
Iterating global reduction 2 with 136 rules applied. Total rules applied 248 place count 153 transition count 186
Applied a total of 248 rules in 46 ms. Remains 153 /252 variables (removed 99) and now considering 186/510 (removed 324) transitions.
// Phase 1: matrix 186 rows 153 cols
[2024-06-01 12:28:38] [INFO ] Computed 48 invariants in 1 ms
[2024-06-01 12:28:38] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-01 12:28:38] [INFO ] Invariant cache hit.
[2024-06-01 12:28:38] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 12:28:38] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-06-01 12:28:38] [INFO ] Redundant transitions in 10 ms returned []
Running 161 sub problems to find dead transitions.
[2024-06-01 12:28:38] [INFO ] Invariant cache hit.
[2024-06-01 12:28:38] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 185/338 variables, 153/201 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 112/313 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 0/338 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/339 variables, and 313 constraints, problems are : Problem set: 0 solved, 161 unsolved in 3243 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 153/153 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 185/338 variables, 153/201 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 112/313 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 161/474 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/338 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/339 variables, and 474 constraints, problems are : Problem set: 0 solved, 161 unsolved in 3128 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 153/153 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
After SMT, in 6397ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 6403ms
Starting structural reductions in SI_LTL mode, iteration 1 : 153/252 places, 186/510 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6683 ms. Remains : 153/252 places, 186/510 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-09 finished in 6779 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(p1||F(G(p2))))))'
Support contains 3 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 8 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
// Phase 1: matrix 510 rows 252 cols
[2024-06-01 12:28:45] [INFO ] Computed 57 invariants in 4 ms
[2024-06-01 12:28:45] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-01 12:28:45] [INFO ] Invariant cache hit.
[2024-06-01 12:28:45] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2024-06-01 12:28:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (OVERLAPS) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 18994 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 24575 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
After SMT, in 43681ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 43686ms
Finished structural reductions in LTL mode , in 1 iterations and 44015 ms. Remains : 252/252 places, 510/510 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p2)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 344 ms.
Stack based approach found an accepted trace after 364 steps with 0 reset with depth 365 and stack size 360 in 2 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-10 finished in 44517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F((p1||G(p2))))&&p0)))'
Support contains 3 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 4 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
[2024-06-01 12:29:29] [INFO ] Invariant cache hit.
[2024-06-01 12:29:30] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-01 12:29:30] [INFO ] Invariant cache hit.
[2024-06-01 12:29:30] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2024-06-01 12:29:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (OVERLAPS) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 18456 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 24294 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
After SMT, in 42867ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 42871ms
Finished structural reductions in LTL mode , in 1 iterations and 43159 ms. Remains : 252/252 places, 510/510 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-14 finished in 43353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 7 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
[2024-06-01 12:30:13] [INFO ] Invariant cache hit.
[2024-06-01 12:30:13] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-01 12:30:13] [INFO ] Invariant cache hit.
[2024-06-01 12:30:13] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2024-06-01 12:30:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (OVERLAPS) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 18467 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 24384 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
After SMT, in 42960ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 42965ms
Finished structural reductions in LTL mode , in 1 iterations and 43259 ms. Remains : 252/252 places, 510/510 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-15
Product exploration explored 100000 steps with 868 reset in 386 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 31 in 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-15 finished in 43760 ms.
All properties solved by simple procedures.
Total runtime 496885 ms.
ITS solved all properties within timeout

BK_STOP 1717245057097

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-8A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is NoC3x3-PT-8A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r508-tall-171654352100668"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-8A.tgz
mv NoC3x3-PT-8A execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;