fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r292-tall-162124155800020
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for CANConstruction-PT-020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1033.880 103836.00 140018.00 506.90 FTFTFFTFTTFFTFFF normal

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.r292-tall-162124155800020.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 CANConstruction-PT-020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124155800020
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 22K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 118K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 12 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 12 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 12 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 4.6K May 11 18:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 11 18:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 11 15:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 11 15:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 12 04:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 12 04:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 4 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 2.0M May 12 08:13 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 CANConstruction-PT-020-00
FORMULA_NAME CANConstruction-PT-020-01
FORMULA_NAME CANConstruction-PT-020-02
FORMULA_NAME CANConstruction-PT-020-03
FORMULA_NAME CANConstruction-PT-020-04
FORMULA_NAME CANConstruction-PT-020-05
FORMULA_NAME CANConstruction-PT-020-06
FORMULA_NAME CANConstruction-PT-020-07
FORMULA_NAME CANConstruction-PT-020-08
FORMULA_NAME CANConstruction-PT-020-09
FORMULA_NAME CANConstruction-PT-020-10
FORMULA_NAME CANConstruction-PT-020-11
FORMULA_NAME CANConstruction-PT-020-12
FORMULA_NAME CANConstruction-PT-020-13
FORMULA_NAME CANConstruction-PT-020-14
FORMULA_NAME CANConstruction-PT-020-15

=== Now, execution of the tool begins

BK_START 1621242979619

Running Version 0
[2021-05-17 09:16:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-17 09:16:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 09:16:21] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2021-05-17 09:16:21] [INFO ] Transformed 1042 places.
[2021-05-17 09:16:21] [INFO ] Transformed 1760 transitions.
[2021-05-17 09:16:21] [INFO ] Parsed PT model containing 1042 places and 1760 transitions in 190 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 09:16:21] [INFO ] Initial state test concluded for 2 properties.
FORMULA CANConstruction-PT-020-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 1042 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1042/1042 places, 1760/1760 transitions.
Discarding 344 places :
Symmetric choice reduction at 0 with 344 rule applications. Total rules 344 place count 698 transition count 1072
Iterating global reduction 0 with 344 rules applied. Total rules applied 688 place count 698 transition count 1072
Applied a total of 688 rules in 139 ms. Remains 698 /1042 variables (removed 344) and now considering 1072/1760 (removed 688) transitions.
// Phase 1: matrix 1072 rows 698 cols
[2021-05-17 09:16:21] [INFO ] Computed 41 place invariants in 33 ms
[2021-05-17 09:16:22] [INFO ] Implicit Places using invariants in 475 ms returned [12, 26, 40, 54, 68, 82, 96, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 503 ms to find 19 implicit places.
// Phase 1: matrix 1072 rows 679 cols
[2021-05-17 09:16:22] [INFO ] Computed 22 place invariants in 8 ms
[2021-05-17 09:16:22] [INFO ] Dead Transitions using invariants and state equation in 423 ms returned []
Starting structural reductions, iteration 1 : 679/1042 places, 1072/1760 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 663 transition count 1056
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 663 transition count 1056
Applied a total of 32 rules in 32 ms. Remains 663 /679 variables (removed 16) and now considering 1056/1072 (removed 16) transitions.
// Phase 1: matrix 1056 rows 663 cols
[2021-05-17 09:16:22] [INFO ] Computed 22 place invariants in 5 ms
[2021-05-17 09:16:22] [INFO ] Implicit Places using invariants in 253 ms returned []
// Phase 1: matrix 1056 rows 663 cols
[2021-05-17 09:16:22] [INFO ] Computed 22 place invariants in 5 ms
[2021-05-17 09:16:23] [INFO ] State equation strengthened by 780 read => feed constraints.
[2021-05-17 09:16:25] [INFO ] Implicit Places using invariants and state equation in 3099 ms returned []
Implicit Place search using SMT with State Equation took 3355 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 663/1042 places, 1056/1760 transitions.
[2021-05-17 09:16:26] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 09:16:26] [INFO ] Flatten gal took : 100 ms
FORMULA CANConstruction-PT-020-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 09:16:26] [INFO ] Flatten gal took : 57 ms
[2021-05-17 09:16:26] [INFO ] Input system was already deterministic with 1056 transitions.
Incomplete random walk after 100000 steps, including 288 resets, run finished after 500 ms. (steps per millisecond=200 ) properties (out of 27) seen :19
Running SMT prover for 8 properties.
// Phase 1: matrix 1056 rows 663 cols
[2021-05-17 09:16:26] [INFO ] Computed 22 place invariants in 5 ms
[2021-05-17 09:16:26] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned unsat
[2021-05-17 09:16:27] [INFO ] [Real]Absence check using 21 positive place invariants in 6 ms returned unsat
[2021-05-17 09:16:27] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned unsat
[2021-05-17 09:16:27] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned unsat
[2021-05-17 09:16:27] [INFO ] [Real]Absence check using 21 positive place invariants in 6 ms returned unsat
[2021-05-17 09:16:27] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned unsat
[2021-05-17 09:16:27] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned sat
[2021-05-17 09:16:27] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-17 09:16:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 09:16:27] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2021-05-17 09:16:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 09:16:27] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2021-05-17 09:16:27] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-17 09:16:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 09:16:28] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2021-05-17 09:16:28] [INFO ] State equation strengthened by 780 read => feed constraints.
[2021-05-17 09:16:28] [INFO ] [Nat]Added 780 Read/Feed constraints in 70 ms returned sat
[2021-05-17 09:16:28] [INFO ] Computed and/alt/rep : 976/1958/976 causal constraints (skipped 60 transitions) in 75 ms.
[2021-05-17 09:16:38] [INFO ] Added : 832 causal constraints over 167 iterations in 9912 ms. Result :sat
[2021-05-17 09:16:38] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 13 simplifications.
[2021-05-17 09:16:38] [INFO ] Initial state test concluded for 3 properties.
FORMULA CANConstruction-PT-020-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (p1&&X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 663 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 663/663 places, 1056/1056 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 646 transition count 1024
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 646 transition count 1024
Applied a total of 34 rules in 47 ms. Remains 646 /663 variables (removed 17) and now considering 1024/1056 (removed 32) transitions.
// Phase 1: matrix 1024 rows 646 cols
[2021-05-17 09:16:38] [INFO ] Computed 22 place invariants in 4 ms
[2021-05-17 09:16:38] [INFO ] Implicit Places using invariants in 266 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 268 ms to find 1 implicit places.
// Phase 1: matrix 1024 rows 645 cols
[2021-05-17 09:16:38] [INFO ] Computed 21 place invariants in 4 ms
[2021-05-17 09:16:38] [INFO ] Dead Transitions using invariants and state equation in 385 ms returned []
Starting structural reductions, iteration 1 : 645/663 places, 1024/1056 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 644 transition count 1023
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 644 transition count 1023
Applied a total of 2 rules in 38 ms. Remains 644 /645 variables (removed 1) and now considering 1023/1024 (removed 1) transitions.
// Phase 1: matrix 1023 rows 644 cols
[2021-05-17 09:16:39] [INFO ] Computed 21 place invariants in 4 ms
[2021-05-17 09:16:39] [INFO ] Implicit Places using invariants in 284 ms returned []
// Phase 1: matrix 1023 rows 644 cols
[2021-05-17 09:16:39] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:16:39] [INFO ] State equation strengthened by 780 read => feed constraints.
[2021-05-17 09:16:43] [INFO ] Implicit Places using invariants and state equation in 3761 ms returned []
Implicit Place search using SMT with State Equation took 4051 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 644/663 places, 1023/1056 transitions.
Stuttering acceptance computed with spot in 215 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-00 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(GT 1 s125), p0:(LEQ s357 s560)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 904 steps with 2 reset in 14 ms.
FORMULA CANConstruction-PT-020-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-00 finished in 5068 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(G(p0)))&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 5 out of 663 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 663/663 places, 1056/1056 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 645 transition count 1023
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 645 transition count 1023
Applied a total of 36 rules in 23 ms. Remains 645 /663 variables (removed 18) and now considering 1023/1056 (removed 33) transitions.
// Phase 1: matrix 1023 rows 645 cols
[2021-05-17 09:16:43] [INFO ] Computed 22 place invariants in 4 ms
[2021-05-17 09:16:43] [INFO ] Implicit Places using invariants in 260 ms returned []
// Phase 1: matrix 1023 rows 645 cols
[2021-05-17 09:16:43] [INFO ] Computed 22 place invariants in 6 ms
[2021-05-17 09:16:43] [INFO ] State equation strengthened by 780 read => feed constraints.
[2021-05-17 09:16:46] [INFO ] Implicit Places using invariants and state equation in 3370 ms returned []
Implicit Place search using SMT with State Equation took 3631 ms to find 0 implicit places.
// Phase 1: matrix 1023 rows 645 cols
[2021-05-17 09:16:46] [INFO ] Computed 22 place invariants in 5 ms
[2021-05-17 09:16:47] [INFO ] Dead Transitions using invariants and state equation in 448 ms returned []
Finished structural reductions, in 1 iterations. Remains : 645/663 places, 1023/1056 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : CANConstruction-PT-020-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LEQ 1 s594) (LEQ 3 s429)), p0:(AND (LEQ s503 s96) (LEQ 1 s214))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 355 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-020-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-02 finished in 4226 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 663 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 663/663 places, 1056/1056 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 645 transition count 1022
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 645 transition count 1022
Applied a total of 36 rules in 21 ms. Remains 645 /663 variables (removed 18) and now considering 1022/1056 (removed 34) transitions.
// Phase 1: matrix 1022 rows 645 cols
[2021-05-17 09:16:47] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-17 09:16:47] [INFO ] Implicit Places using invariants in 236 ms returned [97]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 238 ms to find 1 implicit places.
// Phase 1: matrix 1022 rows 644 cols
[2021-05-17 09:16:47] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:16:48] [INFO ] Dead Transitions using invariants and state equation in 386 ms returned []
Starting structural reductions, iteration 1 : 644/663 places, 1022/1056 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 643 transition count 1021
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 643 transition count 1021
Applied a total of 2 rules in 25 ms. Remains 643 /644 variables (removed 1) and now considering 1021/1022 (removed 1) transitions.
// Phase 1: matrix 1021 rows 643 cols
[2021-05-17 09:16:48] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:16:48] [INFO ] Implicit Places using invariants in 278 ms returned []
// Phase 1: matrix 1021 rows 643 cols
[2021-05-17 09:16:48] [INFO ] Computed 21 place invariants in 4 ms
[2021-05-17 09:16:48] [INFO ] State equation strengthened by 780 read => feed constraints.
[2021-05-17 09:16:52] [INFO ] Implicit Places using invariants and state equation in 4387 ms returned []
Implicit Place search using SMT with State Equation took 4667 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 643/663 places, 1021/1056 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(LEQ s29 s385)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 584 ms.
Product exploration explored 100000 steps with 33333 reset in 417 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 382 ms.
Product exploration explored 100000 steps with 33333 reset in 379 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Support contains 2 out of 643 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 643/643 places, 1021/1021 transitions.
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 643 transition count 1021
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 20 Pre rules applied. Total rules applied 81 place count 643 transition count 1021
Deduced a syphon composed of 101 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 101 place count 643 transition count 1021
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 141 place count 603 transition count 981
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 181 place count 603 transition count 981
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 1 with 78 rules applied. Total rules applied 259 place count 603 transition count 981
Discarding 98 places :
Symmetric choice reduction at 1 with 98 rule applications. Total rules 357 place count 505 transition count 883
Deduced a syphon composed of 41 places in 1 ms
Iterating global reduction 1 with 98 rules applied. Total rules applied 455 place count 505 transition count 883
Deduced a syphon composed of 41 places in 0 ms
Applied a total of 455 rules in 193 ms. Remains 505 /643 variables (removed 138) and now considering 883/1021 (removed 138) transitions.
[2021-05-17 09:16:55] [INFO ] Redundant transitions in 52 ms returned []
// Phase 1: matrix 883 rows 505 cols
[2021-05-17 09:16:55] [INFO ] Computed 21 place invariants in 6 ms
[2021-05-17 09:16:55] [INFO ] Dead Transitions using invariants and state equation in 384 ms returned []
Finished structural reductions, in 1 iterations. Remains : 505/643 places, 883/1021 transitions.
Product exploration explored 100000 steps with 33333 reset in 1934 ms.
Product exploration explored 100000 steps with 33333 reset in 1819 ms.
[2021-05-17 09:16:59] [INFO ] Flatten gal took : 46 ms
[2021-05-17 09:16:59] [INFO ] Flatten gal took : 43 ms
[2021-05-17 09:16:59] [INFO ] Time to serialize gal into /tmp/LTL15703791545143288575.gal : 26 ms
[2021-05-17 09:16:59] [INFO ] Time to serialize properties into /tmp/LTL4378648132112633947.ltl : 14 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15703791545143288575.gal, -t, CGAL, -LTL, /tmp/LTL4378648132112633947.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15703791545143288575.gal -t CGAL -LTL /tmp/LTL4378648132112633947.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X("(Node2ResZone<=Node6requestsent9)"))))
Formula 0 simplified : !XX"(Node2ResZone<=Node6requestsent9)"
Detected timeout of ITS tools.
[2021-05-17 09:17:14] [INFO ] Flatten gal took : 37 ms
[2021-05-17 09:17:14] [INFO ] Applying decomposition
[2021-05-17 09:17:14] [INFO ] Flatten gal took : 34 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/graph15022465184043047710.txt, -o, /tmp/graph15022465184043047710.bin, -w, /tmp/graph15022465184043047710.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/graph15022465184043047710.bin, -l, -1, -v, -w, /tmp/graph15022465184043047710.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 09:17:14] [INFO ] Decomposing Gal with order
[2021-05-17 09:17:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 09:17:15] [INFO ] Removed a total of 776 redundant transitions.
[2021-05-17 09:17:15] [INFO ] Flatten gal took : 206 ms
[2021-05-17 09:17:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 718 labels/synchronizations in 36 ms.
[2021-05-17 09:17:15] [INFO ] Time to serialize gal into /tmp/LTL10943818294112335470.gal : 10 ms
[2021-05-17 09:17:15] [INFO ] Time to serialize properties into /tmp/LTL10014124248087894164.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10943818294112335470.gal, -t, CGAL, -LTL, /tmp/LTL10014124248087894164.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10943818294112335470.gal -t CGAL -LTL /tmp/LTL10014124248087894164.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X("(gu10.Node2ResZone<=gu10.Node6requestsent9)"))))
Formula 0 simplified : !XX"(gu10.Node2ResZone<=gu10.Node6requestsent9)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin886990651021954082
[2021-05-17 09:17:30] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin886990651021954082
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin886990651021954082]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin886990651021954082] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin886990651021954082] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property CANConstruction-PT-020-03 finished in 43838 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)&&X(X(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 663 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 663/663 places, 1056/1056 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 645 transition count 1023
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 645 transition count 1023
Applied a total of 36 rules in 32 ms. Remains 645 /663 variables (removed 18) and now considering 1023/1056 (removed 33) transitions.
// Phase 1: matrix 1023 rows 645 cols
[2021-05-17 09:17:31] [INFO ] Computed 22 place invariants in 4 ms
[2021-05-17 09:17:31] [INFO ] Implicit Places using invariants in 334 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 336 ms to find 1 implicit places.
// Phase 1: matrix 1023 rows 644 cols
[2021-05-17 09:17:31] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:17:32] [INFO ] Dead Transitions using invariants and state equation in 408 ms returned []
Starting structural reductions, iteration 1 : 644/663 places, 1023/1056 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 643 transition count 1022
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 643 transition count 1022
Applied a total of 2 rules in 55 ms. Remains 643 /644 variables (removed 1) and now considering 1022/1023 (removed 1) transitions.
// Phase 1: matrix 1022 rows 643 cols
[2021-05-17 09:17:32] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:17:32] [INFO ] Implicit Places using invariants in 292 ms returned []
// Phase 1: matrix 1022 rows 643 cols
[2021-05-17 09:17:32] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:17:32] [INFO ] State equation strengthened by 780 read => feed constraints.
[2021-05-17 09:17:35] [INFO ] Implicit Places using invariants and state equation in 3483 ms returned []
Implicit Place search using SMT with State Equation took 3777 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 643/663 places, 1022/1056 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : CANConstruction-PT-020-04 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(LEQ s623 s384), p1:(LEQ s451 s610)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1761 steps with 5 reset in 14 ms.
FORMULA CANConstruction-PT-020-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-04 finished in 4810 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 663 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 663/663 places, 1056/1056 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 644 transition count 1021
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 644 transition count 1021
Applied a total of 38 rules in 21 ms. Remains 644 /663 variables (removed 19) and now considering 1021/1056 (removed 35) transitions.
// Phase 1: matrix 1021 rows 644 cols
[2021-05-17 09:17:36] [INFO ] Computed 22 place invariants in 15 ms
[2021-05-17 09:17:36] [INFO ] Implicit Places using invariants in 293 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 295 ms to find 1 implicit places.
// Phase 1: matrix 1021 rows 643 cols
[2021-05-17 09:17:36] [INFO ] Computed 21 place invariants in 4 ms
[2021-05-17 09:17:36] [INFO ] Dead Transitions using invariants and state equation in 439 ms returned []
Starting structural reductions, iteration 1 : 643/663 places, 1021/1056 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 642 transition count 1020
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 642 transition count 1020
Applied a total of 2 rules in 22 ms. Remains 642 /643 variables (removed 1) and now considering 1020/1021 (removed 1) transitions.
// Phase 1: matrix 1020 rows 642 cols
[2021-05-17 09:17:36] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:17:37] [INFO ] Implicit Places using invariants in 254 ms returned []
// Phase 1: matrix 1020 rows 642 cols
[2021-05-17 09:17:37] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:17:37] [INFO ] State equation strengthened by 780 read => feed constraints.
[2021-05-17 09:17:41] [INFO ] Implicit Places using invariants and state equation in 4590 ms returned []
Implicit Place search using SMT with State Equation took 4845 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 642/663 places, 1020/1056 transitions.
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s192 s339)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 162 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-020-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-05 finished in 5691 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 663 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 663/663 places, 1056/1056 transitions.
Drop transitions removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 663 transition count 926
Reduce places removed 130 places and 0 transitions.
Iterating post reduction 1 with 130 rules applied. Total rules applied 260 place count 533 transition count 926
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 260 place count 533 transition count 907
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 298 place count 514 transition count 907
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 314 place count 498 transition count 875
Iterating global reduction 2 with 16 rules applied. Total rules applied 330 place count 498 transition count 875
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 2 with 14 rules applied. Total rules applied 344 place count 498 transition count 861
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 358 place count 484 transition count 861
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 392 place count 467 transition count 844
Applied a total of 392 rules in 70 ms. Remains 467 /663 variables (removed 196) and now considering 844/1056 (removed 212) transitions.
// Phase 1: matrix 844 rows 467 cols
[2021-05-17 09:17:41] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-17 09:17:42] [INFO ] Implicit Places using invariants in 218 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 219 ms to find 1 implicit places.
[2021-05-17 09:17:42] [INFO ] Redundant transitions in 115 ms returned []
// Phase 1: matrix 844 rows 466 cols
[2021-05-17 09:17:42] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:17:42] [INFO ] Dead Transitions using invariants and state equation in 312 ms returned []
Starting structural reductions, iteration 1 : 466/663 places, 844/1056 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 466 transition count 842
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 464 transition count 842
Applied a total of 4 rules in 26 ms. Remains 464 /466 variables (removed 2) and now considering 842/844 (removed 2) transitions.
// Phase 1: matrix 842 rows 464 cols
[2021-05-17 09:17:42] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:17:42] [INFO ] Implicit Places using invariants in 220 ms returned []
// Phase 1: matrix 842 rows 464 cols
[2021-05-17 09:17:42] [INFO ] Computed 21 place invariants in 2 ms
[2021-05-17 09:17:43] [INFO ] State equation strengthened by 780 read => feed constraints.
[2021-05-17 09:17:44] [INFO ] Implicit Places using invariants and state equation in 2105 ms returned []
Implicit Place search using SMT with State Equation took 2326 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 464/663 places, 842/1056 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 280 steps with 4 reset in 2 ms.
FORMULA CANConstruction-PT-020-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-11 finished in 3109 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0||(!p0&&G(p1))))&&(X(p1) U ((p2&&X(p1))||X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 663 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 663/663 places, 1056/1056 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 646 transition count 1025
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 646 transition count 1025
Applied a total of 34 rules in 27 ms. Remains 646 /663 variables (removed 17) and now considering 1025/1056 (removed 31) transitions.
// Phase 1: matrix 1025 rows 646 cols
[2021-05-17 09:17:45] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-17 09:17:45] [INFO ] Implicit Places using invariants in 248 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 249 ms to find 1 implicit places.
// Phase 1: matrix 1025 rows 645 cols
[2021-05-17 09:17:45] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:17:45] [INFO ] Dead Transitions using invariants and state equation in 387 ms returned []
Starting structural reductions, iteration 1 : 645/663 places, 1025/1056 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 644 transition count 1024
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 644 transition count 1024
Applied a total of 2 rules in 19 ms. Remains 644 /645 variables (removed 1) and now considering 1024/1025 (removed 1) transitions.
// Phase 1: matrix 1024 rows 644 cols
[2021-05-17 09:17:45] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:17:45] [INFO ] Implicit Places using invariants in 254 ms returned []
// Phase 1: matrix 1024 rows 644 cols
[2021-05-17 09:17:45] [INFO ] Computed 21 place invariants in 2 ms
[2021-05-17 09:17:46] [INFO ] State equation strengthened by 780 read => feed constraints.
[2021-05-17 09:17:49] [INFO ] Implicit Places using invariants and state equation in 4039 ms returned []
Implicit Place search using SMT with State Equation took 4295 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 644/663 places, 1024/1056 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (NOT p1)]
Running random walk in product with property : CANConstruction-PT-020-13 automaton TGBA [mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 p1 p2), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(LEQ s191 s452), p1:(GT s353 s523), p2:(GT s439 s349)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-020-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-13 finished in 5146 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 663 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 663/663 places, 1056/1056 transitions.
Drop transitions removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 132 place count 663 transition count 924
Reduce places removed 132 places and 0 transitions.
Iterating post reduction 1 with 132 rules applied. Total rules applied 264 place count 531 transition count 924
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 264 place count 531 transition count 905
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 302 place count 512 transition count 905
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 317 place count 497 transition count 875
Iterating global reduction 2 with 15 rules applied. Total rules applied 332 place count 497 transition count 875
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 13 rules applied. Total rules applied 345 place count 497 transition count 862
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 358 place count 484 transition count 862
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 394 place count 466 transition count 844
Applied a total of 394 rules in 57 ms. Remains 466 /663 variables (removed 197) and now considering 844/1056 (removed 212) transitions.
// Phase 1: matrix 844 rows 466 cols
[2021-05-17 09:17:50] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-17 09:17:50] [INFO ] Implicit Places using invariants in 252 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 253 ms to find 1 implicit places.
[2021-05-17 09:17:50] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 844 rows 465 cols
[2021-05-17 09:17:50] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-17 09:17:50] [INFO ] Dead Transitions using invariants and state equation in 305 ms returned []
Starting structural reductions, iteration 1 : 465/663 places, 844/1056 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 465 transition count 842
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 463 transition count 842
Applied a total of 4 rules in 20 ms. Remains 463 /465 variables (removed 2) and now considering 842/844 (removed 2) transitions.
// Phase 1: matrix 842 rows 463 cols
[2021-05-17 09:17:50] [INFO ] Computed 21 place invariants in 2 ms
[2021-05-17 09:17:51] [INFO ] Implicit Places using invariants in 225 ms returned []
// Phase 1: matrix 842 rows 463 cols
[2021-05-17 09:17:51] [INFO ] Computed 21 place invariants in 2 ms
[2021-05-17 09:17:51] [INFO ] State equation strengthened by 780 read => feed constraints.
[2021-05-17 09:17:53] [INFO ] Implicit Places using invariants and state equation in 2107 ms returned []
Implicit Place search using SMT with State Equation took 2332 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 463/663 places, 842/1056 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s431)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 741 reset in 406 ms.
Stack based approach found an accepted trace after 20876 steps with 153 reset with depth 102 and stack size 101 in 125 ms.
FORMULA CANConstruction-PT-020-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-14 finished in 3545 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9396507531074589344
[2021-05-17 09:17:53] [INFO ] Computing symmetric may disable matrix : 1056 transitions.
[2021-05-17 09:17:53] [INFO ] Applying decomposition
[2021-05-17 09:17:53] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 09:17:53] [INFO ] Computing symmetric may enable matrix : 1056 transitions.
[2021-05-17 09:17:53] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 09:17:53] [INFO ] Flatten gal took : 52 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/graph10646640848092673185.txt, -o, /tmp/graph10646640848092673185.bin, -w, /tmp/graph10646640848092673185.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/graph10646640848092673185.bin, -l, -1, -v, -w, /tmp/graph10646640848092673185.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 09:17:53] [INFO ] Decomposing Gal with order
[2021-05-17 09:17:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 09:17:53] [INFO ] Computing Do-Not-Accords matrix : 1056 transitions.
[2021-05-17 09:17:53] [INFO ] Computation of Completed DNA matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 09:17:53] [INFO ] Built C files in 256ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9396507531074589344
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9396507531074589344]
[2021-05-17 09:17:53] [INFO ] Removed a total of 809 redundant transitions.
[2021-05-17 09:17:54] [INFO ] Flatten gal took : 110 ms
[2021-05-17 09:17:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 710 labels/synchronizations in 38 ms.
[2021-05-17 09:17:54] [INFO ] Time to serialize gal into /tmp/LTLCardinality10109923486656005704.gal : 5 ms
[2021-05-17 09:17:54] [INFO ] Time to serialize properties into /tmp/LTLCardinality2350085233112193222.ltl : 0 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality10109923486656005704.gal, -t, CGAL, -LTL, /tmp/LTLCardinality2350085233112193222.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality10109923486656005704.gal -t CGAL -LTL /tmp/LTLCardinality2350085233112193222.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X("(gu10.Node2ResZone<=gu10.Node6requestsent9)"))))
Formula 0 simplified : !XX"(gu10.Node2ResZone<=gu10.Node6requestsent9)"
Compilation finished in 7757 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9396507531074589344]
Link finished in 77 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin9396507531074589344]
LTSmin run took 690 ms.
FORMULA CANConstruction-PT-020-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621243083455

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="CANConstruction-PT-020"
export BK_EXAMINATION="LTLCardinality"
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 CANConstruction-PT-020, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r292-tall-162124155800020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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