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.r202-smll-171649588000345.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 IBM703-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-171649588000345
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 856K
-rw-r--r-- 1 mcc users 11K 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 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.3K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 35K Apr 11 22:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 234K Apr 11 22:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 11 22:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 11 22:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 203K 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 IBM703-PT-none-CTLCardinality-2024-00
FORMULA_NAME IBM703-PT-none-CTLCardinality-2024-01
FORMULA_NAME IBM703-PT-none-CTLCardinality-2024-02
FORMULA_NAME IBM703-PT-none-CTLCardinality-2024-03
FORMULA_NAME IBM703-PT-none-CTLCardinality-2024-04
FORMULA_NAME IBM703-PT-none-CTLCardinality-2024-05
FORMULA_NAME IBM703-PT-none-CTLCardinality-2024-06
FORMULA_NAME IBM703-PT-none-CTLCardinality-2024-07
FORMULA_NAME IBM703-PT-none-CTLCardinality-2024-08
FORMULA_NAME IBM703-PT-none-CTLCardinality-2024-09
FORMULA_NAME IBM703-PT-none-CTLCardinality-2024-10
FORMULA_NAME IBM703-PT-none-CTLCardinality-2024-11
FORMULA_NAME IBM703-PT-none-CTLCardinality-2023-12
FORMULA_NAME IBM703-PT-none-CTLCardinality-2023-13
FORMULA_NAME IBM703-PT-none-CTLCardinality-2023-14
FORMULA_NAME IBM703-PT-none-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716777098938

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM703-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-27 02:31:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 02:31:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 02:31:41] [INFO ] Load time of PNML (sax parser for PT used): 329 ms
[2024-05-27 02:31:41] [INFO ] Transformed 262 places.
[2024-05-27 02:31:41] [INFO ] Transformed 284 transitions.
[2024-05-27 02:31:41] [INFO ] Found NUPN structural information;
[2024-05-27 02:31:41] [INFO ] Parsed PT model containing 262 places and 284 transitions and 572 arcs in 618 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 34 ms.
FORMULA IBM703-PT-none-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 84 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 284/284 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 259 transition count 284
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 19 place count 243 transition count 268
Iterating global reduction 1 with 16 rules applied. Total rules applied 35 place count 243 transition count 268
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 238 transition count 263
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 238 transition count 263
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 49 place count 234 transition count 259
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 234 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 234 transition count 258
Applied a total of 54 rules in 150 ms. Remains 234 /262 variables (removed 28) and now considering 258/284 (removed 26) transitions.
// Phase 1: matrix 258 rows 234 cols
[2024-05-27 02:31:42] [INFO ] Computed 1 invariants in 38 ms
[2024-05-27 02:31:42] [INFO ] Implicit Places using invariants in 455 ms returned []
[2024-05-27 02:31:42] [INFO ] Invariant cache hit.
[2024-05-27 02:31:43] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 936 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-05-27 02:31:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 3/233 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/491 variables, 233/234 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 1/492 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 0/492 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 235 constraints, problems are : Problem set: 0 solved, 257 unsolved in 24939 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 3/233 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/491 variables, 233/234 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 256/490 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 1/492 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (OVERLAPS) 0/492 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Int declared 492/492 variables, and 492 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
After SMT, in 55140ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 55179ms
Starting structural reductions in LTL mode, iteration 1 : 234/262 places, 258/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56318 ms. Remains : 234/262 places, 258/284 transitions.
Support contains 84 out of 234 places after structural reductions.
[2024-05-27 02:32:38] [INFO ] Flatten gal took : 100 ms
[2024-05-27 02:32:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA IBM703-PT-none-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 02:32:38] [INFO ] Flatten gal took : 34 ms
[2024-05-27 02:32:39] [INFO ] Input system was already deterministic with 258 transitions.
Support contains 79 out of 234 places (down from 84) after GAL structural reductions.
RANDOM walk for 40000 steps (746 resets) in 2765 ms. (14 steps per ms) remains 3/58 properties
BEST_FIRST walk for 40001 steps (498 resets) in 785 ms. (50 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (446 resets) in 165 ms. (240 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (503 resets) in 157 ms. (253 steps per ms) remains 3/3 properties
[2024-05-27 02:32:40] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 194/205 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 230/435 variables, 205/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/443 variables, 4/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 8/451 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 8/459 variables, 4/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 5/464 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 4/468 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/468 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 4/472 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/472 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 4/476 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/476 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 4/480 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/480 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 4/484 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/484 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 4/488 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/488 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 4/492 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/492 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/492 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 235 constraints, problems are : Problem set: 0 solved, 3 unsolved in 520 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp52 is UNSAT
After SMT solving in domain Int declared 205/492 variables, and 1 constraints, problems are : Problem set: 3 solved, 0 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/234 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 610ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
[2024-05-27 02:32:40] [INFO ] Flatten gal took : 25 ms
[2024-05-27 02:32:40] [INFO ] Flatten gal took : 26 ms
[2024-05-27 02:32:41] [INFO ] Input system was already deterministic with 258 transitions.
Support contains 69 out of 234 places (down from 71) after GAL structural reductions.
Computed a total of 234 stabilizing places and 258 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 234 transition count 258
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA IBM703-PT-none-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 258/258 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 231 transition count 258
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 23 place count 211 transition count 238
Iterating global reduction 1 with 20 rules applied. Total rules applied 43 place count 211 transition count 238
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 53 place count 201 transition count 228
Iterating global reduction 1 with 10 rules applied. Total rules applied 63 place count 201 transition count 228
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 72 place count 192 transition count 219
Iterating global reduction 1 with 9 rules applied. Total rules applied 81 place count 192 transition count 219
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 83 place count 192 transition count 217
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 87 place count 188 transition count 213
Iterating global reduction 2 with 4 rules applied. Total rules applied 91 place count 188 transition count 213
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 95 place count 184 transition count 209
Iterating global reduction 2 with 4 rules applied. Total rules applied 99 place count 184 transition count 209
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 103 place count 180 transition count 205
Iterating global reduction 2 with 4 rules applied. Total rules applied 107 place count 180 transition count 205
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 110 place count 177 transition count 202
Iterating global reduction 2 with 3 rules applied. Total rules applied 113 place count 177 transition count 202
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 116 place count 174 transition count 199
Iterating global reduction 2 with 3 rules applied. Total rules applied 119 place count 174 transition count 199
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 120 place count 173 transition count 198
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 173 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 172 transition count 197
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 172 transition count 197
Applied a total of 123 rules in 88 ms. Remains 172 /234 variables (removed 62) and now considering 197/258 (removed 61) transitions.
// Phase 1: matrix 197 rows 172 cols
[2024-05-27 02:32:41] [INFO ] Computed 0 invariants in 6 ms
[2024-05-27 02:32:41] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-27 02:32:41] [INFO ] Invariant cache hit.
[2024-05-27 02:32:41] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-27 02:32:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 197/368 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/368 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (OVERLAPS) 1/369 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 0/369 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 172 constraints, problems are : Problem set: 0 solved, 196 unsolved in 12302 ms.
Refiners :[State Equation: 172/172 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 197/368 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/368 variables, 196/367 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/368 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 1/369 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 0/369 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 368 constraints, problems are : Problem set: 0 solved, 196 unsolved in 12996 ms.
Refiners :[State Equation: 172/172 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
After SMT, in 25338ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 25344ms
Starting structural reductions in LTL mode, iteration 1 : 172/234 places, 197/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25665 ms. Remains : 172/234 places, 197/258 transitions.
[2024-05-27 02:33:06] [INFO ] Flatten gal took : 11 ms
[2024-05-27 02:33:06] [INFO ] Flatten gal took : 11 ms
[2024-05-27 02:33:06] [INFO ] Input system was already deterministic with 197 transitions.
[2024-05-27 02:33:06] [INFO ] Flatten gal took : 16 ms
[2024-05-27 02:33:06] [INFO ] Flatten gal took : 15 ms
[2024-05-27 02:33:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality5784539922403534321.gal : 17 ms
[2024-05-27 02:33:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality12575511197819298874.ctl : 5 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/CTLCardinality5784539922403534321.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12575511197819298874.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,2532,0.140545,5652,2,685,5,6007,6,0,885,8979,0


Converting to forward existential form...Done !
original formula: E(EX((merge_s00000452_activated==1)) U AF(E((AF(((task_s00000741_output_s00000264==0)||(decision_s00000787_input_s00000263==1))) * EX((ta...350
=> equivalent forward existential formula: [(FwdU(Init,EX((merge_s00000452_activated==1))) * !(EG(!(E((!(EG(!(((task_s00000741_output_s00000264==0)||(decis...420
Reverse transition relation is NOT exact ! Due to transitions t24, t26, t27, t28, t29, t32, t33, t34, t39, t40, t44, t46, t51, t54, t55, t69, t78, t123, t1...283
(forward)formula 0,0,1.94009,58324,1,0,662,320703,436,412,4875,310711,807
FORMULA IBM703-PT-none-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 234/234 places, 258/258 transitions.
Graph (complete) has 259 edges and 234 vertex of which 85 are kept as prefixes of interest. Removing 149 places using SCC suffix rule.3 ms
Discarding 149 places :
Also discarding 160 output transitions
Drop transitions (Output transitions of discarded places.) removed 160 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 84 transition count 38
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 64 rules applied. Total rules applied 124 place count 26 transition count 32
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 129 place count 22 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 130 place count 21 transition count 31
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 130 place count 21 transition count 27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 138 place count 17 transition count 27
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 140 place count 15 transition count 24
Iterating global reduction 4 with 2 rules applied. Total rules applied 142 place count 15 transition count 24
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 146 place count 15 transition count 20
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 148 place count 15 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 150 place count 13 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 150 place count 13 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 152 place count 12 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 153 place count 12 transition count 16
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 154 place count 12 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 155 place count 11 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 156 place count 11 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 156 place count 11 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 158 place count 10 transition count 13
Applied a total of 158 rules in 38 ms. Remains 10 /234 variables (removed 224) and now considering 13/258 (removed 245) transitions.
// Phase 1: matrix 13 rows 10 cols
[2024-05-27 02:33:08] [INFO ] Computed 0 invariants in 2 ms
[2024-05-27 02:33:08] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-27 02:33:09] [INFO ] Invariant cache hit.
[2024-05-27 02:33:09] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-27 02:33:09] [INFO ] Redundant transitions in 1 ms returned []
Running 10 sub problems to find dead transitions.
[2024-05-27 02:33:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 12/20 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 2/22 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1/23 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 10 constraints, problems are : Problem set: 0 solved, 10 unsolved in 154 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 12/20 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 2/22 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 1/23 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 20 constraints, problems are : Problem set: 0 solved, 10 unsolved in 124 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 283ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 284ms
Starting structural reductions in SI_CTL mode, iteration 1 : 10/234 places, 13/258 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 398 ms. Remains : 10/234 places, 13/258 transitions.
[2024-05-27 02:33:09] [INFO ] Flatten gal took : 1 ms
[2024-05-27 02:33:09] [INFO ] Flatten gal took : 6 ms
[2024-05-27 02:33:09] [INFO ] Input system was already deterministic with 13 transitions.
[2024-05-27 02:33:09] [INFO ] Flatten gal took : 1 ms
[2024-05-27 02:33:09] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:33:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality17227117485427986242.gal : 1 ms
[2024-05-27 02:33:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality1356541022727718298.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/CTLCardinality17227117485427986242.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1356541022727718298.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,16,0.005328,3348,2,22,5,107,6,0,49,89,0


Converting to forward existential form...Done !
original formula: EG((((fork_s00000463_activated_s00000272==0)&&(task_s00000754_inputCriterion_s00000257_used==1)) + (AF((merge_s00000320_activated==1)) * ...195
=> equivalent forward existential formula: [FwdG(Init,(((fork_s00000463_activated_s00000272==0)&&(task_s00000754_inputCriterion_s00000257_used==1)) + (!(EG...244
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t11, Intersection with reachable at each step enabled. (destroyed/reverse/in...179
dead was empty
(forward)formula 0,0,0.013213,3664,1,0,60,709,50,29,255,767,65
FORMULA IBM703-PT-none-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 258/258 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 231 transition count 258
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 19 place count 215 transition count 242
Iterating global reduction 1 with 16 rules applied. Total rules applied 35 place count 215 transition count 242
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 43 place count 207 transition count 234
Iterating global reduction 1 with 8 rules applied. Total rules applied 51 place count 207 transition count 234
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 57 place count 201 transition count 228
Iterating global reduction 1 with 6 rules applied. Total rules applied 63 place count 201 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 201 transition count 227
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 199 transition count 225
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 199 transition count 225
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 197 transition count 223
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 197 transition count 223
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 195 transition count 221
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 195 transition count 221
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 193 transition count 219
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 193 transition count 219
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 191 transition count 217
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 191 transition count 217
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 190 transition count 216
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 190 transition count 216
Applied a total of 86 rules in 83 ms. Remains 190 /234 variables (removed 44) and now considering 216/258 (removed 42) transitions.
// Phase 1: matrix 216 rows 190 cols
[2024-05-27 02:33:09] [INFO ] Computed 0 invariants in 3 ms
[2024-05-27 02:33:09] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-27 02:33:09] [INFO ] Invariant cache hit.
[2024-05-27 02:33:09] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-05-27 02:33:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 216/405 variables, 189/189 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/406 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 0/406 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 190 constraints, problems are : Problem set: 0 solved, 215 unsolved in 13692 ms.
Refiners :[State Equation: 190/190 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 216/405 variables, 189/189 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 215/404 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 1/406 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 0/406 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 405 constraints, problems are : Problem set: 0 solved, 215 unsolved in 15057 ms.
Refiners :[State Equation: 190/190 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
After SMT, in 28795ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 28802ms
Starting structural reductions in LTL mode, iteration 1 : 190/234 places, 216/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29178 ms. Remains : 190/234 places, 216/258 transitions.
[2024-05-27 02:33:38] [INFO ] Flatten gal took : 18 ms
[2024-05-27 02:33:38] [INFO ] Flatten gal took : 17 ms
[2024-05-27 02:33:38] [INFO ] Input system was already deterministic with 216 transitions.
[2024-05-27 02:33:38] [INFO ] Flatten gal took : 8 ms
[2024-05-27 02:33:38] [INFO ] Flatten gal took : 8 ms
[2024-05-27 02:33:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality4546258852589333183.gal : 4 ms
[2024-05-27 02:33:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality3212283941620237820.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4546258852589333183.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3212283941620237820.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,3162,0.111394,6132,2,867,5,7403,6,0,976,9804,0


Converting to forward existential form...Done !
original formula: EX((AX(((A((task_s00000761_output_s00000264==0) U (task_s00000760_inputCriterion_s00000257_used==0)) * ((task_s00000757_input_s00000263==...548
=> equivalent forward existential formula: ([(EY(Init) * !(EX(!(((!((E(!((task_s00000760_inputCriterion_s00000257_used==0)) U (!((task_s00000761_output_s00...902
Reverse transition relation is NOT exact ! Due to transitions t23, t26, t29, t36, t37, t38, t43, t44, t48, t50, t55, t58, t59, t73, t82, t132, t133, t156, ...279
(forward)formula 0,0,2.32726,70056,1,0,672,404726,472,374,5024,354753,888
FORMULA IBM703-PT-none-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 258/258 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 231 transition count 258
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 23 place count 211 transition count 238
Iterating global reduction 1 with 20 rules applied. Total rules applied 43 place count 211 transition count 238
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 200 transition count 227
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 200 transition count 227
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 75 place count 190 transition count 217
Iterating global reduction 1 with 10 rules applied. Total rules applied 85 place count 190 transition count 217
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 87 place count 190 transition count 215
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 92 place count 185 transition count 210
Iterating global reduction 2 with 5 rules applied. Total rules applied 97 place count 185 transition count 210
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 102 place count 180 transition count 205
Iterating global reduction 2 with 5 rules applied. Total rules applied 107 place count 180 transition count 205
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 111 place count 176 transition count 201
Iterating global reduction 2 with 4 rules applied. Total rules applied 115 place count 176 transition count 201
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 118 place count 173 transition count 198
Iterating global reduction 2 with 3 rules applied. Total rules applied 121 place count 173 transition count 198
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 124 place count 170 transition count 195
Iterating global reduction 2 with 3 rules applied. Total rules applied 127 place count 170 transition count 195
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 128 place count 169 transition count 194
Iterating global reduction 2 with 1 rules applied. Total rules applied 129 place count 169 transition count 194
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 130 place count 168 transition count 193
Iterating global reduction 2 with 1 rules applied. Total rules applied 131 place count 168 transition count 193
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 132 place count 167 transition count 192
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 167 transition count 192
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 134 place count 166 transition count 191
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 166 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 136 place count 166 transition count 190
Applied a total of 136 rules in 63 ms. Remains 166 /234 variables (removed 68) and now considering 190/258 (removed 68) transitions.
// Phase 1: matrix 190 rows 166 cols
[2024-05-27 02:33:41] [INFO ] Computed 0 invariants in 1 ms
[2024-05-27 02:33:41] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-27 02:33:41] [INFO ] Invariant cache hit.
[2024-05-27 02:33:41] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2024-05-27 02:33:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 190/355 variables, 165/165 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 1/356 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 0/356 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 166 constraints, problems are : Problem set: 0 solved, 189 unsolved in 11172 ms.
Refiners :[State Equation: 166/166 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 190/355 variables, 165/165 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 189/354 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 1/356 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 0/356 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 356/356 variables, and 355 constraints, problems are : Problem set: 0 solved, 189 unsolved in 13794 ms.
Refiners :[State Equation: 166/166 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
After SMT, in 24992ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 24995ms
Starting structural reductions in LTL mode, iteration 1 : 166/234 places, 190/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25264 ms. Remains : 166/234 places, 190/258 transitions.
[2024-05-27 02:34:06] [INFO ] Flatten gal took : 12 ms
[2024-05-27 02:34:06] [INFO ] Flatten gal took : 11 ms
[2024-05-27 02:34:06] [INFO ] Input system was already deterministic with 190 transitions.
[2024-05-27 02:34:06] [INFO ] Flatten gal took : 11 ms
[2024-05-27 02:34:06] [INFO ] Flatten gal took : 11 ms
[2024-05-27 02:34:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality5349197220033846409.gal : 3 ms
[2024-05-27 02:34:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality6382412061147650981.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/CTLCardinality5349197220033846409.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6382412061147650981.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,2326,0.121541,5456,2,638,5,5493,6,0,854,7855,0


Converting to forward existential form...Done !
original formula: AX(EG(AF((callToProcess_s00000808_output_s00000264==0))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(EG(!((callToProcess_s00000808_output_s00000264==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t23, t25, t26, t27, t28, t31, t32, t33, t38, t39, t43, t45, t50, t53, t54, t59, t67, t75, t11...282
(forward)formula 0,1,1.13654,29916,1,0,363,121492,407,193,4555,122776,532
FORMULA IBM703-PT-none-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 234/234 places, 258/258 transitions.
Graph (complete) has 259 edges and 234 vertex of which 95 are kept as prefixes of interest. Removing 139 places using SCC suffix rule.2 ms
Discarding 139 places :
Also discarding 146 output transitions
Drop transitions (Output transitions of discarded places.) removed 146 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 94 transition count 49
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 67 rules applied. Total rules applied 130 place count 33 transition count 43
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 136 place count 29 transition count 41
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 138 place count 27 transition count 41
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 138 place count 27 transition count 37
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 146 place count 23 transition count 37
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 147 place count 22 transition count 35
Iterating global reduction 4 with 1 rules applied. Total rules applied 148 place count 22 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 150 place count 21 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 152 place count 21 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 153 place count 20 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 156 place count 20 transition count 29
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 158 place count 20 transition count 27
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 160 place count 18 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 161 place count 18 transition count 26
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 162 place count 18 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 163 place count 17 transition count 25
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 164 place count 17 transition count 25
Applied a total of 164 rules in 42 ms. Remains 17 /234 variables (removed 217) and now considering 25/258 (removed 233) transitions.
// Phase 1: matrix 25 rows 17 cols
[2024-05-27 02:34:07] [INFO ] Computed 0 invariants in 1 ms
[2024-05-27 02:34:07] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-27 02:34:07] [INFO ] Invariant cache hit.
[2024-05-27 02:34:07] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-05-27 02:34:07] [INFO ] Redundant transitions in 0 ms returned []
Running 21 sub problems to find dead transitions.
[2024-05-27 02:34:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 24/40 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 2/42 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 0/42 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 17 constraints, problems are : Problem set: 0 solved, 21 unsolved in 311 ms.
Refiners :[State Equation: 17/17 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 24/40 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 2/42 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 0/42 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 38 constraints, problems are : Problem set: 0 solved, 21 unsolved in 343 ms.
Refiners :[State Equation: 17/17 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 661ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 662ms
Starting structural reductions in SI_CTL mode, iteration 1 : 17/234 places, 25/258 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 804 ms. Remains : 17/234 places, 25/258 transitions.
[2024-05-27 02:34:08] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:34:08] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:34:08] [INFO ] Input system was already deterministic with 25 transitions.
[2024-05-27 02:34:08] [INFO ] Flatten gal took : 1 ms
[2024-05-27 02:34:08] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:34:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality1724431610605153977.gal : 1 ms
[2024-05-27 02:34:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality12220639874174890076.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/CTLCardinality1724431610605153977.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12220639874174890076.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,18,0.007817,3412,2,34,5,219,6,0,88,208,0


Converting to forward existential form...Done !
original formula: (EF(!(E(((task_s00000739_input_s00000263==0) * EF(((callToProcess_s00000808_output_s00000264==0)||(task_s00000711_inputCriterion_s0000025...304
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U !(E(((task_s00000739_input_s00000263==0) * E(TRUE U ((callToProcess_s00000808_output_s000...359
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t5, t9, t10, t19, Intersection with reachable at each step enabled. (destroyed/r...189
(forward)formula 0,0,0.023519,3992,1,0,57,1601,84,33,483,1705,85
FORMULA IBM703-PT-none-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 258/258 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 231 transition count 258
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 22 place count 212 transition count 239
Iterating global reduction 1 with 19 rules applied. Total rules applied 41 place count 212 transition count 239
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 52 place count 201 transition count 228
Iterating global reduction 1 with 11 rules applied. Total rules applied 63 place count 201 transition count 228
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 73 place count 191 transition count 218
Iterating global reduction 1 with 10 rules applied. Total rules applied 83 place count 191 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 85 place count 191 transition count 216
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 90 place count 186 transition count 211
Iterating global reduction 2 with 5 rules applied. Total rules applied 95 place count 186 transition count 211
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 100 place count 181 transition count 206
Iterating global reduction 2 with 5 rules applied. Total rules applied 105 place count 181 transition count 206
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 109 place count 177 transition count 202
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 177 transition count 202
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 116 place count 174 transition count 199
Iterating global reduction 2 with 3 rules applied. Total rules applied 119 place count 174 transition count 199
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 122 place count 171 transition count 196
Iterating global reduction 2 with 3 rules applied. Total rules applied 125 place count 171 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 126 place count 170 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 170 transition count 195
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 128 place count 169 transition count 194
Iterating global reduction 2 with 1 rules applied. Total rules applied 129 place count 169 transition count 194
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 130 place count 168 transition count 193
Iterating global reduction 2 with 1 rules applied. Total rules applied 131 place count 168 transition count 193
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 132 place count 167 transition count 192
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 167 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 167 transition count 191
Applied a total of 134 rules in 73 ms. Remains 167 /234 variables (removed 67) and now considering 191/258 (removed 67) transitions.
// Phase 1: matrix 191 rows 167 cols
[2024-05-27 02:34:08] [INFO ] Computed 0 invariants in 2 ms
[2024-05-27 02:34:08] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-27 02:34:08] [INFO ] Invariant cache hit.
[2024-05-27 02:34:08] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2024-05-27 02:34:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 191/357 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 1/358 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 0/358 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 167 constraints, problems are : Problem set: 0 solved, 190 unsolved in 12046 ms.
Refiners :[State Equation: 167/167 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 191/357 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 190/356 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 1/358 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/358 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/358 variables, and 357 constraints, problems are : Problem set: 0 solved, 190 unsolved in 12105 ms.
Refiners :[State Equation: 167/167 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 24176ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 24181ms
Starting structural reductions in LTL mode, iteration 1 : 167/234 places, 191/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24514 ms. Remains : 167/234 places, 191/258 transitions.
[2024-05-27 02:34:32] [INFO ] Flatten gal took : 6 ms
[2024-05-27 02:34:32] [INFO ] Flatten gal took : 7 ms
[2024-05-27 02:34:32] [INFO ] Input system was already deterministic with 191 transitions.
[2024-05-27 02:34:32] [INFO ] Flatten gal took : 7 ms
[2024-05-27 02:34:32] [INFO ] Flatten gal took : 6 ms
[2024-05-27 02:34:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality10829386119660030439.gal : 3 ms
[2024-05-27 02:34:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality11588938642742092401.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/CTLCardinality10829386119660030439.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11588938642742092401.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,2330,0.09757,5456,2,653,5,5580,6,0,859,8107,0


Converting to forward existential form...Done !
original formula: (EF(AG((EG(((merge_s00000446_input_s00000263==0)||(task_s00000707_output_s00000264==1))) + EG((task_s00000710_output_s00000264==1))))) * ...165
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(E(TRUE U !((EG(((merge_s00000446_input_s00000263==0)||(task_s00000707_output_s00000264==1...252
(forward)formula 0,0,0.109757,5456,1,0,6,5580,7,1,1022,8107,1
FORMULA IBM703-PT-none-CTLCardinality-2024-05 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 : 234/234 places, 258/258 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 231 transition count 258
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 22 place count 212 transition count 239
Iterating global reduction 1 with 19 rules applied. Total rules applied 41 place count 212 transition count 239
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 51 place count 202 transition count 229
Iterating global reduction 1 with 10 rules applied. Total rules applied 61 place count 202 transition count 229
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 193 transition count 220
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 193 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 81 place count 193 transition count 218
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 86 place count 188 transition count 213
Iterating global reduction 2 with 5 rules applied. Total rules applied 91 place count 188 transition count 213
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 96 place count 183 transition count 208
Iterating global reduction 2 with 5 rules applied. Total rules applied 101 place count 183 transition count 208
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 105 place count 179 transition count 204
Iterating global reduction 2 with 4 rules applied. Total rules applied 109 place count 179 transition count 204
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 111 place count 177 transition count 202
Iterating global reduction 2 with 2 rules applied. Total rules applied 113 place count 177 transition count 202
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 115 place count 175 transition count 200
Iterating global reduction 2 with 2 rules applied. Total rules applied 117 place count 175 transition count 200
Applied a total of 117 rules in 31 ms. Remains 175 /234 variables (removed 59) and now considering 200/258 (removed 58) transitions.
// Phase 1: matrix 200 rows 175 cols
[2024-05-27 02:34:33] [INFO ] Computed 0 invariants in 2 ms
[2024-05-27 02:34:33] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-27 02:34:33] [INFO ] Invariant cache hit.
[2024-05-27 02:34:33] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2024-05-27 02:34:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 200/374 variables, 174/174 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (OVERLAPS) 1/375 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (OVERLAPS) 0/375 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 375/375 variables, and 175 constraints, problems are : Problem set: 0 solved, 199 unsolved in 12515 ms.
Refiners :[State Equation: 175/175 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 200/374 variables, 174/174 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 199/373 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/374 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 1/375 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (OVERLAPS) 0/375 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Int declared 375/375 variables, and 374 constraints, problems are : Problem set: 0 solved, 199 unsolved in 14726 ms.
Refiners :[State Equation: 175/175 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints]
After SMT, in 27274ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 27278ms
Starting structural reductions in LTL mode, iteration 1 : 175/234 places, 200/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27533 ms. Remains : 175/234 places, 200/258 transitions.
[2024-05-27 02:35:00] [INFO ] Flatten gal took : 7 ms
[2024-05-27 02:35:00] [INFO ] Flatten gal took : 7 ms
[2024-05-27 02:35:00] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-27 02:35:00] [INFO ] Flatten gal took : 7 ms
[2024-05-27 02:35:00] [INFO ] Flatten gal took : 7 ms
[2024-05-27 02:35:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality4947625767003957391.gal : 2 ms
[2024-05-27 02:35:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality9965483002035109658.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/CTLCardinality4947625767003957391.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9965483002035109658.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,3445,0.10478,6040,2,872,5,7067,6,0,900,9986,0


Converting to forward existential form...Done !
original formula: AX(AF(EG((!(E((task_s00000729_output_s00000264==1) U ((task_s00000748_inputCriterion_s00000257_used==0)||(merge_s00000455_input_s00000290...251
=> equivalent forward existential formula: [FwdG(EY(Init),!(EG((!(E((task_s00000729_output_s00000264==1) U ((task_s00000748_inputCriterion_s00000257_used==...296
Reverse transition relation is NOT exact ! Due to transitions t6, t11, t26, t28, t29, t30, t31, t34, t35, t36, t37, t41, t42, t46, t47, t48, t53, t56, t57,...317
(forward)formula 0,0,1.28327,36096,1,0,371,123697,427,193,4966,160674,524
FORMULA IBM703-PT-none-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 234/234 places, 258/258 transitions.
Graph (complete) has 259 edges and 234 vertex of which 100 are kept as prefixes of interest. Removing 134 places using SCC suffix rule.1 ms
Discarding 134 places :
Also discarding 141 output transitions
Drop transitions (Output transitions of discarded places.) removed 141 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 100 transition count 47
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 75 rules applied. Total rules applied 146 place count 31 transition count 41
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 151 place count 27 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 152 place count 26 transition count 40
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 152 place count 26 transition count 36
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 160 place count 22 transition count 36
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 161 place count 21 transition count 34
Iterating global reduction 4 with 1 rules applied. Total rules applied 162 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 164 place count 20 transition count 33
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 167 place count 20 transition count 30
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 169 place count 19 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 172 place count 19 transition count 26
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 174 place count 19 transition count 24
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 176 place count 17 transition count 24
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 176 place count 17 transition count 23
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 178 place count 16 transition count 23
Applied a total of 178 rules in 13 ms. Remains 16 /234 variables (removed 218) and now considering 23/258 (removed 235) transitions.
// Phase 1: matrix 23 rows 16 cols
[2024-05-27 02:35:01] [INFO ] Computed 0 invariants in 2 ms
[2024-05-27 02:35:01] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-27 02:35:01] [INFO ] Invariant cache hit.
[2024-05-27 02:35:02] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-27 02:35:02] [INFO ] Redundant transitions in 0 ms returned []
Running 22 sub problems to find dead transitions.
[2024-05-27 02:35:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 23/38 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 0/39 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 16 constraints, problems are : Problem set: 0 solved, 22 unsolved in 247 ms.
Refiners :[State Equation: 16/16 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 23/38 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 22/37 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 1/39 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 38 constraints, problems are : Problem set: 0 solved, 22 unsolved in 305 ms.
Refiners :[State Equation: 16/16 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 556ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 557ms
Starting structural reductions in SI_CTL mode, iteration 1 : 16/234 places, 23/258 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 637 ms. Remains : 16/234 places, 23/258 transitions.
[2024-05-27 02:35:02] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:35:02] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:35:02] [INFO ] Input system was already deterministic with 23 transitions.
[2024-05-27 02:35:02] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:35:02] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:35:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality16063429728823942744.gal : 1 ms
[2024-05-27 02:35:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality9064512769489533932.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/CTLCardinality16063429728823942744.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9064512769489533932.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,17,0.006208,3404,2,32,5,168,6,0,82,160,0


Converting to forward existential form...Done !
original formula: A((task_s00000754_inputCriterion_s00000257_used!=0) U AF(((!((task_s00000744_inputCriterion_s00000257_used==0)||(alpha==1)))&&((task_s000...239
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(((!((task_s00000744_inputCriterion_s00000257_used==0)||(alpha==1)))&&((task_s00000722_in...666
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t8, t14, t16, t21, Intersection with reachable at each step enabled. (destroyed/...190
(forward)formula 0,0,0.022591,4248,1,0,68,1318,73,44,426,1545,98
FORMULA IBM703-PT-none-CTLCardinality-2024-07 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 : 234/234 places, 258/258 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 232 transition count 258
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 15 place count 219 transition count 245
Iterating global reduction 1 with 13 rules applied. Total rules applied 28 place count 219 transition count 245
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 215 transition count 241
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 215 transition count 241
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 212 transition count 238
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 212 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 212 transition count 237
Applied a total of 43 rules in 18 ms. Remains 212 /234 variables (removed 22) and now considering 237/258 (removed 21) transitions.
// Phase 1: matrix 237 rows 212 cols
[2024-05-27 02:35:02] [INFO ] Computed 0 invariants in 2 ms
[2024-05-27 02:35:02] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-27 02:35:02] [INFO ] Invariant cache hit.
[2024-05-27 02:35:02] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2024-05-27 02:35:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 237/447 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 2/449 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (OVERLAPS) 0/449 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 449/449 variables, and 212 constraints, problems are : Problem set: 0 solved, 236 unsolved in 17266 ms.
Refiners :[State Equation: 212/212 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 237/447 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 235/445 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (OVERLAPS) 2/449 variables, 2/447 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 0/449 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 449/449 variables, and 448 constraints, problems are : Problem set: 0 solved, 236 unsolved in 19414 ms.
Refiners :[State Equation: 212/212 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
After SMT, in 36717ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 36722ms
Starting structural reductions in LTL mode, iteration 1 : 212/234 places, 237/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37038 ms. Remains : 212/234 places, 237/258 transitions.
[2024-05-27 02:35:39] [INFO ] Flatten gal took : 9 ms
[2024-05-27 02:35:39] [INFO ] Flatten gal took : 8 ms
[2024-05-27 02:35:39] [INFO ] Input system was already deterministic with 237 transitions.
[2024-05-27 02:35:39] [INFO ] Flatten gal took : 8 ms
[2024-05-27 02:35:39] [INFO ] Flatten gal took : 8 ms
[2024-05-27 02:35:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality2219715808236504103.gal : 2 ms
[2024-05-27 02:35:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality10843529405173642555.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/CTLCardinality2219715808236504103.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10843529405173642555.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,5162,0.123234,6000,2,947,5,7449,6,0,1081,8508,0


Converting to forward existential form...Done !
original formula: (EG(((EX((task_s00000761_input_s00000263==0)) * ((task_s00000754_output_s00000264==0)||(task_s00000749_output_s00000264==1))) + (((EF((ta...1137
=> equivalent forward existential formula: ([(Init * !(EG(((EX((task_s00000761_input_s00000263==0)) * ((task_s00000754_output_s00000264==0)||(task_s0000074...1325
Reverse transition relation is NOT exact ! Due to transitions t21, t23, t26, t29, t36, t38, t39, t43, t48, t50, t58, t59, t73, t82, t135, t138, t176, t187,...274
(forward)formula 0,1,4.81005,135436,1,0,1283,884754,529,753,5969,707995,1658
FORMULA IBM703-PT-none-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 258/258 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 232 transition count 258
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 22 place count 212 transition count 238
Iterating global reduction 1 with 20 rules applied. Total rules applied 42 place count 212 transition count 238
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 53 place count 201 transition count 227
Iterating global reduction 1 with 11 rules applied. Total rules applied 64 place count 201 transition count 227
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 74 place count 191 transition count 217
Iterating global reduction 1 with 10 rules applied. Total rules applied 84 place count 191 transition count 217
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 86 place count 191 transition count 215
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 186 transition count 210
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 186 transition count 210
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 101 place count 181 transition count 205
Iterating global reduction 2 with 5 rules applied. Total rules applied 106 place count 181 transition count 205
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 110 place count 177 transition count 201
Iterating global reduction 2 with 4 rules applied. Total rules applied 114 place count 177 transition count 201
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 117 place count 174 transition count 198
Iterating global reduction 2 with 3 rules applied. Total rules applied 120 place count 174 transition count 198
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 123 place count 171 transition count 195
Iterating global reduction 2 with 3 rules applied. Total rules applied 126 place count 171 transition count 195
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 170 transition count 194
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 170 transition count 194
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 169 transition count 193
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 169 transition count 193
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 131 place count 168 transition count 192
Iterating global reduction 2 with 1 rules applied. Total rules applied 132 place count 168 transition count 192
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 133 place count 167 transition count 191
Iterating global reduction 2 with 1 rules applied. Total rules applied 134 place count 167 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 135 place count 167 transition count 190
Applied a total of 135 rules in 27 ms. Remains 167 /234 variables (removed 67) and now considering 190/258 (removed 68) transitions.
// Phase 1: matrix 190 rows 167 cols
[2024-05-27 02:35:44] [INFO ] Computed 0 invariants in 1 ms
[2024-05-27 02:35:44] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-27 02:35:44] [INFO ] Invariant cache hit.
[2024-05-27 02:35:44] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2024-05-27 02:35:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 190/355 variables, 165/165 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 2/357 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 0/357 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 357/357 variables, and 167 constraints, problems are : Problem set: 0 solved, 189 unsolved in 11159 ms.
Refiners :[State Equation: 167/167 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 190/355 variables, 165/165 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 185/350 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 2/357 variables, 2/352 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 4/356 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (OVERLAPS) 0/357 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 357/357 variables, and 356 constraints, problems are : Problem set: 0 solved, 189 unsolved in 14272 ms.
Refiners :[State Equation: 167/167 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
After SMT, in 25453ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 25455ms
Starting structural reductions in LTL mode, iteration 1 : 167/234 places, 190/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25661 ms. Remains : 167/234 places, 190/258 transitions.
[2024-05-27 02:36:10] [INFO ] Flatten gal took : 7 ms
[2024-05-27 02:36:10] [INFO ] Flatten gal took : 7 ms
[2024-05-27 02:36:10] [INFO ] Input system was already deterministic with 190 transitions.
[2024-05-27 02:36:10] [INFO ] Flatten gal took : 6 ms
[2024-05-27 02:36:10] [INFO ] Flatten gal took : 6 ms
[2024-05-27 02:36:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality15230794694010639877.gal : 3 ms
[2024-05-27 02:36:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality11365029432470168542.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/CTLCardinality15230794694010639877.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11365029432470168542.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,2327,0.105641,5456,2,661,5,5578,6,0,856,8816,0


Converting to forward existential form...Done !
original formula: (EX(AF((merge_s00000457_activated==0))) * EF(AG(AX((stopNode_s00000597_input_default==1)))))
=> equivalent forward existential formula: [(FwdU((Init * EX(!(EG(!((merge_s00000457_activated==0)))))),TRUE) * !(E(TRUE U !(!(EX(!((stopNode_s00000597_inp...186
Reverse transition relation is NOT exact ! Due to transitions t23, t25, t26, t27, t28, t31, t32, t33, t38, t39, t43, t50, t53, t54, t59, t67, t75, t119, t1...277
(forward)formula 0,1,0.99918,29736,1,0,345,102768,410,183,5034,125712,509
FORMULA IBM703-PT-none-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 258/258 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 231 transition count 258
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 21 place count 213 transition count 240
Iterating global reduction 1 with 18 rules applied. Total rules applied 39 place count 213 transition count 240
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 48 place count 204 transition count 231
Iterating global reduction 1 with 9 rules applied. Total rules applied 57 place count 204 transition count 231
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 65 place count 196 transition count 223
Iterating global reduction 1 with 8 rules applied. Total rules applied 73 place count 196 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 196 transition count 222
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 78 place count 192 transition count 218
Iterating global reduction 2 with 4 rules applied. Total rules applied 82 place count 192 transition count 218
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 86 place count 188 transition count 214
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 188 transition count 214
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 93 place count 185 transition count 211
Iterating global reduction 2 with 3 rules applied. Total rules applied 96 place count 185 transition count 211
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 183 transition count 209
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 183 transition count 209
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 102 place count 181 transition count 207
Iterating global reduction 2 with 2 rules applied. Total rules applied 104 place count 181 transition count 207
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 105 place count 180 transition count 206
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 180 transition count 206
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 179 transition count 205
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 179 transition count 205
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 178 transition count 204
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 178 transition count 204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 177 transition count 203
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 177 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 113 place count 177 transition count 202
Applied a total of 113 rules in 29 ms. Remains 177 /234 variables (removed 57) and now considering 202/258 (removed 56) transitions.
// Phase 1: matrix 202 rows 177 cols
[2024-05-27 02:36:11] [INFO ] Computed 0 invariants in 1 ms
[2024-05-27 02:36:11] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-27 02:36:11] [INFO ] Invariant cache hit.
[2024-05-27 02:36:11] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-27 02:36:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 202/378 variables, 176/176 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 1/379 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 0/379 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 177 constraints, problems are : Problem set: 0 solved, 201 unsolved in 13216 ms.
Refiners :[State Equation: 177/177 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 202/378 variables, 176/176 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 201/377 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 1/379 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 0/379 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 378 constraints, problems are : Problem set: 0 solved, 201 unsolved in 14643 ms.
Refiners :[State Equation: 177/177 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
After SMT, in 27876ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 27879ms
Starting structural reductions in LTL mode, iteration 1 : 177/234 places, 202/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28087 ms. Remains : 177/234 places, 202/258 transitions.
[2024-05-27 02:36:39] [INFO ] Flatten gal took : 8 ms
[2024-05-27 02:36:39] [INFO ] Flatten gal took : 7 ms
[2024-05-27 02:36:39] [INFO ] Input system was already deterministic with 202 transitions.
[2024-05-27 02:36:39] [INFO ] Flatten gal took : 7 ms
[2024-05-27 02:36:39] [INFO ] Flatten gal took : 7 ms
[2024-05-27 02:36:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality13728315601173273933.gal : 6 ms
[2024-05-27 02:36:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality7917983608552316127.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/CTLCardinality13728315601173273933.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7917983608552316127.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,2436,0.126524,5788,2,687,5,6383,6,0,910,8540,0


Converting to forward existential form...Done !
original formula: (AX((!(E(EF((task_s00000727_output_s00000264==1)) U (task_s00000746_input_s00000263==1))) * EX(TRUE))) + EF((AF(((task_s00000752_output_s...315
=> equivalent forward existential formula: ([(FwdU(EY((Init * !(E(TRUE U (!(EG(!(((task_s00000752_output_s00000264==0)&&(task_s00000724_output_s00000264==1...615
Reverse transition relation is NOT exact ! Due to transitions t24, t26, t27, t29, t30, t34, t35, t36, t41, t42, t46, t48, t53, t56, t57, t62, t70, t78, t12...282
(forward)formula 0,1,2.41796,70036,1,0,855,389590,438,500,5002,372362,1068
FORMULA IBM703-PT-none-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 258/258 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 231 transition count 258
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 22 place count 212 transition count 239
Iterating global reduction 1 with 19 rules applied. Total rules applied 41 place count 212 transition count 239
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 51 place count 202 transition count 229
Iterating global reduction 1 with 10 rules applied. Total rules applied 61 place count 202 transition count 229
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 193 transition count 220
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 193 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 81 place count 193 transition count 218
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 86 place count 188 transition count 213
Iterating global reduction 2 with 5 rules applied. Total rules applied 91 place count 188 transition count 213
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 96 place count 183 transition count 208
Iterating global reduction 2 with 5 rules applied. Total rules applied 101 place count 183 transition count 208
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 105 place count 179 transition count 204
Iterating global reduction 2 with 4 rules applied. Total rules applied 109 place count 179 transition count 204
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 111 place count 177 transition count 202
Iterating global reduction 2 with 2 rules applied. Total rules applied 113 place count 177 transition count 202
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 115 place count 175 transition count 200
Iterating global reduction 2 with 2 rules applied. Total rules applied 117 place count 175 transition count 200
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 174 transition count 199
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 174 transition count 199
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 120 place count 173 transition count 198
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 173 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 172 transition count 197
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 172 transition count 197
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 171 transition count 196
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 171 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 126 place count 171 transition count 195
Applied a total of 126 rules in 26 ms. Remains 171 /234 variables (removed 63) and now considering 195/258 (removed 63) transitions.
// Phase 1: matrix 195 rows 171 cols
[2024-05-27 02:36:41] [INFO ] Computed 0 invariants in 1 ms
[2024-05-27 02:36:41] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-27 02:36:41] [INFO ] Invariant cache hit.
[2024-05-27 02:36:42] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-05-27 02:36:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 195/365 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (OVERLAPS) 1/366 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 0/366 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 171 constraints, problems are : Problem set: 0 solved, 194 unsolved in 12283 ms.
Refiners :[State Equation: 171/171 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 195/365 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 194/364 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 1/366 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (OVERLAPS) 0/366 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 365 constraints, problems are : Problem set: 0 solved, 194 unsolved in 12191 ms.
Refiners :[State Equation: 171/171 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints]
After SMT, in 24501ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 24505ms
Starting structural reductions in LTL mode, iteration 1 : 171/234 places, 195/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24695 ms. Remains : 171/234 places, 195/258 transitions.
[2024-05-27 02:37:06] [INFO ] Flatten gal took : 5 ms
[2024-05-27 02:37:06] [INFO ] Flatten gal took : 5 ms
[2024-05-27 02:37:06] [INFO ] Input system was already deterministic with 195 transitions.
[2024-05-27 02:37:06] [INFO ] Flatten gal took : 5 ms
[2024-05-27 02:37:06] [INFO ] Flatten gal took : 5 ms
[2024-05-27 02:37:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality16006388120886399568.gal : 2 ms
[2024-05-27 02:37:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality2445436958907499284.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/CTLCardinality16006388120886399568.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2445436958907499284.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,2346,0.088408,5748,2,662,5,6138,6,0,879,8942,0


Converting to forward existential form...Done !
original formula: EX(AF((AG(((task_s00000728_inputCriterion_s00000257_used==0)||(merge_s00000806_activated==1))) * ((task_s00000741_output_s00000264==1)||(...203
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((!(E(TRUE U !(((task_s00000728_inputCriterion_s00000257_used==0)||(merge_s00000806_activated...266
Reverse transition relation is NOT exact ! Due to transitions t23, t25, t26, t27, t28, t31, t33, t38, t39, t43, t45, t50, t53, t54, t59, t67, t75, t84, t12...282
(forward)formula 0,0,1.96495,63500,1,0,705,362124,418,434,4826,338533,825
FORMULA IBM703-PT-none-CTLCardinality-2023-12 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 : 234/234 places, 258/258 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 231 transition count 258
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 23 place count 211 transition count 238
Iterating global reduction 1 with 20 rules applied. Total rules applied 43 place count 211 transition count 238
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 52 place count 202 transition count 229
Iterating global reduction 1 with 9 rules applied. Total rules applied 61 place count 202 transition count 229
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 69 place count 194 transition count 221
Iterating global reduction 1 with 8 rules applied. Total rules applied 77 place count 194 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 194 transition count 220
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 82 place count 190 transition count 216
Iterating global reduction 2 with 4 rules applied. Total rules applied 86 place count 190 transition count 216
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 90 place count 186 transition count 212
Iterating global reduction 2 with 4 rules applied. Total rules applied 94 place count 186 transition count 212
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 98 place count 182 transition count 208
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 182 transition count 208
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 104 place count 180 transition count 206
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 180 transition count 206
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 108 place count 178 transition count 204
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 178 transition count 204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 177 transition count 203
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 177 transition count 203
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 176 transition count 202
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 176 transition count 202
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 175 transition count 201
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 175 transition count 201
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 174 transition count 200
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 174 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 119 place count 174 transition count 199
Applied a total of 119 rules in 64 ms. Remains 174 /234 variables (removed 60) and now considering 199/258 (removed 59) transitions.
// Phase 1: matrix 199 rows 174 cols
[2024-05-27 02:37:08] [INFO ] Computed 0 invariants in 1 ms
[2024-05-27 02:37:08] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-27 02:37:08] [INFO ] Invariant cache hit.
[2024-05-27 02:37:08] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-27 02:37:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 199/372 variables, 173/173 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 1/373 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 0/373 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 174 constraints, problems are : Problem set: 0 solved, 198 unsolved in 12858 ms.
Refiners :[State Equation: 174/174 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 199/372 variables, 173/173 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 198/371 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/372 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 1/373 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 0/373 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 373/373 variables, and 372 constraints, problems are : Problem set: 0 solved, 198 unsolved in 14380 ms.
Refiners :[State Equation: 174/174 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
After SMT, in 27258ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 27261ms
Starting structural reductions in LTL mode, iteration 1 : 174/234 places, 199/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27497 ms. Remains : 174/234 places, 199/258 transitions.
[2024-05-27 02:37:36] [INFO ] Flatten gal took : 7 ms
[2024-05-27 02:37:36] [INFO ] Flatten gal took : 8 ms
[2024-05-27 02:37:36] [INFO ] Input system was already deterministic with 199 transitions.
[2024-05-27 02:37:36] [INFO ] Flatten gal took : 6 ms
[2024-05-27 02:37:36] [INFO ] Flatten gal took : 7 ms
[2024-05-27 02:37:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality5030821276620733126.gal : 3 ms
[2024-05-27 02:37:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality5041662469154340857.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/CTLCardinality5030821276620733126.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5041662469154340857.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,2382,0.12635,5772,2,720,5,6183,6,0,895,9171,0


Converting to forward existential form...Done !
original formula: (EX(AF((AF((merge_s00000462_activated==1)) + EG(((task_s00000727_input_s00000263==0)&&(decision_s00000793_activated==1)))))) * AF(((task_...239
=> equivalent forward existential formula: ([(Init * !(EX(!(EG(!((!(EG(!((merge_s00000462_activated==1)))) + EG(((task_s00000727_input_s00000263==0)&&(deci...318
Hit Full ! (commute/partial/dont) 195/0/4
(forward)formula 0,0,0.773852,22716,1,0,114,84560,19,3,3969,88250,114
FORMULA IBM703-PT-none-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-27 02:37:36] [INFO ] Flatten gal took : 6 ms
[2024-05-27 02:37:36] [INFO ] Flatten gal took : 6 ms
Total runtime 355678 ms.

BK_STOP 1716777457158

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="IBM703-PT-none"
export BK_EXAMINATION="CTLCardinality"
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 IBM703-PT-none, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r202-smll-171649588000345"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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