Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r121-tall-162075407000441.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is JoinFreeModules-PT-0200, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075407000441
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 111K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 26 06:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 26 06:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 24 10:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 24 10:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.2M May 5 16:51 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 JoinFreeModules-PT-0200-CTLCardinality-00
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-01
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-02
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-03
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-04
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-05
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-06
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-07
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-08
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-09
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-10
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-11
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-12
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-13
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-14
FORMULA_NAME JoinFreeModules-PT-0200-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1620845310035

Running Version 0
[2021-05-12 18:48:31] [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]
[2021-05-12 18:48:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 18:48:32] [INFO ] Load time of PNML (sax parser for PT used): 208 ms
[2021-05-12 18:48:32] [INFO ] Transformed 1001 places.
[2021-05-12 18:48:32] [INFO ] Transformed 1601 transitions.
[2021-05-12 18:48:32] [INFO ] Parsed PT model containing 1001 places and 1601 transitions in 276 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 41 ms.
Reduce places removed 1 places and 0 transitions.
Support contains 493 out of 1000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 62 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:48:32] [INFO ] Computed 200 place invariants in 30 ms
[2021-05-12 18:48:33] [INFO ] Dead Transitions using invariants and state equation in 1025 ms returned []
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:48:33] [INFO ] Computed 200 place invariants in 6 ms
[2021-05-12 18:48:33] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:48:33] [INFO ] Computed 200 place invariants in 6 ms
[2021-05-12 18:48:34] [INFO ] Implicit Places using invariants and state equation in 672 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:48:34] [INFO ] Computed 200 place invariants in 5 ms
[2021-05-12 18:48:35] [INFO ] Dead Transitions using invariants and state equation in 671 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 1601/1601 transitions.
[2021-05-12 18:48:35] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-12 18:48:35] [INFO ] Flatten gal took : 127 ms
FORMULA JoinFreeModules-PT-0200-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 18:48:35] [INFO ] Flatten gal took : 78 ms
[2021-05-12 18:48:35] [INFO ] Input system was already deterministic with 1601 transitions.
Incomplete random walk after 100006 steps, including 2 resets, run finished after 1119 ms. (steps per millisecond=89 ) properties (out of 61) seen :50
Running SMT prover for 11 properties.
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:48:36] [INFO ] Computed 200 place invariants in 4 ms
[2021-05-12 18:48:37] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2021-05-12 18:48:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:48:37] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2021-05-12 18:48:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:48:37] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2021-05-12 18:48:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:48:39] [INFO ] [Nat]Absence check using state equation in 1380 ms returned sat
[2021-05-12 18:48:39] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 6 ms to minimize.
[2021-05-12 18:48:39] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2021-05-12 18:48:39] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 0 ms to minimize.
[2021-05-12 18:48:39] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2021-05-12 18:48:39] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2021-05-12 18:48:39] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2021-05-12 18:48:39] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2021-05-12 18:48:39] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 18:48:40] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 18:48:40] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 1 ms to minimize.
[2021-05-12 18:48:40] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 1 ms to minimize.
[2021-05-12 18:48:40] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2021-05-12 18:48:40] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1211 ms
[2021-05-12 18:48:40] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 83 ms.
[2021-05-12 18:48:57] [INFO ] Deduced a trap composed of 3 places in 416 ms of which 1 ms to minimize.
[2021-05-12 18:48:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-12 18:48:58] [INFO ] [Real]Absence check using 200 positive place invariants in 39 ms returned sat
[2021-05-12 18:48:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:48:58] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2021-05-12 18:48:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:48:58] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2021-05-12 18:48:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:49:00] [INFO ] [Nat]Absence check using state equation in 1827 ms returned sat
[2021-05-12 18:49:00] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2021-05-12 18:49:00] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2021-05-12 18:49:00] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2021-05-12 18:49:00] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2021-05-12 18:49:00] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2021-05-12 18:49:00] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2021-05-12 18:49:00] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2021-05-12 18:49:01] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 18:49:01] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2021-05-12 18:49:01] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2021-05-12 18:49:01] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 18:49:01] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 18:49:01] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 881 ms
[2021-05-12 18:49:01] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 74 ms.
[2021-05-12 18:49:14] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2021-05-12 18:49:15] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2021-05-12 18:49:15] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2021-05-12 18:49:15] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2021-05-12 18:49:15] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2021-05-12 18:49:15] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2021-05-12 18:49:15] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 18:49:15] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 18:49:15] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2021-05-12 18:49:16] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 4 ms to minimize.
[2021-05-12 18:49:16] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2021-05-12 18:49:16] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 18:49:16] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 18:49:16] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1704 ms
[2021-05-12 18:49:16] [INFO ] Added : 670 causal constraints over 136 iterations in 15351 ms. Result :sat
[2021-05-12 18:49:16] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2021-05-12 18:49:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:49:17] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2021-05-12 18:49:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:49:17] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2021-05-12 18:49:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:49:18] [INFO ] [Nat]Absence check using state equation in 1397 ms returned sat
[2021-05-12 18:49:18] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2021-05-12 18:49:18] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2021-05-12 18:49:18] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 18:49:19] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 18:49:19] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 18:49:19] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 18:49:19] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2021-05-12 18:49:19] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 18:49:19] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 18:49:19] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 621 ms
[2021-05-12 18:49:19] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 76 ms.
[2021-05-12 18:49:33] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2021-05-12 18:49:34] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2021-05-12 18:49:34] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2021-05-12 18:49:34] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2021-05-12 18:49:34] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2021-05-12 18:49:34] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2021-05-12 18:49:34] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2021-05-12 18:49:34] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2021-05-12 18:49:34] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2021-05-12 18:49:34] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 18:49:35] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2021-05-12 18:49:35] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 18:49:35] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 1 ms to minimize.
[2021-05-12 18:49:35] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2021-05-12 18:49:35] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2021-05-12 18:49:35] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 1 ms to minimize.
[2021-05-12 18:49:35] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 18:49:35] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 18:49:35] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 18:49:36] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2131 ms
[2021-05-12 18:49:36] [INFO ] Added : 684 causal constraints over 137 iterations in 16726 ms. Result :sat
[2021-05-12 18:49:36] [INFO ] [Real]Absence check using 200 positive place invariants in 31 ms returned sat
[2021-05-12 18:49:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:49:36] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2021-05-12 18:49:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:49:36] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2021-05-12 18:49:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:49:39] [INFO ] [Nat]Absence check using state equation in 2863 ms returned sat
[2021-05-12 18:49:39] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2021-05-12 18:49:39] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 2 ms to minimize.
[2021-05-12 18:49:39] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2021-05-12 18:49:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 7 ms to minimize.
[2021-05-12 18:49:40] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 18:49:40] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 18:49:40] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 18:49:40] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 577 ms
[2021-05-12 18:49:40] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 70 ms.
[2021-05-12 18:49:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2021-05-12 18:49:56] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2021-05-12 18:49:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:49:57] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2021-05-12 18:49:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:49:57] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2021-05-12 18:49:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:49:58] [INFO ] [Nat]Absence check using state equation in 1393 ms returned sat
[2021-05-12 18:49:58] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2021-05-12 18:49:58] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2021-05-12 18:49:58] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2021-05-12 18:49:58] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2021-05-12 18:49:58] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 18:49:59] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 18:49:59] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2021-05-12 18:49:59] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 18:49:59] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 1 ms to minimize.
[2021-05-12 18:49:59] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2021-05-12 18:49:59] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 18:49:59] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 697 ms
[2021-05-12 18:49:59] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 71 ms.
[2021-05-12 18:50:12] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 18:50:12] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 18:50:12] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 18:50:13] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 18:50:13] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2021-05-12 18:50:13] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 1 ms to minimize.
[2021-05-12 18:50:13] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 18:50:13] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2021-05-12 18:50:13] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 18:50:13] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 956 ms
[2021-05-12 18:50:13] [INFO ] Added : 682 causal constraints over 138 iterations in 14359 ms. Result :sat
[2021-05-12 18:50:13] [INFO ] [Real]Absence check using 200 positive place invariants in 31 ms returned sat
[2021-05-12 18:50:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:50:14] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2021-05-12 18:50:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:50:14] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2021-05-12 18:50:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:50:16] [INFO ] [Nat]Absence check using state equation in 2044 ms returned sat
[2021-05-12 18:50:16] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 18:50:16] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 18:50:16] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 18:50:16] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 1 ms to minimize.
[2021-05-12 18:50:16] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2021-05-12 18:50:16] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 18:50:16] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 18:50:16] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 471 ms
[2021-05-12 18:50:16] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 69 ms.
[2021-05-12 18:50:34] [INFO ] Added : 655 causal constraints over 131 iterations in 17369 ms. Result :unknown
[2021-05-12 18:50:34] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2021-05-12 18:50:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:50:34] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2021-05-12 18:50:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:50:34] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2021-05-12 18:50:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:50:36] [INFO ] [Nat]Absence check using state equation in 1477 ms returned sat
[2021-05-12 18:50:36] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2021-05-12 18:50:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2021-05-12 18:50:36] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 18:50:36] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 18:50:36] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 18:50:36] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 18:50:36] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 18:50:36] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 18:50:36] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2021-05-12 18:50:36] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 1 ms to minimize.
[2021-05-12 18:50:37] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2021-05-12 18:50:37] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 18:50:37] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 724 ms
[2021-05-12 18:50:37] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 75 ms.
[2021-05-12 18:50:54] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2021-05-12 18:50:54] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2021-05-12 18:50:54] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2021-05-12 18:50:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
[2021-05-12 18:50:54] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2021-05-12 18:50:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:50:55] [INFO ] [Real]Absence check using state equation in 365 ms returned sat
[2021-05-12 18:50:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:50:55] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2021-05-12 18:50:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:50:56] [INFO ] [Nat]Absence check using state equation in 1250 ms returned sat
[2021-05-12 18:50:56] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2021-05-12 18:50:56] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2021-05-12 18:50:56] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2021-05-12 18:50:57] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2021-05-12 18:50:57] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2021-05-12 18:50:57] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 18:50:57] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 18:50:57] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 18:50:57] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 18:50:57] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 18:50:57] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 18:50:57] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2021-05-12 18:50:57] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 18:50:57] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 18:50:57] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 18:50:57] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 957 ms
[2021-05-12 18:50:57] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 72 ms.
[2021-05-12 18:51:10] [INFO ] Added : 280 causal constraints over 56 iterations in 13162 ms. Result :sat
[2021-05-12 18:51:11] [INFO ] [Real]Absence check using 200 positive place invariants in 35 ms returned sat
[2021-05-12 18:51:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:51:11] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2021-05-12 18:51:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:51:11] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2021-05-12 18:51:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:51:13] [INFO ] [Nat]Absence check using state equation in 1583 ms returned sat
[2021-05-12 18:51:13] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2021-05-12 18:51:13] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2021-05-12 18:51:13] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2021-05-12 18:51:13] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 18:51:13] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 1 ms to minimize.
[2021-05-12 18:51:13] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 18:51:13] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 18:51:13] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2021-05-12 18:51:13] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2021-05-12 18:51:13] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 18:51:13] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2021-05-12 18:51:13] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2021-05-12 18:51:14] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 885 ms
[2021-05-12 18:51:14] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 73 ms.
[2021-05-12 18:51:29] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2021-05-12 18:51:29] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2021-05-12 18:51:29] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2021-05-12 18:51:29] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2021-05-12 18:51:29] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2021-05-12 18:51:30] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2021-05-12 18:51:30] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2021-05-12 18:51:30] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2021-05-12 18:51:30] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2021-05-12 18:51:30] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 18:51:30] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 18:51:30] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 18:51:31] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 18:51:31] [INFO ] Deduced a trap composed of 3 places in 403 ms of which 1 ms to minimize.
[2021-05-12 18:51:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
[2021-05-12 18:51:31] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2021-05-12 18:51:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:51:32] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2021-05-12 18:51:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:51:32] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2021-05-12 18:51:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:51:33] [INFO ] [Nat]Absence check using state equation in 1422 ms returned sat
[2021-05-12 18:51:33] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2021-05-12 18:51:34] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2021-05-12 18:51:34] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 18:51:34] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 1 ms to minimize.
[2021-05-12 18:51:34] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 18:51:34] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2021-05-12 18:51:34] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2021-05-12 18:51:34] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 18:51:34] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 508 ms
[2021-05-12 18:51:34] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 74 ms.
[2021-05-12 18:51:50] [INFO ] Added : 525 causal constraints over 105 iterations in 16184 ms. Result :unknown
[2021-05-12 18:51:50] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2021-05-12 18:51:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:51:51] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2021-05-12 18:51:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:51:51] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2021-05-12 18:51:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:51:52] [INFO ] [Nat]Absence check using state equation in 1659 ms returned sat
[2021-05-12 18:51:52] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 18:51:53] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 18:51:53] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 18:51:53] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 18:51:53] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 18:51:53] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2021-05-12 18:51:53] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 18:51:53] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 18:51:53] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 1 ms to minimize.
[2021-05-12 18:51:53] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 696 ms
[2021-05-12 18:51:53] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 71 ms.
[2021-05-12 18:52:11] [INFO ] Added : 575 causal constraints over 115 iterations in 17527 ms. Result :unknown
Applied a total of 0 rules in 122 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
[2021-05-12 18:52:11] [INFO ] Flatten gal took : 60 ms
[2021-05-12 18:52:11] [INFO ] Flatten gal took : 53 ms
[2021-05-12 18:52:11] [INFO ] Input system was already deterministic with 1601 transitions.
[2021-05-12 18:52:11] [INFO ] Flatten gal took : 47 ms
[2021-05-12 18:52:11] [INFO ] Flatten gal took : 43 ms
[2021-05-12 18:52:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality5857865210381656118.gal : 24 ms
[2021-05-12 18:52:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality15477090305644648418.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLCardinality5857865210381656118.gal, -t, CGAL, -ctl, /tmp/CTLCardinality15477090305644648418.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLCardinality5857865210381656118.gal -t CGAL -ctl /tmp/CTLCardinality15477090305644648418.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-12 18:52:41] [INFO ] Flatten gal took : 43 ms
[2021-05-12 18:52:41] [INFO ] Applying decomposition
[2021-05-12 18:52:41] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14191770643766538441.txt, -o, /tmp/graph14191770643766538441.bin, -w, /tmp/graph14191770643766538441.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14191770643766538441.bin, -l, -1, -v, -w, /tmp/graph14191770643766538441.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 18:52:42] [INFO ] Decomposing Gal with order
[2021-05-12 18:52:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 18:52:42] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-12 18:52:42] [INFO ] Flatten gal took : 96 ms
[2021-05-12 18:52:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 27 ms.
[2021-05-12 18:52:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality858957177237769710.gal : 17 ms
[2021-05-12 18:52:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality2874897915515887574.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLCardinality858957177237769710.gal, -t, CGAL, -ctl, /tmp/CTLCardinality2874897915515887574.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLCardinality858957177237769710.gal -t CGAL -ctl /tmp/CTLCardinality2874897915515887574.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-12 18:53:12] [INFO ] Flatten gal took : 39 ms
[2021-05-12 18:53:12] [INFO ] Flatten gal took : 40 ms
[2021-05-12 18:53:12] [INFO ] Applying decomposition
[2021-05-12 18:53:12] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12805775769955376922.txt, -o, /tmp/graph12805775769955376922.bin, -w, /tmp/graph12805775769955376922.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12805775769955376922.bin, -l, -1, -v, -w, /tmp/graph12805775769955376922.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 18:53:12] [INFO ] Decomposing Gal with order
[2021-05-12 18:53:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 18:53:12] [INFO ] Removed a total of 26 redundant transitions.
[2021-05-12 18:53:12] [INFO ] Flatten gal took : 123 ms
[2021-05-12 18:53:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 22 ms.
[2021-05-12 18:53:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality10752021961003375972.gal : 15 ms
[2021-05-12 18:53:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality7775344449894499167.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLCardinality10752021961003375972.gal, -t, CGAL, -ctl, /tmp/CTLCardinality7775344449894499167.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLCardinality10752021961003375972.gal -t CGAL -ctl /tmp/CTLCardinality7775344449894499167.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
Detected timeout of ITS tools.
[2021-05-12 19:14:46] [INFO ] Flatten gal took : 39 ms
[2021-05-12 19:14:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality15220263038324815635.gal : 4 ms
[2021-05-12 19:14:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality15650467219672547512.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLCardinality15220263038324815635.gal, -t, CGAL, -ctl, /tmp/CTLCardinality15650467219672547512.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLCardinality15220263038324815635.gal -t CGAL -ctl /tmp/CTLCardinality15650467219672547512.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
Detected timeout of ITS tools.
[2021-05-12 19:36:19] [INFO ] Flatten gal took : 37 ms
[2021-05-12 19:36:19] [INFO ] Input system was already deterministic with 1601 transitions.
[2021-05-12 19:36:19] [INFO ] Transformed 1000 places.
[2021-05-12 19:36:19] [INFO ] Transformed 1601 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-12 19:36:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality13096138978097906515.gal : 4 ms
[2021-05-12 19:36:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality6278469317011968648.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLCardinality13096138978097906515.gal, -t, CGAL, -ctl, /tmp/CTLCardinality6278469317011968648.ctl, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLCardinality13096138978097906515.gal -t CGAL -ctl /tmp/CTLCardinality6278469317011968648.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="JoinFreeModules-PT-0200"
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 JoinFreeModules-PT-0200, 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 r121-tall-162075407000441"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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