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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.9M
-rw-r--r-- 1 mcc users 31K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 168K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K May 12 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 12 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 12 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 12 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.6K May 11 18:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K 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.7K 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 7.5M 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-040-00
FORMULA_NAME CANConstruction-PT-040-01
FORMULA_NAME CANConstruction-PT-040-02
FORMULA_NAME CANConstruction-PT-040-03
FORMULA_NAME CANConstruction-PT-040-04
FORMULA_NAME CANConstruction-PT-040-05
FORMULA_NAME CANConstruction-PT-040-06
FORMULA_NAME CANConstruction-PT-040-07
FORMULA_NAME CANConstruction-PT-040-08
FORMULA_NAME CANConstruction-PT-040-09
FORMULA_NAME CANConstruction-PT-040-10
FORMULA_NAME CANConstruction-PT-040-11
FORMULA_NAME CANConstruction-PT-040-12
FORMULA_NAME CANConstruction-PT-040-13
FORMULA_NAME CANConstruction-PT-040-14
FORMULA_NAME CANConstruction-PT-040-15

=== Now, execution of the tool begins

BK_START 1621247578121

Running Version 0
[2021-05-17 10:33:08] [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 10:33:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 10:33:09] [INFO ] Load time of PNML (sax parser for PT used): 351 ms
[2021-05-17 10:33:09] [INFO ] Transformed 3682 places.
[2021-05-17 10:33:09] [INFO ] Transformed 6720 transitions.
[2021-05-17 10:33:09] [INFO ] Parsed PT model containing 3682 places and 6720 transitions in 486 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Support contains 59 out of 3682 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3682/3682 places, 6720/6720 transitions.
Discarding 1490 places :
Symmetric choice reduction at 0 with 1490 rule applications. Total rules 1490 place count 2192 transition count 3740
Iterating global reduction 0 with 1490 rules applied. Total rules applied 2980 place count 2192 transition count 3740
Applied a total of 2980 rules in 564 ms. Remains 2192 /3682 variables (removed 1490) and now considering 3740/6720 (removed 2980) transitions.
// Phase 1: matrix 3740 rows 2192 cols
[2021-05-17 10:33:10] [INFO ] Computed 81 place invariants in 53 ms
[2021-05-17 10:33:11] [INFO ] Implicit Places using invariants in 1434 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278, 292, 306, 320, 334, 348, 362, 376, 390, 404, 418, 432, 446, 460, 474, 488, 502, 516, 530, 544, 558]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 1469 ms to find 40 implicit places.
// Phase 1: matrix 3740 rows 2152 cols
[2021-05-17 10:33:11] [INFO ] Computed 41 place invariants in 43 ms
[2021-05-17 10:33:13] [INFO ] Dead Transitions using invariants and state equation in 1926 ms returned []
Starting structural reductions, iteration 1 : 2152/3682 places, 3740/6720 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 2113 transition count 3701
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 2113 transition count 3701
Applied a total of 78 rules in 227 ms. Remains 2113 /2152 variables (removed 39) and now considering 3701/3740 (removed 39) transitions.
// Phase 1: matrix 3701 rows 2113 cols
[2021-05-17 10:33:13] [INFO ] Computed 41 place invariants in 32 ms
[2021-05-17 10:33:14] [INFO ] Implicit Places using invariants in 1206 ms returned []
// Phase 1: matrix 3701 rows 2113 cols
[2021-05-17 10:33:14] [INFO ] Computed 41 place invariants in 19 ms
[2021-05-17 10:33:16] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2021-05-17 10:33:46] [INFO ] Performed 1468/2113 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2021-05-17 10:34:03] [INFO ] Implicit Places using invariants and state equation in 48165 ms returned []
Implicit Place search using SMT with State Equation took 49374 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 2113/3682 places, 3701/6720 transitions.
[2021-05-17 10:34:17] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 10:34:17] [INFO ] Flatten gal took : 235 ms
FORMULA CANConstruction-PT-040-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-040-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 10:34:17] [INFO ] Flatten gal took : 166 ms
[2021-05-17 10:34:17] [INFO ] Input system was already deterministic with 3701 transitions.
Incomplete random walk after 100000 steps, including 142 resets, run finished after 961 ms. (steps per millisecond=104 ) properties (out of 32) seen :24
Running SMT prover for 8 properties.
// Phase 1: matrix 3701 rows 2113 cols
[2021-05-17 10:34:18] [INFO ] Computed 41 place invariants in 22 ms
[2021-05-17 10:34:18] [INFO ] [Real]Absence check using 41 positive place invariants in 16 ms returned unsat
[2021-05-17 10:34:19] [INFO ] [Real]Absence check using 41 positive place invariants in 22 ms returned unsat
[2021-05-17 10:34:19] [INFO ] [Real]Absence check using 41 positive place invariants in 22 ms returned unsat
[2021-05-17 10:34:19] [INFO ] [Real]Absence check using 41 positive place invariants in 25 ms returned unsat
[2021-05-17 10:34:19] [INFO ] [Real]Absence check using 41 positive place invariants in 23 ms returned unsat
[2021-05-17 10:34:20] [INFO ] [Real]Absence check using 41 positive place invariants in 48 ms returned sat
[2021-05-17 10:34:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 10:34:21] [INFO ] [Real]Absence check using state equation in 935 ms returned sat
[2021-05-17 10:34:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 10:34:21] [INFO ] [Nat]Absence check using 41 positive place invariants in 40 ms returned sat
[2021-05-17 10:34:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 10:34:22] [INFO ] [Nat]Absence check using state equation in 1002 ms returned sat
[2021-05-17 10:34:22] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2021-05-17 10:34:22] [INFO ] [Nat]Added 3160 Read/Feed constraints in 264 ms returned sat
[2021-05-17 10:34:23] [INFO ] Computed and/alt/rep : 3541/6878/3541 causal constraints (skipped 120 transitions) in 245 ms.
[2021-05-17 10:34:43] [INFO ] Deduced a trap composed of 5 places in 1994 ms of which 5 ms to minimize.
[2021-05-17 10:34:43] [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 5
[2021-05-17 10:34:43] [INFO ] [Real]Absence check using 41 positive place invariants in 37 ms returned unsat
[2021-05-17 10:34:43] [INFO ] [Real]Absence check using 41 positive place invariants in 27 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 14 simplifications.
[2021-05-17 10:34:43] [INFO ] Initial state test concluded for 1 properties.
FORMULA CANConstruction-PT-040-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-040-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 2113 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2113/2113 places, 3701/3701 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 2083 transition count 3642
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 2083 transition count 3642
Applied a total of 60 rules in 201 ms. Remains 2083 /2113 variables (removed 30) and now considering 3642/3701 (removed 59) transitions.
// Phase 1: matrix 3642 rows 2083 cols
[2021-05-17 10:34:44] [INFO ] Computed 41 place invariants in 20 ms
[2021-05-17 10:34:45] [INFO ] Implicit Places using invariants in 1134 ms returned []
// Phase 1: matrix 3642 rows 2083 cols
[2021-05-17 10:34:45] [INFO ] Computed 41 place invariants in 25 ms
[2021-05-17 10:34:46] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2021-05-17 10:35:16] [INFO ] Performed 1413/2083 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2021-05-17 10:35:30] [INFO ] Implicit Places using invariants and state equation in 45245 ms returned []
Implicit Place search using SMT with State Equation took 46381 ms to find 0 implicit places.
// Phase 1: matrix 3642 rows 2083 cols
[2021-05-17 10:35:30] [INFO ] Computed 41 place invariants in 31 ms
[2021-05-17 10:35:32] [INFO ] Dead Transitions using invariants and state equation in 1821 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2083/2113 places, 3642/3701 transitions.
Stuttering acceptance computed with spot in 5567 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-040-00 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:(GT 1 s1008)], 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 3493 steps with 4 reset in 40 ms.
FORMULA CANConstruction-PT-040-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-00 finished in 54073 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 2113 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2113/2113 places, 3701/3701 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 2082 transition count 3640
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 2082 transition count 3640
Applied a total of 62 rules in 205 ms. Remains 2082 /2113 variables (removed 31) and now considering 3640/3701 (removed 61) transitions.
// Phase 1: matrix 3640 rows 2082 cols
[2021-05-17 10:35:38] [INFO ] Computed 41 place invariants in 17 ms
[2021-05-17 10:35:39] [INFO ] Implicit Places using invariants in 1167 ms returned []
// Phase 1: matrix 3640 rows 2082 cols
[2021-05-17 10:35:39] [INFO ] Computed 41 place invariants in 16 ms
[2021-05-17 10:35:40] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2021-05-17 10:36:10] [INFO ] Performed 1715/2082 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2021-05-17 10:36:17] [INFO ] Implicit Places using invariants and state equation in 38475 ms returned []
Implicit Place search using SMT with State Equation took 39648 ms to find 0 implicit places.
// Phase 1: matrix 3640 rows 2082 cols
[2021-05-17 10:36:17] [INFO ] Computed 41 place invariants in 19 ms
[2021-05-17 10:36:19] [INFO ] Dead Transitions using invariants and state equation in 1788 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2082/2113 places, 3640/3701 transitions.
Stuttering acceptance computed with spot in 11206 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-040-02 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:(GT 1 s1393)], 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 25536 steps with 36 reset in 205 ms.
FORMULA CANConstruction-PT-040-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-02 finished in 53089 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(((p0 U p1)&&X((p2&&G(p3))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 2113 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2113/2113 places, 3701/3701 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 2085 transition count 3646
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 2085 transition count 3646
Applied a total of 56 rules in 213 ms. Remains 2085 /2113 variables (removed 28) and now considering 3646/3701 (removed 55) transitions.
// Phase 1: matrix 3646 rows 2085 cols
[2021-05-17 10:36:31] [INFO ] Computed 41 place invariants in 17 ms
[2021-05-17 10:36:32] [INFO ] Implicit Places using invariants in 1138 ms returned []
// Phase 1: matrix 3646 rows 2085 cols
[2021-05-17 10:36:32] [INFO ] Computed 41 place invariants in 20 ms
[2021-05-17 10:36:33] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2021-05-17 10:37:03] [INFO ] Performed 1376/2085 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2021-05-17 10:37:25] [INFO ] Implicit Places using invariants and state equation in 52744 ms returned []
Implicit Place search using SMT with State Equation took 53883 ms to find 0 implicit places.
// Phase 1: matrix 3646 rows 2085 cols
[2021-05-17 10:37:25] [INFO ] Computed 41 place invariants in 21 ms
[2021-05-17 10:37:26] [INFO ] Dead Transitions using invariants and state equation in 1720 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2085/2113 places, 3646/3701 transitions.
Stuttering acceptance computed with spot in 6639 ms :[(OR (NOT p1) (NOT p2) (NOT p3)), true, (NOT p1), (OR (AND p0 (NOT p3)) (AND p0 (NOT p2)) (AND p1 (NOT p3)) (AND p1 (NOT p2))), (NOT p3)]
Running random walk in product with property : CANConstruction-PT-040-03 automaton TGBA [mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND p1 (NOT p2)) (AND p1 (NOT p3)) (AND p0 (NOT p2)) (AND p0 (NOT p3))), acceptance={} source=3 dest: 1}, { cond=(AND p2 p3), acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={} source=4 dest: 1}, { cond=p3, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s820 s770), p0:(LEQ s1271 s1925), p2:(LEQ s565 s983), p3:(LEQ 1 s1894)], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-040-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-03 finished in 62498 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||(p0&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 2113 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2113/2113 places, 3701/3701 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 2085 transition count 3646
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 2085 transition count 3646
Applied a total of 56 rules in 207 ms. Remains 2085 /2113 variables (removed 28) and now considering 3646/3701 (removed 55) transitions.
// Phase 1: matrix 3646 rows 2085 cols
[2021-05-17 10:37:33] [INFO ] Computed 41 place invariants in 19 ms
[2021-05-17 10:37:34] [INFO ] Implicit Places using invariants in 1057 ms returned []
// Phase 1: matrix 3646 rows 2085 cols
[2021-05-17 10:37:34] [INFO ] Computed 41 place invariants in 17 ms
[2021-05-17 10:37:36] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2021-05-17 10:38:08] [INFO ] Performed 1342/2085 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2021-05-17 10:38:26] [INFO ] Implicit Places using invariants and state equation in 51782 ms returned []
Implicit Place search using SMT with State Equation took 52860 ms to find 0 implicit places.
// Phase 1: matrix 3646 rows 2085 cols
[2021-05-17 10:38:26] [INFO ] Computed 41 place invariants in 19 ms
[2021-05-17 10:38:28] [INFO ] Dead Transitions using invariants and state equation in 1770 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2085/2113 places, 3646/3701 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-040-04 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(GT s1133 s1116), p0:(GT s878 s1515)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-040-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-04 finished in 54976 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 2113 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2113/2113 places, 3701/3701 transitions.
Drop transitions removed 262 transitions
Trivial Post-agglo rules discarded 262 transitions
Performed 262 trivial Post agglomeration. Transition count delta: 262
Iterating post reduction 0 with 262 rules applied. Total rules applied 262 place count 2113 transition count 3439
Reduce places removed 262 places and 0 transitions.
Iterating post reduction 1 with 262 rules applied. Total rules applied 524 place count 1851 transition count 3439
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 524 place count 1851 transition count 3399
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 604 place count 1811 transition count 3399
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 632 place count 1783 transition count 3343
Iterating global reduction 2 with 28 rules applied. Total rules applied 660 place count 1783 transition count 3343
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 2 with 18 rules applied. Total rules applied 678 place count 1783 transition count 3325
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 696 place count 1765 transition count 3325
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 778 place count 1724 transition count 3284
Applied a total of 778 rules in 544 ms. Remains 1724 /2113 variables (removed 389) and now considering 3284/3701 (removed 417) transitions.
// Phase 1: matrix 3284 rows 1724 cols
[2021-05-17 10:38:28] [INFO ] Computed 41 place invariants in 18 ms
[2021-05-17 10:38:30] [INFO ] Implicit Places using invariants in 1053 ms returned []
// Phase 1: matrix 3284 rows 1724 cols
[2021-05-17 10:38:30] [INFO ] Computed 41 place invariants in 21 ms
[2021-05-17 10:38:31] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2021-05-17 10:39:01] [INFO ] Performed 1375/1724 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2021-05-17 10:39:08] [INFO ] Implicit Places using invariants and state equation in 38754 ms returned []
Implicit Place search using SMT with State Equation took 39807 ms to find 0 implicit places.
[2021-05-17 10:39:10] [INFO ] Redundant transitions in 216 ms returned []
// Phase 1: matrix 3284 rows 1724 cols
[2021-05-17 10:39:10] [INFO ] Computed 41 place invariants in 21 ms
[2021-05-17 10:39:11] [INFO ] Dead Transitions using invariants and state equation in 1486 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1724/2113 places, 3284/3701 transitions.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-040-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(GT s416 s612), p1:(LEQ s1212 s1269)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 368 reset in 898 ms.
Stack based approach found an accepted trace after 20911 steps with 76 reset with depth 240 and stack size 240 in 211 ms.
FORMULA CANConstruction-PT-040-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-05 finished in 44664 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 2113 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2113/2113 places, 3701/3701 transitions.
Drop transitions removed 260 transitions
Trivial Post-agglo rules discarded 260 transitions
Performed 260 trivial Post agglomeration. Transition count delta: 260
Iterating post reduction 0 with 260 rules applied. Total rules applied 260 place count 2113 transition count 3441
Reduce places removed 260 places and 0 transitions.
Iterating post reduction 1 with 260 rules applied. Total rules applied 520 place count 1853 transition count 3441
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 520 place count 1853 transition count 3401
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 600 place count 1813 transition count 3401
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 630 place count 1783 transition count 3341
Iterating global reduction 2 with 30 rules applied. Total rules applied 660 place count 1783 transition count 3341
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 2 with 20 rules applied. Total rules applied 680 place count 1783 transition count 3321
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 700 place count 1763 transition count 3321
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 2 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 778 place count 1724 transition count 3282
Applied a total of 778 rules in 378 ms. Remains 1724 /2113 variables (removed 389) and now considering 3282/3701 (removed 419) transitions.
// Phase 1: matrix 3282 rows 1724 cols
[2021-05-17 10:39:13] [INFO ] Computed 41 place invariants in 22 ms
[2021-05-17 10:39:14] [INFO ] Implicit Places using invariants in 965 ms returned []
// Phase 1: matrix 3282 rows 1724 cols
[2021-05-17 10:39:14] [INFO ] Computed 41 place invariants in 22 ms
[2021-05-17 10:39:15] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2021-05-17 10:39:45] [INFO ] Performed 1250/1724 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2021-05-17 10:39:56] [INFO ] Implicit Places using invariants and state equation in 41761 ms returned []
Implicit Place search using SMT with State Equation took 42730 ms to find 0 implicit places.
[2021-05-17 10:39:59] [INFO ] Redundant transitions in 190 ms returned []
// Phase 1: matrix 3282 rows 1724 cols
[2021-05-17 10:39:59] [INFO ] Computed 41 place invariants in 23 ms
[2021-05-17 10:40:00] [INFO ] Dead Transitions using invariants and state equation in 1547 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1724/2113 places, 3282/3701 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0)]
Running random walk in product with property : CANConstruction-PT-040-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s92 s1208)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 100 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-040-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-06 finished in 47631 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 2113 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2113/2113 places, 3701/3701 transitions.
Drop transitions removed 262 transitions
Trivial Post-agglo rules discarded 262 transitions
Performed 262 trivial Post agglomeration. Transition count delta: 262
Iterating post reduction 0 with 262 rules applied. Total rules applied 262 place count 2113 transition count 3439
Reduce places removed 262 places and 0 transitions.
Iterating post reduction 1 with 262 rules applied. Total rules applied 524 place count 1851 transition count 3439
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 524 place count 1851 transition count 3399
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 604 place count 1811 transition count 3399
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 633 place count 1782 transition count 3341
Iterating global reduction 2 with 29 rules applied. Total rules applied 662 place count 1782 transition count 3341
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 2 with 19 rules applied. Total rules applied 681 place count 1782 transition count 3322
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 700 place count 1763 transition count 3322
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 780 place count 1723 transition count 3282
Applied a total of 780 rules in 365 ms. Remains 1723 /2113 variables (removed 390) and now considering 3282/3701 (removed 419) transitions.
// Phase 1: matrix 3282 rows 1723 cols
[2021-05-17 10:40:01] [INFO ] Computed 41 place invariants in 20 ms
[2021-05-17 10:40:02] [INFO ] Implicit Places using invariants in 995 ms returned []
// Phase 1: matrix 3282 rows 1723 cols
[2021-05-17 10:40:02] [INFO ] Computed 41 place invariants in 18 ms
[2021-05-17 10:40:03] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2021-05-17 10:40:33] [INFO ] Performed 1338/1723 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2021-05-17 10:40:42] [INFO ] Implicit Places using invariants and state equation in 40401 ms returned []
Implicit Place search using SMT with State Equation took 41416 ms to find 0 implicit places.
[2021-05-17 10:40:42] [INFO ] Redundant transitions in 86 ms returned []
// Phase 1: matrix 3282 rows 1723 cols
[2021-05-17 10:40:42] [INFO ] Computed 41 place invariants in 23 ms
[2021-05-17 10:40:44] [INFO ] Dead Transitions using invariants and state equation in 1627 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1723/2113 places, 3282/3701 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-040-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ s244 s651) (LEQ s1055 s439))], 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 363 reset in 959 ms.
Stack based approach found an accepted trace after 14077 steps with 50 reset with depth 85 and stack size 85 in 122 ms.
FORMULA CANConstruction-PT-040-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-07 finished in 44630 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G(p1))||p0)))], workingDir=/home/mcc/execution]
Support contains 7 out of 2113 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2113/2113 places, 3701/3701 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 2086 transition count 3648
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 2086 transition count 3648
Applied a total of 54 rules in 202 ms. Remains 2086 /2113 variables (removed 27) and now considering 3648/3701 (removed 53) transitions.
// Phase 1: matrix 3648 rows 2086 cols
[2021-05-17 10:40:45] [INFO ] Computed 41 place invariants in 18 ms
[2021-05-17 10:40:46] [INFO ] Implicit Places using invariants in 1210 ms returned []
// Phase 1: matrix 3648 rows 2086 cols
[2021-05-17 10:40:46] [INFO ] Computed 41 place invariants in 24 ms
[2021-05-17 10:40:48] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2021-05-17 10:41:18] [INFO ] Performed 1367/2086 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2021-05-17 10:41:39] [INFO ] Implicit Places using invariants and state equation in 52491 ms returned []
Implicit Place search using SMT with State Equation took 53702 ms to find 0 implicit places.
// Phase 1: matrix 3648 rows 2086 cols
[2021-05-17 10:41:39] [INFO ] Computed 41 place invariants in 18 ms
[2021-05-17 10:41:40] [INFO ] Dead Transitions using invariants and state equation in 1674 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2086/2113 places, 3648/3701 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-040-08 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: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LEQ s2024 s1898) (LEQ s1895 s552) (LEQ s1703 s1022)), p1:(OR (LEQ s1703 s1022) (LEQ 2 s706))], 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 50000 reset in 2021 ms.
Product exploration explored 100000 steps with 50000 reset in 2075 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 95 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 2079 ms.
Product exploration explored 100000 steps with 50000 reset in 2093 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 92 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 7 out of 2086 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2086/2086 places, 3648/3648 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 2086 transition count 3648
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 40 Pre rules applied. Total rules applied 160 place count 2086 transition count 3648
Deduced a syphon composed of 200 places in 1 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 200 place count 2086 transition count 3648
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 280 place count 2006 transition count 3568
Deduced a syphon composed of 120 places in 1 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 360 place count 2006 transition count 3568
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 280 places in 1 ms
Iterating global reduction 1 with 160 rules applied. Total rules applied 520 place count 2006 transition count 3568
Discarding 200 places :
Symmetric choice reduction at 1 with 200 rule applications. Total rules 720 place count 1806 transition count 3368
Deduced a syphon composed of 80 places in 1 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 920 place count 1806 transition count 3368
Deduced a syphon composed of 80 places in 0 ms
Applied a total of 920 rules in 1136 ms. Remains 1806 /2086 variables (removed 280) and now considering 3368/3648 (removed 280) transitions.
[2021-05-17 10:41:58] [INFO ] Redundant transitions in 88 ms returned []
// Phase 1: matrix 3368 rows 1806 cols
[2021-05-17 10:41:58] [INFO ] Computed 41 place invariants in 27 ms
[2021-05-17 10:41:59] [INFO ] Dead Transitions using invariants and state equation in 1478 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1806/2086 places, 3368/3648 transitions.
Product exploration explored 100000 steps with 50000 reset in 2120 ms.
Product exploration explored 100000 steps with 50000 reset in 2116 ms.
[2021-05-17 10:42:04] [INFO ] Flatten gal took : 125 ms
[2021-05-17 10:42:04] [INFO ] Flatten gal took : 118 ms
[2021-05-17 10:42:04] [INFO ] Time to serialize gal into /tmp/LTL7613441142115905209.gal : 47 ms
[2021-05-17 10:42:04] [INFO ] Time to serialize properties into /tmp/LTL4986762506993457939.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/LTL7613441142115905209.gal, -t, CGAL, -LTL, /tmp/LTL4986762506993457939.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/LTL7613441142115905209.gal -t CGAL -LTL /tmp/LTL4986762506993457939.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(((Node38requestsent16<=Node35GiveAnswer7)||(Node35GiveAnswer5<=Node0requestsent36))||(Node30requestsent9<=Node12GiveAnswer31))")||(X(G("((Node30requestsent9<=Node12GiveAnswer31)||(Node4GiveAnswer28>=2))"))))))
Formula 0 simplified : !X("(((Node38requestsent16<=Node35GiveAnswer7)||(Node35GiveAnswer5<=Node0requestsent36))||(Node30requestsent9<=Node12GiveAnswer31))" | XG"((Node30requestsent9<=Node12GiveAnswer31)||(Node4GiveAnswer28>=2))")
Detected timeout of ITS tools.
[2021-05-17 10:42:19] [INFO ] Flatten gal took : 104 ms
[2021-05-17 10:42:19] [INFO ] Applying decomposition
[2021-05-17 10:42:19] [INFO ] Flatten gal took : 104 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/graph13685667470852992950.txt, -o, /tmp/graph13685667470852992950.bin, -w, /tmp/graph13685667470852992950.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/graph13685667470852992950.bin, -l, -1, -v, -w, /tmp/graph13685667470852992950.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 10:42:20] [INFO ] Decomposing Gal with order
[2021-05-17 10:42:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 10:42:20] [INFO ] Removed a total of 3163 redundant transitions.
[2021-05-17 10:42:21] [INFO ] Flatten gal took : 625 ms
[2021-05-17 10:42:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 3036 labels/synchronizations in 234 ms.
[2021-05-17 10:42:21] [INFO ] Time to serialize gal into /tmp/LTL18021366137317847066.gal : 19 ms
[2021-05-17 10:42:21] [INFO ] Time to serialize properties into /tmp/LTL12548108926361582060.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/LTL18021366137317847066.gal, -t, CGAL, -LTL, /tmp/LTL12548108926361582060.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/LTL18021366137317847066.gal -t CGAL -LTL /tmp/LTL12548108926361582060.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(((gu184.Node38requestsent16<=gu184.Node35GiveAnswer7)||(gu182.Node35GiveAnswer5<=gu182.Node0requestsent36))||(gu183.Node30requestsent9<=gu183.Node12GiveAnswer31))")||(X(G("((gu183.Node30requestsent9<=gu183.Node12GiveAnswer31)||(gi0.gi4.gu129.Node4GiveAnswer28>=2))"))))))
Formula 0 simplified : !X("(((gu184.Node38requestsent16<=gu184.Node35GiveAnswer7)||(gu182.Node35GiveAnswer5<=gu182.Node0requestsent36))||(gu183.Node30requestsent9<=gu183.Node12GiveAnswer31))" | XG"((gu183.Node30requestsent9<=gu183.Node12GiveAnswer31)||(gi0.gi4.gu129.Node4GiveAnswer28>=2))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2686143977270154364
[2021-05-17 10:42:36] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2686143977270154364
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/ltsmin2686143977270154364]
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/ltsmin2686143977270154364] 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/ltsmin2686143977270154364] 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-040-08 finished in 112417 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(p0)||(p0 U X(X(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 2113 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2113/2113 places, 3701/3701 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 2085 transition count 3646
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 2085 transition count 3646
Applied a total of 56 rules in 225 ms. Remains 2085 /2113 variables (removed 28) and now considering 3646/3701 (removed 55) transitions.
// Phase 1: matrix 3646 rows 2085 cols
[2021-05-17 10:42:38] [INFO ] Computed 41 place invariants in 21 ms
[2021-05-17 10:42:39] [INFO ] Implicit Places using invariants in 1094 ms returned []
// Phase 1: matrix 3646 rows 2085 cols
[2021-05-17 10:42:39] [INFO ] Computed 41 place invariants in 25 ms
[2021-05-17 10:42:40] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2021-05-17 10:43:10] [INFO ] Performed 1287/2085 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2021-05-17 10:43:32] [INFO ] Implicit Places using invariants and state equation in 53009 ms returned []
Implicit Place search using SMT with State Equation took 54104 ms to find 0 implicit places.
// Phase 1: matrix 3646 rows 2085 cols
[2021-05-17 10:43:32] [INFO ] Computed 41 place invariants in 21 ms
[2021-05-17 10:43:33] [INFO ] Dead Transitions using invariants and state equation in 1748 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2085/2113 places, 3646/3701 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-040-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s2005 s487), p1:(GT s1506 s1318)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2026 ms.
Product exploration explored 100000 steps with 50000 reset in 2040 ms.
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 2030 ms.
Product exploration explored 100000 steps with 50000 reset in 2066 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 2085 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2085/2085 places, 3646/3646 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 2085 transition count 3646
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 40 Pre rules applied. Total rules applied 160 place count 2085 transition count 3646
Deduced a syphon composed of 200 places in 1 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 200 place count 2085 transition count 3646
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 280 place count 2005 transition count 3566
Deduced a syphon composed of 120 places in 1 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 360 place count 2005 transition count 3566
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 280 places in 0 ms
Iterating global reduction 1 with 160 rules applied. Total rules applied 520 place count 2005 transition count 3566
Discarding 200 places :
Symmetric choice reduction at 1 with 200 rule applications. Total rules 720 place count 1805 transition count 3366
Deduced a syphon composed of 80 places in 1 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 920 place count 1805 transition count 3366
Deduced a syphon composed of 80 places in 0 ms
Applied a total of 920 rules in 459 ms. Remains 1805 /2085 variables (removed 280) and now considering 3366/3646 (removed 280) transitions.
[2021-05-17 10:43:42] [INFO ] Redundant transitions in 88 ms returned []
// Phase 1: matrix 3366 rows 1805 cols
[2021-05-17 10:43:42] [INFO ] Computed 41 place invariants in 23 ms
[2021-05-17 10:43:44] [INFO ] Dead Transitions using invariants and state equation in 1678 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1805/2085 places, 3366/3646 transitions.
Product exploration explored 100000 steps with 50000 reset in 2069 ms.
Product exploration explored 100000 steps with 50000 reset in 2034 ms.
[2021-05-17 10:43:48] [INFO ] Flatten gal took : 95 ms
[2021-05-17 10:43:48] [INFO ] Flatten gal took : 104 ms
[2021-05-17 10:43:49] [INFO ] Time to serialize gal into /tmp/LTL6323239566028427001.gal : 18 ms
[2021-05-17 10:43:49] [INFO ] Time to serialize properties into /tmp/LTL10449257581986965621.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/LTL6323239566028427001.gal, -t, CGAL, -LTL, /tmp/LTL10449257581986965621.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/LTL6323239566028427001.gal -t CGAL -LTL /tmp/LTL10449257581986965621.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((X("(Node37requestsent38<=Node0GiveAnswer3)"))||(("(Node37requestsent38<=Node0GiveAnswer3)")U(X(X("(Node25GiveAnswer6>Node20GiveAnswer14)")))))))
Formula 0 simplified : !F(X"(Node37requestsent38<=Node0GiveAnswer3)" | ("(Node37requestsent38<=Node0GiveAnswer3)" U XX"(Node25GiveAnswer6>Node20GiveAnswer14)"))
Detected timeout of ITS tools.
[2021-05-17 10:44:04] [INFO ] Flatten gal took : 100 ms
[2021-05-17 10:44:04] [INFO ] Applying decomposition
[2021-05-17 10:44:04] [INFO ] Flatten gal took : 103 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/graph4310370322977972850.txt, -o, /tmp/graph4310370322977972850.bin, -w, /tmp/graph4310370322977972850.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/graph4310370322977972850.bin, -l, -1, -v, -w, /tmp/graph4310370322977972850.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 10:44:04] [INFO ] Decomposing Gal with order
[2021-05-17 10:44:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 10:44:04] [INFO ] Removed a total of 3164 redundant transitions.
[2021-05-17 10:44:04] [INFO ] Flatten gal took : 365 ms
[2021-05-17 10:44:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 3036 labels/synchronizations in 180 ms.
[2021-05-17 10:44:05] [INFO ] Time to serialize gal into /tmp/LTL17018274755621206769.gal : 15 ms
[2021-05-17 10:44:05] [INFO ] Time to serialize properties into /tmp/LTL7276241568549524124.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/LTL17018274755621206769.gal, -t, CGAL, -LTL, /tmp/LTL7276241568549524124.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/LTL17018274755621206769.gal -t CGAL -LTL /tmp/LTL7276241568549524124.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((X("(gu177.Node37requestsent38<=gu177.Node0GiveAnswer3)"))||(("(gu177.Node37requestsent38<=gu177.Node0GiveAnswer3)")U(X(X("(gu176.Node25GiveAnswer6>gu176.Node20GiveAnswer14)")))))))
Formula 0 simplified : !F(X"(gu177.Node37requestsent38<=gu177.Node0GiveAnswer3)" | ("(gu177.Node37requestsent38<=gu177.Node0GiveAnswer3)" U XX"(gu176.Node25GiveAnswer6>gu176.Node20GiveAnswer14)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10805245754080693896
[2021-05-17 10:44:20] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10805245754080693896
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/ltsmin10805245754080693896]
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/ltsmin10805245754080693896] 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/ltsmin10805245754080693896] 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-040-09 finished in 103753 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 2113 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2113/2113 places, 3701/3701 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 2082 transition count 3640
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 2082 transition count 3640
Applied a total of 62 rules in 218 ms. Remains 2082 /2113 variables (removed 31) and now considering 3640/3701 (removed 61) transitions.
// Phase 1: matrix 3640 rows 2082 cols
[2021-05-17 10:44:21] [INFO ] Computed 41 place invariants in 28 ms
[2021-05-17 10:44:22] [INFO ] Implicit Places using invariants in 1029 ms returned []
// Phase 1: matrix 3640 rows 2082 cols
[2021-05-17 10:44:22] [INFO ] Computed 41 place invariants in 18 ms
[2021-05-17 10:44:24] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2021-05-17 10:44:54] [INFO ] Performed 1494/2082 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2021-05-17 10:45:07] [INFO ] Implicit Places using invariants and state equation in 44876 ms returned []
Implicit Place search using SMT with State Equation took 45915 ms to find 0 implicit places.
// Phase 1: matrix 3640 rows 2082 cols
[2021-05-17 10:45:07] [INFO ] Computed 41 place invariants in 18 ms
[2021-05-17 10:45:09] [INFO ] Dead Transitions using invariants and state equation in 1824 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2082/2113 places, 3640/3701 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : CANConstruction-PT-040-11 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 1 s896)], 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-040-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-11 finished in 48054 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&X((p1&&G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 2113 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2113/2113 places, 3701/3701 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 2086 transition count 3647
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 2086 transition count 3647
Applied a total of 54 rules in 188 ms. Remains 2086 /2113 variables (removed 27) and now considering 3647/3701 (removed 54) transitions.
// Phase 1: matrix 3647 rows 2086 cols
[2021-05-17 10:45:09] [INFO ] Computed 41 place invariants in 16 ms
[2021-05-17 10:45:10] [INFO ] Implicit Places using invariants in 1073 ms returned []
// Phase 1: matrix 3647 rows 2086 cols
[2021-05-17 10:45:10] [INFO ] Computed 41 place invariants in 16 ms
[2021-05-17 10:45:12] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2021-05-17 10:45:42] [INFO ] Performed 1398/2086 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2021-05-17 10:46:01] [INFO ] Implicit Places using invariants and state equation in 50475 ms returned []
Implicit Place search using SMT with State Equation took 51558 ms to find 0 implicit places.
// Phase 1: matrix 3647 rows 2086 cols
[2021-05-17 10:46:01] [INFO ] Computed 41 place invariants in 20 ms
[2021-05-17 10:46:02] [INFO ] Dead Transitions using invariants and state equation in 1682 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2086/2113 places, 3647/3701 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-040-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT s1686 s56), p1:(LEQ 1 s396), p2:(GT s944 s688)], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-040-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-13 finished in 53567 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 2113 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2113/2113 places, 3701/3701 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 2083 transition count 3642
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 2083 transition count 3642
Applied a total of 60 rules in 185 ms. Remains 2083 /2113 variables (removed 30) and now considering 3642/3701 (removed 59) transitions.
// Phase 1: matrix 3642 rows 2083 cols
[2021-05-17 10:46:03] [INFO ] Computed 41 place invariants in 18 ms
[2021-05-17 10:46:04] [INFO ] Implicit Places using invariants in 1089 ms returned []
// Phase 1: matrix 3642 rows 2083 cols
[2021-05-17 10:46:04] [INFO ] Computed 41 place invariants in 17 ms
[2021-05-17 10:46:05] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2021-05-17 10:46:35] [INFO ] Performed 1354/2083 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2021-05-17 10:46:53] [INFO ] Implicit Places using invariants and state equation in 49321 ms returned []
Implicit Place search using SMT with State Equation took 50419 ms to find 0 implicit places.
// Phase 1: matrix 3642 rows 2083 cols
[2021-05-17 10:46:53] [INFO ] Computed 41 place invariants in 17 ms
[2021-05-17 10:46:55] [INFO ] Dead Transitions using invariants and state equation in 1642 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2083/2113 places, 3642/3701 transitions.
Stuttering acceptance computed with spot in 486 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-040-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s1027 s1791)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2028 ms.
Product exploration explored 100000 steps with 50000 reset in 2039 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 2002 ms.
Product exploration explored 100000 steps with 50000 reset in 2016 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 2083 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2083/2083 places, 3642/3642 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 2083 transition count 3642
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 40 Pre rules applied. Total rules applied 160 place count 2083 transition count 3642
Deduced a syphon composed of 200 places in 1 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 200 place count 2083 transition count 3642
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 280 place count 2003 transition count 3562
Deduced a syphon composed of 120 places in 0 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 360 place count 2003 transition count 3562
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 280 places in 0 ms
Iterating global reduction 1 with 160 rules applied. Total rules applied 520 place count 2003 transition count 3562
Discarding 200 places :
Symmetric choice reduction at 1 with 200 rule applications. Total rules 720 place count 1803 transition count 3362
Deduced a syphon composed of 80 places in 1 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 920 place count 1803 transition count 3362
Deduced a syphon composed of 80 places in 1 ms
Applied a total of 920 rules in 446 ms. Remains 1803 /2083 variables (removed 280) and now considering 3362/3642 (removed 280) transitions.
[2021-05-17 10:47:06] [INFO ] Redundant transitions in 88 ms returned []
// Phase 1: matrix 3362 rows 1803 cols
[2021-05-17 10:47:06] [INFO ] Computed 41 place invariants in 23 ms
[2021-05-17 10:47:08] [INFO ] Dead Transitions using invariants and state equation in 1557 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1803/2083 places, 3362/3642 transitions.
Product exploration timeout after 71600 steps with 35800 reset in 10001 ms.
Product exploration timeout after 72950 steps with 36475 reset in 10001 ms.
[2021-05-17 10:47:28] [INFO ] Flatten gal took : 130 ms
[2021-05-17 10:47:28] [INFO ] Flatten gal took : 93 ms
[2021-05-17 10:47:29] [INFO ] Time to serialize gal into /tmp/LTL534599734762960351.gal : 604 ms
[2021-05-17 10:47:29] [INFO ] Time to serialize properties into /tmp/LTL9208898432216838962.ltl : 89 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/LTL534599734762960351.gal, -t, CGAL, -LTL, /tmp/LTL9208898432216838962.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/LTL534599734762960351.gal -t CGAL -LTL /tmp/LTL9208898432216838962.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(Node12GiveAnswer37<=Node32requestsent20)"))))
Formula 0 simplified : !XF"(Node12GiveAnswer37<=Node32requestsent20)"
Detected timeout of ITS tools.
[2021-05-17 10:47:44] [INFO ] Flatten gal took : 89 ms
[2021-05-17 10:47:44] [INFO ] Applying decomposition
[2021-05-17 10:47:44] [INFO ] Flatten gal took : 93 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/graph17811895173347330736.txt, -o, /tmp/graph17811895173347330736.bin, -w, /tmp/graph17811895173347330736.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/graph17811895173347330736.bin, -l, -1, -v, -w, /tmp/graph17811895173347330736.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 10:47:44] [INFO ] Decomposing Gal with order
[2021-05-17 10:47:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 10:47:44] [INFO ] Removed a total of 3158 redundant transitions.
[2021-05-17 10:47:44] [INFO ] Flatten gal took : 392 ms
[2021-05-17 10:47:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 3040 labels/synchronizations in 148 ms.
[2021-05-17 10:47:45] [INFO ] Time to serialize gal into /tmp/LTL6892980779623052400.gal : 14 ms
[2021-05-17 10:47:45] [INFO ] Time to serialize properties into /tmp/LTL6961543551381715987.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/LTL6892980779623052400.gal, -t, CGAL, -LTL, /tmp/LTL6961543551381715987.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/LTL6892980779623052400.gal -t CGAL -LTL /tmp/LTL6961543551381715987.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(gu178.Node12GiveAnswer37<=gu178.Node32requestsent20)"))))
Formula 0 simplified : !XF"(gu178.Node12GiveAnswer37<=gu178.Node32requestsent20)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2510519603579782661
[2021-05-17 10:48:00] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2510519603579782661
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/ltsmin2510519603579782661]
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/ltsmin2510519603579782661] 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/ltsmin2510519603579782661] 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-040-14 finished in 118318 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin159483405550136184
[2021-05-17 10:48:01] [INFO ] Too many transitions (3701) to apply POR reductions. Disabling POR matrices.
[2021-05-17 10:48:01] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin159483405550136184
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/ltsmin159483405550136184]
[2021-05-17 10:48:01] [INFO ] Applying decomposition
[2021-05-17 10:48:01] [INFO ] Flatten gal took : 97 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/graph8263953164349373620.txt, -o, /tmp/graph8263953164349373620.bin, -w, /tmp/graph8263953164349373620.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/graph8263953164349373620.bin, -l, -1, -v, -w, /tmp/graph8263953164349373620.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 10:48:01] [INFO ] Decomposing Gal with order
[2021-05-17 10:48:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 10:48:02] [INFO ] Removed a total of 3240 redundant transitions.
[2021-05-17 10:48:02] [INFO ] Flatten gal took : 393 ms
[2021-05-17 10:48:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 3038 labels/synchronizations in 154 ms.
[2021-05-17 10:48:02] [INFO ] Time to serialize gal into /tmp/LTLCardinality9932660300120179144.gal : 13 ms
[2021-05-17 10:48:02] [INFO ] Time to serialize properties into /tmp/LTLCardinality17056924276931686473.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/LTLCardinality9932660300120179144.gal, -t, CGAL, -LTL, /tmp/LTLCardinality17056924276931686473.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/LTLCardinality9932660300120179144.gal -t CGAL -LTL /tmp/LTLCardinality17056924276931686473.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 3 LTL properties
Checking formula 0 : !((X(("(((gu214.Node38requestsent16<=gu214.Node35GiveAnswer7)||(gu213.Node35GiveAnswer5<=gu213.Node0requestsent36))||(gu211.Node30requestsent9<=gu211.Node12GiveAnswer31))")||(X(G("((gu211.Node30requestsent9<=gu211.Node12GiveAnswer31)||(gi0.gi1.gu142.Node4GiveAnswer28>=2))"))))))
Formula 0 simplified : !X("(((gu214.Node38requestsent16<=gu214.Node35GiveAnswer7)||(gu213.Node35GiveAnswer5<=gu213.Node0requestsent36))||(gu211.Node30requestsent9<=gu211.Node12GiveAnswer31))" | XG"((gu211.Node30requestsent9<=gu211.Node12GiveAnswer31)||(gi0.gi1.gu142.Node4GiveAnswer28>=2))")
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/ltsmin159483405550136184] killed by timeout after 25 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/ltsmin159483405550136184] killed by timeout after 25 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-17 11:13:04] [INFO ] Flatten gal took : 398 ms
[2021-05-17 11:13:04] [INFO ] Time to serialize gal into /tmp/LTLCardinality8428037085643758493.gal : 62 ms
[2021-05-17 11:13:04] [INFO ] Time to serialize properties into /tmp/LTLCardinality7304379577473331410.ltl : 8 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/LTLCardinality8428037085643758493.gal, -t, CGAL, -LTL, /tmp/LTLCardinality7304379577473331410.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/LTLCardinality8428037085643758493.gal -t CGAL -LTL /tmp/LTLCardinality7304379577473331410.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 3 LTL properties
Checking formula 0 : !((X(("(((Node38requestsent16<=Node35GiveAnswer7)||(Node35GiveAnswer5<=Node0requestsent36))||(Node30requestsent9<=Node12GiveAnswer31))")||(X(G("((Node30requestsent9<=Node12GiveAnswer31)||(Node4GiveAnswer28>=2))"))))))
Formula 0 simplified : !X("(((Node38requestsent16<=Node35GiveAnswer7)||(Node35GiveAnswer5<=Node0requestsent36))||(Node30requestsent9<=Node12GiveAnswer31))" | XG"((Node30requestsent9<=Node12GiveAnswer31)||(Node4GiveAnswer28>=2))")

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
+ [[ 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-040"
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-040, 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-162124155800036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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