Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r150-smll-165276998700361.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PermAdmissibility-COL-05, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998700361
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 308K
-rw-r--r-- 1 mcc users 7.9K Apr 29 12:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 29 12:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 12:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 29 12:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 54K May 10 09:34 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 PermAdmissibility-COL-05-CTLCardinality-00
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-01
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-02
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-03
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-04
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-05
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-06
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-07
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-08
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-09
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-10
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-11
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-12
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-13
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-14
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653067228502

Running Version 202205111006
[2022-05-20 17:20:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 17:20:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 17:20:30] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-20 17:20:31] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-20 17:20:32] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1453 ms
[2022-05-20 17:20:32] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 44 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 46 ms.
[2022-05-20 17:20:32] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 11 ms.
[2022-05-20 17:20:32] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10000 steps, including 102 resets, run finished after 630 ms. (steps per millisecond=15 ) properties (out of 99) seen :38
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 61) seen :0
Running SMT prover for 61 properties.
// Phase 1: matrix 16 rows 40 cols
[2022-05-20 17:20:34] [INFO ] Computed 24 place invariants in 13 ms
[2022-05-20 17:20:34] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned sat
[2022-05-20 17:20:34] [INFO ] After 503ms SMT Verify possible using all constraints in real domain returned unsat :21 sat :0 real:40
[2022-05-20 17:20:34] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 10 ms returned sat
[2022-05-20 17:20:34] [INFO ] After 180ms SMT Verify possible using all constraints in natural domain returned unsat :61 sat :0
Fused 61 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 61 atomic propositions for a total of 16 simplifications.
FORMULA PermAdmissibility-COL-05-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-05-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-05-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-05-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 17:20:34] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2022-05-20 17:20:34] [INFO ] Flatten gal took : 29 ms
FORMULA PermAdmissibility-COL-05-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-05-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-05-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-05-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 17:20:35] [INFO ] Flatten gal took : 9 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :input
Symmetric sort wr.t. initial detected :input
Symmetric sort wr.t. initial and guards detected :input
Applying symmetric unfolding of full symmetric sort :input domain size was 8
[2022-05-20 17:20:35] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 11 ms.
[2022-05-20 17:20:35] [INFO ] Unfolded 8 HLPN properties in 1 ms.
Support contains 36 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 38 transition count 16
Applied a total of 2 rules in 8 ms. Remains 38 /40 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 38 cols
[2022-05-20 17:20:35] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-20 17:20:35] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 16 rows 38 cols
[2022-05-20 17:20:35] [INFO ] Computed 22 place invariants in 5 ms
[2022-05-20 17:20:35] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 38 cols
[2022-05-20 17:20:35] [INFO ] Computed 22 place invariants in 6 ms
[2022-05-20 17:20:35] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 38/40 places, 16/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/40 places, 16/16 transitions.
Support contains 36 out of 38 places after structural reductions.
[2022-05-20 17:20:35] [INFO ] Flatten gal took : 18 ms
[2022-05-20 17:20:35] [INFO ] Flatten gal took : 11 ms
[2022-05-20 17:20:35] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10001 steps, including 103 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 54) seen :23
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Running SMT prover for 31 properties.
// Phase 1: matrix 16 rows 38 cols
[2022-05-20 17:20:36] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 17:20:36] [INFO ] [Real]Absence check using 0 positive and 22 generalized place invariants in 8 ms returned sat
[2022-05-20 17:20:36] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :17 sat :0 real:14
[2022-05-20 17:20:36] [INFO ] [Nat]Absence check using 0 positive and 22 generalized place invariants in 6 ms returned sat
[2022-05-20 17:20:36] [INFO ] After 81ms SMT Verify possible using all constraints in natural domain returned unsat :31 sat :0
Fused 31 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 31 atomic propositions for a total of 8 simplifications.
[2022-05-20 17:20:36] [INFO ] Flatten gal took : 5 ms
[2022-05-20 17:20:36] [INFO ] Flatten gal took : 5 ms
[2022-05-20 17:20:36] [INFO ] Input system was already deterministic with 16 transitions.
Support contains 19 out of 38 places (down from 24) after GAL structural reductions.
Computed a total of 38 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 38 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 30 transition count 16
Applied a total of 8 rules in 1 ms. Remains 30 /38 variables (removed 8) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2022-05-20 17:20:36] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-20 17:20:36] [INFO ] Implicit Places using invariants in 74 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 18, 22, 23, 26]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 80 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/38 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 18/38 places, 16/16 transitions.
[2022-05-20 17:20:36] [INFO ] Flatten gal took : 3 ms
[2022-05-20 17:20:36] [INFO ] Flatten gal took : 3 ms
[2022-05-20 17:20:36] [INFO ] Input system was already deterministic with 16 transitions.
[2022-05-20 17:20:36] [INFO ] Flatten gal took : 4 ms
[2022-05-20 17:20:36] [INFO ] Flatten gal took : 3 ms
[2022-05-20 17:20:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality13941212176639765057.gal : 2 ms
[2022-05-20 17:20:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality2847498432477889494.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13941212176639765057.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2847498432477889494.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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,20349,0.028448,4768,2,379,5,2100,6,0,89,2367,0


Converting to forward existential form...Done !
original formula: EG(AX((aux7_0<=aux15_0)))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((aux7_0<=aux15_0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,0,0.213331,10164,1,0,126,29689,52,36,563,36517,134
FORMULA PermAdmissibility-COL-05-CTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 16/16 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 32 transition count 16
Applied a total of 6 rules in 2 ms. Remains 32 /38 variables (removed 6) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 32 cols
[2022-05-20 17:20:36] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-20 17:20:37] [INFO ] Implicit Places using invariants in 87 ms returned [5, 7, 12, 15, 16, 17, 23, 24, 26, 27]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 89 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/38 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 22/38 places, 16/16 transitions.
[2022-05-20 17:20:37] [INFO ] Flatten gal took : 4 ms
[2022-05-20 17:20:37] [INFO ] Flatten gal took : 3 ms
[2022-05-20 17:20:37] [INFO ] Input system was already deterministic with 16 transitions.
[2022-05-20 17:20:37] [INFO ] Flatten gal took : 4 ms
[2022-05-20 17:20:37] [INFO ] Flatten gal took : 3 ms
[2022-05-20 17:20:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality1212323226677828342.gal : 2 ms
[2022-05-20 17:20:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality5444427665257946000.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1212323226677828342.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5444427665257946000.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
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,20349,0.028918,4988,2,603,5,3245,6,0,101,2612,0


Converting to forward existential form...Done !
original formula: AF(E(E((c110_0>in2_0) U ((aux11_0<=c18_0)||(aux9_0>=10))) U ((EX((c110_0>in4_0)) * (out8_0>=1)) * (c15_0<=aux5_0))))
=> equivalent forward existential formula: [FwdG(Init,!(E(E((c110_0>in2_0) U ((aux11_0<=c18_0)||(aux9_0>=10))) U ((EX((c110_0>in4_0)) * (out8_0>=1)) * (c15...179
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 12/0/4
(forward)formula 0,1,0.600283,16388,1,0,188,70931,28,70,685,71623,157
FORMULA PermAdmissibility-COL-05-CTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 30 transition count 16
Applied a total of 8 rules in 1 ms. Remains 30 /38 variables (removed 8) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2022-05-20 17:20:37] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-20 17:20:37] [INFO ] Implicit Places using invariants in 72 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 18, 22, 23, 25, 26]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 75 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16/38 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 16/38 places, 16/16 transitions.
[2022-05-20 17:20:37] [INFO ] Flatten gal took : 3 ms
[2022-05-20 17:20:37] [INFO ] Flatten gal took : 2 ms
[2022-05-20 17:20:37] [INFO ] Input system was already deterministic with 16 transitions.
[2022-05-20 17:20:37] [INFO ] Flatten gal took : 1 ms
[2022-05-20 17:20:37] [INFO ] Flatten gal took : 1 ms
[2022-05-20 17:20:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality14563538452898959720.gal : 4 ms
[2022-05-20 17:20:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality6914035691005905169.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14563538452898959720.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6914035691005905169.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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,20349,0.010146,4892,2,92,5,1098,6,0,81,1212,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.010384,4892,1,0,6,1098,7,1,97,1212,1
FORMULA PermAdmissibility-COL-05-CTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 32 transition count 16
Applied a total of 6 rules in 1 ms. Remains 32 /38 variables (removed 6) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 32 cols
[2022-05-20 17:20:37] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-20 17:20:37] [INFO ] Implicit Places using invariants in 109 ms returned [4, 5, 7, 12, 13, 14, 16, 18, 22, 23, 25, 26]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 112 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/38 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/38 places, 16/16 transitions.
[2022-05-20 17:20:37] [INFO ] Flatten gal took : 2 ms
[2022-05-20 17:20:37] [INFO ] Flatten gal took : 2 ms
[2022-05-20 17:20:37] [INFO ] Input system was already deterministic with 16 transitions.
[2022-05-20 17:20:37] [INFO ] Flatten gal took : 2 ms
[2022-05-20 17:20:37] [INFO ] Flatten gal took : 1 ms
[2022-05-20 17:20:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality7936764638365293995.gal : 1 ms
[2022-05-20 17:20:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality10283182546035624840.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7936764638365293995.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10283182546035624840.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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,20349,0.040588,5052,2,937,5,3931,6,0,91,3771,0


Converting to forward existential form...Done !
original formula: (EG(EF((aux11_0<=out4_0))) * EX(EF((aux6_0>out3_0))))
=> equivalent forward existential formula: [(FwdU(EY((Init * EG(E(TRUE U (aux11_0<=out4_0))))),TRUE) * (aux6_0>out3_0))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,1,0.426674,12356,1,0,121,40040,55,33,659,43392,152
FORMULA PermAdmissibility-COL-05-CTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 31 transition count 16
Applied a total of 7 rules in 0 ms. Remains 31 /38 variables (removed 7) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 31 cols
[2022-05-20 17:20:38] [INFO ] Computed 15 place invariants in 3 ms
[2022-05-20 17:20:38] [INFO ] Implicit Places using invariants in 96 ms returned [4, 5, 6, 7, 13, 14, 15, 16, 22, 23, 25, 26]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 98 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/38 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 19/38 places, 16/16 transitions.
[2022-05-20 17:20:38] [INFO ] Flatten gal took : 3 ms
[2022-05-20 17:20:38] [INFO ] Flatten gal took : 2 ms
[2022-05-20 17:20:38] [INFO ] Input system was already deterministic with 16 transitions.
[2022-05-20 17:20:38] [INFO ] Flatten gal took : 2 ms
[2022-05-20 17:20:38] [INFO ] Flatten gal took : 2 ms
[2022-05-20 17:20:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality15447493304019929954.gal : 1 ms
[2022-05-20 17:20:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality8088991274428927908.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15447493304019929954.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8088991274428927908.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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,20349,0.015115,4780,2,400,5,2496,6,0,90,2090,0


Converting to forward existential form...Done !
original formula: ((AX(FALSE) * AF(((EG((in3_0<=c110_0)) + (c11_0>=33)) + (aux5_0>in3_0)))) * EX(((in3_0<=out8_0)||(c14_0>=15))))
=> equivalent forward existential formula: (([(EY(Init) * !(FALSE))] = FALSE * [FwdG(Init,!(((EG((in3_0<=c110_0)) + (c11_0>=33)) + (aux5_0>in3_0))))] = FAL...218
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.040857,5632,1,0,9,6304,10,3,465,3223,4
FORMULA PermAdmissibility-COL-05-CTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 30 transition count 16
Applied a total of 8 rules in 1 ms. Remains 30 /38 variables (removed 8) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2022-05-20 17:20:38] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-20 17:20:38] [INFO ] Implicit Places using invariants in 85 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 18, 22, 23, 25, 26]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 88 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16/38 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 16/38 places, 16/16 transitions.
[2022-05-20 17:20:38] [INFO ] Flatten gal took : 2 ms
[2022-05-20 17:20:38] [INFO ] Flatten gal took : 2 ms
[2022-05-20 17:20:38] [INFO ] Input system was already deterministic with 16 transitions.
[2022-05-20 17:20:38] [INFO ] Flatten gal took : 2 ms
[2022-05-20 17:20:38] [INFO ] Flatten gal took : 2 ms
[2022-05-20 17:20:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality7817149793745283213.gal : 1 ms
[2022-05-20 17:20:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality4717366051194185767.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7817149793745283213.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4717366051194185767.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
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,20349,0.014511,4740,2,92,5,1098,6,0,81,1212,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.014867,4740,1,0,6,1098,7,1,97,1212,1
FORMULA PermAdmissibility-COL-05-CTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 38/38 places, 16/16 transitions.
Graph (complete) has 98 edges and 38 vertex of which 32 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 9 ms. Remains 31 /38 variables (removed 7) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 31 cols
[2022-05-20 17:20:38] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-20 17:20:38] [INFO ] Implicit Places using invariants in 93 ms returned [4, 5, 6, 7, 12, 13, 14, 16, 18, 22, 23, 25, 26]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 95 ms to find 13 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 18/38 places, 16/16 transitions.
Graph (complete) has 19 edges and 18 vertex of which 17 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 16 transition count 11
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 11 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 11 place count 11 transition count 8
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 13 place count 10 transition count 8
Applied a total of 13 rules in 11 ms. Remains 10 /18 variables (removed 8) and now considering 8/16 (removed 8) transitions.
// Phase 1: matrix 8 rows 10 cols
[2022-05-20 17:20:38] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 17:20:38] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2022-05-20 17:20:38] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 17:20:38] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 10/38 places, 8/16 transitions.
Finished structural reductions, in 2 iterations. Remains : 10/38 places, 8/16 transitions.
[2022-05-20 17:20:38] [INFO ] Flatten gal took : 3 ms
[2022-05-20 17:20:38] [INFO ] Flatten gal took : 1 ms
[2022-05-20 17:20:38] [INFO ] Input system was already deterministic with 8 transitions.
[2022-05-20 17:20:38] [INFO ] Flatten gal took : 2 ms
[2022-05-20 17:20:38] [INFO ] Flatten gal took : 1 ms
[2022-05-20 17:20:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality14455218566171218133.gal : 1 ms
[2022-05-20 17:20:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality518214179140804020.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14455218566171218133.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality518214179140804020.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
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,1287,0.00875,4472,2,116,5,689,6,0,47,583,0


Converting to forward existential form...Done !
original formula: EF(AG((EF((aux6_0<=c16_0)) + (c110_0<=out6_0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((E(TRUE U (aux6_0<=c16_0)) + (c110_0<=out6_0))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.021503,5172,1,0,8,1510,15,2,275,1377,6
FORMULA PermAdmissibility-COL-05-CTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 38/38 places, 16/16 transitions.
Graph (complete) has 98 edges and 38 vertex of which 27 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 4 ms. Remains 26 /38 variables (removed 12) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 26 cols
[2022-05-20 17:20:38] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 17:20:38] [INFO ] Implicit Places using invariants in 110 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 18, 22, 24]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 112 ms to find 12 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 14/38 places, 14/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 13 transition count 3
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 2 transition count 2
Applied a total of 22 rules in 3 ms. Remains 2 /14 variables (removed 12) and now considering 2/14 (removed 12) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 17:20:38] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 17:20:38] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 17:20:38] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 17:20:38] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 2/38 places, 2/16 transitions.
Finished structural reductions, in 2 iterations. Remains : 2/38 places, 2/16 transitions.
[2022-05-20 17:20:38] [INFO ] Flatten gal took : 1 ms
[2022-05-20 17:20:38] [INFO ] Flatten gal took : 1 ms
[2022-05-20 17:20:38] [INFO ] Input system was already deterministic with 2 transitions.
[2022-05-20 17:20:39] [INFO ] Flatten gal took : 0 ms
[2022-05-20 17:20:39] [INFO ] Flatten gal took : 1 ms
[2022-05-20 17:20:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality7552022641432367838.gal : 0 ms
[2022-05-20 17:20:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality17030276466606732956.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7552022641432367838.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17030276466606732956.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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,21,0.00256,4372,2,8,5,53,6,0,11,52,0


Converting to forward existential form...Done !
original formula: AG(AF((c18_0>=2)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((c18_0>=2)))] = FALSE
Hit Full ! (commute/partial/dont) 0/0/2
(forward)formula 0,0,0.003669,4928,1,0,17,113,19,2,54,115,17
FORMULA PermAdmissibility-COL-05-CTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2022-05-20 17:20:39] [INFO ] Flatten gal took : 6 ms
[2022-05-20 17:20:39] [INFO ] Flatten gal took : 5 ms
Total runtime 8488 ms.

BK_STOP 1653067239146

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination CTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="PermAdmissibility-COL-05"
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-4028"
echo " Executing tool itstools"
echo " Input is PermAdmissibility-COL-05, 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 r150-smll-165276998700361"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-COL-05.tgz
mv PermAdmissibility-COL-05 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 ;