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.r136-tall-171631132500362.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 itstools
Input is DiscoveryGPU-PT-06a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132500362
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 22 14:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 01:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 12 01:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 01:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 12 01:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 22K May 18 16:42 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 DiscoveryGPU-PT-06a-CTLFireability-2024-00
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-01
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-02
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-03
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-04
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-05
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-06
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-07
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-08
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-09
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-10
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-11
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2023-12
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2023-13
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2023-14
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716373643177

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-06a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 10:27:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 10:27:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 10:27:24] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2024-05-22 10:27:24] [INFO ] Transformed 63 places.
[2024-05-22 10:27:24] [INFO ] Transformed 85 transitions.
[2024-05-22 10:27:24] [INFO ] Found NUPN structural information;
[2024-05-22 10:27:24] [INFO ] Parsed PT model containing 63 places and 85 transitions and 273 arcs in 141 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 85/85 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 63 transition count 79
Applied a total of 6 rules in 18 ms. Remains 63 /63 variables (removed 0) and now considering 79/85 (removed 6) transitions.
// Phase 1: matrix 79 rows 63 cols
[2024-05-22 10:27:24] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 10:27:24] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-22 10:27:24] [INFO ] Invariant cache hit.
[2024-05-22 10:27:24] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-22 10:27:24] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-22 10:27:24] [INFO ] Invariant cache hit.
[2024-05-22 10:27:24] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 79/142 variables, 63/128 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 48/176 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/142 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 176 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1375 ms.
Refiners :[Domain max(s): 63/63 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 79/142 variables, 63/128 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 48/176 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 78/254 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 0/142 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 254 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1016 ms.
Refiners :[Domain max(s): 63/63 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
After SMT, in 2433ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 2444ms
Starting structural reductions in LTL mode, iteration 1 : 63/63 places, 79/85 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2770 ms. Remains : 63/63 places, 79/85 transitions.
Support contains 53 out of 63 places after structural reductions.
[2024-05-22 10:27:27] [INFO ] Flatten gal took : 25 ms
[2024-05-22 10:27:27] [INFO ] Flatten gal took : 8 ms
[2024-05-22 10:27:27] [INFO ] Input system was already deterministic with 79 transitions.
Reduction of identical properties reduced properties to check from 78 to 72
RANDOM walk for 40000 steps (621 resets) in 935 ms. (42 steps per ms) remains 1/72 properties
BEST_FIRST walk for 40003 steps (88 resets) in 231 ms. (172 steps per ms) remains 1/1 properties
[2024-05-22 10:27:27] [INFO ] Invariant cache hit.
[2024-05-22 10:27:27] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 6/8 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 5/13 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/18 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/18 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/22 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/22 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/24 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/24 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/24 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/24 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Real declared 37/142 variables, and 36 constraints, problems are : Problem set: 1 solved, 0 unsolved in 37 ms.
Refiners :[Domain max(s): 10/63 constraints, Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 18/63 constraints, ReadFeed: 8/48 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 45ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2024-05-22 10:27:27] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:27:28] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:27:28] [INFO ] Input system was already deterministic with 79 transitions.
Computed a total of 9 stabilizing places and 7 stable transitions
Graph (complete) has 172 edges and 63 vertex of which 57 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 79/79 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 58 transition count 74
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 58 transition count 74
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 54 transition count 70
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 54 transition count 70
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 50 transition count 66
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 50 transition count 66
Applied a total of 26 rules in 7 ms. Remains 50 /63 variables (removed 13) and now considering 66/79 (removed 13) transitions.
// Phase 1: matrix 66 rows 50 cols
[2024-05-22 10:27:28] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 10:27:28] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-22 10:27:28] [INFO ] Invariant cache hit.
[2024-05-22 10:27:28] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-22 10:27:28] [INFO ] Implicit Places using invariants and state equation in 63 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 112 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/63 places, 66/79 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 121 ms. Remains : 49/63 places, 66/79 transitions.
[2024-05-22 10:27:28] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:28] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:28] [INFO ] Input system was already deterministic with 66 transitions.
[2024-05-22 10:27:28] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:27:28] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:28] [INFO ] Time to serialize gal into /tmp/CTLFireability16880781290757877226.gal : 2 ms
[2024-05-22 10:27:28] [INFO ] Time to serialize properties into /tmp/CTLFireability17569824803546037185.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16880781290757877226.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17569824803546037185.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18093e+06,0.058476,5580,2,789,5,13349,6,0,255,8387,0


Converting to forward existential form...Done !
original formula: AF(!(E((EF((p26==1)) + EX(((p39==1)&&(p61==1)))) U EF(((p2==1)&&(p61==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E((E(TRUE U (p26==1)) + EX(((p39==1)&&(p61==1)))) U E(TRUE U ((p2==1)&&(p61==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t16, t18, t20, t23, t25, t54, t56, t59, t60, t61, t62, t63, t64, t65, Intersection with reac...230
(forward)formula 0,0,1.32348,45488,1,0,271,230078,164,183,1551,270595,275
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 79/79 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 60 transition count 76
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 60 transition count 76
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 57 transition count 73
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 57 transition count 73
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 55 transition count 71
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 55 transition count 71
Applied a total of 16 rules in 7 ms. Remains 55 /63 variables (removed 8) and now considering 71/79 (removed 8) transitions.
// Phase 1: matrix 71 rows 55 cols
[2024-05-22 10:27:29] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 10:27:29] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 10:27:29] [INFO ] Invariant cache hit.
[2024-05-22 10:27:29] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 10:27:29] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-05-22 10:27:29] [INFO ] Invariant cache hit.
[2024-05-22 10:27:29] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (OVERLAPS) 71/126 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 45/102 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 0/126 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 102 constraints, problems are : Problem set: 0 solved, 70 unsolved in 961 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 55/55 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (OVERLAPS) 71/126 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 45/102 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 70/172 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/126 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 172 constraints, problems are : Problem set: 0 solved, 70 unsolved in 778 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 55/55 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 1754ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 1755ms
Starting structural reductions in LTL mode, iteration 1 : 55/63 places, 71/79 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1852 ms. Remains : 55/63 places, 71/79 transitions.
[2024-05-22 10:27:31] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:27:31] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:27:31] [INFO ] Input system was already deterministic with 71 transitions.
[2024-05-22 10:27:31] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:31] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:27:31] [INFO ] Time to serialize gal into /tmp/CTLFireability6406594328382655710.gal : 2 ms
[2024-05-22 10:27:31] [INFO ] Time to serialize properties into /tmp/CTLFireability12564739353868190344.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6406594328382655710.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12564739353868190344.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46083e+06,0.049854,5720,2,480,5,12739,6,0,280,9309,0


Converting to forward existential form...Done !
original formula: (AX(((AG((p31==0)) * ((p44==0)||(p1==0))) * ((p32==0)||(p61==0)))) + ((EG(((p27==1)&&(p61==1))) * !(A(AF(((p6==1)&&(p61==1))) U ((p17==1)...276
=> equivalent forward existential formula: (([(FwdU(EY((Init * !(((EG(((p27==1)&&(p61==1))) * !(!((E(!(((p17==1)&&(p61==1))) U (!(!(EG(!(((p6==1)&&(p61==1)...1401
Reverse transition relation is NOT exact ! Due to transitions t8, t11, t18, t25, t27, t62, t63, t64, t65, t66, t67, t68, t69, t70, Intersection with reach...229
(forward)formula 0,0,0.943539,38772,1,0,392,199643,184,214,1810,266118,480
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 79/79 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 58 transition count 74
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 58 transition count 74
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 54 transition count 70
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 54 transition count 70
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 50 transition count 66
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 50 transition count 66
Applied a total of 26 rules in 4 ms. Remains 50 /63 variables (removed 13) and now considering 66/79 (removed 13) transitions.
// Phase 1: matrix 66 rows 50 cols
[2024-05-22 10:27:32] [INFO ] Computed 2 invariants in 5 ms
[2024-05-22 10:27:32] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-22 10:27:32] [INFO ] Invariant cache hit.
[2024-05-22 10:27:32] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-22 10:27:32] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-22 10:27:32] [INFO ] Invariant cache hit.
[2024-05-22 10:27:32] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 66/116 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 44/96 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 65 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/116 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 96 constraints, problems are : Problem set: 0 solved, 65 unsolved in 841 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 66/116 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 44/96 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 65/161 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/116 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 161 constraints, problems are : Problem set: 0 solved, 65 unsolved in 711 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 1563ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 1564ms
Starting structural reductions in LTL mode, iteration 1 : 50/63 places, 66/79 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1658 ms. Remains : 50/63 places, 66/79 transitions.
[2024-05-22 10:27:34] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:34] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:34] [INFO ] Input system was already deterministic with 66 transitions.
[2024-05-22 10:27:34] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:34] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:34] [INFO ] Time to serialize gal into /tmp/CTLFireability15309266888897270896.gal : 1 ms
[2024-05-22 10:27:34] [INFO ] Time to serialize properties into /tmp/CTLFireability10632965105522896533.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15309266888897270896.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10632965105522896533.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18093e+06,0.04459,5432,2,560,5,11817,6,0,257,7692,0


Converting to forward existential form...Done !
original formula: AG((EX((AX(((p2==1)&&(p61==1))) * AG((p3==1)))) + EX((((((p4==0)&&(p8==0))||(p25==0))||(p61==0))&&((p24==0)||(p62==0))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EX((((((p4==0)&&(p8==0))||(p25==0))||(p61==0))&&((p24==0)||(p62==0)))))) * !(EX((!(EX(!((...215
Reverse transition relation is NOT exact ! Due to transitions t16, t18, t20, t23, t25, t54, t56, t59, t60, t61, t62, t63, t64, t65, Intersection with reac...230
(forward)formula 0,0,0.221614,12032,1,0,106,48051,157,66,1570,50163,147
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 79/79 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 59 transition count 75
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 59 transition count 75
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 55 transition count 71
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 55 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 54 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 54 transition count 70
Applied a total of 18 rules in 10 ms. Remains 54 /63 variables (removed 9) and now considering 70/79 (removed 9) transitions.
// Phase 1: matrix 70 rows 54 cols
[2024-05-22 10:27:34] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 10:27:34] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 10:27:34] [INFO ] Invariant cache hit.
[2024-05-22 10:27:34] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-22 10:27:34] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Running 69 sub problems to find dead transitions.
[2024-05-22 10:27:34] [INFO ] Invariant cache hit.
[2024-05-22 10:27:34] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (OVERLAPS) 70/124 variables, 54/56 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 44/100 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (OVERLAPS) 0/124 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 100 constraints, problems are : Problem set: 0 solved, 69 unsolved in 961 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (OVERLAPS) 70/124 variables, 54/56 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 44/100 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 69/169 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/124 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 169 constraints, problems are : Problem set: 0 solved, 69 unsolved in 724 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
After SMT, in 1698ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 1698ms
Starting structural reductions in LTL mode, iteration 1 : 54/63 places, 70/79 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1808 ms. Remains : 54/63 places, 70/79 transitions.
[2024-05-22 10:27:36] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:27:36] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:36] [INFO ] Input system was already deterministic with 70 transitions.
[2024-05-22 10:27:36] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:36] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:36] [INFO ] Time to serialize gal into /tmp/CTLFireability15228018540198458225.gal : 0 ms
[2024-05-22 10:27:36] [INFO ] Time to serialize properties into /tmp/CTLFireability12115206558958560991.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15228018540198458225.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12115206558958560991.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.41907e+06,0.060248,6236,2,707,5,16906,6,0,276,12101,0


Converting to forward existential form...Done !
original formula: AX((((EX(EG(((p46==1)&&(p61==1)))) + EX(AF((p51==1)))) + ((p23==0)||(p62==0))) * (AX((p43==1)) + (EF(((p47==1)&&(p61==1))) * (((p5==0)||(...178
=> equivalent forward existential formula: ([(((EY(Init) * !(((p23==0)||(p62==0)))) * !(EX(!(EG(!((p51==1))))))) * !(EX(EG(((p46==1)&&(p61==1))))))] = FALS...272
Reverse transition relation is NOT exact ! Due to transitions t4, t7, t10, t15, t23, t25, t62, t63, t64, t65, t66, t67, t68, t69, Intersection with reacha...228
(forward)formula 0,1,1.01179,41056,1,0,466,209614,179,241,1708,294823,567
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 79/79 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 59 transition count 75
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 59 transition count 75
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 55 transition count 71
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 55 transition count 71
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 52 transition count 68
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 52 transition count 68
Applied a total of 22 rules in 4 ms. Remains 52 /63 variables (removed 11) and now considering 68/79 (removed 11) transitions.
// Phase 1: matrix 68 rows 52 cols
[2024-05-22 10:27:37] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 10:27:37] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-22 10:27:37] [INFO ] Invariant cache hit.
[2024-05-22 10:27:37] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-22 10:27:37] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Running 67 sub problems to find dead transitions.
[2024-05-22 10:27:37] [INFO ] Invariant cache hit.
[2024-05-22 10:27:37] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (OVERLAPS) 68/120 variables, 52/54 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 44/98 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (OVERLAPS) 0/120 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 98 constraints, problems are : Problem set: 0 solved, 67 unsolved in 913 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 52/52 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (OVERLAPS) 68/120 variables, 52/54 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 44/98 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 67/165 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 0/120 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 165 constraints, problems are : Problem set: 0 solved, 67 unsolved in 707 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 52/52 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints]
After SMT, in 1629ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 1629ms
Starting structural reductions in LTL mode, iteration 1 : 52/63 places, 68/79 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1711 ms. Remains : 52/63 places, 68/79 transitions.
[2024-05-22 10:27:38] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:27:38] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:27:38] [INFO ] Input system was already deterministic with 68 transitions.
[2024-05-22 10:27:38] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:38] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:38] [INFO ] Time to serialize gal into /tmp/CTLFireability2632178594414155035.gal : 1 ms
[2024-05-22 10:27:38] [INFO ] Time to serialize properties into /tmp/CTLFireability18025607204451728565.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2632178594414155035.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18025607204451728565.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.2929e+06,0.060213,6224,2,613,5,16240,6,0,266,11519,0


Converting to forward existential form...Done !
original formula: AG(A(!((AX(((p34==1)&&(p62==1))) + EG((p4==1)))) U ((AF((((p4==1)&&(p62==1))||(p33==1))) + (p26==1)) + (EF(((p44==1)&&(p62==1))) * !(((p4...176
=> equivalent forward existential formula: ([FwdG((((FwdU(FwdU(Init,TRUE),!(((!(EG(!((((p4==1)&&(p62==1))||(p33==1))))) + (p26==1)) + (E(TRUE U ((p44==1)&&...532
Reverse transition relation is NOT exact ! Due to transitions t6, t13, t17, t21, t23, t24, t60, t61, t62, t63, t64, t65, t66, t67, Intersection with reach...229
(forward)formula 0,0,1.06293,41288,1,0,389,212135,172,209,1637,290827,464
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 63/63 places, 79/79 transitions.
Graph (complete) has 172 edges and 63 vertex of which 58 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 58 transition count 68
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 52 transition count 68
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 17 place count 48 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 21 place count 48 transition count 64
Applied a total of 21 rules in 24 ms. Remains 48 /63 variables (removed 15) and now considering 64/79 (removed 15) transitions.
// Phase 1: matrix 64 rows 48 cols
[2024-05-22 10:27:40] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:27:40] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-22 10:27:40] [INFO ] Invariant cache hit.
[2024-05-22 10:27:40] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-22 10:27:40] [INFO ] Implicit Places using invariants and state equation in 50 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 109 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 47/63 places, 64/79 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 64
Applied a total of 2 rules in 6 ms. Remains 47 /47 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 47 cols
[2024-05-22 10:27:40] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 10:27:40] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-22 10:27:40] [INFO ] Invariant cache hit.
[2024-05-22 10:27:40] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-22 10:27:40] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 47/63 places, 64/79 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 242 ms. Remains : 47/63 places, 64/79 transitions.
[2024-05-22 10:27:40] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:40] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:40] [INFO ] Input system was already deterministic with 64 transitions.
[2024-05-22 10:27:40] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:40] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:40] [INFO ] Time to serialize gal into /tmp/CTLFireability2345912065393663034.gal : 1 ms
[2024-05-22 10:27:40] [INFO ] Time to serialize properties into /tmp/CTLFireability7667598409296565338.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2345912065393663034.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7667598409296565338.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,532481,0.0314,4844,2,479,5,8325,6,0,245,5435,0


Converting to forward existential form...Done !
original formula: EF(AG((AG(((p39==1)&&(p61==1))) + AF((((p31==1)||(p57==0))||(p61==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(E(TRUE U !(((p39==1)&&(p61==1))))) + !(EG(!((((p31==1)||(p57==0))||(p61==0))...173
Reverse transition relation is NOT exact ! Due to transitions t13, t16, t18, t19, t21, t53, t54, t55, t56, t57, t58, t59, t60, Intersection with reachable...225
(forward)formula 0,1,0.170861,10652,1,0,135,40350,157,82,1485,41517,189
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 63/63 places, 79/79 transitions.
Graph (complete) has 172 edges and 63 vertex of which 57 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 57 transition count 70
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 54 transition count 70
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 10 place count 51 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 51 transition count 67
Applied a total of 13 rules in 7 ms. Remains 51 /63 variables (removed 12) and now considering 67/79 (removed 12) transitions.
// Phase 1: matrix 67 rows 51 cols
[2024-05-22 10:27:40] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 10:27:40] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-22 10:27:40] [INFO ] Invariant cache hit.
[2024-05-22 10:27:40] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 10:27:40] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-22 10:27:40] [INFO ] Redundant transitions in 0 ms returned []
Running 66 sub problems to find dead transitions.
[2024-05-22 10:27:40] [INFO ] Invariant cache hit.
[2024-05-22 10:27:40] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 67/118 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 45/98 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 0/118 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 98 constraints, problems are : Problem set: 0 solved, 66 unsolved in 933 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 67/118 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 45/98 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 66/164 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/118 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 164 constraints, problems are : Problem set: 0 solved, 66 unsolved in 708 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 1651ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 1652ms
Starting structural reductions in SI_CTL mode, iteration 1 : 51/63 places, 67/79 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1738 ms. Remains : 51/63 places, 67/79 transitions.
[2024-05-22 10:27:42] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:27:42] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:42] [INFO ] Input system was already deterministic with 67 transitions.
[2024-05-22 10:27:42] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:42] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:42] [INFO ] Time to serialize gal into /tmp/CTLFireability7676950722740361040.gal : 0 ms
[2024-05-22 10:27:42] [INFO ] Time to serialize properties into /tmp/CTLFireability1355823406016165872.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7676950722740361040.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1355823406016165872.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,684801,0.036062,5164,2,437,5,9175,6,0,263,6315,0


Converting to forward existential form...Done !
original formula: AG(EF(((AG((((p43==1)&&(p62==1))||((p32==1)&&(p61==1)))) * (E(((p4==1)&&(p62==1)) U ((p56==1)&&(p61==1))) + ((((p54==1)&&(p62==1))||((p33...295
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((!(E(TRUE U !((((p43==1)&&(p62==1))||((p32==1)&&(p61==1)))))) * (E(((p4==1)&&(p6...379
Reverse transition relation is NOT exact ! Due to transitions t3, t17, t21, t23, t54, t57, t60, t61, t62, t63, t64, t65, t66, Intersection with reachable ...224
(forward)formula 0,0,0.315771,16456,1,0,186,75296,175,112,1631,77997,266
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 79/79 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 58 transition count 74
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 58 transition count 74
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 53 transition count 69
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 53 transition count 69
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 49 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 49 transition count 65
Applied a total of 28 rules in 12 ms. Remains 49 /63 variables (removed 14) and now considering 65/79 (removed 14) transitions.
// Phase 1: matrix 65 rows 49 cols
[2024-05-22 10:27:42] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 10:27:42] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-22 10:27:42] [INFO ] Invariant cache hit.
[2024-05-22 10:27:42] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 10:27:42] [INFO ] Implicit Places using invariants and state equation in 56 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 90 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/63 places, 65/79 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104 ms. Remains : 48/63 places, 65/79 transitions.
[2024-05-22 10:27:42] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:42] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:42] [INFO ] Input system was already deterministic with 65 transitions.
[2024-05-22 10:27:42] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:42] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:42] [INFO ] Time to serialize gal into /tmp/CTLFireability8087388912286340394.gal : 1 ms
[2024-05-22 10:27:42] [INFO ] Time to serialize properties into /tmp/CTLFireability3252725976449553269.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8087388912286340394.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3252725976449553269.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.12397e+06,0.084469,7236,2,1404,5,20289,6,0,250,15766,0


Converting to forward existential form...Done !
original formula: AF(AG(EX((p53==0))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(EX((p53==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t12, t18, t20, t22, t23, t25, t58, t59, t60, t61, t62, t63, t64, Intersection with reach...229
(forward)formula 0,0,1.9757,68276,1,0,168,374257,155,102,1606,353620,234
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 63/63 places, 79/79 transitions.
Graph (complete) has 172 edges and 63 vertex of which 57 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 57 transition count 68
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 52 transition count 68
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 15 place count 48 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 19 place count 48 transition count 64
Applied a total of 19 rules in 13 ms. Remains 48 /63 variables (removed 15) and now considering 64/79 (removed 15) transitions.
// Phase 1: matrix 64 rows 48 cols
[2024-05-22 10:27:44] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 10:27:44] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-22 10:27:44] [INFO ] Invariant cache hit.
[2024-05-22 10:27:44] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-22 10:27:44] [INFO ] Implicit Places using invariants and state equation in 55 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 84 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 47/63 places, 64/79 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 99 ms. Remains : 47/63 places, 64/79 transitions.
[2024-05-22 10:27:44] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:44] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:44] [INFO ] Input system was already deterministic with 64 transitions.
[2024-05-22 10:27:44] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:44] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:44] [INFO ] Time to serialize gal into /tmp/CTLFireability7135201935221848494.gal : 1 ms
[2024-05-22 10:27:44] [INFO ] Time to serialize properties into /tmp/CTLFireability16194673894402339604.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7135201935221848494.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16194673894402339604.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,532481,0.030713,4840,2,712,5,7933,6,0,246,5281,0


Converting to forward existential form...Done !
original formula: EF(AG(((p22==0)||(p61==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p22==0)||(p61==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t15, t17, t19, t21, t24, t54, t57, t58, t59, t60, t61, t62, t63, Intersection with reachable...225
(forward)formula 0,1,0.243202,13816,1,0,94,58641,150,62,1423,51884,138
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 79/79 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 59 transition count 75
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 59 transition count 75
Applied a total of 8 rules in 1 ms. Remains 59 /63 variables (removed 4) and now considering 75/79 (removed 4) transitions.
// Phase 1: matrix 75 rows 59 cols
[2024-05-22 10:27:44] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:27:45] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-22 10:27:45] [INFO ] Invariant cache hit.
[2024-05-22 10:27:45] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-22 10:27:45] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2024-05-22 10:27:45] [INFO ] Invariant cache hit.
[2024-05-22 10:27:45] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 75/134 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 48/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 109 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1047 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 75/134 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 48/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 74/183 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 183 constraints, problems are : Problem set: 0 solved, 74 unsolved in 824 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 1883ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 1883ms
Starting structural reductions in LTL mode, iteration 1 : 59/63 places, 75/79 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1959 ms. Remains : 59/63 places, 75/79 transitions.
[2024-05-22 10:27:46] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:46] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:46] [INFO ] Input system was already deterministic with 75 transitions.
[2024-05-22 10:27:46] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:46] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:46] [INFO ] Time to serialize gal into /tmp/CTLFireability14007489801274312688.gal : 1 ms
[2024-05-22 10:27:46] [INFO ] Time to serialize properties into /tmp/CTLFireability3463824540091329611.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14007489801274312688.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3463824540091329611.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.65e+06,0.047917,5484,2,619,5,12412,6,0,301,8264,0


Converting to forward existential form...Done !
original formula: E(((p6==1) + (!(((!(EF((p4==1))) + AG((p21==1))) * (((p56==1)&&(p61==1)) + A((p16==1) U ((p49==1)&&(p61==1)))))) * (AX(((p28==1)&&(p62==1...556
=> equivalent forward existential formula: ([FwdG((FwdU(Init,((p6==1) + (!(((!(E(TRUE U (p4==1))) + !(E(TRUE U !((p21==1))))) * (((p56==1)&&(p61==1)) + !((...1317
Reverse transition relation is NOT exact ! Due to transitions t56, t58, t60, t62, t65, t67, t68, t69, t70, t71, t72, t73, t74, Intersection with reachable...225
(forward)formula 0,0,0.311406,16604,1,0,119,74621,186,73,1866,66082,173
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 79/79 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 59 transition count 75
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 59 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 56 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 56 transition count 72
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 53 transition count 69
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 53 transition count 69
Applied a total of 20 rules in 2 ms. Remains 53 /63 variables (removed 10) and now considering 69/79 (removed 10) transitions.
// Phase 1: matrix 69 rows 53 cols
[2024-05-22 10:27:47] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:27:47] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-22 10:27:47] [INFO ] Invariant cache hit.
[2024-05-22 10:27:47] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 10:27:47] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Running 68 sub problems to find dead transitions.
[2024-05-22 10:27:47] [INFO ] Invariant cache hit.
[2024-05-22 10:27:47] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (OVERLAPS) 69/122 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 45/100 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (OVERLAPS) 0/122 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 100 constraints, problems are : Problem set: 0 solved, 68 unsolved in 938 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (OVERLAPS) 69/122 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 45/100 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 68/168 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 168 constraints, problems are : Problem set: 0 solved, 68 unsolved in 713 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
After SMT, in 1660ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 1661ms
Starting structural reductions in LTL mode, iteration 1 : 53/63 places, 69/79 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1736 ms. Remains : 53/63 places, 69/79 transitions.
[2024-05-22 10:27:49] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:27:49] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:27:49] [INFO ] Input system was already deterministic with 69 transitions.
[2024-05-22 10:27:49] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:49] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:49] [INFO ] Time to serialize gal into /tmp/CTLFireability1260923674461174498.gal : 1 ms
[2024-05-22 10:27:49] [INFO ] Time to serialize properties into /tmp/CTLFireability16125848013236498610.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1260923674461174498.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16125848013236498610.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.35098e+06,0.058075,5968,2,651,5,16256,6,0,271,10560,0


Converting to forward existential form...Done !
original formula: (EX(((p43==0)||(p62==0))) * E(!((((((((AX(((p35==1)&&(p61==1))) * (p46==1)) * (p61==1)) + ((p60==1)&&(p61==1))) + (((p54==1)&&(p62==1))&&...557
=> equivalent forward existential formula: ([FwdG((FwdU((Init * EX(((p43==0)||(p62==0)))),!((((((((!(EX(!(((p35==1)&&(p61==1))))) * (p46==1)) * (p61==1)) +...1223
Reverse transition relation is NOT exact ! Due to transitions t17, t21, t23, t24, t57, t59, t61, t62, t63, t64, t65, t66, t67, t68, Intersection with reac...230
(forward)formula 0,1,2.76253,97344,1,0,1095,524779,207,609,1724,721158,1268
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 79/79 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 59 transition count 75
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 59 transition count 75
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 55 transition count 71
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 55 transition count 71
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 51 transition count 67
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 51 transition count 67
Applied a total of 24 rules in 3 ms. Remains 51 /63 variables (removed 12) and now considering 67/79 (removed 12) transitions.
// Phase 1: matrix 67 rows 51 cols
[2024-05-22 10:27:51] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:27:51] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-22 10:27:51] [INFO ] Invariant cache hit.
[2024-05-22 10:27:51] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-22 10:27:51] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2024-05-22 10:27:51] [INFO ] Invariant cache hit.
[2024-05-22 10:27:51] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 67/118 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 44/97 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 0/118 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 97 constraints, problems are : Problem set: 0 solved, 66 unsolved in 885 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 67/118 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 44/97 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 66/163 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/118 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 163 constraints, problems are : Problem set: 0 solved, 66 unsolved in 684 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 1580ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 1581ms
Starting structural reductions in LTL mode, iteration 1 : 51/63 places, 67/79 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1653 ms. Remains : 51/63 places, 67/79 transitions.
[2024-05-22 10:27:53] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:27:53] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:27:53] [INFO ] Input system was already deterministic with 67 transitions.
[2024-05-22 10:27:53] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:53] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:53] [INFO ] Time to serialize gal into /tmp/CTLFireability543806689886993408.gal : 0 ms
[2024-05-22 10:27:53] [INFO ] Time to serialize properties into /tmp/CTLFireability8341492529886547793.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability543806689886993408.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8341492529886547793.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.21229e+06,0.053519,5956,2,573,5,15348,6,0,261,9751,0


Converting to forward existential form...Done !
original formula: AG(E(A(((p47==1)&&(p61==1)) U ((!(((p18==1)&&(p4==1))&&(p62==1)))||(((p21==1)&&(p29==1))&&(p61==1)))) U (AF(((p58==1)&&(p62==1))) + (EG(A...234
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!((E(!(((!(((p18==1)&&(p4==1))&&(p62==1)))||(((p21==1)&&(p29==1))&&(p61==1)))) U (!(((p4...475
Reverse transition relation is NOT exact ! Due to transitions t16, t18, t20, t22, t25, t59, t60, t61, t62, t63, t64, t65, t66, Intersection with reachable...225
(forward)formula 0,0,1.14806,45424,1,0,452,249513,183,251,1621,304447,575
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 79/79 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 58 transition count 74
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 58 transition count 74
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 53 transition count 69
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 53 transition count 69
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 48 transition count 64
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 48 transition count 64
Applied a total of 30 rules in 7 ms. Remains 48 /63 variables (removed 15) and now considering 64/79 (removed 15) transitions.
// Phase 1: matrix 64 rows 48 cols
[2024-05-22 10:27:54] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:27:54] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-22 10:27:54] [INFO ] Invariant cache hit.
[2024-05-22 10:27:54] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 10:27:54] [INFO ] Implicit Places using invariants and state equation in 46 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 73 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/63 places, 64/79 transitions.
Applied a total of 0 rules in 0 ms. Remains 47 /47 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 80 ms. Remains : 47/63 places, 64/79 transitions.
[2024-05-22 10:27:54] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:54] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:54] [INFO ] Input system was already deterministic with 64 transitions.
[2024-05-22 10:27:54] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:27:54] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:27:54] [INFO ] Time to serialize gal into /tmp/CTLFireability17159765211578954211.gal : 0 ms
[2024-05-22 10:27:54] [INFO ] Time to serialize properties into /tmp/CTLFireability11227334107766670888.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17159765211578954211.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11227334107766670888.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.04653e+06,0.055418,5896,2,889,5,15700,6,0,245,9290,0


Converting to forward existential form...Done !
original formula: EF(AX(AG(((EX(((p50==1)&&(p61==1))) * (p18==0)) * (EX(((p40==1)&&(p61==1))) + EG((p58==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !(((EX(((p50==1)&&(p61==1))) * (p18==0)) * (EX(((p40==1)&&(p61==1))) + EG(...183
Reverse transition relation is NOT exact ! Due to transitions t15, t17, t19, t21, t22, t24, t57, t58, t59, t60, t61, t62, t63, Intersection with reachable...225
(forward)formula 0,1,0.371144,18820,1,0,184,86281,158,108,1495,87727,258
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 79/79 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 59 transition count 75
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 59 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 56 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 56 transition count 72
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 53 transition count 69
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 53 transition count 69
Applied a total of 20 rules in 2 ms. Remains 53 /63 variables (removed 10) and now considering 69/79 (removed 10) transitions.
// Phase 1: matrix 69 rows 53 cols
[2024-05-22 10:27:55] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:27:55] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-22 10:27:55] [INFO ] Invariant cache hit.
[2024-05-22 10:27:55] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 10:27:55] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Running 68 sub problems to find dead transitions.
[2024-05-22 10:27:55] [INFO ] Invariant cache hit.
[2024-05-22 10:27:55] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (OVERLAPS) 69/122 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 45/100 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (OVERLAPS) 0/122 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 100 constraints, problems are : Problem set: 0 solved, 68 unsolved in 927 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (OVERLAPS) 69/122 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 45/100 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 68/168 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 168 constraints, problems are : Problem set: 0 solved, 68 unsolved in 744 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
After SMT, in 1682ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 1683ms
Starting structural reductions in LTL mode, iteration 1 : 53/63 places, 69/79 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1762 ms. Remains : 53/63 places, 69/79 transitions.
[2024-05-22 10:27:56] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:27:56] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:56] [INFO ] Input system was already deterministic with 69 transitions.
[2024-05-22 10:27:56] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:56] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:56] [INFO ] Time to serialize gal into /tmp/CTLFireability13334922382428572675.gal : 1 ms
[2024-05-22 10:27:56] [INFO ] Time to serialize properties into /tmp/CTLFireability16460295400601713924.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13334922382428572675.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16460295400601713924.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.35098e+06,0.050196,5452,2,639,5,11058,6,0,271,7560,0


Converting to forward existential form...Done !
original formula: AX(((EX(EG(((p3==1)&&(p62==1)))) * (((p9==1)&&(p61==1))||(((p48==1)||(p14==1))&&(((p58==1)&&(p62==1))||((p22==1)&&(p61==1)))))) * ((AG((p...324
=> equivalent forward existential formula: (([(EY(Init) * !(EX(EG(((p3==1)&&(p62==1))))))] = FALSE * [(EY(Init) * !((((p9==1)&&(p61==1))||(((p48==1)||(p14=...439
Reverse transition relation is NOT exact ! Due to transitions t17, t19, t21, t26, t55, t58, t61, t62, t63, t64, t65, t66, t67, t68, Intersection with reac...230
(forward)formula 0,0,0.928548,39028,1,0,400,197940,183,242,1680,252035,447
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 63/63 places, 79/79 transitions.
Graph (complete) has 172 edges and 63 vertex of which 57 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 57 transition count 67
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 51 transition count 67
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 18 place count 46 transition count 62
Iterating global reduction 0 with 5 rules applied. Total rules applied 23 place count 46 transition count 62
Applied a total of 23 rules in 11 ms. Remains 46 /63 variables (removed 17) and now considering 62/79 (removed 17) transitions.
// Phase 1: matrix 62 rows 46 cols
[2024-05-22 10:27:57] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 10:27:57] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-22 10:27:57] [INFO ] Invariant cache hit.
[2024-05-22 10:27:57] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 10:27:58] [INFO ] Implicit Places using invariants and state equation in 66 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 129 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 45/63 places, 62/79 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 62
Applied a total of 1 rules in 5 ms. Remains 45 /45 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 45 cols
[2024-05-22 10:27:58] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 10:27:58] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-22 10:27:58] [INFO ] Invariant cache hit.
[2024-05-22 10:27:58] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-22 10:27:58] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 45/63 places, 62/79 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 248 ms. Remains : 45/63 places, 62/79 transitions.
[2024-05-22 10:27:58] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:27:58] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:27:58] [INFO ] Input system was already deterministic with 62 transitions.
[2024-05-22 10:27:58] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:58] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:58] [INFO ] Time to serialize gal into /tmp/CTLFireability7709891209486633644.gal : 1 ms
[2024-05-22 10:27:58] [INFO ] Time to serialize properties into /tmp/CTLFireability732165898934976319.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7709891209486633644.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability732165898934976319.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,458753,0.031485,4824,2,849,5,8808,6,0,236,6029,0


Converting to forward existential form...Done !
original formula: !(E((p54==1) U !(EG(AG(AF(((p17==1)&&(p61==1))))))))
=> equivalent forward existential formula: [(FwdU(Init,(p54==1)) * !(EG(!(E(TRUE U !(!(EG(!(((p17==1)&&(p61==1)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t13, t15, t17, t19, t20, t22, t54, t55, t56, t57, t58, t59, t60, Intersection with reachable...225
Hit Full ! (commute/partial/dont) 59/0/3
(forward)formula 0,0,0.712144,33232,1,0,288,165865,163,162,1437,208949,362
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-22 10:27:58] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:27:58] [INFO ] Flatten gal took : 4 ms
Total runtime 34550 ms.

BK_STOP 1716373678916

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-06a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-tall-171631132500362"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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