fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r136-tall-171631132600409
Last Updated
July 7, 2024

About the Execution of ITS-Tools for DiscoveryGPU-PT-09a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1201.415 233196.00 257135.00 458.90 TFFFTTTTTFFFTFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r136-tall-171631132600409.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is DiscoveryGPU-PT-09a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132600409
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 01:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 01:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 01:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 01:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 32K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-2024-00
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-2024-01
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-2024-02
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-2024-03
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-2024-04
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-2024-05
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-2024-06
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-2024-07
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-2024-08
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-2024-09
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-2024-10
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-2024-11
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-2023-12
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-2023-13
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-2023-14
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716375900203

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-09a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 11:05:01] [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-22 11:05:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 11:05:01] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2024-05-22 11:05:01] [INFO ] Transformed 93 places.
[2024-05-22 11:05:01] [INFO ] Transformed 127 transitions.
[2024-05-22 11:05:01] [INFO ] Found NUPN structural information;
[2024-05-22 11:05:01] [INFO ] Parsed PT model containing 93 places and 127 transitions and 408 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-09a-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 65 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 127/127 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 93 transition count 118
Applied a total of 9 rules in 17 ms. Remains 93 /93 variables (removed 0) and now considering 118/127 (removed 9) transitions.
// Phase 1: matrix 118 rows 93 cols
[2024-05-22 11:05:01] [INFO ] Computed 2 invariants in 6 ms
[2024-05-22 11:05:01] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-22 11:05:01] [INFO ] Invariant cache hit.
[2024-05-22 11:05:01] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-22 11:05:01] [INFO ] Implicit Places using invariants and state equation in 123 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 342 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/93 places, 118/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 391 ms. Remains : 92/93 places, 118/127 transitions.
Support contains 65 out of 92 places after structural reductions.
[2024-05-22 11:05:02] [INFO ] Flatten gal took : 25 ms
[2024-05-22 11:05:02] [INFO ] Flatten gal took : 10 ms
[2024-05-22 11:05:02] [INFO ] Input system was already deterministic with 118 transitions.
Support contains 63 out of 92 places (down from 65) after GAL structural reductions.
FORMULA DiscoveryGPU-PT-09a-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Reduction of identical properties reduced properties to check from 66 to 63
RANDOM walk for 40000 steps (408 resets) in 814 ms. (49 steps per ms) remains 1/63 properties
BEST_FIRST walk for 40004 steps (43 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
// Phase 1: matrix 118 rows 92 cols
[2024-05-22 11:05:02] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 11:05:02] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/3 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp19 is UNSAT
After SMT solving in domain Real declared 7/210 variables, and 8 constraints, problems are : Problem set: 1 solved, 0 unsolved in 59 ms.
Refiners :[Domain max(s): 3/92 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 3/92 constraints, ReadFeed: 1/54 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 96ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2024-05-22 11:05:02] [INFO ] Flatten gal took : 15 ms
[2024-05-22 11:05:02] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:05:02] [INFO ] Input system was already deterministic with 118 transitions.
Computed a total of 11 stabilizing places and 10 stable transitions
Graph (complete) has 218 edges and 92 vertex of which 83 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 118/118 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 87 transition count 113
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 87 transition count 113
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 83 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 83 transition count 109
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 80 transition count 106
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 80 transition count 106
Applied a total of 24 rules in 9 ms. Remains 80 /92 variables (removed 12) and now considering 106/118 (removed 12) transitions.
// Phase 1: matrix 106 rows 80 cols
[2024-05-22 11:05:02] [INFO ] Computed 1 invariants in 6 ms
[2024-05-22 11:05:02] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-22 11:05:02] [INFO ] Invariant cache hit.
[2024-05-22 11:05:02] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 11:05:02] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-05-22 11:05:02] [INFO ] Invariant cache hit.
[2024-05-22 11:05:02] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 106/186 variables, 80/81 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 50/131 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 0/186 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 131 constraints, problems are : Problem set: 0 solved, 105 unsolved in 2146 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 80/80 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 106/186 variables, 80/81 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 50/131 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 105/236 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/186 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 236 constraints, problems are : Problem set: 0 solved, 105 unsolved in 1477 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 80/80 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
After SMT, in 3646ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 3648ms
Starting structural reductions in LTL mode, iteration 1 : 80/92 places, 106/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3791 ms. Remains : 80/92 places, 106/118 transitions.
[2024-05-22 11:05:06] [INFO ] Flatten gal took : 10 ms
[2024-05-22 11:05:06] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:05:06] [INFO ] Input system was already deterministic with 106 transitions.
[2024-05-22 11:05:06] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:05:06] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:05:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality3918822897062187887.gal : 2 ms
[2024-05-22 11:05:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality1362194617756187376.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/CTLCardinality3918822897062187887.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1362194617756187376.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.67531e+09,0.37298,18264,2,5014,5,90465,6,0,413,56865,0


Converting to forward existential form...Done !
original formula: E(EX((!((AX((p27==1)) * !(((p63==0)||(p5==1))))) + AX((((p81==1)&&(p60==0)) + EG((p46==1)))))) U !(((((EF((p47==0)) * (((p40==1)||(p1==1)...299
=> equivalent forward existential formula: (([(((FwdU(Init,EX((!((!(EX(!((p27==1)))) * !(((p63==0)||(p5==1))))) + !(EX(!((((p81==1)&&(p60==0)) + EG((p46==1...1549
Reverse transition relation is NOT exact ! Due to transitions t7, t19, t30, t32, t35, t39, t86, t91, t93, t94, t95, t96, t97, t98, t99, t100, t101, t102, t...271
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,23.6031,681760,1,0,945,3.57144e+06,274,640,2619,4.8497e+06,1254
FORMULA DiscoveryGPU-PT-09a-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 118/118 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 85 transition count 111
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 85 transition count 111
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 78 transition count 104
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 78 transition count 104
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 72 transition count 98
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 72 transition count 98
Applied a total of 40 rules in 17 ms. Remains 72 /92 variables (removed 20) and now considering 98/118 (removed 20) transitions.
// Phase 1: matrix 98 rows 72 cols
[2024-05-22 11:05:30] [INFO ] Computed 1 invariants in 3 ms
[2024-05-22 11:05:30] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 11:05:30] [INFO ] Invariant cache hit.
[2024-05-22 11:05:30] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-22 11:05:30] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-22 11:05:30] [INFO ] Invariant cache hit.
[2024-05-22 11:05:30] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 98/170 variables, 72/73 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 47/120 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 0/170 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 120 constraints, problems are : Problem set: 0 solved, 97 unsolved in 1727 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 98/170 variables, 72/73 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 47/120 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 97/217 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 0/170 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 217 constraints, problems are : Problem set: 0 solved, 97 unsolved in 1200 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints]
After SMT, in 2940ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 2942ms
Starting structural reductions in LTL mode, iteration 1 : 72/92 places, 98/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3070 ms. Remains : 72/92 places, 98/118 transitions.
[2024-05-22 11:05:33] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:05:33] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:05:33] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-22 11:05:33] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:05:33] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:05:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality9794588419664565101.gal : 1 ms
[2024-05-22 11:05:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality8704266555620104452.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/CTLCardinality9794588419664565101.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8704266555620104452.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.08544e+09,0.515114,24824,2,6173,5,137510,6,0,375,78541,0


Converting to forward existential form...Done !
original formula: EF((((p27==0) * AF(!(A((p45==1) U ((p81==0)||(p3==1)))))) * EX(EG((p86==1)))))
=> equivalent forward existential formula: [FwdG(EY((FwdU(Init,TRUE) * ((p27==0) * !(EG(!(!(!((E(!(((p81==0)||(p3==1))) U (!((p45==1)) * !(((p81==0)||(p3==...219
Reverse transition relation is NOT exact ! Due to transitions t16, t19, t25, t27, t29, t32, t34, t36, t38, t87, t88, t89, t90, t91, t92, t93, t94, t95, t96...260
Detected timeout of ITS tools.
[2024-05-22 11:06:03] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:06:03] [INFO ] Applying decomposition
[2024-05-22 11:06:03] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11042732716527682113.txt' '-o' '/tmp/graph11042732716527682113.bin' '-w' '/tmp/graph11042732716527682113.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11042732716527682113.bin' '-l' '-1' '-v' '-w' '/tmp/graph11042732716527682113.weights' '-q' '0' '-e' '0.001'
[2024-05-22 11:06:03] [INFO ] Decomposing Gal with order
[2024-05-22 11:06:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 11:06:03] [INFO ] Removed a total of 48 redundant transitions.
[2024-05-22 11:06:03] [INFO ] Flatten gal took : 29 ms
[2024-05-22 11:06:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 6 ms.
[2024-05-22 11:06:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality10099205622265568840.gal : 3 ms
[2024-05-22 11:06:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality11006863721480809944.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/CTLCardinality10099205622265568840.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11006863721480809944.ctl'

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 -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.08544e+09,0.065489,6708,234,87,6638,1686,175,13811,48,7759,0


Converting to forward existential form...Done !
original formula: EF((((u6.p27==0) * AF(!(A((i6.u9.p45==1) U ((i10.u17.p81==0)||(i0.u0.p3==1)))))) * EX(EG((i10.u18.p86==1)))))
=> equivalent forward existential formula: [FwdG(EY((FwdU(Init,TRUE) * ((u6.p27==0) * !(EG(!(!(!((E(!(((i10.u17.p81==0)||(i0.u0.p3==1))) U (!((i6.u9.p45==1...278
Reverse transition relation is NOT exact ! Due to transitions t16, t25, t27, t34, t36, t38, u4.t94, i0.u0.t19, i0.u0.t92, i0.u1.t93, i2.t29, i2.u3.t32, i2....345
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,0,3.0284,101484,1,0,122185,8831,986,643800,269,136630,73139
FORMULA DiscoveryGPU-PT-09a-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 118/118 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 84 transition count 110
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 84 transition count 110
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 77 transition count 103
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 77 transition count 103
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 70 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 70 transition count 96
Applied a total of 44 rules in 14 ms. Remains 70 /92 variables (removed 22) and now considering 96/118 (removed 22) transitions.
// Phase 1: matrix 96 rows 70 cols
[2024-05-22 11:06:06] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 11:06:06] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-22 11:06:06] [INFO ] Invariant cache hit.
[2024-05-22 11:06:06] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-22 11:06:06] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2024-05-22 11:06:06] [INFO ] Invariant cache hit.
[2024-05-22 11:06:06] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 96/166 variables, 70/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 47/118 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 0/166 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 118 constraints, problems are : Problem set: 0 solved, 95 unsolved in 1554 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 96/166 variables, 70/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 47/118 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 95/213 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 0/166 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 213 constraints, problems are : Problem set: 0 solved, 95 unsolved in 1186 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints]
After SMT, in 2751ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 2752ms
Starting structural reductions in LTL mode, iteration 1 : 70/92 places, 96/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2873 ms. Remains : 70/92 places, 96/118 transitions.
[2024-05-22 11:06:09] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:06:09] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:06:09] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-22 11:06:09] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:06:09] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:06:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality17503858240791733446.gal : 1 ms
[2024-05-22 11:06:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality9246555409163860020.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/CTLCardinality17503858240791733446.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9246555409163860020.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,9.67311e+08,1.38707,51980,2,14736,5,281244,6,0,366,198776,0


Converting to forward existential form...Done !
original formula: EF((((p54!=0) * ((p6!=0) + AX((p20==1)))) * (AG(AF((p62==1))) + EG((((p7!=0)&&(p62!=1))&&(p87!=1))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * ((p54!=0) * ((p6!=0) + !(EX(!((p20==1))))))) * !(E(TRUE U !(!(EG(!((p62==1))))))))] != FAL...273
Reverse transition relation is NOT exact ! Due to transitions t22, t26, t28, t29, t31, t33, t35, t37, t77, t80, t86, t87, t88, t89, t90, t91, t92, t93, t94...260
Detected timeout of ITS tools.
[2024-05-22 11:06:39] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:06:39] [INFO ] Applying decomposition
[2024-05-22 11:06:39] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12126257071957285451.txt' '-o' '/tmp/graph12126257071957285451.bin' '-w' '/tmp/graph12126257071957285451.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12126257071957285451.bin' '-l' '-1' '-v' '-w' '/tmp/graph12126257071957285451.weights' '-q' '0' '-e' '0.001'
[2024-05-22 11:06:39] [INFO ] Decomposing Gal with order
[2024-05-22 11:06:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 11:06:39] [INFO ] Removed a total of 52 redundant transitions.
[2024-05-22 11:06:39] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:06:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 3 ms.
[2024-05-22 11:06:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality5791326420067527489.gal : 2 ms
[2024-05-22 11:06:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality11446190300900737208.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/CTLCardinality5791326420067527489.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11446190300900737208.ctl'

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 -...263
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,9.67311e+08,0.059851,6468,304,52,6980,540,164,11872,41,2669,0


Converting to forward existential form...Done !
original formula: EF((((i6.u12.p54!=0) * ((i1.u2.p6!=0) + AX((i2.u5.p20==1)))) * (AG(AF((i7.u14.p62==1))) + EG((((i1.u3.p7!=0)&&(i7.u14.p62!=1))&&(i9.u20.p...166
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * ((i6.u12.p54!=0) * ((i1.u2.p6!=0) + !(EX(!((i2.u5.p20==1))))))) * !(E(TRUE U !(!(EG(!((i7....338
Reverse transition relation is NOT exact ! Due to transitions t22, t26, t29, t31, t35, t37, t77, t80, i0.t33, i0.t28, i0.u6.t89, i0.u8.t93, i1.u0.t90, i1.u...331
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,0.612675,31548,1,0,61052,1695,954,108135,207,6661,51526
FORMULA DiscoveryGPU-PT-09a-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 118/118 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 88 transition count 114
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 88 transition count 114
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 86 transition count 112
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 86 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 85 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 85 transition count 111
Applied a total of 14 rules in 6 ms. Remains 85 /92 variables (removed 7) and now considering 111/118 (removed 7) transitions.
// Phase 1: matrix 111 rows 85 cols
[2024-05-22 11:06:40] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 11:06:40] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-22 11:06:40] [INFO ] Invariant cache hit.
[2024-05-22 11:06:40] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-22 11:06:40] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-22 11:06:40] [INFO ] Invariant cache hit.
[2024-05-22 11:06:40] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 111/196 variables, 85/86 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 52/138 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/196 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 138 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2103 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 111/196 variables, 85/86 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 52/138 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 110/248 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 248 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1569 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 3682ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 3684ms
Starting structural reductions in LTL mode, iteration 1 : 85/92 places, 111/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3825 ms. Remains : 85/92 places, 111/118 transitions.
[2024-05-22 11:06:44] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:06:44] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:06:44] [INFO ] Input system was already deterministic with 111 transitions.
[2024-05-22 11:06:44] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:06:44] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:06:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality12933789214111231476.gal : 1 ms
[2024-05-22 11:06:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality2161575337652634336.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/CTLCardinality12933789214111231476.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2161575337652634336.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,2.05355e+09,0.216664,12508,2,1579,5,53597,6,0,437,34127,0


Converting to forward existential form...Done !
original formula: (EF((((p37==1)&&(p23==1))&&(p4==0))) * A((!((((!(A((p50==0) U ((p41==0)||(p38==1)))) * A(((p59==0)||(p86==1)) U ((p54==0)||(p30==1)))) * ...409
=> equivalent forward existential formula: [(((Init * E(TRUE U (((p37==1)&&(p23==1))&&(p4==0)))) * !(EG(!(!(E(TRUE U !(EX(EG(((p61==0)||(p62==1))))))))))) ...844
Reverse transition relation is NOT exact ! Due to transitions t19, t24, t35, t37, t88, t91, t93, t97, t98, t99, t100, t101, t102, t103, t104, t105, t106, t...277
(forward)formula 0,0,10.0323,318368,1,0,1477,1.93094e+06,292,769,2647,2.02144e+06,1823
FORMULA DiscoveryGPU-PT-09a-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 118/118 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 84 transition count 110
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 84 transition count 110
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 76 transition count 102
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 76 transition count 102
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 69 transition count 95
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 69 transition count 95
Applied a total of 46 rules in 4 ms. Remains 69 /92 variables (removed 23) and now considering 95/118 (removed 23) transitions.
// Phase 1: matrix 95 rows 69 cols
[2024-05-22 11:06:54] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 11:06:54] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 11:06:54] [INFO ] Invariant cache hit.
[2024-05-22 11:06:54] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-22 11:06:54] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2024-05-22 11:06:54] [INFO ] Invariant cache hit.
[2024-05-22 11:06:54] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 95/164 variables, 69/70 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 46/116 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 0/164 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 116 constraints, problems are : Problem set: 0 solved, 94 unsolved in 1532 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 95/164 variables, 69/70 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 46/116 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 94/210 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 0/164 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 210 constraints, problems are : Problem set: 0 solved, 94 unsolved in 1147 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints]
After SMT, in 2691ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 2692ms
Starting structural reductions in LTL mode, iteration 1 : 69/92 places, 95/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2795 ms. Remains : 69/92 places, 95/118 transitions.
[2024-05-22 11:06:56] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:06:56] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:06:56] [INFO ] Input system was already deterministic with 95 transitions.
[2024-05-22 11:06:56] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:06:56] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:06:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality8763607819695059090.gal : 1 ms
[2024-05-22 11:06:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality15562747470725587652.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/CTLCardinality8763607819695059090.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15562747470725587652.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,9.09902e+08,0.279334,16416,2,3684,5,87916,6,0,361,45745,0


Converting to forward existential form...Done !
original formula: AX(EF(!(E(!(EG((p3==1))) U AX(((p76==0)||(p77==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(!(EG((p3==1))) U !(EX(!(((p76==0)||(p77==1))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t15, t18, t22, t24, t26, t28, t31, t33, t35, t37, t85, t86, t87, t88, t89, t90, t91, t92, t93...260
(forward)formula 0,1,2.85003,103304,1,0,290,591559,222,161,2210,563267,383
FORMULA DiscoveryGPU-PT-09a-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 118/118 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 85 transition count 111
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 85 transition count 111
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 78 transition count 104
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 78 transition count 104
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 72 transition count 98
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 72 transition count 98
Applied a total of 40 rules in 3 ms. Remains 72 /92 variables (removed 20) and now considering 98/118 (removed 20) transitions.
// Phase 1: matrix 98 rows 72 cols
[2024-05-22 11:06:59] [INFO ] Computed 1 invariants in 5 ms
[2024-05-22 11:06:59] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-22 11:06:59] [INFO ] Invariant cache hit.
[2024-05-22 11:06:59] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-22 11:06:59] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-22 11:06:59] [INFO ] Invariant cache hit.
[2024-05-22 11:06:59] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 98/170 variables, 72/73 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 47/120 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 0/170 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 120 constraints, problems are : Problem set: 0 solved, 97 unsolved in 1651 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 98/170 variables, 72/73 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 47/120 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 97/217 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 0/170 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 217 constraints, problems are : Problem set: 0 solved, 97 unsolved in 1267 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints]
After SMT, in 2926ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 2927ms
Starting structural reductions in LTL mode, iteration 1 : 72/92 places, 98/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3036 ms. Remains : 72/92 places, 98/118 transitions.
[2024-05-22 11:07:02] [INFO ] Flatten gal took : 10 ms
[2024-05-22 11:07:02] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:07:02] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-22 11:07:02] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:07:02] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:07:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality15543572642375688071.gal : 0 ms
[2024-05-22 11:07:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality4947372984735915684.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/CTLCardinality15543572642375688071.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4947372984735915684.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.08544e+09,0.457784,22088,2,4606,5,123976,6,0,375,67234,0


Converting to forward existential form...Done !
original formula: ((EF(AG(AF(((p64==0)||(p10==1))))) + AG(EF((p33==1)))) + ((AX((p41==1)) * !(A(((p59==0)||(p19==1)) U (p80==1)))) * AF((p48==1))))
=> equivalent forward existential formula: (([(EY((Init * !((E(TRUE U !(E(TRUE U !(!(EG(!(((p64==0)||(p10==1))))))))) + !(E(TRUE U !(E(TRUE U (p33==1))))))...529
Reverse transition relation is NOT exact ! Due to transitions t12, t19, t23, t25, t29, t30, t32, t36, t38, t87, t88, t89, t90, t91, t92, t93, t94, t95, t96...260
(forward)formula 0,1,14.793,468088,1,0,698,2.87206e+06,245,359,2292,3.10023e+06,864
FORMULA DiscoveryGPU-PT-09a-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 118/118 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 85 transition count 111
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 85 transition count 111
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 80 transition count 106
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 80 transition count 106
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 75 transition count 101
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 75 transition count 101
Applied a total of 34 rules in 10 ms. Remains 75 /92 variables (removed 17) and now considering 101/118 (removed 17) transitions.
// Phase 1: matrix 101 rows 75 cols
[2024-05-22 11:07:17] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 11:07:17] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 11:07:17] [INFO ] Invariant cache hit.
[2024-05-22 11:07:17] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-22 11:07:17] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-05-22 11:07:17] [INFO ] Invariant cache hit.
[2024-05-22 11:07:17] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 101/176 variables, 75/76 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 49/125 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 0/176 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 125 constraints, problems are : Problem set: 0 solved, 100 unsolved in 1742 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 101/176 variables, 75/76 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 49/125 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 100/225 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/176 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/176 variables, and 225 constraints, problems are : Problem set: 0 solved, 100 unsolved in 1284 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 3037ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 3038ms
Starting structural reductions in LTL mode, iteration 1 : 75/92 places, 101/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3152 ms. Remains : 75/92 places, 101/118 transitions.
[2024-05-22 11:07:20] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:07:20] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:07:20] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-22 11:07:20] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:07:20] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:07:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality5665896399386686521.gal : 1 ms
[2024-05-22 11:07:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality12390437957125015479.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/CTLCardinality5665896399386686521.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12390437957125015479.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.30888e+09,0.386068,18544,2,4758,5,97028,6,0,390,58073,0


Converting to forward existential form...Done !
original formula: (E((AG((p87!=1)) * (p35==0)) U EX(AG(((p39==0)||(p7==1))))) + (AG(EF((((p65==0)&&(p12==1)) + AX((p18==0))))) * AF((EX(!(A(((p64==0)||(p11...209
=> equivalent forward existential formula: ([(FwdU((Init * !(E((!(E(TRUE U !((p87!=1)))) * (p35==0)) U EX(!(E(TRUE U !(((p39==0)||(p7==1))))))))),TRUE) * !...487
Reverse transition relation is NOT exact ! Due to transitions t24, t28, t30, t31, t35, t39, t79, t82, t87, t90, t91, t92, t93, t94, t95, t96, t97, t98, t99...262
Using saturation style SCC detection
(forward)formula 0,1,5.33589,166320,1,0,347,884257,256,204,2495,975984,471
FORMULA DiscoveryGPU-PT-09a-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 118/118 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 84 transition count 110
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 84 transition count 110
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 77 transition count 103
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 77 transition count 103
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 71 transition count 97
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 71 transition count 97
Applied a total of 42 rules in 7 ms. Remains 71 /92 variables (removed 21) and now considering 97/118 (removed 21) transitions.
// Phase 1: matrix 97 rows 71 cols
[2024-05-22 11:07:26] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 11:07:26] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-22 11:07:26] [INFO ] Invariant cache hit.
[2024-05-22 11:07:26] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-22 11:07:26] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-22 11:07:26] [INFO ] Invariant cache hit.
[2024-05-22 11:07:26] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 97/168 variables, 71/72 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 47/119 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/168 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 119 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1557 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 97/168 variables, 71/72 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 47/119 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 96/215 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/168 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 215 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1207 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 2776ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 2778ms
Starting structural reductions in LTL mode, iteration 1 : 71/92 places, 97/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2881 ms. Remains : 71/92 places, 97/118 transitions.
[2024-05-22 11:07:29] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:07:29] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:07:29] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-22 11:07:29] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:07:29] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:07:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality17707562275093662306.gal : 1 ms
[2024-05-22 11:07:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality17604562422088966770.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/CTLCardinality17707562275093662306.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17604562422088966770.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.0488e+09,0.770326,32172,2,8249,5,190465,6,0,371,108582,0


Converting to forward existential form...Done !
original formula: EX((AG((p63==0)) * ((EX((p24==0)) + (p12==0)) + (p16==1))))
=> equivalent forward existential formula: (([(EY((EY(Init) * !(E(TRUE U !((p63==0)))))) * (p24==0))] != FALSE + [((EY(Init) * !(E(TRUE U !((p63==0))))) * ...240
Reverse transition relation is NOT exact ! Due to transitions t5, t19, t23, t27, t29, t30, t34, t36, t38, t80, t82, t87, t88, t89, t90, t91, t92, t93, t94,...264
(forward)formula 0,0,4.53361,145716,1,0,147,776737,219,91,2231,789044,208
FORMULA DiscoveryGPU-PT-09a-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 92/92 places, 118/118 transitions.
Graph (complete) has 218 edges and 92 vertex of which 83 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 90 edges and 81 vertex of which 63 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Graph (trivial) has 64 edges and 63 vertex of which 30 / 63 are part of one of the 15 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 48 transition count 82
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 36 place count 40 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 39 transition count 66
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 44 place count 32 transition count 52
Iterating global reduction 3 with 7 rules applied. Total rules applied 51 place count 32 transition count 52
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 58 place count 25 transition count 38
Iterating global reduction 3 with 7 rules applied. Total rules applied 65 place count 25 transition count 38
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 71 place count 19 transition count 26
Iterating global reduction 3 with 6 rules applied. Total rules applied 77 place count 19 transition count 26
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 83 place count 13 transition count 20
Iterating global reduction 3 with 6 rules applied. Total rules applied 89 place count 13 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 13 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 92 place count 12 transition count 18
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 12 transition count 18
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 94 place count 11 transition count 17
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 11 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 97 place count 9 transition count 15
Applied a total of 97 rules in 31 ms. Remains 9 /92 variables (removed 83) and now considering 15/118 (removed 103) transitions.
[2024-05-22 11:07:33] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
// Phase 1: matrix 14 rows 9 cols
[2024-05-22 11:07:33] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 11:07:33] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-22 11:07:33] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2024-05-22 11:07:33] [INFO ] Invariant cache hit.
[2024-05-22 11:07:33] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2024-05-22 11:07:33] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2024-05-22 11:07:33] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2024-05-22 11:07:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 13/19 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 3/22 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/23 variables, and 9 constraints, problems are : Problem set: 0 solved, 11 unsolved in 60 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 13/19 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 3/22 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/23 variables, and 20 constraints, problems are : Problem set: 0 solved, 11 unsolved in 61 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 124ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 124ms
Starting structural reductions in SI_CTL mode, iteration 1 : 9/92 places, 15/118 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 190 ms. Remains : 9/92 places, 15/118 transitions.
[2024-05-22 11:07:34] [INFO ] Flatten gal took : 1 ms
[2024-05-22 11:07:34] [INFO ] Flatten gal took : 1 ms
[2024-05-22 11:07:34] [INFO ] Input system was already deterministic with 15 transitions.
[2024-05-22 11:07:34] [INFO ] Flatten gal took : 1 ms
[2024-05-22 11:07:34] [INFO ] Flatten gal took : 0 ms
[2024-05-22 11:07:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality15010358612231429655.gal : 0 ms
[2024-05-22 11:07:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality12941415570602364580.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/CTLCardinality15010358612231429655.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12941415570602364580.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,696,0.002548,3376,2,23,5,228,6,0,48,250,0


Converting to forward existential form...Done !
original formula: !(E(AG(!(((p88==1)||(p9==0)))) U EF((p4==1))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,!(E(TRUE U !(!(((p88==1)||(p9==0))))))),TRUE) * (p4==1))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t11, t13, Intersection with reachable at each step enabled. (destroyed/reverse/inter...177
(forward)formula 0,0,0.006059,3696,1,0,33,732,55,17,275,774,44
FORMULA DiscoveryGPU-PT-09a-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 118/118 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 84 transition count 110
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 84 transition count 110
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 77 transition count 103
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 77 transition count 103
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 71 transition count 97
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 71 transition count 97
Applied a total of 42 rules in 3 ms. Remains 71 /92 variables (removed 21) and now considering 97/118 (removed 21) transitions.
// Phase 1: matrix 97 rows 71 cols
[2024-05-22 11:07:34] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 11:07:34] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-22 11:07:34] [INFO ] Invariant cache hit.
[2024-05-22 11:07:34] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-22 11:07:34] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-22 11:07:34] [INFO ] Invariant cache hit.
[2024-05-22 11:07:34] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 97/168 variables, 71/72 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 47/119 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/168 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 119 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1496 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 97/168 variables, 71/72 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 47/119 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 96/215 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/168 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 215 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1183 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 2690ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 2691ms
Starting structural reductions in LTL mode, iteration 1 : 71/92 places, 97/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2785 ms. Remains : 71/92 places, 97/118 transitions.
[2024-05-22 11:07:36] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:07:36] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:07:36] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-22 11:07:36] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:07:36] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:07:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality12409541453275767210.gal : 1 ms
[2024-05-22 11:07:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality2873108979479014577.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/CTLCardinality12409541453275767210.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2873108979479014577.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.0488e+09,1.04115,40576,2,10900,5,223158,6,0,371,152678,0


Converting to forward existential form...Done !
original formula: EG(EX((EX(((p38==1) * EX((p63==1)))) + AG(EF((p72==0))))))
=> equivalent forward existential formula: [FwdG(Init,EX((EX(((p38==1) * EX((p63==1)))) + !(E(TRUE U !(E(TRUE U (p72==0))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t19, t23, t27, t29, t30, t32, t34, t36, t80, t85, t87, t88, t89, t90, t91, t92, t93, t94,...264
(forward)formula 0,1,26.2602,704248,1,0,354,3.43898e+06,223,266,2273,4.69527e+06,391
FORMULA DiscoveryGPU-PT-09a-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 118/118 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 85 transition count 111
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 85 transition count 111
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 78 transition count 104
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 78 transition count 104
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 71 transition count 97
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 71 transition count 97
Applied a total of 42 rules in 9 ms. Remains 71 /92 variables (removed 21) and now considering 97/118 (removed 21) transitions.
// Phase 1: matrix 97 rows 71 cols
[2024-05-22 11:08:03] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 11:08:03] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 11:08:03] [INFO ] Invariant cache hit.
[2024-05-22 11:08:03] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-22 11:08:03] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-22 11:08:03] [INFO ] Invariant cache hit.
[2024-05-22 11:08:03] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 97/168 variables, 71/72 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 47/119 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/168 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 119 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1577 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 97/168 variables, 71/72 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 47/119 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 96/215 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/168 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 215 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1216 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 2805ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 2807ms
Starting structural reductions in LTL mode, iteration 1 : 71/92 places, 97/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2919 ms. Remains : 71/92 places, 97/118 transitions.
[2024-05-22 11:08:06] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:08:06] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:08:06] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-22 11:08:06] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:08:06] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:08:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality17068134248283049982.gal : 1 ms
[2024-05-22 11:08:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality1442791883067442127.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/CTLCardinality17068134248283049982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1442791883067442127.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.0006e+09,0.711383,30892,2,7970,5,177774,6,0,370,104250,0


Converting to forward existential form...Done !
original formula: EX(E(AG((EG((p21==0)) * ((p84==0)||(p58==1)))) U (p89==1)))
=> equivalent forward existential formula: [(FwdU(EY(Init),!(E(TRUE U !((EG((p21==0)) * ((p84==0)||(p58==1))))))) * (p89==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t22, t24, t26, t29, t31, t33, t35, t37, t86, t87, t88, t89, t90, t91, t92, t93, t94, t95, t96...255
(forward)formula 0,0,26.3944,789100,1,0,533,4.62272e+06,227,291,2265,5.20097e+06,658
FORMULA DiscoveryGPU-PT-09a-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 118/118 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 85 transition count 111
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 85 transition count 111
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 78 transition count 104
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 78 transition count 104
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 71 transition count 97
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 71 transition count 97
Applied a total of 42 rules in 7 ms. Remains 71 /92 variables (removed 21) and now considering 97/118 (removed 21) transitions.
// Phase 1: matrix 97 rows 71 cols
[2024-05-22 11:08:32] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 11:08:32] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 11:08:32] [INFO ] Invariant cache hit.
[2024-05-22 11:08:32] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-22 11:08:32] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-22 11:08:32] [INFO ] Invariant cache hit.
[2024-05-22 11:08:32] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 97/168 variables, 71/72 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 47/119 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/168 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 119 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1582 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 97/168 variables, 71/72 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 47/119 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 96/215 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/168 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 215 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1176 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 2772ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 2777ms
Starting structural reductions in LTL mode, iteration 1 : 71/92 places, 97/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2882 ms. Remains : 71/92 places, 97/118 transitions.
[2024-05-22 11:08:35] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:08:35] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:08:35] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-22 11:08:35] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:08:35] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:08:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality15394177190388747185.gal : 1 ms
[2024-05-22 11:08:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality15200498409428013242.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/CTLCardinality15394177190388747185.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15200498409428013242.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.0006e+09,0.44536,21084,2,5006,5,118365,6,0,370,63008,0


Converting to forward existential form...Done !
original formula: EX(AG(AF(EG((p51==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(EG(!(EG((p51==0)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t22, t24, t26, t28, t29, t31, t33, t37, t86, t87, t88, t89, t90, t91, t92, t93, t94, t95, t96...255
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,14.0885,445636,1,0,669,2.58336e+06,227,374,2352,3.01484e+06,794
FORMULA DiscoveryGPU-PT-09a-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 118/118 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 84 transition count 110
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 84 transition count 110
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 76 transition count 102
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 76 transition count 102
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 68 transition count 94
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 68 transition count 94
Applied a total of 48 rules in 6 ms. Remains 68 /92 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 68 cols
[2024-05-22 11:08:49] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 11:08:49] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 11:08:50] [INFO ] Invariant cache hit.
[2024-05-22 11:08:50] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-22 11:08:50] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2024-05-22 11:08:50] [INFO ] Invariant cache hit.
[2024-05-22 11:08:50] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 94/162 variables, 68/69 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 46/115 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 0/162 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 115 constraints, problems are : Problem set: 0 solved, 93 unsolved in 1486 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 94/162 variables, 68/69 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 46/115 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 93/208 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 0/162 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 208 constraints, problems are : Problem set: 0 solved, 93 unsolved in 1158 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints]
After SMT, in 2653ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 2655ms
Starting structural reductions in LTL mode, iteration 1 : 68/92 places, 94/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2755 ms. Remains : 68/92 places, 94/118 transitions.
[2024-05-22 11:08:52] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:08:52] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:08:52] [INFO ] Input system was already deterministic with 94 transitions.
[2024-05-22 11:08:52] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:08:52] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:08:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality13265307726303417491.gal : 0 ms
[2024-05-22 11:08:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality4693587363319683642.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/CTLCardinality13265307726303417491.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4693587363319683642.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,8.35715e+08,0.458868,21780,2,5324,5,123961,6,0,356,67148,0


Converting to forward existential form...Done !
original formula: EX((p58==0))
=> equivalent forward existential formula: [(EY(Init) * (p58==0))] != FALSE
(forward)formula 0,1,0.460809,21780,1,0,8,123961,8,1,479,67148,2
FORMULA DiscoveryGPU-PT-09a-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-22 11:08:53] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:08:53] [INFO ] Flatten gal took : 3 ms
Total runtime 231944 ms.

BK_STOP 1716376133399

--------------------
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="DiscoveryGPU-PT-09a"
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 DiscoveryGPU-PT-09a, 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 r136-tall-171631132600409"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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