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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.8M
-rw-r--r-- 1 mcc users 29K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 158K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 119K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 12 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 12 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 12 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 12 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 4.0K May 11 18:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 11 18:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 11 15:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 4.3M 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-030-00
FORMULA_NAME CANConstruction-PT-030-01
FORMULA_NAME CANConstruction-PT-030-02
FORMULA_NAME CANConstruction-PT-030-03
FORMULA_NAME CANConstruction-PT-030-04
FORMULA_NAME CANConstruction-PT-030-05
FORMULA_NAME CANConstruction-PT-030-06
FORMULA_NAME CANConstruction-PT-030-07
FORMULA_NAME CANConstruction-PT-030-08
FORMULA_NAME CANConstruction-PT-030-09
FORMULA_NAME CANConstruction-PT-030-10
FORMULA_NAME CANConstruction-PT-030-11
FORMULA_NAME CANConstruction-PT-030-12
FORMULA_NAME CANConstruction-PT-030-13
FORMULA_NAME CANConstruction-PT-030-14
FORMULA_NAME CANConstruction-PT-030-15

=== Now, execution of the tool begins

BK_START 1621246569763

Running Version 0
[2021-05-17 10:16:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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:16:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 10:16:11] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2021-05-17 10:16:11] [INFO ] Transformed 2162 places.
[2021-05-17 10:16:11] [INFO ] Transformed 3840 transitions.
[2021-05-17 10:16:11] [INFO ] Parsed PT model containing 2162 places and 3840 transitions in 274 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 10:16:11] [INFO ] Initial state test concluded for 1 properties.
FORMULA CANConstruction-PT-030-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 2162 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2162/2162 places, 3840/3840 transitions.
Discarding 829 places :
Symmetric choice reduction at 0 with 829 rule applications. Total rules 829 place count 1333 transition count 2182
Iterating global reduction 0 with 829 rules applied. Total rules applied 1658 place count 1333 transition count 2182
Applied a total of 1658 rules in 292 ms. Remains 1333 /2162 variables (removed 829) and now considering 2182/3840 (removed 1658) transitions.
// Phase 1: matrix 2182 rows 1333 cols
[2021-05-17 10:16:12] [INFO ] Computed 61 place invariants in 50 ms
[2021-05-17 10:16:12] [INFO ] Implicit Places using invariants in 823 ms returned [12, 26, 40, 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]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 855 ms to find 29 implicit places.
// Phase 1: matrix 2182 rows 1304 cols
[2021-05-17 10:16:13] [INFO ] Computed 32 place invariants in 16 ms
[2021-05-17 10:16:14] [INFO ] Dead Transitions using invariants and state equation in 1039 ms returned []
Starting structural reductions, iteration 1 : 1304/2162 places, 2182/3840 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 1275 transition count 2153
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 1275 transition count 2153
Applied a total of 58 rules in 193 ms. Remains 1275 /1304 variables (removed 29) and now considering 2153/2182 (removed 29) transitions.
// Phase 1: matrix 2153 rows 1275 cols
[2021-05-17 10:16:14] [INFO ] Computed 32 place invariants in 9 ms
[2021-05-17 10:16:14] [INFO ] Implicit Places using invariants in 652 ms returned []
// Phase 1: matrix 2153 rows 1275 cols
[2021-05-17 10:16:14] [INFO ] Computed 32 place invariants in 9 ms
[2021-05-17 10:16:15] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2021-05-17 10:16:24] [INFO ] Implicit Places using invariants and state equation in 9506 ms returned []
Implicit Place search using SMT with State Equation took 10160 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1275/2162 places, 2153/3840 transitions.
[2021-05-17 10:16:24] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 10:16:24] [INFO ] Flatten gal took : 159 ms
FORMULA CANConstruction-PT-030-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-030-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 10:16:24] [INFO ] Flatten gal took : 119 ms
[2021-05-17 10:16:25] [INFO ] Input system was already deterministic with 2153 transitions.
Incomplete random walk after 100000 steps, including 193 resets, run finished after 704 ms. (steps per millisecond=142 ) properties (out of 28) seen :26
Running SMT prover for 2 properties.
// Phase 1: matrix 2153 rows 1275 cols
[2021-05-17 10:16:25] [INFO ] Computed 32 place invariants in 9 ms
[2021-05-17 10:16:25] [INFO ] [Real]Absence check using 31 positive place invariants in 25 ms returned sat
[2021-05-17 10:16:25] [INFO ] [Real]Absence check using 31 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-17 10:16:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 10:16:26] [INFO ] [Real]Absence check using state equation in 498 ms returned sat
[2021-05-17 10:16:26] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2021-05-17 10:16:26] [INFO ] [Real]Added 1770 Read/Feed constraints in 118 ms returned unsat
[2021-05-17 10:16:26] [INFO ] [Real]Absence check using 31 positive place invariants in 22 ms returned sat
[2021-05-17 10:16:26] [INFO ] [Real]Absence check using 31 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-17 10:16:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 10:16:27] [INFO ] [Real]Absence check using state equation in 534 ms returned sat
[2021-05-17 10:16:27] [INFO ] [Real]Added 1770 Read/Feed constraints in 119 ms returned sat
[2021-05-17 10:16:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 10:16:27] [INFO ] [Nat]Absence check using 31 positive place invariants in 23 ms returned sat
[2021-05-17 10:16:27] [INFO ] [Nat]Absence check using 31 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-17 10:16:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 10:16:28] [INFO ] [Nat]Absence check using state equation in 550 ms returned sat
[2021-05-17 10:16:28] [INFO ] [Nat]Added 1770 Read/Feed constraints in 150 ms returned sat
[2021-05-17 10:16:28] [INFO ] Computed and/alt/rep : 2033/3914/2033 causal constraints (skipped 90 transitions) in 100 ms.
[2021-05-17 10:16:47] [INFO ] Added : 820 causal constraints over 164 iterations in 18886 ms. Result :unknown
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA CANConstruction-PT-030-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1275 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1275/1275 places, 2153/2153 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1264 transition count 2131
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1264 transition count 2131
Applied a total of 22 rules in 148 ms. Remains 1264 /1275 variables (removed 11) and now considering 2131/2153 (removed 22) transitions.
// Phase 1: matrix 2131 rows 1264 cols
[2021-05-17 10:16:47] [INFO ] Computed 32 place invariants in 11 ms
[2021-05-17 10:16:48] [INFO ] Implicit Places using invariants in 606 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 610 ms to find 1 implicit places.
// Phase 1: matrix 2131 rows 1263 cols
[2021-05-17 10:16:48] [INFO ] Computed 31 place invariants in 11 ms
[2021-05-17 10:16:49] [INFO ] Dead Transitions using invariants and state equation in 986 ms returned []
Starting structural reductions, iteration 1 : 1263/1275 places, 2131/2153 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1262 transition count 2130
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1262 transition count 2130
Applied a total of 2 rules in 71 ms. Remains 1262 /1263 variables (removed 1) and now considering 2130/2131 (removed 1) transitions.
// Phase 1: matrix 2130 rows 1262 cols
[2021-05-17 10:16:49] [INFO ] Computed 31 place invariants in 20 ms
[2021-05-17 10:16:50] [INFO ] Implicit Places using invariants in 630 ms returned []
// Phase 1: matrix 2130 rows 1262 cols
[2021-05-17 10:16:50] [INFO ] Computed 31 place invariants in 8 ms
[2021-05-17 10:16:50] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2021-05-17 10:17:02] [INFO ] Implicit Places using invariants and state equation in 12810 ms returned []
Implicit Place search using SMT with State Equation took 13442 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1262/1275 places, 2130/2153 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-030-00 automaton TGBA [mat=[[{ cond=(NOT p1), 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: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LT s106 1), p0:(OR (LT s90 1) (LT s1008 1))], 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][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 804 ms.
Product exploration explored 100000 steps with 33333 reset in 690 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 33333 reset in 673 ms.
Product exploration explored 100000 steps with 33333 reset in 666 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 1262 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1262/1262 places, 2130/2130 transitions.
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 1262 transition count 2130
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 30 Pre rules applied. Total rules applied 119 place count 1262 transition count 2130
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 149 place count 1262 transition count 2130
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 208 place count 1203 transition count 2071
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 59 rules applied. Total rules applied 267 place count 1203 transition count 2071
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 208 places in 2 ms
Iterating global reduction 1 with 118 rules applied. Total rules applied 385 place count 1203 transition count 2071
Discarding 147 places :
Symmetric choice reduction at 1 with 147 rule applications. Total rules 532 place count 1056 transition count 1924
Deduced a syphon composed of 61 places in 1 ms
Iterating global reduction 1 with 147 rules applied. Total rules applied 679 place count 1056 transition count 1924
Deduced a syphon composed of 61 places in 1 ms
Applied a total of 679 rules in 571 ms. Remains 1056 /1262 variables (removed 206) and now considering 1924/2130 (removed 206) transitions.
[2021-05-17 10:17:07] [INFO ] Redundant transitions in 122 ms returned []
// Phase 1: matrix 1924 rows 1056 cols
[2021-05-17 10:17:07] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-17 10:17:07] [INFO ] Dead Transitions using invariants and state equation in 831 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1056/1262 places, 1924/2130 transitions.
Product exploration explored 100000 steps with 33333 reset in 4601 ms.
Product exploration explored 100000 steps with 33333 reset in 4542 ms.
[2021-05-17 10:17:17] [INFO ] Flatten gal took : 75 ms
[2021-05-17 10:17:17] [INFO ] Flatten gal took : 77 ms
[2021-05-17 10:17:17] [INFO ] Time to serialize gal into /tmp/LTL7095773549345750679.gal : 44 ms
[2021-05-17 10:17:17] [INFO ] Time to serialize properties into /tmp/LTL5235858760364566573.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/LTL7095773549345750679.gal, -t, CGAL, -LTL, /tmp/LTL5235858760364566573.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/LTL7095773549345750679.gal -t CGAL -LTL /tmp/LTL5235858760364566573.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G("((Node7IsInserted<1)||(Node21requestsent7<1))"))||(X(F("(Node8JoinMsg<1)"))))))
Formula 0 simplified : !X(G"((Node7IsInserted<1)||(Node21requestsent7<1))" | XF"(Node8JoinMsg<1)")
Detected timeout of ITS tools.
[2021-05-17 10:17:32] [INFO ] Flatten gal took : 65 ms
[2021-05-17 10:17:32] [INFO ] Applying decomposition
[2021-05-17 10:17:32] [INFO ] Flatten gal took : 63 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/graph12095567841528233421.txt, -o, /tmp/graph12095567841528233421.bin, -w, /tmp/graph12095567841528233421.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/graph12095567841528233421.bin, -l, -1, -v, -w, /tmp/graph12095567841528233421.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 10:17:32] [INFO ] Decomposing Gal with order
[2021-05-17 10:17:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 10:17:33] [INFO ] Removed a total of 1823 redundant transitions.
[2021-05-17 10:17:33] [INFO ] Flatten gal took : 485 ms
[2021-05-17 10:17:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 3476 labels/synchronizations in 153 ms.
[2021-05-17 10:17:33] [INFO ] Time to serialize gal into /tmp/LTL17260091650235225658.gal : 17 ms
[2021-05-17 10:17:33] [INFO ] Time to serialize properties into /tmp/LTL4902649735687656797.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/LTL17260091650235225658.gal, -t, CGAL, -LTL, /tmp/LTL4902649735687656797.ltl, -c, -stutter-deadlock], 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/LTL17260091650235225658.gal -t CGAL -LTL /tmp/LTL4902649735687656797.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((G("((i7.u31.Node7IsInserted<1)||(i21.u100.Node21requestsent7<1))"))||(X(F("(i8.u38.Node8JoinMsg<1)"))))))
Formula 0 simplified : !X(G"((i7.u31.Node7IsInserted<1)||(i21.u100.Node21requestsent7<1))" | XF"(i8.u38.Node8JoinMsg<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17100699983572665751
[2021-05-17 10:17:48] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17100699983572665751
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/ltsmin17100699983572665751]
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/ltsmin17100699983572665751] 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/ltsmin17100699983572665751] 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-030-00 finished in 62093 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F(p0)) U (p1||G(p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1275 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1275/1275 places, 2153/2153 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 1275 transition count 1954
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1076 transition count 1954
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 398 place count 1076 transition count 1925
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 456 place count 1047 transition count 1925
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 467 place count 1036 transition count 1903
Iterating global reduction 2 with 11 rules applied. Total rules applied 478 place count 1036 transition count 1903
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 9 rules applied. Total rules applied 487 place count 1036 transition count 1894
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 496 place count 1027 transition count 1894
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 552 place count 999 transition count 1866
Applied a total of 552 rules in 286 ms. Remains 999 /1275 variables (removed 276) and now considering 1866/2153 (removed 287) transitions.
// Phase 1: matrix 1866 rows 999 cols
[2021-05-17 10:17:50] [INFO ] Computed 32 place invariants in 7 ms
[2021-05-17 10:17:50] [INFO ] Implicit Places using invariants in 675 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 677 ms to find 1 implicit places.
[2021-05-17 10:17:50] [INFO ] Redundant transitions in 44 ms returned []
// Phase 1: matrix 1866 rows 998 cols
[2021-05-17 10:17:50] [INFO ] Computed 31 place invariants in 17 ms
[2021-05-17 10:17:51] [INFO ] Dead Transitions using invariants and state equation in 804 ms returned []
Starting structural reductions, iteration 1 : 998/1275 places, 1866/2153 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 998 transition count 1864
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 996 transition count 1864
Applied a total of 4 rules in 89 ms. Remains 996 /998 variables (removed 2) and now considering 1864/1866 (removed 2) transitions.
// Phase 1: matrix 1864 rows 996 cols
[2021-05-17 10:17:51] [INFO ] Computed 31 place invariants in 7 ms
[2021-05-17 10:17:52] [INFO ] Implicit Places using invariants in 515 ms returned []
// Phase 1: matrix 1864 rows 996 cols
[2021-05-17 10:17:52] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-17 10:17:52] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2021-05-17 10:18:01] [INFO ] Implicit Places using invariants and state equation in 9513 ms returned []
Implicit Place search using SMT with State Equation took 10029 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 996/1275 places, 1864/2153 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-01 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s16 1) (GEQ s80 1)), p0:(AND (GEQ s30 1) (GEQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 252 steps with 1 reset in 2 ms.
FORMULA CANConstruction-PT-030-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-01 finished in 12049 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0&&(p0 U p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1275 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1275/1275 places, 2153/2153 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1275 transition count 1953
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1075 transition count 1953
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 400 place count 1075 transition count 1924
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 458 place count 1046 transition count 1924
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 468 place count 1036 transition count 1904
Iterating global reduction 2 with 10 rules applied. Total rules applied 478 place count 1036 transition count 1904
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 8 rules applied. Total rules applied 486 place count 1036 transition count 1896
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 494 place count 1028 transition count 1896
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 554 place count 998 transition count 1866
Applied a total of 554 rules in 146 ms. Remains 998 /1275 variables (removed 277) and now considering 1866/2153 (removed 287) transitions.
// Phase 1: matrix 1866 rows 998 cols
[2021-05-17 10:18:01] [INFO ] Computed 32 place invariants in 12 ms
[2021-05-17 10:18:02] [INFO ] Implicit Places using invariants in 493 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 495 ms to find 1 implicit places.
[2021-05-17 10:18:02] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 1866 rows 997 cols
[2021-05-17 10:18:02] [INFO ] Computed 31 place invariants in 8 ms
[2021-05-17 10:18:03] [INFO ] Dead Transitions using invariants and state equation in 783 ms returned []
Starting structural reductions, iteration 1 : 997/1275 places, 1866/2153 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 997 transition count 1864
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 995 transition count 1864
Applied a total of 4 rules in 77 ms. Remains 995 /997 variables (removed 2) and now considering 1864/1866 (removed 2) transitions.
// Phase 1: matrix 1864 rows 995 cols
[2021-05-17 10:18:03] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-17 10:18:03] [INFO ] Implicit Places using invariants in 573 ms returned []
// Phase 1: matrix 1864 rows 995 cols
[2021-05-17 10:18:03] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-17 10:18:04] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2021-05-17 10:18:14] [INFO ] Implicit Places using invariants and state equation in 10276 ms returned []
Implicit Place search using SMT with State Equation took 10850 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 995/1275 places, 1864/2153 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-030-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s377 1), p1:(AND (GEQ s20 1) (GEQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 228 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-030-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-03 finished in 12501 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 2 out of 1275 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1275/1275 places, 2153/2153 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1275 transition count 1953
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1075 transition count 1953
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 400 place count 1075 transition count 1924
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 458 place count 1046 transition count 1924
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 468 place count 1036 transition count 1904
Iterating global reduction 2 with 10 rules applied. Total rules applied 478 place count 1036 transition count 1904
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 2 with 7 rules applied. Total rules applied 485 place count 1036 transition count 1897
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 492 place count 1029 transition count 1897
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 554 place count 998 transition count 1866
Applied a total of 554 rules in 138 ms. Remains 998 /1275 variables (removed 277) and now considering 1866/2153 (removed 287) transitions.
// Phase 1: matrix 1866 rows 998 cols
[2021-05-17 10:18:14] [INFO ] Computed 32 place invariants in 10 ms
[2021-05-17 10:18:15] [INFO ] Implicit Places using invariants in 540 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 544 ms to find 1 implicit places.
[2021-05-17 10:18:15] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 1866 rows 997 cols
[2021-05-17 10:18:15] [INFO ] Computed 31 place invariants in 8 ms
[2021-05-17 10:18:15] [INFO ] Dead Transitions using invariants and state equation in 828 ms returned []
Starting structural reductions, iteration 1 : 997/1275 places, 1866/2153 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 997 transition count 1864
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 995 transition count 1864
Applied a total of 4 rules in 52 ms. Remains 995 /997 variables (removed 2) and now considering 1864/1866 (removed 2) transitions.
// Phase 1: matrix 1864 rows 995 cols
[2021-05-17 10:18:15] [INFO ] Computed 31 place invariants in 8 ms
[2021-05-17 10:18:16] [INFO ] Implicit Places using invariants in 561 ms returned []
// Phase 1: matrix 1864 rows 995 cols
[2021-05-17 10:18:16] [INFO ] Computed 31 place invariants in 8 ms
[2021-05-17 10:18:17] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2021-05-17 10:18:26] [INFO ] Implicit Places using invariants and state equation in 10216 ms returned []
Implicit Place search using SMT with State Equation took 10779 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 995/1275 places, 1864/2153 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-030-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:(GEQ s84 1), p1:(LT s936 1)], 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 486 reset in 653 ms.
Stack based approach found an accepted trace after 84197 steps with 417 reset with depth 98 and stack size 98 in 654 ms.
FORMULA CANConstruction-PT-030-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-05 finished in 13756 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(X(p0))||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1275 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1275/1275 places, 2153/2153 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1265 transition count 2133
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1265 transition count 2133
Applied a total of 20 rules in 65 ms. Remains 1265 /1275 variables (removed 10) and now considering 2133/2153 (removed 20) transitions.
// Phase 1: matrix 2133 rows 1265 cols
[2021-05-17 10:18:29] [INFO ] Computed 32 place invariants in 7 ms
[2021-05-17 10:18:30] [INFO ] Implicit Places using invariants in 631 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 633 ms to find 1 implicit places.
// Phase 1: matrix 2133 rows 1264 cols
[2021-05-17 10:18:30] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-17 10:18:31] [INFO ] Dead Transitions using invariants and state equation in 876 ms returned []
Starting structural reductions, iteration 1 : 1264/1275 places, 2133/2153 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1263 transition count 2132
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1263 transition count 2132
Applied a total of 2 rules in 64 ms. Remains 1263 /1264 variables (removed 1) and now considering 2132/2133 (removed 1) transitions.
// Phase 1: matrix 2132 rows 1263 cols
[2021-05-17 10:18:31] [INFO ] Computed 31 place invariants in 8 ms
[2021-05-17 10:18:31] [INFO ] Implicit Places using invariants in 616 ms returned []
// Phase 1: matrix 2132 rows 1263 cols
[2021-05-17 10:18:31] [INFO ] Computed 31 place invariants in 7 ms
[2021-05-17 10:18:32] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2021-05-17 10:18:46] [INFO ] Implicit Places using invariants and state equation in 14398 ms returned []
Implicit Place search using SMT with State Equation took 15024 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1263/1275 places, 2132/2153 transitions.
Stuttering acceptance computed with spot in 1822 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-030-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 2}, { cond=(NOT p1), acceptance={} source=6 dest: 4}], [{ cond=(NOT p1), acceptance={} source=7 dest: 5}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=1, aps=[p0:(LT s1185 1), p1:(AND (GEQ s1185 1) (GEQ s6 1) (GEQ s131 1))], 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, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 513 ms.
Product exploration explored 100000 steps with 25000 reset in 535 ms.
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 514 ms.
Product exploration explored 100000 steps with 25000 reset in 531 ms.
Applying partial POR strategy [true, false, false, true, false, true, false, true]
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 1263 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1263/1263 places, 2132/2132 transitions.
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 1263 transition count 2132
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 31 Pre rules applied. Total rules applied 119 place count 1263 transition count 2132
Deduced a syphon composed of 150 places in 0 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 150 place count 1263 transition count 2132
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 210 place count 1203 transition count 2072
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 270 place count 1203 transition count 2072
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 208 places in 1 ms
Iterating global reduction 1 with 118 rules applied. Total rules applied 388 place count 1203 transition count 2072
Discarding 147 places :
Symmetric choice reduction at 1 with 147 rule applications. Total rules 535 place count 1056 transition count 1925
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 1 with 147 rules applied. Total rules applied 682 place count 1056 transition count 1925
Deduced a syphon composed of 61 places in 0 ms
Applied a total of 682 rules in 176 ms. Remains 1056 /1263 variables (removed 207) and now considering 1925/2132 (removed 207) transitions.
[2021-05-17 10:18:50] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 1925 rows 1056 cols
[2021-05-17 10:18:50] [INFO ] Computed 31 place invariants in 8 ms
[2021-05-17 10:18:51] [INFO ] Dead Transitions using invariants and state equation in 855 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1056/1263 places, 1925/2132 transitions.
Product exploration explored 100000 steps with 25000 reset in 3549 ms.
Product exploration explored 100000 steps with 25000 reset in 3510 ms.
[2021-05-17 10:18:59] [INFO ] Flatten gal took : 60 ms
[2021-05-17 10:18:59] [INFO ] Flatten gal took : 66 ms
[2021-05-17 10:19:03] [INFO ] Time to serialize gal into /tmp/LTL6110249418627071218.gal : 4230 ms
[2021-05-17 10:19:03] [INFO ] Time to serialize properties into /tmp/LTL15842025680329976724.ltl : 108 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/LTL6110249418627071218.gal, -t, CGAL, -LTL, /tmp/LTL15842025680329976724.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/LTL6110249418627071218.gal -t CGAL -LTL /tmp/LTL15842025680329976724.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X(X("(Node27GiveAnswer9<1)")))||(G("(((Node27GiveAnswer9>=1)&&(Node0IsInserted>=1))&&(Node10Request>=1))")))))
Formula 0 simplified : !X(XX"(Node27GiveAnswer9<1)" | G"(((Node27GiveAnswer9>=1)&&(Node0IsInserted>=1))&&(Node10Request>=1))")
Detected timeout of ITS tools.
[2021-05-17 10:19:18] [INFO ] Flatten gal took : 54 ms
[2021-05-17 10:19:18] [INFO ] Applying decomposition
[2021-05-17 10:19:18] [INFO ] Flatten gal took : 56 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/graph13806368590964556463.txt, -o, /tmp/graph13806368590964556463.bin, -w, /tmp/graph13806368590964556463.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/graph13806368590964556463.bin, -l, -1, -v, -w, /tmp/graph13806368590964556463.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 10:19:18] [INFO ] Decomposing Gal with order
[2021-05-17 10:19:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 10:19:18] [INFO ] Removed a total of 1821 redundant transitions.
[2021-05-17 10:19:18] [INFO ] Flatten gal took : 210 ms
[2021-05-17 10:19:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 3524 labels/synchronizations in 170 ms.
[2021-05-17 10:19:19] [INFO ] Time to serialize gal into /tmp/LTL18387628123700684017.gal : 10 ms
[2021-05-17 10:19:19] [INFO ] Time to serialize properties into /tmp/LTL9496504326165275943.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/LTL18387628123700684017.gal, -t, CGAL, -LTL, /tmp/LTL9496504326165275943.ltl, -c, -stutter-deadlock], 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/LTL18387628123700684017.gal -t CGAL -LTL /tmp/LTL9496504326165275943.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((X(X("(i9.u39.Node27GiveAnswer9<1)")))||(G("(((i9.u39.Node27GiveAnswer9>=1)&&(i0.u0.Node0IsInserted>=1))&&(i10.i0.u47.Node10Request>=1))")))))
Formula 0 simplified : !X(XX"(i9.u39.Node27GiveAnswer9<1)" | G"(((i9.u39.Node27GiveAnswer9>=1)&&(i0.u0.Node0IsInserted>=1))&&(i10.i0.u47.Node10Request>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4844332861682794641
[2021-05-17 10:19:34] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4844332861682794641
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/ltsmin4844332861682794641]
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/ltsmin4844332861682794641] 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/ltsmin4844332861682794641] 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-030-06 finished in 67169 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(G(p0))||(F(G(p0))&&p1)) U X(p2)))], workingDir=/home/mcc/execution]
Support contains 4 out of 1275 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1275/1275 places, 2153/2153 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1266 transition count 2135
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1266 transition count 2135
Applied a total of 18 rules in 62 ms. Remains 1266 /1275 variables (removed 9) and now considering 2135/2153 (removed 18) transitions.
// Phase 1: matrix 2135 rows 1266 cols
[2021-05-17 10:19:35] [INFO ] Computed 32 place invariants in 7 ms
[2021-05-17 10:19:35] [INFO ] Implicit Places using invariants in 622 ms returned []
// Phase 1: matrix 2135 rows 1266 cols
[2021-05-17 10:19:35] [INFO ] Computed 32 place invariants in 7 ms
[2021-05-17 10:19:36] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2021-05-17 10:19:49] [INFO ] Implicit Places using invariants and state equation in 13194 ms returned []
Implicit Place search using SMT with State Equation took 13817 ms to find 0 implicit places.
// Phase 1: matrix 2135 rows 1266 cols
[2021-05-17 10:19:49] [INFO ] Computed 32 place invariants in 8 ms
[2021-05-17 10:19:50] [INFO ] Dead Transitions using invariants and state equation in 941 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1266/1275 places, 2135/2153 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), true, (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-07 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s48 1) (GEQ s50 1)), p2:(GEQ s455 1), p0:(GEQ s835 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-030-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-07 finished in 15034 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(p0)||(p1 U (p2||G(p1))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1275 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1275/1275 places, 2153/2153 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1265 transition count 2133
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1265 transition count 2133
Applied a total of 20 rules in 65 ms. Remains 1265 /1275 variables (removed 10) and now considering 2133/2153 (removed 20) transitions.
// Phase 1: matrix 2133 rows 1265 cols
[2021-05-17 10:19:50] [INFO ] Computed 32 place invariants in 8 ms
[2021-05-17 10:19:50] [INFO ] Implicit Places using invariants in 600 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 601 ms to find 1 implicit places.
// Phase 1: matrix 2133 rows 1264 cols
[2021-05-17 10:19:50] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-17 10:19:51] [INFO ] Dead Transitions using invariants and state equation in 992 ms returned []
Starting structural reductions, iteration 1 : 1264/1275 places, 2133/2153 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1263 transition count 2132
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1263 transition count 2132
Applied a total of 2 rules in 73 ms. Remains 1263 /1264 variables (removed 1) and now considering 2132/2133 (removed 1) transitions.
// Phase 1: matrix 2132 rows 1263 cols
[2021-05-17 10:19:52] [INFO ] Computed 31 place invariants in 7 ms
[2021-05-17 10:19:52] [INFO ] Implicit Places using invariants in 565 ms returned []
// Phase 1: matrix 2132 rows 1263 cols
[2021-05-17 10:19:52] [INFO ] Computed 31 place invariants in 8 ms
[2021-05-17 10:19:53] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2021-05-17 10:20:05] [INFO ] Implicit Places using invariants and state equation in 13084 ms returned []
Implicit Place search using SMT with State Equation took 13650 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1263/1275 places, 2132/2153 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : CANConstruction-PT-030-08 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (OR (LT s299 1) (LT s306 1)) (LT s1150 1)), p1:(LT s1150 1), p0:(OR (LT s354 1) (LT s884 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 189 reset in 445 ms.
Product exploration explored 100000 steps with 184 reset in 487 ms.
Knowledge obtained : [p2, p1, p0]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), true]
Product exploration explored 100000 steps with 192 reset in 467 ms.
Product exploration explored 100000 steps with 186 reset in 478 ms.
[2021-05-17 10:20:08] [INFO ] Flatten gal took : 49 ms
[2021-05-17 10:20:08] [INFO ] Flatten gal took : 51 ms
[2021-05-17 10:20:08] [INFO ] Time to serialize gal into /tmp/LTL6460571725370259412.gal : 7 ms
[2021-05-17 10:20:08] [INFO ] Time to serialize properties into /tmp/LTL11329127917679229840.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/LTL6460571725370259412.gal, -t, CGAL, -LTL, /tmp/LTL11329127917679229840.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/LTL6460571725370259412.gal -t CGAL -LTL /tmp/LTL11329127917679229840.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((X("((Node29IsInserted<1)||(Node16requestsent29<1))"))||(("(Node26GiveAnswer3<1)")U(("(((Node24Request<1)||(Node25IsInserted<1))&&(Node26GiveAnswer3<1))")||(G("(Node26GiveAnswer3<1)")))))))
Formula 0 simplified : !G(X"((Node29IsInserted<1)||(Node16requestsent29<1))" | ("(Node26GiveAnswer3<1)" U ("(((Node24Request<1)||(Node25IsInserted<1))&&(Node26GiveAnswer3<1))" | G"(Node26GiveAnswer3<1)")))
Detected timeout of ITS tools.
[2021-05-17 10:20:23] [INFO ] Flatten gal took : 55 ms
[2021-05-17 10:20:23] [INFO ] Applying decomposition
[2021-05-17 10:20:23] [INFO ] Flatten gal took : 51 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/graph11959134153459687147.txt, -o, /tmp/graph11959134153459687147.bin, -w, /tmp/graph11959134153459687147.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/graph11959134153459687147.bin, -l, -1, -v, -w, /tmp/graph11959134153459687147.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 10:20:23] [INFO ] Decomposing Gal with order
[2021-05-17 10:20:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 10:20:23] [INFO ] Removed a total of 1824 redundant transitions.
[2021-05-17 10:20:23] [INFO ] Flatten gal took : 181 ms
[2021-05-17 10:20:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 3476 labels/synchronizations in 76 ms.
[2021-05-17 10:20:23] [INFO ] Time to serialize gal into /tmp/LTL15285683761973496962.gal : 12 ms
[2021-05-17 10:20:23] [INFO ] Time to serialize properties into /tmp/LTL84494784788299031.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/LTL15285683761973496962.gal, -t, CGAL, -LTL, /tmp/LTL84494784788299031.ltl, -c, -stutter-deadlock], 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/LTL15285683761973496962.gal -t CGAL -LTL /tmp/LTL84494784788299031.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((X("((i29.u132.Node29IsInserted<1)||(i16.u77.Node16requestsent29<1))"))||(("(i3.u17.Node26GiveAnswer3<1)")U(("(((i24.u112.Node24Request<1)||(i25.u114.Node25IsInserted<1))&&(i3.u17.Node26GiveAnswer3<1))")||(G("(i3.u17.Node26GiveAnswer3<1)")))))))
Formula 0 simplified : !G(X"((i29.u132.Node29IsInserted<1)||(i16.u77.Node16requestsent29<1))" | ("(i3.u17.Node26GiveAnswer3<1)" U ("(((i24.u112.Node24Request<1)||(i25.u114.Node25IsInserted<1))&&(i3.u17.Node26GiveAnswer3<1))" | G"(i3.u17.Node26GiveAnswer3<1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6621705442775266803
[2021-05-17 10:20:38] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6621705442775266803
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/ltsmin6621705442775266803]
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/ltsmin6621705442775266803] 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/ltsmin6621705442775266803] 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-030-08 finished in 49577 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1275 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1275/1275 places, 2153/2153 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1266 transition count 2135
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1266 transition count 2135
Applied a total of 18 rules in 80 ms. Remains 1266 /1275 variables (removed 9) and now considering 2135/2153 (removed 18) transitions.
// Phase 1: matrix 2135 rows 1266 cols
[2021-05-17 10:20:39] [INFO ] Computed 32 place invariants in 8 ms
[2021-05-17 10:20:40] [INFO ] Implicit Places using invariants in 677 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 689 ms to find 1 implicit places.
// Phase 1: matrix 2135 rows 1265 cols
[2021-05-17 10:20:40] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-17 10:20:41] [INFO ] Dead Transitions using invariants and state equation in 1196 ms returned []
Starting structural reductions, iteration 1 : 1265/1275 places, 2135/2153 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1264 transition count 2134
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1264 transition count 2134
Applied a total of 2 rules in 64 ms. Remains 1264 /1265 variables (removed 1) and now considering 2134/2135 (removed 1) transitions.
// Phase 1: matrix 2134 rows 1264 cols
[2021-05-17 10:20:41] [INFO ] Computed 31 place invariants in 15 ms
[2021-05-17 10:20:42] [INFO ] Implicit Places using invariants in 616 ms returned []
// Phase 1: matrix 2134 rows 1264 cols
[2021-05-17 10:20:42] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-17 10:20:43] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2021-05-17 10:20:53] [INFO ] Implicit Places using invariants and state equation in 11258 ms returned []
Implicit Place search using SMT with State Equation took 11875 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1264/1275 places, 2134/2153 transitions.
Stuttering acceptance computed with spot in 2276 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-030-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s734 1), p1:(LT s932 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 499 steps with 0 reset in 3 ms.
FORMULA CANConstruction-PT-030-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-09 finished in 16215 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 1275 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1275/1275 places, 2153/2153 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 1275 transition count 1954
Reduce places removed 199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 200 rules applied. Total rules applied 399 place count 1076 transition count 1953
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 400 place count 1075 transition count 1953
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 400 place count 1075 transition count 1924
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 458 place count 1046 transition count 1924
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 468 place count 1036 transition count 1904
Iterating global reduction 3 with 10 rules applied. Total rules applied 478 place count 1036 transition count 1904
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 8 rules applied. Total rules applied 486 place count 1036 transition count 1896
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 494 place count 1028 transition count 1896
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 498 place count 1026 transition count 1894
Applied a total of 498 rules in 143 ms. Remains 1026 /1275 variables (removed 249) and now considering 1894/2153 (removed 259) transitions.
// Phase 1: matrix 1894 rows 1026 cols
[2021-05-17 10:20:56] [INFO ] Computed 32 place invariants in 7 ms
[2021-05-17 10:20:56] [INFO ] Implicit Places using invariants in 576 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 592 ms to find 1 implicit places.
[2021-05-17 10:20:56] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 1894 rows 1025 cols
[2021-05-17 10:20:56] [INFO ] Computed 31 place invariants in 5 ms
[2021-05-17 10:20:57] [INFO ] Dead Transitions using invariants and state equation in 814 ms returned []
Starting structural reductions, iteration 1 : 1025/1275 places, 1894/2153 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1025 transition count 1893
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1024 transition count 1893
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 1023 transition count 1892
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 1023 transition count 1892
Applied a total of 4 rules in 85 ms. Remains 1023 /1025 variables (removed 2) and now considering 1892/1894 (removed 2) transitions.
// Phase 1: matrix 1892 rows 1023 cols
[2021-05-17 10:20:57] [INFO ] Computed 31 place invariants in 6 ms
[2021-05-17 10:20:58] [INFO ] Implicit Places using invariants in 612 ms returned []
// Phase 1: matrix 1892 rows 1023 cols
[2021-05-17 10:20:58] [INFO ] Computed 31 place invariants in 5 ms
[2021-05-17 10:20:58] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2021-05-17 10:21:08] [INFO ] Implicit Places using invariants and state equation in 9941 ms returned []
Implicit Place search using SMT with State Equation took 10556 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1023/1275 places, 1892/2153 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s914 1) (AND (GEQ s0 1) (GEQ s90 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 219 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-030-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-10 finished in 12278 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (p1 U (p2&&X(X(F(!p1)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1275 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1275/1275 places, 2153/2153 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1264 transition count 2131
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1264 transition count 2131
Applied a total of 22 rules in 62 ms. Remains 1264 /1275 variables (removed 11) and now considering 2131/2153 (removed 22) transitions.
// Phase 1: matrix 2131 rows 1264 cols
[2021-05-17 10:21:08] [INFO ] Computed 32 place invariants in 9 ms
[2021-05-17 10:21:09] [INFO ] Implicit Places using invariants in 627 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 630 ms to find 1 implicit places.
// Phase 1: matrix 2131 rows 1263 cols
[2021-05-17 10:21:09] [INFO ] Computed 31 place invariants in 8 ms
[2021-05-17 10:21:10] [INFO ] Dead Transitions using invariants and state equation in 972 ms returned []
Starting structural reductions, iteration 1 : 1263/1275 places, 2131/2153 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1262 transition count 2130
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1262 transition count 2130
Applied a total of 2 rules in 64 ms. Remains 1262 /1263 variables (removed 1) and now considering 2130/2131 (removed 1) transitions.
// Phase 1: matrix 2130 rows 1262 cols
[2021-05-17 10:21:10] [INFO ] Computed 31 place invariants in 8 ms
[2021-05-17 10:21:10] [INFO ] Implicit Places using invariants in 629 ms returned []
// Phase 1: matrix 2130 rows 1262 cols
[2021-05-17 10:21:10] [INFO ] Computed 31 place invariants in 8 ms
[2021-05-17 10:21:11] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2021-05-17 10:21:26] [INFO ] Implicit Places using invariants and state equation in 16008 ms returned []
Implicit Place search using SMT with State Equation took 16639 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1262/1275 places, 2130/2153 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1), p1, p1]
Running random walk in product with property : CANConstruction-PT-030-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=p2, acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={0} source=4 dest: 4}]], initial=1, aps=[p2:(GEQ s7 1), p1:(AND (GEQ s306 1) (GEQ s706 1)), p0:(OR (LT s54 1) (LT s71 1))], 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]]
Stuttering criterion allowed to conclude after 2875 steps with 67 reset in 13 ms.
FORMULA CANConstruction-PT-030-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-12 finished in 18550 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1275 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1275/1275 places, 2153/2153 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1264 transition count 2131
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1264 transition count 2131
Applied a total of 22 rules in 77 ms. Remains 1264 /1275 variables (removed 11) and now considering 2131/2153 (removed 22) transitions.
// Phase 1: matrix 2131 rows 1264 cols
[2021-05-17 10:21:26] [INFO ] Computed 32 place invariants in 7 ms
[2021-05-17 10:21:27] [INFO ] Implicit Places using invariants in 645 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 646 ms to find 1 implicit places.
// Phase 1: matrix 2131 rows 1263 cols
[2021-05-17 10:21:27] [INFO ] Computed 31 place invariants in 8 ms
[2021-05-17 10:21:28] [INFO ] Dead Transitions using invariants and state equation in 1007 ms returned []
Starting structural reductions, iteration 1 : 1263/1275 places, 2131/2153 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1262 transition count 2130
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1262 transition count 2130
Applied a total of 2 rules in 63 ms. Remains 1262 /1263 variables (removed 1) and now considering 2130/2131 (removed 1) transitions.
// Phase 1: matrix 2130 rows 1262 cols
[2021-05-17 10:21:28] [INFO ] Computed 31 place invariants in 17 ms
[2021-05-17 10:21:29] [INFO ] Implicit Places using invariants in 595 ms returned []
// Phase 1: matrix 2130 rows 1262 cols
[2021-05-17 10:21:29] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-17 10:21:30] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2021-05-17 10:21:41] [INFO ] Implicit Places using invariants and state equation in 11773 ms returned []
Implicit Place search using SMT with State Equation took 12384 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1262/1275 places, 2130/2153 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-13 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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s210 1) (LT s669 1))], 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 10611 steps with 20 reset in 45 ms.
FORMULA CANConstruction-PT-030-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-13 finished in 14326 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F(p0)) U p1))], workingDir=/home/mcc/execution]
Support contains 3 out of 1275 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1275/1275 places, 2153/2153 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 1275 transition count 1954
Reduce places removed 199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 200 rules applied. Total rules applied 399 place count 1076 transition count 1953
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 400 place count 1075 transition count 1953
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 400 place count 1075 transition count 1925
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 456 place count 1047 transition count 1925
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 467 place count 1036 transition count 1903
Iterating global reduction 3 with 11 rules applied. Total rules applied 478 place count 1036 transition count 1903
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 9 rules applied. Total rules applied 487 place count 1036 transition count 1894
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 496 place count 1027 transition count 1894
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 554 place count 998 transition count 1865
Applied a total of 554 rules in 150 ms. Remains 998 /1275 variables (removed 277) and now considering 1865/2153 (removed 288) transitions.
// Phase 1: matrix 1865 rows 998 cols
[2021-05-17 10:21:41] [INFO ] Computed 32 place invariants in 8 ms
[2021-05-17 10:21:41] [INFO ] Implicit Places using invariants in 582 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 596 ms to find 1 implicit places.
[2021-05-17 10:21:42] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 1865 rows 997 cols
[2021-05-17 10:21:42] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-17 10:21:42] [INFO ] Dead Transitions using invariants and state equation in 729 ms returned []
Starting structural reductions, iteration 1 : 997/1275 places, 1865/2153 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 997 transition count 1863
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 995 transition count 1863
Applied a total of 4 rules in 62 ms. Remains 995 /997 variables (removed 2) and now considering 1863/1865 (removed 2) transitions.
// Phase 1: matrix 1863 rows 995 cols
[2021-05-17 10:21:42] [INFO ] Computed 31 place invariants in 8 ms
[2021-05-17 10:21:43] [INFO ] Implicit Places using invariants in 514 ms returned []
// Phase 1: matrix 1863 rows 995 cols
[2021-05-17 10:21:43] [INFO ] Computed 31 place invariants in 7 ms
[2021-05-17 10:21:43] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2021-05-17 10:21:53] [INFO ] Implicit Places using invariants and state equation in 10288 ms returned []
Implicit Place search using SMT with State Equation took 10803 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 995/1275 places, 1863/2153 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-030-15 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s39 1) (GEQ s600 1)), p0:(LT s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 953 reset in 631 ms.
Stack based approach found an accepted trace after 3097 steps with 35 reset with depth 167 and stack size 167 in 21 ms.
FORMULA CANConstruction-PT-030-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-030-15 finished in 13126 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5570870006403151371
[2021-05-17 10:21:54] [INFO ] Too many transitions (2153) to apply POR reductions. Disabling POR matrices.
[2021-05-17 10:21:54] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5570870006403151371
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/ltsmin5570870006403151371]
[2021-05-17 10:21:54] [INFO ] Applying decomposition
[2021-05-17 10:21:54] [INFO ] Flatten gal took : 54 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/graph5684844154453288592.txt, -o, /tmp/graph5684844154453288592.bin, -w, /tmp/graph5684844154453288592.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/graph5684844154453288592.bin, -l, -1, -v, -w, /tmp/graph5684844154453288592.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 10:21:54] [INFO ] Decomposing Gal with order
[2021-05-17 10:21:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 10:21:54] [INFO ] Removed a total of 1823 redundant transitions.
[2021-05-17 10:21:54] [INFO ] Flatten gal took : 183 ms
[2021-05-17 10:21:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 3538 labels/synchronizations in 101 ms.
[2021-05-17 10:21:54] [INFO ] Time to serialize gal into /tmp/LTLFireability13084621656999355326.gal : 10 ms
[2021-05-17 10:21:54] [INFO ] Time to serialize properties into /tmp/LTLFireability3124496939976512295.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/LTLFireability13084621656999355326.gal, -t, CGAL, -LTL, /tmp/LTLFireability3124496939976512295.ltl, -c, -stutter-deadlock], 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/LTLFireability13084621656999355326.gal -t CGAL -LTL /tmp/LTLFireability3124496939976512295.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((X((G(!("((i8.u33.Node7IsInserted>=1)&&(i22.i1.u98.Node21requestsent7>=1))")))||(X(F("(i9.u39.Node8JoinMsg<1)"))))))
Formula 0 simplified : !X(G!"((i8.u33.Node7IsInserted>=1)&&(i22.i1.u98.Node21requestsent7>=1))" | XF"(i9.u39.Node8JoinMsg<1)")
Compilation finished in 17312 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5570870006403151371]
Link finished in 57 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(([]((LTLAPp0==true))||X(<>((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5570870006403151371]
LTSmin run took 623 ms.
FORMULA CANConstruction-PT-030-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((X(X((LTLAPp2==true)))||[]((LTLAPp3==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin5570870006403151371]
LTSmin run took 759 ms.
FORMULA CANConstruction-PT-030-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, []((X((LTLAPp4==true))||((LTLAPp5==true) U ((LTLAPp6==true)||[]((LTLAPp5==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5570870006403151371]
WARNING : LTSmin timed out (>276 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, []((X((LTLAPp4==true))||((LTLAPp5==true) U ((LTLAPp6==true)||[]((LTLAPp5==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5570870006403151371]
Retrying LTSmin with larger timeout 2208 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, []((X((LTLAPp4==true))||((LTLAPp5==true) U ((LTLAPp6==true)||[]((LTLAPp5==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5570870006403151371]
Detected timeout of ITS tools.
[2021-05-17 10:43:49] [INFO ] Flatten gal took : 145 ms
[2021-05-17 10:43:49] [INFO ] Time to serialize gal into /tmp/LTLFireability8900176372099623225.gal : 23 ms
[2021-05-17 10:43:49] [INFO ] Time to serialize properties into /tmp/LTLFireability17725650739551123438.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/LTLFireability8900176372099623225.gal, -t, CGAL, -LTL, /tmp/LTLFireability17725650739551123438.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/LTLFireability8900176372099623225.gal -t CGAL -LTL /tmp/LTLFireability17725650739551123438.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((X(!("((Node29IsInserted>=1)&&(Node16requestsent29>=1))")))||(("(Node26GiveAnswer3<1)")U(("((!((Node24Request>=1)&&(Node25IsInserted>=1)))&&(Node26GiveAnswer3<1))")||(G("(Node26GiveAnswer3<1)")))))))
Formula 0 simplified : !G(X!"((Node29IsInserted>=1)&&(Node16requestsent29>=1))" | ("(Node26GiveAnswer3<1)" U ("((!((Node24Request>=1)&&(Node25IsInserted>=1)))&&(Node26GiveAnswer3<1))" | G"(Node26GiveAnswer3<1)")))
WARNING : LTSmin timed out (>2208 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, []((X((LTLAPp4==true))||((LTLAPp5==true) U ((LTLAPp6==true)||[]((LTLAPp5==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5570870006403151371]
Detected timeout of ITS tools.
[2021-05-17 11:05:44] [INFO ] Flatten gal took : 56 ms
[2021-05-17 11:05:44] [INFO ] Input system was already deterministic with 2153 transitions.
[2021-05-17 11:05:44] [INFO ] Transformed 1275 places.
[2021-05-17 11:05:44] [INFO ] Transformed 2153 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-17 11:05:51] [INFO ] Time to serialize gal into /tmp/LTLFireability14400420075124354144.gal : 6867 ms
[2021-05-17 11:05:52] [INFO ] Time to serialize properties into /tmp/LTLFireability2359591785737705812.ltl : 1115 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/LTLFireability14400420075124354144.gal, -t, CGAL, -LTL, /tmp/LTLFireability2359591785737705812.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --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/LTLFireability14400420075124354144.gal -t CGAL -LTL /tmp/LTLFireability2359591785737705812.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((X(!("((Node29IsInserted>=1)&&(Node16requestsent29>=1))")))||(("(Node26GiveAnswer3<1)")U(("((!((Node24Request>=1)&&(Node25IsInserted>=1)))&&(Node26GiveAnswer3<1))")||(G("(Node26GiveAnswer3<1)")))))))
Formula 0 simplified : !G(X!"((Node29IsInserted>=1)&&(Node16requestsent29>=1))" | ("(Node26GiveAnswer3<1)" U ("((!((Node24Request>=1)&&(Node25IsInserted>=1)))&&(Node26GiveAnswer3<1))" | G"(Node26GiveAnswer3<1)")))

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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-030"
export BK_EXAMINATION="LTLFireability"
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-030, examination is LTLFireability"
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-162124155800029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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