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-171654351900564.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-1B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654351900564
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 840K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.5K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 07:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 12 07:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 07:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 12 07:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 362K 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-1B-LTLFireability-00
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-01
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-02
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-03
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-04
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-05
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-06
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-07
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-08
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-09
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-10
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-11
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-12
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-13
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-14
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717240155045

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-1B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:09:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 11:09:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:09:16] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2024-06-01 11:09:16] [INFO ] Transformed 1416 places.
[2024-06-01 11:09:16] [INFO ] Transformed 1640 transitions.
[2024-06-01 11:09:16] [INFO ] Found NUPN structural information;
[2024-06-01 11:09:16] [INFO ] Parsed PT model containing 1416 places and 1640 transitions and 3639 arcs in 252 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA NoC3x3-PT-1B-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1B-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1B-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 1416 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1416/1416 places, 1640/1640 transitions.
Discarding 351 places :
Symmetric choice reduction at 0 with 351 rule applications. Total rules 351 place count 1065 transition count 1289
Iterating global reduction 0 with 351 rules applied. Total rules applied 702 place count 1065 transition count 1289
Discarding 193 places :
Symmetric choice reduction at 0 with 193 rule applications. Total rules 895 place count 872 transition count 1096
Iterating global reduction 0 with 193 rules applied. Total rules applied 1088 place count 872 transition count 1096
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 0 with 81 rules applied. Total rules applied 1169 place count 872 transition count 1015
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 1206 place count 835 transition count 978
Iterating global reduction 1 with 37 rules applied. Total rules applied 1243 place count 835 transition count 978
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 1261 place count 835 transition count 960
Applied a total of 1261 rules in 315 ms. Remains 835 /1416 variables (removed 581) and now considering 960/1640 (removed 680) transitions.
// Phase 1: matrix 960 rows 835 cols
[2024-06-01 11:09:17] [INFO ] Computed 40 invariants in 27 ms
[2024-06-01 11:09:17] [INFO ] Implicit Places using invariants in 425 ms returned []
[2024-06-01 11:09:17] [INFO ] Invariant cache hit.
[2024-06-01 11:09:18] [INFO ] Implicit Places using invariants and state equation in 569 ms returned []
Implicit Place search using SMT with State Equation took 1028 ms to find 0 implicit places.
Running 959 sub problems to find dead transitions.
[2024-06-01 11:09:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/834 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (OVERLAPS) 1/835 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-06-01 11:09:43] [INFO ] Deduced a trap composed of 44 places in 459 ms of which 158 ms to minimize.
[2024-06-01 11:09:43] [INFO ] Deduced a trap composed of 46 places in 245 ms of which 6 ms to minimize.
[2024-06-01 11:09:45] [INFO ] Deduced a trap composed of 54 places in 200 ms of which 5 ms to minimize.
[2024-06-01 11:09:48] [INFO ] Deduced a trap composed of 58 places in 162 ms of which 4 ms to minimize.
[2024-06-01 11:09:48] [INFO ] Deduced a trap composed of 58 places in 144 ms of which 3 ms to minimize.
SMT process timed out in 30483ms, After SMT, problems are : Problem set: 0 solved, 959 unsolved
Search for dead transitions found 0 dead transitions in 30588ms
Starting structural reductions in LTL mode, iteration 1 : 835/1416 places, 960/1640 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31964 ms. Remains : 835/1416 places, 960/1640 transitions.
Support contains 37 out of 835 places after structural reductions.
[2024-06-01 11:09:48] [INFO ] Flatten gal took : 86 ms
[2024-06-01 11:09:48] [INFO ] Flatten gal took : 46 ms
[2024-06-01 11:09:49] [INFO ] Input system was already deterministic with 960 transitions.
Support contains 34 out of 835 places (down from 37) after GAL structural reductions.
RANDOM walk for 40000 steps (38 resets) in 2145 ms. (18 steps per ms) remains 3/27 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 92 ms. (430 steps per ms) remains 3/3 properties
[2024-06-01 11:09:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 219/227 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 608/835 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/835 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 960/1795 variables, 835/875 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1795 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/1795 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1795/1795 variables, and 875 constraints, problems are : Problem set: 0 solved, 3 unsolved in 655 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 835/835 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 219/227 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 608/835 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/835 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 960/1795 variables, 835/875 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1795 variables, 3/878 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1795 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1795 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1795/1795 variables, and 878 constraints, problems are : Problem set: 0 solved, 3 unsolved in 623 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 835/835 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1297ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 354 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=177 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 113 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 41 stabilizing places and 41 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' '!(G(F(p0)))'
Support contains 1 out of 835 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 835/835 places, 960/960 transitions.
Graph (trivial) has 770 edges and 835 vertex of which 542 / 835 are part of one of the 20 SCC in 4 ms
Free SCC test removed 522 places
Ensure Unique test removed 588 transitions
Reduce isomorphic transitions removed 588 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 312 transition count 366
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 307 transition count 365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 306 transition count 365
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 13 place count 306 transition count 347
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 49 place count 288 transition count 347
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 63 place count 274 transition count 320
Iterating global reduction 3 with 14 rules applied. Total rules applied 77 place count 274 transition count 320
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 201 place count 212 transition count 258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 202 place count 212 transition count 257
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 204 place count 211 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 205 place count 211 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 206 place count 210 transition count 260
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 142 edges and 204 vertex of which 26 / 204 are part of one of the 13 SCC in 1 ms
Free SCC test removed 13 places
Iterating post reduction 5 with 7 rules applied. Total rules applied 213 place count 191 transition count 260
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 6 with 26 rules applied. Total rules applied 239 place count 191 transition count 234
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 241 place count 190 transition count 233
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 244 place count 190 transition count 230
Applied a total of 244 rules in 98 ms. Remains 190 /835 variables (removed 645) and now considering 230/960 (removed 730) transitions.
[2024-06-01 11:09:51] [INFO ] Flow matrix only has 211 transitions (discarded 19 similar events)
// Phase 1: matrix 211 rows 190 cols
[2024-06-01 11:09:51] [INFO ] Computed 34 invariants in 2 ms
[2024-06-01 11:09:51] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-01 11:09:51] [INFO ] Flow matrix only has 211 transitions (discarded 19 similar events)
[2024-06-01 11:09:51] [INFO ] Invariant cache hit.
[2024-06-01 11:09:51] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 11:09:51] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-06-01 11:09:51] [INFO ] Redundant transitions in 8 ms returned []
Running 115 sub problems to find dead transitions.
[2024-06-01 11:09:51] [INFO ] Flow matrix only has 211 transitions (discarded 19 similar events)
[2024-06-01 11:09:52] [INFO ] Invariant cache hit.
[2024-06-01 11:09:52] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 20/190 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 210/400 variables, 190/224 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 7/231 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/400 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/401 variables, and 231 constraints, problems are : Problem set: 0 solved, 115 unsolved in 3194 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 190/190 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 20/190 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 210/400 variables, 190/224 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 7/231 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 115/346 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/400 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/401 variables, and 346 constraints, problems are : Problem set: 0 solved, 115 unsolved in 3230 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 190/190 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
After SMT, in 6461ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 6462ms
Starting structural reductions in SI_LTL mode, iteration 1 : 190/835 places, 230/960 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6809 ms. Remains : 190/835 places, 230/960 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-00
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 4 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-00 finished in 7078 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((X((p0 U p1))&&(G(p2)||F(p3)))))'
Support contains 4 out of 835 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 835/835 places, 960/960 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 821 transition count 946
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 821 transition count 946
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 816 transition count 941
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 816 transition count 941
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 816 transition count 939
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 815 transition count 938
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 815 transition count 938
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 815 transition count 937
Applied a total of 43 rules in 83 ms. Remains 815 /835 variables (removed 20) and now considering 937/960 (removed 23) transitions.
// Phase 1: matrix 937 rows 815 cols
[2024-06-01 11:09:58] [INFO ] Computed 40 invariants in 7 ms
[2024-06-01 11:09:58] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-06-01 11:09:58] [INFO ] Invariant cache hit.
[2024-06-01 11:09:59] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
Running 936 sub problems to find dead transitions.
[2024-06-01 11:09:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/814 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 1 (OVERLAPS) 1/815 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 936 unsolved
[2024-06-01 11:10:22] [INFO ] Deduced a trap composed of 43 places in 255 ms of which 5 ms to minimize.
[2024-06-01 11:10:22] [INFO ] Deduced a trap composed of 44 places in 252 ms of which 5 ms to minimize.
[2024-06-01 11:10:24] [INFO ] Deduced a trap composed of 49 places in 230 ms of which 4 ms to minimize.
[2024-06-01 11:10:26] [INFO ] Deduced a trap composed of 56 places in 179 ms of which 3 ms to minimize.
[2024-06-01 11:10:27] [INFO ] Deduced a trap composed of 58 places in 174 ms of which 3 ms to minimize.
[2024-06-01 11:10:29] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 2 ms to minimize.
SMT process timed out in 30276ms, After SMT, problems are : Problem set: 0 solved, 936 unsolved
Search for dead transitions found 0 dead transitions in 30283ms
Starting structural reductions in LTL mode, iteration 1 : 815/835 places, 937/960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31052 ms. Remains : 815/835 places, 937/960 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p3), true]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-02 finished in 31313 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 2 out of 835 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 835/835 places, 960/960 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 822 transition count 947
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 822 transition count 947
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 817 transition count 942
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 817 transition count 942
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 817 transition count 940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 816 transition count 939
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 816 transition count 939
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 41 place count 816 transition count 938
Applied a total of 41 rules in 93 ms. Remains 816 /835 variables (removed 19) and now considering 938/960 (removed 22) transitions.
// Phase 1: matrix 938 rows 816 cols
[2024-06-01 11:10:30] [INFO ] Computed 40 invariants in 8 ms
[2024-06-01 11:10:30] [INFO ] Implicit Places using invariants in 368 ms returned []
[2024-06-01 11:10:30] [INFO ] Invariant cache hit.
[2024-06-01 11:10:31] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 1005 ms to find 0 implicit places.
Running 937 sub problems to find dead transitions.
[2024-06-01 11:10:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/815 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 937 unsolved
At refinement iteration 1 (OVERLAPS) 1/816 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 937 unsolved
[2024-06-01 11:10:55] [INFO ] Deduced a trap composed of 43 places in 249 ms of which 4 ms to minimize.
[2024-06-01 11:10:55] [INFO ] Deduced a trap composed of 44 places in 242 ms of which 5 ms to minimize.
[2024-06-01 11:10:57] [INFO ] Deduced a trap composed of 49 places in 192 ms of which 4 ms to minimize.
[2024-06-01 11:10:59] [INFO ] Deduced a trap composed of 56 places in 146 ms of which 3 ms to minimize.
[2024-06-01 11:11:00] [INFO ] Deduced a trap composed of 58 places in 144 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 816/1754 variables, and 45 constraints, problems are : Problem set: 0 solved, 937 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/816 constraints, PredecessorRefiner: 937/937 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 937 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/815 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 937 unsolved
At refinement iteration 1 (OVERLAPS) 1/816 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 937 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/816 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 937 unsolved
[2024-06-01 11:11:19] [INFO ] Deduced a trap composed of 64 places in 117 ms of which 3 ms to minimize.
[2024-06-01 11:11:21] [INFO ] Deduced a trap composed of 69 places in 93 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/816 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 816/1754 variables, and 47 constraints, problems are : Problem set: 0 solved, 937 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/816 constraints, PredecessorRefiner: 0/937 constraints, Known Traps: 7/7 constraints]
After SMT, in 60199ms problems are : Problem set: 0 solved, 937 unsolved
Search for dead transitions found 0 dead transitions in 60209ms
Starting structural reductions in LTL mode, iteration 1 : 816/835 places, 938/960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61323 ms. Remains : 816/835 places, 938/960 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2643 steps with 2 reset in 19 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-04 finished in 61468 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)&&(!p0||X(((p0||F(p2)) U (!p0&&(p0||F(p2)))))))))'
Support contains 3 out of 835 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 835/835 places, 960/960 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 822 transition count 947
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 822 transition count 947
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 817 transition count 942
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 817 transition count 942
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 817 transition count 940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 816 transition count 939
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 816 transition count 939
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 41 place count 816 transition count 938
Applied a total of 41 rules in 135 ms. Remains 816 /835 variables (removed 19) and now considering 938/960 (removed 22) transitions.
// Phase 1: matrix 938 rows 816 cols
[2024-06-01 11:11:31] [INFO ] Computed 40 invariants in 4 ms
[2024-06-01 11:11:32] [INFO ] Implicit Places using invariants in 412 ms returned []
[2024-06-01 11:11:32] [INFO ] Invariant cache hit.
[2024-06-01 11:11:32] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 916 ms to find 0 implicit places.
Running 937 sub problems to find dead transitions.
[2024-06-01 11:11:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/815 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 937 unsolved
At refinement iteration 1 (OVERLAPS) 1/816 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 937 unsolved
[2024-06-01 11:11:56] [INFO ] Deduced a trap composed of 43 places in 261 ms of which 5 ms to minimize.
[2024-06-01 11:11:56] [INFO ] Deduced a trap composed of 44 places in 284 ms of which 4 ms to minimize.
[2024-06-01 11:11:58] [INFO ] Deduced a trap composed of 49 places in 258 ms of which 4 ms to minimize.
[2024-06-01 11:12:01] [INFO ] Deduced a trap composed of 56 places in 175 ms of which 16 ms to minimize.
[2024-06-01 11:12:01] [INFO ] Deduced a trap composed of 58 places in 167 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 816/1754 variables, and 45 constraints, problems are : Problem set: 0 solved, 937 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/816 constraints, PredecessorRefiner: 937/937 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 937 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/815 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 937 unsolved
At refinement iteration 1 (OVERLAPS) 1/816 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 937 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/816 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 937 unsolved
[2024-06-01 11:12:22] [INFO ] Deduced a trap composed of 64 places in 137 ms of which 3 ms to minimize.
[2024-06-01 11:12:24] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/816 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 816/1754 variables, and 47 constraints, problems are : Problem set: 0 solved, 937 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/816 constraints, PredecessorRefiner: 0/937 constraints, Known Traps: 7/7 constraints]
After SMT, in 60209ms problems are : Problem set: 0 solved, 937 unsolved
Search for dead transitions found 0 dead transitions in 60216ms
Starting structural reductions in LTL mode, iteration 1 : 816/835 places, 938/960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61270 ms. Remains : 816/835 places, 938/960 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1) p0), true, true, true]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-05 finished in 61512 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' '!(F(p0))'
Support contains 3 out of 835 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 835/835 places, 960/960 transitions.
Graph (trivial) has 768 edges and 835 vertex of which 542 / 835 are part of one of the 20 SCC in 3 ms
Free SCC test removed 522 places
Ensure Unique test removed 588 transitions
Reduce isomorphic transitions removed 588 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 312 transition count 366
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 307 transition count 365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 306 transition count 365
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 13 place count 306 transition count 348
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 47 place count 289 transition count 348
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 60 place count 276 transition count 323
Iterating global reduction 3 with 13 rules applied. Total rules applied 73 place count 276 transition count 323
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 197 place count 214 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 198 place count 214 transition count 260
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 200 place count 213 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 201 place count 213 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 202 place count 212 transition count 261
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 142 edges and 206 vertex of which 28 / 206 are part of one of the 14 SCC in 1 ms
Free SCC test removed 14 places
Iterating post reduction 5 with 7 rules applied. Total rules applied 209 place count 192 transition count 261
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 6 with 28 rules applied. Total rules applied 237 place count 192 transition count 233
Applied a total of 237 rules in 88 ms. Remains 192 /835 variables (removed 643) and now considering 233/960 (removed 727) transitions.
[2024-06-01 11:12:33] [INFO ] Flow matrix only has 214 transitions (discarded 19 similar events)
// Phase 1: matrix 214 rows 192 cols
[2024-06-01 11:12:33] [INFO ] Computed 34 invariants in 1 ms
[2024-06-01 11:12:33] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-06-01 11:12:33] [INFO ] Flow matrix only has 214 transitions (discarded 19 similar events)
[2024-06-01 11:12:33] [INFO ] Invariant cache hit.
[2024-06-01 11:12:33] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 11:12:33] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2024-06-01 11:12:33] [INFO ] Redundant transitions in 8 ms returned []
Running 118 sub problems to find dead transitions.
[2024-06-01 11:12:33] [INFO ] Flow matrix only has 214 transitions (discarded 19 similar events)
[2024-06-01 11:12:33] [INFO ] Invariant cache hit.
[2024-06-01 11:12:33] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 20/192 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 213/405 variables, 192/226 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 7/233 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 0/405 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/406 variables, and 233 constraints, problems are : Problem set: 0 solved, 118 unsolved in 3501 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 192/192 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 20/192 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 213/405 variables, 192/226 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 7/233 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 118/351 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 0/405 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/406 variables, and 351 constraints, problems are : Problem set: 0 solved, 118 unsolved in 3598 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 192/192 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
After SMT, in 7134ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 7135ms
Starting structural reductions in SI_LTL mode, iteration 1 : 192/835 places, 233/960 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7690 ms. Remains : 192/835 places, 233/960 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-07 finished in 7824 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' '!(F(((p1||G(p2))&&p0)))'
Support contains 5 out of 835 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 835/835 places, 960/960 transitions.
Graph (trivial) has 771 edges and 835 vertex of which 551 / 835 are part of one of the 20 SCC in 1 ms
Free SCC test removed 531 places
Ensure Unique test removed 599 transitions
Reduce isomorphic transitions removed 599 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 303 transition count 359
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 302 transition count 359
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 3 place count 302 transition count 342
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 37 place count 285 transition count 342
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 50 place count 272 transition count 316
Iterating global reduction 2 with 13 rules applied. Total rules applied 63 place count 272 transition count 316
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 183 place count 212 transition count 256
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 211 transition count 255
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 145 edges and 205 vertex of which 28 / 205 are part of one of the 14 SCC in 1 ms
Free SCC test removed 14 places
Iterating post reduction 2 with 7 rules applied. Total rules applied 191 place count 191 transition count 255
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 219 place count 191 transition count 227
Applied a total of 219 rules in 36 ms. Remains 191 /835 variables (removed 644) and now considering 227/960 (removed 733) transitions.
[2024-06-01 11:12:40] [INFO ] Flow matrix only has 208 transitions (discarded 19 similar events)
// Phase 1: matrix 208 rows 191 cols
[2024-06-01 11:12:40] [INFO ] Computed 34 invariants in 1 ms
[2024-06-01 11:12:40] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-06-01 11:12:40] [INFO ] Flow matrix only has 208 transitions (discarded 19 similar events)
[2024-06-01 11:12:40] [INFO ] Invariant cache hit.
[2024-06-01 11:12:41] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 11:12:41] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2024-06-01 11:12:41] [INFO ] Redundant transitions in 2 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 11:12:41] [INFO ] Flow matrix only has 208 transitions (discarded 19 similar events)
[2024-06-01 11:12:41] [INFO ] Invariant cache hit.
[2024-06-01 11:12:41] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 20/191 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 207/398 variables, 191/225 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 7/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/398 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/399 variables, and 232 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3271 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 191/191 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 20/191 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 207/398 variables, 191/225 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 7/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 108/340 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/398 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/399 variables, and 340 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3040 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 191/191 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 6340ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 6341ms
Starting structural reductions in SI_LTL mode, iteration 1 : 191/835 places, 227/960 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6753 ms. Remains : 191/835 places, 227/960 transitions.
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-08 finished in 6859 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&&X(F((X(p2)||p1))))))'
Support contains 4 out of 835 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 835/835 places, 960/960 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 823 transition count 948
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 823 transition count 948
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 818 transition count 943
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 818 transition count 943
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 818 transition count 941
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 817 transition count 940
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 817 transition count 940
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 817 transition count 939
Applied a total of 39 rules in 62 ms. Remains 817 /835 variables (removed 18) and now considering 939/960 (removed 21) transitions.
// Phase 1: matrix 939 rows 817 cols
[2024-06-01 11:12:47] [INFO ] Computed 40 invariants in 4 ms
[2024-06-01 11:12:48] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-06-01 11:12:48] [INFO ] Invariant cache hit.
[2024-06-01 11:12:48] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 903 ms to find 0 implicit places.
Running 938 sub problems to find dead transitions.
[2024-06-01 11:12:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/816 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 938 unsolved
At refinement iteration 1 (OVERLAPS) 1/817 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 938 unsolved
[2024-06-01 11:13:13] [INFO ] Deduced a trap composed of 43 places in 251 ms of which 4 ms to minimize.
[2024-06-01 11:13:13] [INFO ] Deduced a trap composed of 44 places in 242 ms of which 5 ms to minimize.
[2024-06-01 11:13:15] [INFO ] Deduced a trap composed of 49 places in 206 ms of which 4 ms to minimize.
[2024-06-01 11:13:18] [INFO ] Deduced a trap composed of 56 places in 154 ms of which 3 ms to minimize.
[2024-06-01 11:13:18] [INFO ] Deduced a trap composed of 58 places in 152 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 817/1756 variables, and 45 constraints, problems are : Problem set: 0 solved, 938 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/817 constraints, PredecessorRefiner: 938/938 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 938 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/816 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 938 unsolved
At refinement iteration 1 (OVERLAPS) 1/817 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 938 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/817 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 938 unsolved
[2024-06-01 11:13:37] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 3 ms to minimize.
[2024-06-01 11:13:38] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/817 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 938 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 817/1756 variables, and 47 constraints, problems are : Problem set: 0 solved, 938 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/817 constraints, PredecessorRefiner: 0/938 constraints, Known Traps: 7/7 constraints]
After SMT, in 60172ms problems are : Problem set: 0 solved, 938 unsolved
Search for dead transitions found 0 dead transitions in 60187ms
Starting structural reductions in LTL mode, iteration 1 : 817/835 places, 939/960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61154 ms. Remains : 817/835 places, 939/960 transitions.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-10 finished in 61352 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)&&(p1 U p2)))))'
Support contains 4 out of 835 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 835/835 places, 960/960 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 822 transition count 947
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 822 transition count 947
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 817 transition count 942
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 817 transition count 942
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 817 transition count 940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 816 transition count 939
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 816 transition count 939
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 41 place count 816 transition count 938
Applied a total of 41 rules in 61 ms. Remains 816 /835 variables (removed 19) and now considering 938/960 (removed 22) transitions.
// Phase 1: matrix 938 rows 816 cols
[2024-06-01 11:13:49] [INFO ] Computed 40 invariants in 8 ms
[2024-06-01 11:13:49] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-06-01 11:13:49] [INFO ] Invariant cache hit.
[2024-06-01 11:13:49] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
Running 937 sub problems to find dead transitions.
[2024-06-01 11:13:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/815 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 937 unsolved
At refinement iteration 1 (OVERLAPS) 1/816 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 937 unsolved
[2024-06-01 11:14:12] [INFO ] Deduced a trap composed of 43 places in 246 ms of which 5 ms to minimize.
[2024-06-01 11:14:12] [INFO ] Deduced a trap composed of 44 places in 234 ms of which 5 ms to minimize.
[2024-06-01 11:14:14] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 6 ms to minimize.
[2024-06-01 11:14:17] [INFO ] Deduced a trap composed of 56 places in 144 ms of which 3 ms to minimize.
[2024-06-01 11:14:17] [INFO ] Deduced a trap composed of 58 places in 143 ms of which 3 ms to minimize.
[2024-06-01 11:14:19] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 816/1754 variables, and 46 constraints, problems are : Problem set: 0 solved, 937 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/816 constraints, PredecessorRefiner: 937/937 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 937 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/815 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 937 unsolved
At refinement iteration 1 (OVERLAPS) 1/816 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 937 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/816 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 937 unsolved
[2024-06-01 11:14:39] [INFO ] Deduced a trap composed of 69 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/816 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 937 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 1)
(s170 0)
(s171 0)
(s172 1)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 1)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 1)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 1)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 1)
(s297 0)
(s298 0)
(s299 1)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 1)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 1)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 timeout
0)
(s360 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 816/1754 variables, and 47 constraints, problems are : Problem set: 0 solved, 937 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/816 constraints, PredecessorRefiner: 0/937 constraints, Known Traps: 7/7 constraints]
After SMT, in 60153ms problems are : Problem set: 0 solved, 937 unsolved
Search for dead transitions found 0 dead transitions in 60165ms
Starting structural reductions in LTL mode, iteration 1 : 816/835 places, 938/960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60892 ms. Remains : 816/835 places, 938/960 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p2), (NOT p0), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), true, (OR (NOT p2) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-11 finished in 61158 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)&&F(G(p1)))))'
Support contains 3 out of 835 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 835/835 places, 960/960 transitions.
Graph (trivial) has 769 edges and 835 vertex of which 529 / 835 are part of one of the 20 SCC in 2 ms
Free SCC test removed 509 places
Ensure Unique test removed 572 transitions
Reduce isomorphic transitions removed 572 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 325 transition count 375
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 313 transition count 375
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 25 place count 313 transition count 358
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 59 place count 296 transition count 358
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 73 place count 282 transition count 331
Iterating global reduction 2 with 14 rules applied. Total rules applied 87 place count 282 transition count 331
Performed 66 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 219 place count 216 transition count 264
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 221 place count 216 transition count 262
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 223 place count 215 transition count 263
Applied a total of 223 rules in 37 ms. Remains 215 /835 variables (removed 620) and now considering 263/960 (removed 697) transitions.
[2024-06-01 11:14:50] [INFO ] Flow matrix only has 244 transitions (discarded 19 similar events)
// Phase 1: matrix 244 rows 215 cols
[2024-06-01 11:14:50] [INFO ] Computed 40 invariants in 3 ms
[2024-06-01 11:14:50] [INFO ] Implicit Places using invariants in 110 ms returned [10, 38, 73, 122, 165, 195]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 112 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 209/835 places, 263/960 transitions.
Graph (trivial) has 147 edges and 209 vertex of which 26 / 209 are part of one of the 13 SCC in 1 ms
Free SCC test removed 13 places
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 196 transition count 236
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 195 transition count 235
Applied a total of 4 rules in 10 ms. Remains 195 /209 variables (removed 14) and now considering 235/263 (removed 28) transitions.
[2024-06-01 11:14:50] [INFO ] Flow matrix only has 216 transitions (discarded 19 similar events)
// Phase 1: matrix 216 rows 195 cols
[2024-06-01 11:14:50] [INFO ] Computed 34 invariants in 2 ms
[2024-06-01 11:14:50] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-01 11:14:50] [INFO ] Flow matrix only has 216 transitions (discarded 19 similar events)
[2024-06-01 11:14:50] [INFO ] Invariant cache hit.
[2024-06-01 11:14:50] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 11:14:50] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 195/835 places, 235/960 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 419 ms. Remains : 195/835 places, 235/960 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-13 finished in 551 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(((X(p0) U p1)&&F(p0)&&F(G(p2))))))'
Support contains 3 out of 835 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 835/835 places, 960/960 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 823 transition count 948
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 823 transition count 948
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 819 transition count 944
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 819 transition count 944
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 819 transition count 942
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 818 transition count 941
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 818 transition count 941
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 818 transition count 940
Applied a total of 37 rules in 66 ms. Remains 818 /835 variables (removed 17) and now considering 940/960 (removed 20) transitions.
// Phase 1: matrix 940 rows 818 cols
[2024-06-01 11:14:50] [INFO ] Computed 40 invariants in 7 ms
[2024-06-01 11:14:50] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-06-01 11:14:50] [INFO ] Invariant cache hit.
[2024-06-01 11:14:51] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
Running 939 sub problems to find dead transitions.
[2024-06-01 11:14:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/817 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 939 unsolved
At refinement iteration 1 (OVERLAPS) 1/818 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 939 unsolved
[2024-06-01 11:15:14] [INFO ] Deduced a trap composed of 43 places in 221 ms of which 5 ms to minimize.
[2024-06-01 11:15:14] [INFO ] Deduced a trap composed of 46 places in 220 ms of which 5 ms to minimize.
[2024-06-01 11:15:16] [INFO ] Deduced a trap composed of 49 places in 187 ms of which 3 ms to minimize.
[2024-06-01 11:15:18] [INFO ] Deduced a trap composed of 56 places in 145 ms of which 3 ms to minimize.
[2024-06-01 11:15:19] [INFO ] Deduced a trap composed of 58 places in 144 ms of which 3 ms to minimize.
[2024-06-01 11:15:21] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 818/1758 variables, and 46 constraints, problems are : Problem set: 0 solved, 939 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/818 constraints, PredecessorRefiner: 939/939 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 939 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/817 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 939 unsolved
At refinement iteration 1 (OVERLAPS) 1/818 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 939 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/818 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 939 unsolved
[2024-06-01 11:15:42] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/818 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 939 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 818/1758 variables, and 47 constraints, problems are : Problem set: 0 solved, 939 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/818 constraints, PredecessorRefiner: 0/939 constraints, Known Traps: 7/7 constraints]
After SMT, in 60166ms problems are : Problem set: 0 solved, 939 unsolved
Search for dead transitions found 0 dead transitions in 60174ms
Starting structural reductions in LTL mode, iteration 1 : 818/835 places, 940/960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60924 ms. Remains : 818/835 places, 940/960 transitions.
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-14
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-14 finished in 61233 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' '!((F(p0) U G((p1&&F(!p2)))))'
Support contains 4 out of 835 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 835/835 places, 960/960 transitions.
Graph (trivial) has 765 edges and 835 vertex of which 536 / 835 are part of one of the 20 SCC in 1 ms
Free SCC test removed 516 places
Ensure Unique test removed 580 transitions
Reduce isomorphic transitions removed 580 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 318 transition count 372
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 311 transition count 370
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 309 transition count 370
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 19 place count 309 transition count 352
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 55 place count 291 transition count 352
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 69 place count 277 transition count 325
Iterating global reduction 3 with 14 rules applied. Total rules applied 83 place count 277 transition count 325
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 205 place count 216 transition count 264
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 207 place count 216 transition count 262
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 209 place count 215 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 210 place count 215 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 211 place count 214 transition count 263
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 134 edges and 211 vertex of which 14 / 211 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Iterating post reduction 5 with 4 rules applied. Total rules applied 215 place count 204 transition count 263
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 229 place count 204 transition count 249
Applied a total of 229 rules in 43 ms. Remains 204 /835 variables (removed 631) and now considering 249/960 (removed 711) transitions.
[2024-06-01 11:15:52] [INFO ] Flow matrix only has 230 transitions (discarded 19 similar events)
// Phase 1: matrix 230 rows 204 cols
[2024-06-01 11:15:52] [INFO ] Computed 37 invariants in 1 ms
[2024-06-01 11:15:52] [INFO ] Implicit Places using invariants in 99 ms returned [10, 40, 77]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 101 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 201/835 places, 249/960 transitions.
Graph (trivial) has 127 edges and 201 vertex of which 14 / 201 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Applied a total of 1 rules in 5 ms. Remains 194 /201 variables (removed 7) and now considering 235/249 (removed 14) transitions.
[2024-06-01 11:15:52] [INFO ] Flow matrix only has 216 transitions (discarded 19 similar events)
// Phase 1: matrix 216 rows 194 cols
[2024-06-01 11:15:52] [INFO ] Computed 34 invariants in 0 ms
[2024-06-01 11:15:52] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-01 11:15:52] [INFO ] Flow matrix only has 216 transitions (discarded 19 similar events)
[2024-06-01 11:15:52] [INFO ] Invariant cache hit.
[2024-06-01 11:15:52] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 11:15:52] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 194/835 places, 235/960 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 403 ms. Remains : 194/835 places, 235/960 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p1) p2), (NOT p0), p2]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-15 finished in 552 ms.
All properties solved by simple procedures.
Total runtime 396272 ms.
ITS solved all properties within timeout

BK_STOP 1717240552569

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-1B"
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-1B, 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-171654351900564"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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