Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 7.7K Apr 29 12:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 29 12:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 29 12:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 12:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 9 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 9 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 15M May 10 09:33 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-100-LTLFireability-00
FORMULA_NAME CANConstruction-PT-100-LTLFireability-01
FORMULA_NAME CANConstruction-PT-100-LTLFireability-02
FORMULA_NAME CANConstruction-PT-100-LTLFireability-03
FORMULA_NAME CANConstruction-PT-100-LTLFireability-04
FORMULA_NAME CANConstruction-PT-100-LTLFireability-05
FORMULA_NAME CANConstruction-PT-100-LTLFireability-06
FORMULA_NAME CANConstruction-PT-100-LTLFireability-07
FORMULA_NAME CANConstruction-PT-100-LTLFireability-08
FORMULA_NAME CANConstruction-PT-100-LTLFireability-09
FORMULA_NAME CANConstruction-PT-100-LTLFireability-10
FORMULA_NAME CANConstruction-PT-100-LTLFireability-11
FORMULA_NAME CANConstruction-PT-100-LTLFireability-12
FORMULA_NAME CANConstruction-PT-100-LTLFireability-13
FORMULA_NAME CANConstruction-PT-100-LTLFireability-14
FORMULA_NAME CANConstruction-PT-100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652661318707

Running Version 202205111006
[2022-05-16 00:35:19] [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]
[2022-05-16 00:35:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 00:35:20] [INFO ] Load time of PNML (sax parser for PT used): 951 ms
[2022-05-16 00:35:21] [INFO ] Transformed 21202 places.
[2022-05-16 00:35:21] [INFO ] Transformed 40800 transitions.
[2022-05-16 00:35:21] [INFO ] Parsed PT model containing 21202 places and 40800 transitions in 1192 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 294 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANConstruction-PT-100-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-100-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-100-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 313 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:35:22] [INFO ] Computed 201 place invariants in 691 ms
[2022-05-16 00:35:24] [INFO ] Implicit Places using invariants in 2758 ms returned []
Implicit Place search using SMT only with invariants took 2811 ms to find 0 implicit places.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:35:25] [INFO ] Computed 201 place invariants in 406 ms
[2022-05-16 00:35:27] [INFO ] Dead Transitions using invariants and state equation in 2363 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21202/21202 places, 40800/40800 transitions.
Support contains 46 out of 21202 places after structural reductions.
[2022-05-16 00:35:28] [INFO ] Flatten gal took : 1239 ms
[2022-05-16 00:35:29] [INFO ] Flatten gal took : 967 ms
[2022-05-16 00:35:31] [INFO ] Input system was already deterministic with 40800 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 1013 ms. (steps per millisecond=9 ) properties (out of 29) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:35:33] [INFO ] Computed 201 place invariants in 337 ms
[2022-05-16 00:35:41] [INFO ] [Real]Absence check using 101 positive place invariants in 495 ms returned sat
[2022-05-16 00:35:41] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 183 ms returned sat
[2022-05-16 00:35:58] [INFO ] After 11364ms SMT Verify possible using state equation in real domain returned unsat :0 sat :18
[2022-05-16 00:35:58] [INFO ] State equation strengthened by 19900 read => feed constraints.
[2022-05-16 00:35:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 00:35:58] [INFO ] After 25303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 19 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 27 out of 21202 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 694 transitions
Trivial Post-agglo rules discarded 694 transitions
Performed 694 trivial Post agglomeration. Transition count delta: 694
Iterating post reduction 0 with 694 rules applied. Total rules applied 694 place count 21202 transition count 40106
Reduce places removed 694 places and 0 transitions.
Iterating post reduction 1 with 694 rules applied. Total rules applied 1388 place count 20508 transition count 40106
Performed 9985 Post agglomeration using F-continuation condition.Transition count delta: 9985
Deduced a syphon composed of 9985 places in 15 ms
Reduce places removed 9985 places and 0 transitions.
Iterating global reduction 2 with 19970 rules applied. Total rules applied 21358 place count 10523 transition count 30121
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21364 place count 10523 transition count 30115
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 21370 place count 10517 transition count 30115
Applied a total of 21370 rules in 6484 ms. Remains 10517 /21202 variables (removed 10685) and now considering 30115/40800 (removed 10685) transitions.
Finished structural reductions, in 1 iterations. Remains : 10517/21202 places, 30115/40800 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 871 ms. (steps per millisecond=11 ) properties (out of 19) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 30115 rows 10517 cols
[2022-05-16 00:36:06] [INFO ] Computed 201 place invariants in 204 ms
[2022-05-16 00:36:09] [INFO ] [Real]Absence check using 101 positive place invariants in 250 ms returned sat
[2022-05-16 00:36:09] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 132 ms returned sat
[2022-05-16 00:36:31] [INFO ] After 21040ms SMT Verify possible using state equation in real domain returned unsat :0 sat :10
[2022-05-16 00:36:32] [INFO ] State equation strengthened by 29885 read => feed constraints.
[2022-05-16 00:36:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 00:36:32] [INFO ] After 25336ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 10 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 118 ms.
Support contains 14 out of 10517 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10517/10517 places, 30115/30115 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 10510 transition count 30108
Applied a total of 14 rules in 365 ms. Remains 10510 /10517 variables (removed 7) and now considering 30108/30115 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 10510/10517 places, 30108/30115 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 706 ms. (steps per millisecond=14 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 30108 rows 10510 cols
[2022-05-16 00:36:33] [INFO ] Computed 201 place invariants in 206 ms
[2022-05-16 00:36:35] [INFO ] [Real]Absence check using 101 positive place invariants in 263 ms returned sat
[2022-05-16 00:36:36] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 147 ms returned sat
[2022-05-16 00:36:58] [INFO ] After 21773ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2022-05-16 00:36:59] [INFO ] State equation strengthened by 29892 read => feed constraints.
[2022-05-16 00:36:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 00:36:59] [INFO ] After 25459ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 10510 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10510/10510 places, 30108/30108 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 10508 transition count 30106
Applied a total of 4 rules in 311 ms. Remains 10508 /10510 variables (removed 2) and now considering 30106/30108 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 10508/10510 places, 30106/30108 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 633 ms. (steps per millisecond=15 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 77918 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77918 steps, saw 74068 distinct states, run finished after 3003 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 30106 rows 10508 cols
[2022-05-16 00:37:03] [INFO ] Computed 201 place invariants in 217 ms
[2022-05-16 00:37:05] [INFO ] [Real]Absence check using 101 positive place invariants in 302 ms returned sat
[2022-05-16 00:37:06] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 167 ms returned sat
[2022-05-16 00:37:28] [INFO ] After 25014ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 10508 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10508/10508 places, 30106/30106 transitions.
Applied a total of 0 rules in 166 ms. Remains 10508 /10508 variables (removed 0) and now considering 30106/30106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10508/10508 places, 30106/30106 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 10508/10508 places, 30106/30106 transitions.
Applied a total of 0 rules in 162 ms. Remains 10508 /10508 variables (removed 0) and now considering 30106/30106 (removed 0) transitions.
// Phase 1: matrix 30106 rows 10508 cols
[2022-05-16 00:37:29] [INFO ] Computed 201 place invariants in 225 ms
[2022-05-16 00:37:30] [INFO ] Implicit Places using invariants in 1313 ms returned []
Implicit Place search using SMT only with invariants took 1326 ms to find 0 implicit places.
// Phase 1: matrix 30106 rows 10508 cols
[2022-05-16 00:37:30] [INFO ] Computed 201 place invariants in 223 ms
[2022-05-16 00:37:31] [INFO ] Dead Transitions using invariants and state equation in 1291 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10508/10508 places, 30106/30106 transitions.
FORMULA CANConstruction-PT-100-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 401 stabilizing places and 500 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((X(F(p0))&&X(p1))))))'
Support contains 3 out of 21202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 21202 transition count 40101
Reduce places removed 699 places and 0 transitions.
Iterating post reduction 1 with 699 rules applied. Total rules applied 1398 place count 20503 transition count 40101
Performed 9999 Post agglomeration using F-continuation condition.Transition count delta: 9999
Deduced a syphon composed of 9999 places in 13 ms
Reduce places removed 9999 places and 0 transitions.
Iterating global reduction 2 with 19998 rules applied. Total rules applied 21396 place count 10504 transition count 30102
Applied a total of 21396 rules in 6250 ms. Remains 10504 /21202 variables (removed 10698) and now considering 30102/40800 (removed 10698) transitions.
// Phase 1: matrix 30102 rows 10504 cols
[2022-05-16 00:37:38] [INFO ] Computed 201 place invariants in 189 ms
[2022-05-16 00:37:39] [INFO ] Implicit Places using invariants in 1230 ms returned []
Implicit Place search using SMT only with invariants took 1232 ms to find 0 implicit places.
// Phase 1: matrix 30102 rows 10504 cols
[2022-05-16 00:37:39] [INFO ] Computed 201 place invariants in 186 ms
[2022-05-16 00:37:40] [INFO ] Dead Transitions using invariants and state equation in 1144 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10504/21202 places, 30102/40800 transitions.
Finished structural reductions, in 1 iterations. Remains : 10504/21202 places, 30102/40800 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s334 1) (LT s6004 1)), p0:(LT s4571 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 143 reset in 3539 ms.
Product exploration explored 100000 steps with 144 reset in 3467 ms.
Computed a total of 303 stabilizing places and 301 stable transitions
Computed a total of 303 stabilizing places and 301 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 299 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 539 ms. (steps per millisecond=18 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 80952 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80952 steps, saw 74532 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 30102 rows 10504 cols
[2022-05-16 00:37:52] [INFO ] Computed 201 place invariants in 221 ms
[2022-05-16 00:37:54] [INFO ] [Real]Absence check using 101 positive place invariants in 215 ms returned sat
[2022-05-16 00:37:54] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 130 ms returned sat
[2022-05-16 00:38:17] [INFO ] After 23043ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-05-16 00:38:17] [INFO ] State equation strengthened by 29899 read => feed constraints.
[2022-05-16 00:38:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 00:38:17] [INFO ] After 25294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 10504 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10504/10504 places, 30102/30102 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10504 transition count 30101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10503 transition count 30101
Applied a total of 2 rules in 500 ms. Remains 10503 /10504 variables (removed 1) and now considering 30101/30102 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 10503/10504 places, 30101/30102 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 545 ms. (steps per millisecond=18 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 30101 rows 10503 cols
[2022-05-16 00:38:19] [INFO ] Computed 201 place invariants in 198 ms
[2022-05-16 00:38:20] [INFO ] [Real]Absence check using 101 positive place invariants in 228 ms returned sat
[2022-05-16 00:38:20] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 130 ms returned sat
[2022-05-16 00:38:43] [INFO ] After 22518ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-16 00:38:43] [INFO ] State equation strengthened by 29899 read => feed constraints.
[2022-05-16 00:38:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 00:38:44] [INFO ] After 25035ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 3 out of 10503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10503/10503 places, 30101/30101 transitions.
Applied a total of 0 rules in 204 ms. Remains 10503 /10503 variables (removed 0) and now considering 30101/30101 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10503/10503 places, 30101/30101 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 82126 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82126 steps, saw 74713 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 30101 rows 10503 cols
[2022-05-16 00:38:48] [INFO ] Computed 201 place invariants in 195 ms
[2022-05-16 00:38:49] [INFO ] [Real]Absence check using 101 positive place invariants in 216 ms returned sat
[2022-05-16 00:38:49] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 138 ms returned sat
[2022-05-16 00:39:13] [INFO ] After 25018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 10503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10503/10503 places, 30101/30101 transitions.
Applied a total of 0 rules in 216 ms. Remains 10503 /10503 variables (removed 0) and now considering 30101/30101 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10503/10503 places, 30101/30101 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 10503/10503 places, 30101/30101 transitions.
Applied a total of 0 rules in 256 ms. Remains 10503 /10503 variables (removed 0) and now considering 30101/30101 (removed 0) transitions.
// Phase 1: matrix 30101 rows 10503 cols
[2022-05-16 00:39:13] [INFO ] Computed 201 place invariants in 202 ms
[2022-05-16 00:39:14] [INFO ] Implicit Places using invariants in 1121 ms returned []
Implicit Place search using SMT only with invariants took 1134 ms to find 0 implicit places.
// Phase 1: matrix 30101 rows 10503 cols
[2022-05-16 00:39:14] [INFO ] Computed 201 place invariants in 254 ms
[2022-05-16 00:39:15] [INFO ] Dead Transitions using invariants and state equation in 1178 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10503/10503 places, 30101/30101 transitions.
Graph (trivial) has 29795 edges and 10503 vertex of which 10098 / 10503 are part of one of the 100 SCC in 9 ms
Free SCC test removed 9998 places
Drop transitions removed 19896 transitions
Ensure Unique test removed 9798 transitions
Reduce isomorphic transitions removed 29694 transitions.
Graph (complete) has 1008 edges and 505 vertex of which 13 are kept as prefixes of interest. Removing 492 places using SCC suffix rule.1 ms
Discarding 492 places :
Also discarding 293 output transitions
Drop transitions removed 293 transitions
Drop transitions removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 103 rules applied. Total rules applied 105 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 106 place count 11 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 106 place count 11 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 10 transition count 11
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 10 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 110 place count 9 transition count 10
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 9 transition count 10
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 114 place count 7 transition count 8
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 7 transition count 8
Applied a total of 116 rules in 199 ms. Remains 7 /10503 variables (removed 10496) and now considering 8/30101 (removed 30093) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 7 cols
[2022-05-16 00:39:16] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 00:39:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 00:39:16] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 00:39:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 00:39:16] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 00:39:16] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-16 00:39:16] [INFO ] After 107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-16 00:39:16] [INFO ] Flatten gal took : 1 ms
[2022-05-16 00:39:16] [INFO ] Flatten gal took : 0 ms
[2022-05-16 00:39:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12060168212978173233.gal : 2 ms
[2022-05-16 00:39:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9431048956863674032.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1535153164043300979;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12060168212978173233.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9431048956863674032.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality9431048956863674032.prop.
Reachability property apf2 is true.
Reachability property apf1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.025324,3836,2,10,6,40,6,0,32,19,0
Total reachable state count : 6

Verifying 2 reachability properties.
Reachability property apf1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,1,0.02563,3836,2,8,6,40,7,0,39,19,0
Reachability property apf2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf2,1,0.025731,3836,2,8,6,40,8,0,39,19,0
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 7 factoid took 276 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Support contains 3 out of 10504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10504/10504 places, 30102/30102 transitions.
Applied a total of 0 rules in 307 ms. Remains 10504 /10504 variables (removed 0) and now considering 30102/30102 (removed 0) transitions.
// Phase 1: matrix 30102 rows 10504 cols
[2022-05-16 00:39:17] [INFO ] Computed 201 place invariants in 218 ms
[2022-05-16 00:39:18] [INFO ] Implicit Places using invariants in 1220 ms returned []
Implicit Place search using SMT only with invariants took 1222 ms to find 0 implicit places.
// Phase 1: matrix 30102 rows 10504 cols
[2022-05-16 00:39:18] [INFO ] Computed 201 place invariants in 201 ms
[2022-05-16 00:39:19] [INFO ] Dead Transitions using invariants and state equation in 1226 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10504/10504 places, 30102/30102 transitions.
Computed a total of 303 stabilizing places and 301 stable transitions
Computed a total of 303 stabilizing places and 301 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 228 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 63 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 530 ms. (steps per millisecond=18 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 30102 rows 10504 cols
[2022-05-16 00:39:20] [INFO ] Computed 201 place invariants in 204 ms
[2022-05-16 00:39:22] [INFO ] [Real]Absence check using 101 positive place invariants in 219 ms returned sat
[2022-05-16 00:39:22] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 153 ms returned sat
[2022-05-16 00:39:46] [INFO ] After 23008ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-16 00:39:46] [INFO ] State equation strengthened by 29899 read => feed constraints.
[2022-05-16 00:39:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 00:39:46] [INFO ] After 25285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 32 ms.
Support contains 3 out of 10504 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10504/10504 places, 30102/30102 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10504 transition count 30101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10503 transition count 30101
Applied a total of 2 rules in 544 ms. Remains 10503 /10504 variables (removed 1) and now considering 30101/30102 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 10503/10504 places, 30101/30102 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 567 ms. (steps per millisecond=17 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 81652 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81652 steps, saw 74649 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 30101 rows 10503 cols
[2022-05-16 00:39:50] [INFO ] Computed 201 place invariants in 201 ms
[2022-05-16 00:39:52] [INFO ] [Real]Absence check using 101 positive place invariants in 223 ms returned sat
[2022-05-16 00:39:52] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 139 ms returned sat
[2022-05-16 00:40:15] [INFO ] After 25012ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 10503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10503/10503 places, 30101/30101 transitions.
Applied a total of 0 rules in 204 ms. Remains 10503 /10503 variables (removed 0) and now considering 30101/30101 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10503/10503 places, 30101/30101 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 10503/10503 places, 30101/30101 transitions.
Applied a total of 0 rules in 201 ms. Remains 10503 /10503 variables (removed 0) and now considering 30101/30101 (removed 0) transitions.
// Phase 1: matrix 30101 rows 10503 cols
[2022-05-16 00:40:16] [INFO ] Computed 201 place invariants in 195 ms
[2022-05-16 00:40:17] [INFO ] Implicit Places using invariants in 1150 ms returned []
Implicit Place search using SMT only with invariants took 1165 ms to find 0 implicit places.
// Phase 1: matrix 30101 rows 10503 cols
[2022-05-16 00:40:17] [INFO ] Computed 201 place invariants in 195 ms
[2022-05-16 00:40:18] [INFO ] Dead Transitions using invariants and state equation in 1092 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10503/10503 places, 30101/30101 transitions.
Graph (trivial) has 29795 edges and 10503 vertex of which 10098 / 10503 are part of one of the 100 SCC in 6 ms
Free SCC test removed 9998 places
Drop transitions removed 19896 transitions
Ensure Unique test removed 9798 transitions
Reduce isomorphic transitions removed 29694 transitions.
Graph (complete) has 1008 edges and 505 vertex of which 13 are kept as prefixes of interest. Removing 492 places using SCC suffix rule.0 ms
Discarding 492 places :
Also discarding 293 output transitions
Drop transitions removed 293 transitions
Drop transitions removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 103 rules applied. Total rules applied 105 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 106 place count 11 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 106 place count 11 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 10 transition count 11
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 10 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 110 place count 9 transition count 10
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 9 transition count 10
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 114 place count 7 transition count 8
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 7 transition count 8
Applied a total of 116 rules in 150 ms. Remains 7 /10503 variables (removed 10496) and now considering 8/30101 (removed 30093) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 7 cols
[2022-05-16 00:40:18] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 00:40:18] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 00:40:18] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 00:40:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 00:40:18] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 00:40:18] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-16 00:40:18] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-16 00:40:18] [INFO ] Flatten gal took : 2 ms
[2022-05-16 00:40:18] [INFO ] Flatten gal took : 0 ms
[2022-05-16 00:40:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16832377977845331319.gal : 1 ms
[2022-05-16 00:40:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12983464679040901046.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms469541728739010787;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16832377977845331319.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12983464679040901046.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality12983464679040901046.prop.
Reachability property apf2 is true.
Reachability property apf1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.013183,3936,2,10,6,40,6,0,32,19,0
Total reachable state count : 6

Verifying 2 reachability properties.
Reachability property apf1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,1,0.013454,3936,2,8,6,40,7,0,39,19,0
Reachability property apf2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf2,1,0.013573,3936,2,8,6,40,8,0,39,19,0
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 7 factoid took 298 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 144 reset in 3364 ms.
Product exploration explored 100000 steps with 146 reset in 3460 ms.
Built C files in :
/tmp/ltsmin13643358230248055620
[2022-05-16 00:40:26] [INFO ] Too many transitions (30102) to apply POR reductions. Disabling POR matrices.
[2022-05-16 00:40:26] [INFO ] Built C files in 317ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13643358230248055620
Running compilation step : cd /tmp/ltsmin13643358230248055620;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13643358230248055620;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13643358230248055620;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 10504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10504/10504 places, 30102/30102 transitions.
Applied a total of 0 rules in 260 ms. Remains 10504 /10504 variables (removed 0) and now considering 30102/30102 (removed 0) transitions.
// Phase 1: matrix 30102 rows 10504 cols
[2022-05-16 00:40:30] [INFO ] Computed 201 place invariants in 273 ms
[2022-05-16 00:40:32] [INFO ] Implicit Places using invariants in 2311 ms returned []
Implicit Place search using SMT only with invariants took 2334 ms to find 0 implicit places.
// Phase 1: matrix 30102 rows 10504 cols
[2022-05-16 00:40:32] [INFO ] Computed 201 place invariants in 252 ms
[2022-05-16 00:40:34] [INFO ] Dead Transitions using invariants and state equation in 2337 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10504/10504 places, 30102/30102 transitions.
Built C files in :
/tmp/ltsmin16397346840369964607
[2022-05-16 00:40:34] [INFO ] Too many transitions (30102) to apply POR reductions. Disabling POR matrices.
[2022-05-16 00:40:34] [INFO ] Built C files in 354ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16397346840369964607
Running compilation step : cd /tmp/ltsmin16397346840369964607;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16397346840369964607;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16397346840369964607;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 00:40:41] [INFO ] Flatten gal took : 693 ms
[2022-05-16 00:40:41] [INFO ] Flatten gal took : 744 ms
[2022-05-16 00:40:42] [INFO ] Time to serialize gal into /tmp/LTL12046057878121917185.gal : 348 ms
[2022-05-16 00:40:42] [INFO ] Time to serialize properties into /tmp/LTL17627530206866238996.ltl : 19 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12046057878121917185.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17627530206866238996.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1204605...268
Read 1 LTL properties
Checking formula 0 : !((F(G(X((X(F("(Node40GiveAnswer7<1)")))&&(X("((Node55IsInserted<1)||(Node54requestsent55<1))")))))))
Formula 0 simplified : !FGX(XF"(Node40GiveAnswer7<1)" & X"((Node55IsInserted<1)||(Node54requestsent55<1))")
Detected timeout of ITS tools.
[2022-05-16 00:40:58] [INFO ] Flatten gal took : 1249 ms
[2022-05-16 00:40:58] [INFO ] Applying decomposition
[2022-05-16 00:40:59] [INFO ] Flatten gal took : 631 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17107373437927316572.txt' '-o' '/tmp/graph17107373437927316572.bin' '-w' '/tmp/graph17107373437927316572.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17107373437927316572.bin' '-l' '-1' '-v' '-w' '/tmp/graph17107373437927316572.weights' '-q' '0' '-e' '0.001'
[2022-05-16 00:41:02] [INFO ] Decomposing Gal with order
[2022-05-16 00:41:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 00:41:12] [INFO ] Removed a total of 29509 redundant transitions.
[2022-05-16 00:41:13] [INFO ] Flatten gal took : 9002 ms
[2022-05-16 00:41:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 29402 labels/synchronizations in 10466 ms.
[2022-05-16 00:41:24] [INFO ] Time to serialize gal into /tmp/LTL2230075380460178791.gal : 142 ms
[2022-05-16 00:41:24] [INFO ] Time to serialize properties into /tmp/LTL320436201732305434.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2230075380460178791.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL320436201732305434.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2230075...244
Read 1 LTL properties
Checking formula 0 : !((F(G(X((X(F("(u8.Node40GiveAnswer7<1)")))&&(X("((i0.u56.Node55IsInserted<1)||(u55.Node54requestsent55<1))")))))))
Formula 0 simplified : !FGX(XF"(u8.Node40GiveAnswer7<1)" & X"((i0.u56.Node55IsInserted<1)||(u55.Node54requestsent55<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17885848275857934805
[2022-05-16 00:41:40] [INFO ] Built C files in 163ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17885848275857934805
Running compilation step : cd /tmp/ltsmin17885848275857934805;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17885848275857934805;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17885848275857934805;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CANConstruction-PT-100-LTLFireability-00 finished in 250935 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 21202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21202 transition count 40100
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20502 transition count 40100
Performed 9999 Post agglomeration using F-continuation condition.Transition count delta: 9999
Deduced a syphon composed of 9999 places in 20 ms
Reduce places removed 9999 places and 0 transitions.
Iterating global reduction 2 with 19998 rules applied. Total rules applied 21398 place count 10503 transition count 30101
Applied a total of 21398 rules in 8104 ms. Remains 10503 /21202 variables (removed 10699) and now considering 30101/40800 (removed 10699) transitions.
// Phase 1: matrix 30101 rows 10503 cols
[2022-05-16 00:41:51] [INFO ] Computed 201 place invariants in 208 ms
[2022-05-16 00:41:52] [INFO ] Implicit Places using invariants in 1045 ms returned []
Implicit Place search using SMT only with invariants took 1046 ms to find 0 implicit places.
// Phase 1: matrix 30101 rows 10503 cols
[2022-05-16 00:41:52] [INFO ] Computed 201 place invariants in 237 ms
[2022-05-16 00:41:53] [INFO ] Dead Transitions using invariants and state equation in 1088 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10503/21202 places, 30101/40800 transitions.
Finished structural reductions, in 1 iterations. Remains : 10503/21202 places, 30101/40800 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s733 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 715 steps with 0 reset in 40 ms.
FORMULA CANConstruction-PT-100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-01 finished in 10403 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p0))||F(p1))))'
Support contains 3 out of 21202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 698 transitions
Trivial Post-agglo rules discarded 698 transitions
Performed 698 trivial Post agglomeration. Transition count delta: 698
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 21202 transition count 40102
Reduce places removed 698 places and 0 transitions.
Iterating post reduction 1 with 698 rules applied. Total rules applied 1396 place count 20504 transition count 40102
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1396 place count 20504 transition count 40101
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1398 place count 20503 transition count 40101
Performed 9998 Post agglomeration using F-continuation condition.Transition count delta: 9998
Deduced a syphon composed of 9998 places in 17 ms
Reduce places removed 9998 places and 0 transitions.
Iterating global reduction 2 with 19996 rules applied. Total rules applied 21394 place count 10505 transition count 30103
Applied a total of 21394 rules in 8613 ms. Remains 10505 /21202 variables (removed 10697) and now considering 30103/40800 (removed 10697) transitions.
// Phase 1: matrix 30103 rows 10505 cols
[2022-05-16 00:42:02] [INFO ] Computed 201 place invariants in 330 ms
[2022-05-16 00:42:03] [INFO ] Implicit Places using invariants in 1179 ms returned []
Implicit Place search using SMT only with invariants took 1180 ms to find 0 implicit places.
// Phase 1: matrix 30103 rows 10505 cols
[2022-05-16 00:42:03] [INFO ] Computed 201 place invariants in 316 ms
[2022-05-16 00:42:04] [INFO ] Dead Transitions using invariants and state equation in 1150 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10505/21202 places, 30103/40800 transitions.
Finished structural reductions, in 1 iterations. Remains : 10505/21202 places, 30103/40800 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s10307 1), p0:(AND (GEQ s442 1) (GEQ s558 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2645 steps with 5 reset in 109 ms.
FORMULA CANConstruction-PT-100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-02 finished in 11204 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(X((X(p0)||p1))))))'
Support contains 2 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 237 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:42:05] [INFO ] Computed 201 place invariants in 471 ms
[2022-05-16 00:42:07] [INFO ] Implicit Places using invariants in 2108 ms returned []
Implicit Place search using SMT only with invariants took 2110 ms to find 0 implicit places.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:42:07] [INFO ] Computed 201 place invariants in 594 ms
[2022-05-16 00:42:09] [INFO ] Dead Transitions using invariants and state equation in 2137 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(GEQ s20853 1), p0:(GEQ s3103 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1876 steps with 0 reset in 73 ms.
FORMULA CANConstruction-PT-100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-03 finished in 4836 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)||X(F(p2))||p3)))'
Support contains 5 out of 21202 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 238 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:42:10] [INFO ] Computed 201 place invariants in 526 ms
[2022-05-16 00:42:11] [INFO ] Implicit Places using invariants in 2063 ms returned []
Implicit Place search using SMT only with invariants took 2063 ms to find 0 implicit places.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:42:12] [INFO ] Computed 201 place invariants in 607 ms
[2022-05-16 00:42:13] [INFO ] Dead Transitions using invariants and state equation in 2164 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p3:(AND (GEQ s25 1) (GEQ s90 1)), p1:(GEQ s17817 1), p2:(AND (GEQ s916 1) (GEQ s11430 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 2065 steps with 0 reset in 75 ms.
FORMULA CANConstruction-PT-100-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-05 finished in 4712 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(!X(p0))) U p1)))'
Support contains 4 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 255 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:42:15] [INFO ] Computed 201 place invariants in 523 ms
[2022-05-16 00:42:16] [INFO ] Implicit Places using invariants in 2031 ms returned []
Implicit Place search using SMT only with invariants took 2032 ms to find 0 implicit places.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:42:16] [INFO ] Computed 201 place invariants in 471 ms
[2022-05-16 00:42:18] [INFO ] Dead Transitions using invariants and state equation in 2096 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1), p0]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s21121 1), p0:(OR (GEQ s14911 1) (AND (GEQ s104 1) (GEQ s2008 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 55 reset in 3650 ms.
Product exploration explored 100000 steps with 55 reset in 3369 ms.
Computed a total of 401 stabilizing places and 500 stable transitions
Computed a total of 401 stabilizing places and 500 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p1) p0), (NOT p1), p0]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 536 ms. (steps per millisecond=18 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 85550 steps, run timeout after 3003 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85550 steps, saw 84429 distinct states, run finished after 3003 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:42:30] [INFO ] Computed 201 place invariants in 436 ms
[2022-05-16 00:42:33] [INFO ] [Real]Absence check using 101 positive place invariants in 468 ms returned sat
[2022-05-16 00:42:34] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 180 ms returned sat
[2022-05-16 00:42:55] [INFO ] After 25030ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 00:42:58] [INFO ] [Nat]Absence check using 101 positive place invariants in 471 ms returned sat
[2022-05-16 00:42:59] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 187 ms returned sat
[2022-05-16 00:43:20] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 21202 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 21202 transition count 40101
Reduce places removed 699 places and 0 transitions.
Iterating post reduction 1 with 699 rules applied. Total rules applied 1398 place count 20503 transition count 40101
Performed 9998 Post agglomeration using F-continuation condition.Transition count delta: 9998
Deduced a syphon composed of 9998 places in 21 ms
Reduce places removed 9998 places and 0 transitions.
Iterating global reduction 2 with 19996 rules applied. Total rules applied 21394 place count 10505 transition count 30103
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21395 place count 10505 transition count 30102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21396 place count 10504 transition count 30102
Applied a total of 21396 rules in 15912 ms. Remains 10504 /21202 variables (removed 10698) and now considering 30102/40800 (removed 10698) transitions.
Finished structural reductions, in 1 iterations. Remains : 10504/21202 places, 30102/40800 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 1081 ms. (steps per millisecond=9 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 30102 rows 10504 cols
[2022-05-16 00:43:38] [INFO ] Computed 201 place invariants in 585 ms
[2022-05-16 00:43:41] [INFO ] [Real]Absence check using 101 positive place invariants in 989 ms returned sat
[2022-05-16 00:43:41] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 804 ms returned sat
[2022-05-16 00:43:42] [INFO ] After 4077ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 00:43:43] [INFO ] [Nat]Absence check using 101 positive place invariants in 235 ms returned sat
[2022-05-16 00:43:43] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 154 ms returned sat
[2022-05-16 00:44:07] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 10504 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10504/10504 places, 30102/30102 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 10503 transition count 30101
Applied a total of 2 rules in 623 ms. Remains 10503 /10504 variables (removed 1) and now considering 30101/30102 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 10503/10504 places, 30101/30102 transitions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 239 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p1) p0), (NOT p1), p0]
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p1) p0), (NOT p1), p0]
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:44:09] [INFO ] Computed 201 place invariants in 568 ms
Could not prove EG (NOT p1)
Support contains 4 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 294 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:44:25] [INFO ] Computed 201 place invariants in 714 ms
[2022-05-16 00:44:27] [INFO ] Implicit Places using invariants in 2515 ms returned []
Implicit Place search using SMT only with invariants took 2517 ms to find 0 implicit places.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:44:27] [INFO ] Computed 201 place invariants in 587 ms
[2022-05-16 00:44:29] [INFO ] Dead Transitions using invariants and state equation in 2371 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21202/21202 places, 40800/40800 transitions.
Computed a total of 401 stabilizing places and 500 stable transitions
Computed a total of 401 stabilizing places and 500 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 309 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p1) p0), (NOT p1), p0]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 713 ms. (steps per millisecond=14 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 70637 steps, run timeout after 3004 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70637 steps, saw 69732 distinct states, run finished after 3004 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:44:34] [INFO ] Computed 201 place invariants in 480 ms
[2022-05-16 00:44:38] [INFO ] [Real]Absence check using 101 positive place invariants in 557 ms returned sat
[2022-05-16 00:44:38] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 235 ms returned sat
[2022-05-16 00:44:59] [INFO ] After 25020ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 00:45:03] [INFO ] [Nat]Absence check using 101 positive place invariants in 560 ms returned sat
[2022-05-16 00:45:03] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 238 ms returned sat
[2022-05-16 00:45:24] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 21202 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 21202 transition count 40101
Reduce places removed 699 places and 0 transitions.
Iterating post reduction 1 with 699 rules applied. Total rules applied 1398 place count 20503 transition count 40101
Performed 9998 Post agglomeration using F-continuation condition.Transition count delta: 9998
Deduced a syphon composed of 9998 places in 20 ms
Reduce places removed 9998 places and 0 transitions.
Iterating global reduction 2 with 19996 rules applied. Total rules applied 21394 place count 10505 transition count 30103
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21395 place count 10505 transition count 30102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21396 place count 10504 transition count 30102
Applied a total of 21396 rules in 9233 ms. Remains 10504 /21202 variables (removed 10698) and now considering 30102/40800 (removed 10698) transitions.
Finished structural reductions, in 1 iterations. Remains : 10504/21202 places, 30102/40800 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 426 ms. (steps per millisecond=23 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 30102 rows 10504 cols
[2022-05-16 00:45:34] [INFO ] Computed 201 place invariants in 335 ms
[2022-05-16 00:45:36] [INFO ] [Real]Absence check using 101 positive place invariants in 235 ms returned sat
[2022-05-16 00:45:36] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 141 ms returned sat
[2022-05-16 00:45:36] [INFO ] After 1478ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 00:45:37] [INFO ] [Nat]Absence check using 101 positive place invariants in 236 ms returned sat
[2022-05-16 00:45:37] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 139 ms returned sat
[2022-05-16 00:46:01] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 10504 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10504/10504 places, 30102/30102 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 10503 transition count 30101
Applied a total of 2 rules in 482 ms. Remains 10503 /10504 variables (removed 1) and now considering 30101/30102 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 10503/10504 places, 30101/30102 transitions.
Finished random walk after 527 steps, including 0 resets, run visited all 1 properties in 21 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 315 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p1) p0), (NOT p1), p0]
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) p0), (NOT p1), p0]
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:46:03] [INFO ] Computed 201 place invariants in 669 ms
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) p0), (NOT p1), p0]
Product exploration explored 100000 steps with 56 reset in 3190 ms.
Product exploration explored 100000 steps with 56 reset in 3275 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p1) p0), (NOT p1), p0]
Support contains 4 out of 21202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Performed 499 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 499 rules applied. Total rules applied 499 place count 21202 transition count 40800
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 101 Pre rules applied. Total rules applied 499 place count 21202 transition count 40800
Deduced a syphon composed of 600 places in 24 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 600 place count 21202 transition count 40800
Performed 10097 Post agglomeration using F-continuation condition.Transition count delta: -9898
Deduced a syphon composed of 10697 places in 20 ms
Iterating global reduction 1 with 10097 rules applied. Total rules applied 10697 place count 21202 transition count 50698
Discarding 598 places :
Symmetric choice reduction at 1 with 598 rule applications. Total rules 11295 place count 20604 transition count 50100
Deduced a syphon composed of 10099 places in 27 ms
Iterating global reduction 1 with 598 rules applied. Total rules applied 11893 place count 20604 transition count 50100
Deduced a syphon composed of 10099 places in 10 ms
Applied a total of 11893 rules in 10136 ms. Remains 20604 /21202 variables (removed 598) and now considering 50100/40800 (removed -9300) transitions.
// Phase 1: matrix 50100 rows 20604 cols
[2022-05-16 00:46:36] [INFO ] Computed 201 place invariants in 624 ms
[2022-05-16 00:46:37] [INFO ] Dead Transitions using invariants and state equation in 2157 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20604/21202 places, 50100/40800 transitions.
Finished structural reductions, in 1 iterations. Remains : 20604/21202 places, 50100/40800 transitions.
Product exploration explored 100000 steps with 144 reset in 5403 ms.
Stack based approach found an accepted trace after 67230 steps with 95 reset with depth 709 and stack size 706 in 3621 ms.
FORMULA CANConstruction-PT-100-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-06 finished in 272464 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(X(F(G(p1)))))||p0)))'
Support contains 4 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 262 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:46:47] [INFO ] Computed 201 place invariants in 580 ms
[2022-05-16 00:46:49] [INFO ] Implicit Places using invariants in 2121 ms returned []
Implicit Place search using SMT only with invariants took 2124 ms to find 0 implicit places.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:46:49] [INFO ] Computed 201 place invariants in 528 ms
[2022-05-16 00:46:51] [INFO ] Dead Transitions using invariants and state equation in 2064 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (LT s146 1) (LT s5382 1)), p1:(AND (GEQ s146 1) (GEQ s5382 1) (GEQ s314 1) (GEQ s6198 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 59270 steps with 29635 reset in 10001 ms.
Product exploration timeout after 57030 steps with 28515 reset in 10005 ms.
Computed a total of 401 stabilizing places and 500 stable transitions
Computed a total of 401 stabilizing places and 500 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA CANConstruction-PT-100-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-100-LTLFireability-07 finished in 24928 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(p0)))&&F(X((G(p1) U p1)))))'
Support contains 3 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 280 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:47:12] [INFO ] Computed 201 place invariants in 650 ms
[2022-05-16 00:47:14] [INFO ] Implicit Places using invariants in 2230 ms returned []
Implicit Place search using SMT only with invariants took 2231 ms to find 0 implicit places.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:47:14] [INFO ] Computed 201 place invariants in 574 ms
[2022-05-16 00:47:16] [INFO ] Dead Transitions using invariants and state equation in 2138 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(AND (GEQ s1350 1) (GEQ s13670 1)), p1:(GEQ s2321 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-100-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-09 finished in 4911 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(X(p0))&&(p1 U p2)&&p3))))'
Support contains 4 out of 21202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 697 transitions
Trivial Post-agglo rules discarded 697 transitions
Performed 697 trivial Post agglomeration. Transition count delta: 697
Iterating post reduction 0 with 697 rules applied. Total rules applied 697 place count 21202 transition count 40103
Reduce places removed 697 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 698 rules applied. Total rules applied 1395 place count 20505 transition count 40102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1396 place count 20504 transition count 40102
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1396 place count 20504 transition count 40101
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1398 place count 20503 transition count 40101
Performed 9996 Post agglomeration using F-continuation condition.Transition count delta: 9996
Deduced a syphon composed of 9996 places in 18 ms
Reduce places removed 9996 places and 0 transitions.
Iterating global reduction 3 with 19992 rules applied. Total rules applied 21390 place count 10507 transition count 30105
Applied a total of 21390 rules in 8886 ms. Remains 10507 /21202 variables (removed 10695) and now considering 30105/40800 (removed 10695) transitions.
// Phase 1: matrix 30105 rows 10507 cols
[2022-05-16 00:47:25] [INFO ] Computed 201 place invariants in 252 ms
[2022-05-16 00:47:26] [INFO ] Implicit Places using invariants in 1207 ms returned []
Implicit Place search using SMT only with invariants took 1208 ms to find 0 implicit places.
// Phase 1: matrix 30105 rows 10507 cols
[2022-05-16 00:47:26] [INFO ] Computed 201 place invariants in 265 ms
[2022-05-16 00:47:27] [INFO ] Dead Transitions using invariants and state equation in 1234 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10507/21202 places, 30105/40800 transitions.
Finished structural reductions, in 1 iterations. Remains : 10507/21202 places, 30105/40800 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p3) (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (AND p3 p2 p0) (AND p3 p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p3) (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p3 (NOT p2) p0 p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p3:(GEQ s101 1), p2:(GEQ s9981 1), p0:(GEQ s4593 1), p1:(LT s9027 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 647 steps with 0 reset in 32 ms.
FORMULA CANConstruction-PT-100-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-12 finished in 11581 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(X(X((F(p0)||(G(p1)&&F(p1)))))))))'
Support contains 3 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 200 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:47:28] [INFO ] Computed 201 place invariants in 525 ms
[2022-05-16 00:47:30] [INFO ] Implicit Places using invariants in 2319 ms returned []
Implicit Place search using SMT only with invariants took 2320 ms to find 0 implicit places.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:47:31] [INFO ] Computed 201 place invariants in 551 ms
[2022-05-16 00:47:32] [INFO ] Dead Transitions using invariants and state equation in 2317 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LT s10789 1), p1:(AND (GEQ s795 1) (GEQ s1336 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 56 reset in 3239 ms.
Product exploration explored 100000 steps with 56 reset in 3337 ms.
Computed a total of 401 stabilizing places and 500 stable transitions
Computed a total of 401 stabilizing places and 500 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 6 states, 7 edges and 2 AP to 6 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 512 ms. (steps per millisecond=19 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 88905 steps, run timeout after 3002 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 88905 steps, saw 87732 distinct states, run finished after 3002 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:47:44] [INFO ] Computed 201 place invariants in 488 ms
[2022-05-16 00:47:47] [INFO ] [Real]Absence check using 101 positive place invariants in 572 ms returned sat
[2022-05-16 00:47:48] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 209 ms returned sat
[2022-05-16 00:48:09] [INFO ] After 25027ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 21202 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 698 transitions
Trivial Post-agglo rules discarded 698 transitions
Performed 698 trivial Post agglomeration. Transition count delta: 698
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 21202 transition count 40102
Reduce places removed 698 places and 0 transitions.
Iterating post reduction 1 with 698 rules applied. Total rules applied 1396 place count 20504 transition count 40102
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1396 place count 20504 transition count 40101
Deduced a syphon composed of 1 places in 18 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1398 place count 20503 transition count 40101
Performed 9998 Post agglomeration using F-continuation condition.Transition count delta: 9998
Deduced a syphon composed of 9998 places in 20 ms
Reduce places removed 9998 places and 0 transitions.
Iterating global reduction 2 with 19996 rules applied. Total rules applied 21394 place count 10505 transition count 30103
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21395 place count 10505 transition count 30102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21396 place count 10504 transition count 30102
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 21397 place count 10504 transition count 30102
Applied a total of 21397 rules in 9225 ms. Remains 10504 /21202 variables (removed 10698) and now considering 30102/40800 (removed 10698) transitions.
Finished structural reductions, in 1 iterations. Remains : 10504/21202 places, 30102/40800 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 502 ms. (steps per millisecond=19 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 77240 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77240 steps, saw 73834 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 30102 rows 10504 cols
[2022-05-16 00:48:22] [INFO ] Computed 201 place invariants in 296 ms
[2022-05-16 00:48:23] [INFO ] [Real]Absence check using 101 positive place invariants in 241 ms returned sat
[2022-05-16 00:48:24] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 141 ms returned sat
[2022-05-16 00:48:47] [INFO ] After 25024ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 10504 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10504/10504 places, 30102/30102 transitions.
Applied a total of 0 rules in 344 ms. Remains 10504 /10504 variables (removed 0) and now considering 30102/30102 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10504/10504 places, 30102/30102 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 10504/10504 places, 30102/30102 transitions.
Applied a total of 0 rules in 280 ms. Remains 10504 /10504 variables (removed 0) and now considering 30102/30102 (removed 0) transitions.
// Phase 1: matrix 30102 rows 10504 cols
[2022-05-16 00:48:48] [INFO ] Computed 201 place invariants in 226 ms
[2022-05-16 00:48:49] [INFO ] Implicit Places using invariants in 1062 ms returned []
Implicit Place search using SMT only with invariants took 1062 ms to find 0 implicit places.
// Phase 1: matrix 30102 rows 10504 cols
[2022-05-16 00:48:49] [INFO ] Computed 201 place invariants in 257 ms
[2022-05-16 00:48:50] [INFO ] Dead Transitions using invariants and state equation in 1160 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10504/10504 places, 30102/30102 transitions.
Graph (trivial) has 29699 edges and 10504 vertex of which 9998 / 10504 are part of one of the 99 SCC in 14 ms
Free SCC test removed 9899 places
Drop transitions removed 19699 transitions
Ensure Unique test removed 9701 transitions
Reduce isomorphic transitions removed 29400 transitions.
Graph (complete) has 1303 edges and 605 vertex of which 113 are kept as prefixes of interest. Removing 492 places using SCC suffix rule.0 ms
Discarding 492 places :
Also discarding 293 output transitions
Drop transitions removed 293 transitions
Drop transitions removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 201 rules applied. Total rules applied 203 place count 112 transition count 209
Reduce places removed 1 places and 0 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Iterating post reduction 1 with 100 rules applied. Total rules applied 303 place count 111 transition count 110
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 2 with 197 rules applied. Total rules applied 500 place count 12 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 500 place count 12 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 504 place count 10 transition count 10
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 505 place count 9 transition count 9
Iterating global reduction 3 with 1 rules applied. Total rules applied 506 place count 9 transition count 9
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 507 place count 9 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 508 place count 8 transition count 8
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 509 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 510 place count 7 transition count 7
Iterating global reduction 4 with 1 rules applied. Total rules applied 511 place count 7 transition count 7
Applied a total of 511 rules in 205 ms. Remains 7 /10504 variables (removed 10497) and now considering 7/30102 (removed 30095) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 7 rows 7 cols
[2022-05-16 00:48:50] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 00:48:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 00:48:50] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 00:48:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 00:48:50] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 00:48:50] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-16 00:48:50] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-16 00:48:50] [INFO ] Flatten gal took : 3 ms
[2022-05-16 00:48:50] [INFO ] Flatten gal took : 0 ms
[2022-05-16 00:48:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality966863236813627634.gal : 2 ms
[2022-05-16 00:48:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14422415438604778832.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms7655136050769987000;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality966863236813627634.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14422415438604778832.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality14422415438604778832.prop.
Reachability property apf1 is true.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,12,0.002572,3936,2,11,6,48,6,0,32,25,0
Total reachable state count : 12

Verifying 2 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,0.002871,3936,2,8,6,48,7,0,39,25,0
Reachability property apf1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,1,0.002975,3936,2,8,6,48,8,0,39,25,0
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 6 states, 7 edges and 2 AP to 6 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 207 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:48:52] [INFO ] Computed 201 place invariants in 521 ms
[2022-05-16 00:48:53] [INFO ] Implicit Places using invariants in 2077 ms returned []
Implicit Place search using SMT only with invariants took 2077 ms to find 0 implicit places.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:48:54] [INFO ] Computed 201 place invariants in 468 ms
[2022-05-16 00:48:55] [INFO ] Dead Transitions using invariants and state equation in 2015 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21202/21202 places, 40800/40800 transitions.
Computed a total of 401 stabilizing places and 500 stable transitions
Computed a total of 401 stabilizing places and 500 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 6 states, 7 edges and 2 AP to 6 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 486 ms. (steps per millisecond=20 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 113463 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 113463 steps, saw 111909 distinct states, run finished after 3002 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:49:00] [INFO ] Computed 201 place invariants in 454 ms
[2022-05-16 00:49:03] [INFO ] [Real]Absence check using 101 positive place invariants in 556 ms returned sat
[2022-05-16 00:49:03] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 237 ms returned sat
[2022-05-16 00:49:25] [INFO ] After 25033ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 21202 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 698 transitions
Trivial Post-agglo rules discarded 698 transitions
Performed 698 trivial Post agglomeration. Transition count delta: 698
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 21202 transition count 40102
Reduce places removed 698 places and 0 transitions.
Iterating post reduction 1 with 698 rules applied. Total rules applied 1396 place count 20504 transition count 40102
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1396 place count 20504 transition count 40101
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1398 place count 20503 transition count 40101
Performed 9998 Post agglomeration using F-continuation condition.Transition count delta: 9998
Deduced a syphon composed of 9998 places in 21 ms
Reduce places removed 9998 places and 0 transitions.
Iterating global reduction 2 with 19996 rules applied. Total rules applied 21394 place count 10505 transition count 30103
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21395 place count 10505 transition count 30102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21396 place count 10504 transition count 30102
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 21397 place count 10504 transition count 30102
Applied a total of 21397 rules in 8832 ms. Remains 10504 /21202 variables (removed 10698) and now considering 30102/40800 (removed 10698) transitions.
Finished structural reductions, in 1 iterations. Remains : 10504/21202 places, 30102/40800 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 80721 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80721 steps, saw 74391 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 30102 rows 10504 cols
[2022-05-16 00:49:38] [INFO ] Computed 201 place invariants in 303 ms
[2022-05-16 00:49:39] [INFO ] [Real]Absence check using 101 positive place invariants in 239 ms returned sat
[2022-05-16 00:49:39] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 137 ms returned sat
[2022-05-16 00:50:03] [INFO ] After 25033ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 10504 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10504/10504 places, 30102/30102 transitions.
Applied a total of 0 rules in 777 ms. Remains 10504 /10504 variables (removed 0) and now considering 30102/30102 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10504/10504 places, 30102/30102 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 10504/10504 places, 30102/30102 transitions.
Applied a total of 0 rules in 743 ms. Remains 10504 /10504 variables (removed 0) and now considering 30102/30102 (removed 0) transitions.
// Phase 1: matrix 30102 rows 10504 cols
[2022-05-16 00:50:05] [INFO ] Computed 201 place invariants in 668 ms
[2022-05-16 00:50:07] [INFO ] Implicit Places using invariants in 2309 ms returned []
Implicit Place search using SMT only with invariants took 2319 ms to find 0 implicit places.
// Phase 1: matrix 30102 rows 10504 cols
[2022-05-16 00:50:07] [INFO ] Computed 201 place invariants in 608 ms
[2022-05-16 00:50:09] [INFO ] Dead Transitions using invariants and state equation in 2261 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10504/10504 places, 30102/30102 transitions.
Graph (trivial) has 29699 edges and 10504 vertex of which 9998 / 10504 are part of one of the 99 SCC in 9 ms
Free SCC test removed 9899 places
Drop transitions removed 19699 transitions
Ensure Unique test removed 9701 transitions
Reduce isomorphic transitions removed 29400 transitions.
Graph (complete) has 1303 edges and 605 vertex of which 113 are kept as prefixes of interest. Removing 492 places using SCC suffix rule.0 ms
Discarding 492 places :
Also discarding 293 output transitions
Drop transitions removed 293 transitions
Drop transitions removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 201 rules applied. Total rules applied 203 place count 112 transition count 209
Reduce places removed 1 places and 0 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Iterating post reduction 1 with 100 rules applied. Total rules applied 303 place count 111 transition count 110
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 2 with 197 rules applied. Total rules applied 500 place count 12 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 500 place count 12 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 504 place count 10 transition count 10
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 505 place count 9 transition count 9
Iterating global reduction 3 with 1 rules applied. Total rules applied 506 place count 9 transition count 9
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 507 place count 9 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 508 place count 8 transition count 8
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 509 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 510 place count 7 transition count 7
Iterating global reduction 4 with 1 rules applied. Total rules applied 511 place count 7 transition count 7
Applied a total of 511 rules in 312 ms. Remains 7 /10504 variables (removed 10497) and now considering 7/30102 (removed 30095) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 7 rows 7 cols
[2022-05-16 00:50:09] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 00:50:09] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 00:50:09] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 00:50:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 32 ms returned sat
[2022-05-16 00:50:10] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 00:50:10] [INFO ] After 353ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 120 ms.
[2022-05-16 00:50:10] [INFO ] After 787ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-16 00:50:10] [INFO ] Flatten gal took : 1 ms
[2022-05-16 00:50:10] [INFO ] Flatten gal took : 0 ms
[2022-05-16 00:50:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17666896980093703555.gal : 0 ms
[2022-05-16 00:50:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2011827856137132318.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms18198114019159692710;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17666896980093703555.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2011827856137132318.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality2011827856137132318.prop.
Reachability property apf1 is true.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,12,0.002547,3936,2,11,6,47,6,0,32,26,0
Total reachable state count : 12

Verifying 2 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,0.002862,3936,2,8,6,47,7,0,39,26,0
Reachability property apf1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,1,0.002985,3936,2,8,6,47,8,0,39,26,0
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 191 ms. Reduced automaton from 6 states, 7 edges and 2 AP to 6 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 456 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 57 reset in 3743 ms.
Product exploration explored 100000 steps with 55 reset in 6649 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 422 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 21202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Performed 498 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 498 rules applied. Total rules applied 498 place count 21202 transition count 40800
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 102 Pre rules applied. Total rules applied 498 place count 21202 transition count 40800
Deduced a syphon composed of 600 places in 37 ms
Iterating global reduction 1 with 102 rules applied. Total rules applied 600 place count 21202 transition count 40800
Performed 10097 Post agglomeration using F-continuation condition.Transition count delta: -9899
Deduced a syphon composed of 10697 places in 39 ms
Iterating global reduction 1 with 10097 rules applied. Total rules applied 10697 place count 21202 transition count 50699
Discarding 596 places :
Symmetric choice reduction at 1 with 596 rule applications. Total rules 11293 place count 20606 transition count 50103
Deduced a syphon composed of 10101 places in 29 ms
Iterating global reduction 1 with 596 rules applied. Total rules applied 11889 place count 20606 transition count 50103
Deduced a syphon composed of 10101 places in 37 ms
Applied a total of 11889 rules in 17307 ms. Remains 20606 /21202 variables (removed 596) and now considering 50103/40800 (removed -9303) transitions.
// Phase 1: matrix 50103 rows 20606 cols
[2022-05-16 00:50:40] [INFO ] Computed 201 place invariants in 584 ms
[2022-05-16 00:50:42] [INFO ] Dead Transitions using invariants and state equation in 2789 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20606/21202 places, 50103/40800 transitions.
Finished structural reductions, in 1 iterations. Remains : 20606/21202 places, 50103/40800 transitions.
Product exploration explored 100000 steps with 144 reset in 8539 ms.
Product exploration explored 100000 steps with 142 reset in 9354 ms.
Built C files in :
/tmp/ltsmin10437694194936629752
[2022-05-16 00:51:01] [INFO ] Built C files in 614ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10437694194936629752
Running compilation step : cd /tmp/ltsmin10437694194936629752;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10437694194936629752;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10437694194936629752;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 510 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:51:06] [INFO ] Computed 201 place invariants in 1264 ms
[2022-05-16 00:51:10] [INFO ] Implicit Places using invariants in 5026 ms returned []
Implicit Place search using SMT only with invariants took 5027 ms to find 0 implicit places.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:51:11] [INFO ] Computed 201 place invariants in 880 ms
[2022-05-16 00:51:18] [INFO ] Dead Transitions using invariants and state equation in 8128 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21202/21202 places, 40800/40800 transitions.
Built C files in :
/tmp/ltsmin4785008225549054633
[2022-05-16 00:51:19] [INFO ] Built C files in 823ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4785008225549054633
Running compilation step : cd /tmp/ltsmin4785008225549054633;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4785008225549054633;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4785008225549054633;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 00:51:25] [INFO ] Flatten gal took : 2476 ms
[2022-05-16 00:51:27] [INFO ] Flatten gal took : 1752 ms
[2022-05-16 00:51:27] [INFO ] Time to serialize gal into /tmp/LTL3309830298780006997.gal : 171 ms
[2022-05-16 00:51:27] [INFO ] Time to serialize properties into /tmp/LTL8054121668140162189.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3309830298780006997.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8054121668140162189.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3309830...266
Read 1 LTL properties
Detected timeout of ITS tools.
[2022-05-16 00:51:45] [INFO ] Flatten gal took : 2526 ms
[2022-05-16 00:51:45] [INFO ] Applying decomposition
[2022-05-16 00:51:47] [INFO ] Flatten gal took : 2034 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14137610628056546987.txt' '-o' '/tmp/graph14137610628056546987.bin' '-w' '/tmp/graph14137610628056546987.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14137610628056546987.bin' '-l' '-1' '-v' '-w' '/tmp/graph14137610628056546987.weights' '-q' '0' '-e' '0.001'
[2022-05-16 00:51:52] [INFO ] Decomposing Gal with order
[2022-05-16 00:51:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 00:52:09] [INFO ] Removed a total of 17290 redundant transitions.
[2022-05-16 00:52:10] [INFO ] Flatten gal took : 6358 ms
[2022-05-16 00:52:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 326 labels/synchronizations in 876 ms.
[2022-05-16 00:52:12] [INFO ] Time to serialize gal into /tmp/LTL13589992014110941089.gal : 470 ms
[2022-05-16 00:52:12] [INFO ] Time to serialize properties into /tmp/LTL986544186999889554.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13589992014110941089.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL986544186999889554.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1358999...245
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4385609031258980795
[2022-05-16 00:52:28] [INFO ] Built C files in 507ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4385609031258980795
Running compilation step : cd /tmp/ltsmin4385609031258980795;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4385609031258980795;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4385609031258980795;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CANConstruction-PT-100-LTLFireability-13 finished in 303653 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!X(p0)) U (X(p1) U (G(p2) U (G(p1)||p0)))))'
Support contains 5 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 448 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:52:33] [INFO ] Computed 201 place invariants in 1048 ms
[2022-05-16 00:52:37] [INFO ] Implicit Places using invariants in 4894 ms returned []
Implicit Place search using SMT only with invariants took 4895 ms to find 0 implicit places.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:52:38] [INFO ] Computed 201 place invariants in 990 ms
[2022-05-16 00:52:42] [INFO ] Dead Transitions using invariants and state equation in 5575 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 1346 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) p0), false, (AND p0 (NOT p1) (NOT p2)), p0, true, (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0), (NOT p2)]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 8}], [{ cond=p0, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 5}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=7 dest: 9}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND p0 p2), acceptance={} source=8 dest: 9}], [{ cond=(NOT p2), acceptance={} source=9 dest: 5}, { cond=p2, acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(AND (GEQ s440 1) (GEQ s3244 1)), p1:(AND (GEQ s608 1) (GEQ s6436 1)), p2:(GEQ s18465 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 45290 steps with 12949 reset in 10043 ms.
Product exploration timeout after 40320 steps with 11549 reset in 10016 ms.
Computed a total of 401 stabilizing places and 500 stable transitions
Computed a total of 401 stabilizing places and 500 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 2650 ms. Reduced automaton from 10 states, 19 edges and 3 AP to 10 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 1060 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) p0), false, (AND p0 (NOT p1) (NOT p2)), p0, true, (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 1312 ms. (steps per millisecond=7 ) properties (out of 14) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:53:11] [INFO ] Computed 201 place invariants in 978 ms
[2022-05-16 00:53:26] [INFO ] [Real]Absence check using 101 positive place invariants in 1503 ms returned sat
[2022-05-16 00:53:27] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 497 ms returned sat
[2022-05-16 00:53:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 00:53:36] [INFO ] After 25078ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 21202 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 698 transitions
Trivial Post-agglo rules discarded 698 transitions
Performed 698 trivial Post agglomeration. Transition count delta: 698
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 21202 transition count 40102
Reduce places removed 698 places and 0 transitions.
Iterating post reduction 1 with 698 rules applied. Total rules applied 1396 place count 20504 transition count 40102
Performed 9999 Post agglomeration using F-continuation condition.Transition count delta: 9999
Deduced a syphon composed of 9999 places in 30 ms
Reduce places removed 9999 places and 0 transitions.
Iterating global reduction 2 with 19998 rules applied. Total rules applied 21394 place count 10505 transition count 30103
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21396 place count 10505 transition count 30101
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21398 place count 10503 transition count 30101
Applied a total of 21398 rules in 25033 ms. Remains 10503 /21202 variables (removed 10699) and now considering 30101/40800 (removed 10699) transitions.
Finished structural reductions, in 1 iterations. Remains : 10503/21202 places, 30101/40800 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 1091 ms. (steps per millisecond=9 ) properties (out of 10) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 30101 rows 10503 cols
[2022-05-16 00:54:03] [INFO ] Computed 201 place invariants in 418 ms
[2022-05-16 00:54:09] [INFO ] [Real]Absence check using 101 positive place invariants in 663 ms returned sat
[2022-05-16 00:54:09] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 144 ms returned sat
[2022-05-16 00:54:10] [INFO ] After 6521ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-16 00:54:18] [INFO ] [Nat]Absence check using 101 positive place invariants in 599 ms returned sat
[2022-05-16 00:54:18] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 375 ms returned sat
[2022-05-16 00:54:35] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 10503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10503/10503 places, 30101/30101 transitions.
Applied a total of 0 rules in 619 ms. Remains 10503 /10503 variables (removed 0) and now considering 30101/30101 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10503/10503 places, 30101/30101 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 1132 ms. (steps per millisecond=8 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 47913 steps, run timeout after 3003 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 47913 steps, saw 47231 distinct states, run finished after 3003 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 30101 rows 10503 cols
[2022-05-16 00:54:41] [INFO ] Computed 201 place invariants in 307 ms
[2022-05-16 00:54:45] [INFO ] [Real]Absence check using 101 positive place invariants in 1549 ms returned sat
[2022-05-16 00:54:49] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 3984 ms returned sat
[2022-05-16 00:54:51] [INFO ] After 10093ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-16 00:54:59] [INFO ] [Nat]Absence check using 101 positive place invariants in 477 ms returned sat
[2022-05-16 00:55:01] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 2313 ms returned sat
[2022-05-16 00:55:16] [INFO ] After 12671ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-16 00:55:16] [INFO ] State equation strengthened by 29899 read => feed constraints.
[2022-05-16 00:55:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 00:55:16] [INFO ] After 25660ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 10503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10503/10503 places, 30101/30101 transitions.
Applied a total of 0 rules in 374 ms. Remains 10503 /10503 variables (removed 0) and now considering 30101/30101 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10503/10503 places, 30101/30101 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 10503/10503 places, 30101/30101 transitions.
Applied a total of 0 rules in 509 ms. Remains 10503 /10503 variables (removed 0) and now considering 30101/30101 (removed 0) transitions.
// Phase 1: matrix 30101 rows 10503 cols
[2022-05-16 00:55:18] [INFO ] Computed 201 place invariants in 571 ms
[2022-05-16 00:55:19] [INFO ] Implicit Places using invariants in 2268 ms returned []
Implicit Place search using SMT only with invariants took 2268 ms to find 0 implicit places.
// Phase 1: matrix 30101 rows 10503 cols
[2022-05-16 00:55:20] [INFO ] Computed 201 place invariants in 557 ms
[2022-05-16 00:55:22] [INFO ] Dead Transitions using invariants and state equation in 2099 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10503/10503 places, 30101/30101 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p2)))), (F p1), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p2))), (F (AND p0 (NOT p1))), (F (AND p0 (NOT p1) (NOT p2)))]
Knowledge based reduction with 22 factoid took 2815 ms. Reduced automaton from 10 states, 19 edges and 3 AP to 10 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 605 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) p0), false, (AND p0 (NOT p1) (NOT p2)), p0, true, (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0), (NOT p2)]
Stuttering acceptance computed with spot in 642 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) p0), false, (AND p0 (NOT p1) (NOT p2)), p0, true, (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0), (NOT p2)]
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:55:27] [INFO ] Computed 201 place invariants in 601 ms
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 5 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 357 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:55:43] [INFO ] Computed 201 place invariants in 868 ms
[2022-05-16 00:55:47] [INFO ] Implicit Places using invariants in 5208 ms returned []
Implicit Place search using SMT only with invariants took 5209 ms to find 0 implicit places.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:55:48] [INFO ] Computed 201 place invariants in 920 ms
[2022-05-16 00:55:51] [INFO ] Dead Transitions using invariants and state equation in 3961 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21202/21202 places, 40800/40800 transitions.
Computed a total of 401 stabilizing places and 500 stable transitions
Computed a total of 401 stabilizing places and 500 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 2020 ms. Reduced automaton from 10 states, 19 edges and 3 AP to 10 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 581 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) p0), false, (AND p0 (NOT p1) (NOT p2)), p0, true, (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 1272 ms. (steps per millisecond=7 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 52225 steps, run timeout after 3002 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 52225 steps, saw 51576 distinct states, run finished after 3002 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:55:59] [INFO ] Computed 201 place invariants in 430 ms
[2022-05-16 00:56:06] [INFO ] [Real]Absence check using 101 positive place invariants in 491 ms returned sat
[2022-05-16 00:56:06] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 201 ms returned sat
[2022-05-16 00:56:06] [INFO ] After 7087ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2022-05-16 00:56:13] [INFO ] [Nat]Absence check using 101 positive place invariants in 502 ms returned sat
[2022-05-16 00:56:13] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 205 ms returned sat
[2022-05-16 00:56:32] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 21202 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 698 transitions
Trivial Post-agglo rules discarded 698 transitions
Performed 698 trivial Post agglomeration. Transition count delta: 698
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 21202 transition count 40102
Reduce places removed 698 places and 0 transitions.
Iterating post reduction 1 with 698 rules applied. Total rules applied 1396 place count 20504 transition count 40102
Performed 9999 Post agglomeration using F-continuation condition.Transition count delta: 9999
Deduced a syphon composed of 9999 places in 17 ms
Reduce places removed 9999 places and 0 transitions.
Iterating global reduction 2 with 19998 rules applied. Total rules applied 21394 place count 10505 transition count 30103
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21396 place count 10505 transition count 30101
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21398 place count 10503 transition count 30101
Applied a total of 21398 rules in 8591 ms. Remains 10503 /21202 variables (removed 10699) and now considering 30101/40800 (removed 10699) transitions.
Finished structural reductions, in 1 iterations. Remains : 10503/21202 places, 30101/40800 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 1031 ms. (steps per millisecond=9 ) properties (out of 14) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 30101 rows 10503 cols
[2022-05-16 00:56:41] [INFO ] Computed 201 place invariants in 179 ms
[2022-05-16 00:56:43] [INFO ] [Real]Absence check using 101 positive place invariants in 294 ms returned sat
[2022-05-16 00:56:43] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 206 ms returned sat
[2022-05-16 00:56:43] [INFO ] After 1824ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 00:56:45] [INFO ] [Nat]Absence check using 101 positive place invariants in 302 ms returned sat
[2022-05-16 00:56:45] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 223 ms returned sat
[2022-05-16 00:57:08] [INFO ] After 23219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 00:57:09] [INFO ] State equation strengthened by 29899 read => feed constraints.
[2022-05-16 00:57:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 00:57:09] [INFO ] After 25327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 10503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10503/10503 places, 30101/30101 transitions.
Applied a total of 0 rules in 662 ms. Remains 10503 /10503 variables (removed 0) and now considering 30101/30101 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10503/10503 places, 30101/30101 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 827 ms. (steps per millisecond=12 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 73788 steps, run timeout after 3002 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73788 steps, saw 72673 distinct states, run finished after 3002 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 30101 rows 10503 cols
[2022-05-16 00:57:14] [INFO ] Computed 201 place invariants in 566 ms
[2022-05-16 00:57:17] [INFO ] [Real]Absence check using 101 positive place invariants in 1006 ms returned sat
[2022-05-16 00:57:18] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 799 ms returned sat
[2022-05-16 00:57:19] [INFO ] After 4687ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 00:57:20] [INFO ] [Nat]Absence check using 101 positive place invariants in 307 ms returned sat
[2022-05-16 00:57:20] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 278 ms returned sat
[2022-05-16 00:57:44] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 10503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10503/10503 places, 30101/30101 transitions.
Applied a total of 0 rules in 221 ms. Remains 10503 /10503 variables (removed 0) and now considering 30101/30101 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10503/10503 places, 30101/30101 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 10503/10503 places, 30101/30101 transitions.
Applied a total of 0 rules in 209 ms. Remains 10503 /10503 variables (removed 0) and now considering 30101/30101 (removed 0) transitions.
// Phase 1: matrix 30101 rows 10503 cols
[2022-05-16 00:57:44] [INFO ] Computed 201 place invariants in 201 ms
[2022-05-16 00:57:45] [INFO ] Implicit Places using invariants in 1033 ms returned []
Implicit Place search using SMT only with invariants took 1033 ms to find 0 implicit places.
// Phase 1: matrix 30101 rows 10503 cols
[2022-05-16 00:57:45] [INFO ] Computed 201 place invariants in 195 ms
[2022-05-16 00:57:46] [INFO ] Dead Transitions using invariants and state equation in 1041 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10503/10503 places, 30101/30101 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p1) p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p2)), (F p0), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F p1), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 22 factoid took 1261 ms. Reduced automaton from 10 states, 19 edges and 3 AP to 10 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) p0), false, (AND p0 (NOT p1) (NOT p2)), p0, true, (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0), (NOT p2)]
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) p0), false, (AND p0 (NOT p1) (NOT p2)), p0, true, (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0), (NOT p2)]
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:57:48] [INFO ] Computed 201 place invariants in 372 ms
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) p0), false, (AND p0 (NOT p1) (NOT p2)), p0, true, (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0), (NOT p2)]
Product exploration timeout after 94240 steps with 26851 reset in 10001 ms.
Product exploration timeout after 95430 steps with 27302 reset in 10001 ms.
Applying partial POR strategy [false, false, true, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) p0), false, (AND p0 (NOT p1) (NOT p2)), p0, true, (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0), (NOT p2)]
Support contains 5 out of 21202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Performed 498 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 498 rules applied. Total rules applied 498 place count 21202 transition count 40800
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 102 Pre rules applied. Total rules applied 498 place count 21202 transition count 40800
Deduced a syphon composed of 600 places in 13 ms
Iterating global reduction 1 with 102 rules applied. Total rules applied 600 place count 21202 transition count 40800
Performed 10097 Post agglomeration using F-continuation condition.Transition count delta: -9899
Deduced a syphon composed of 10697 places in 17 ms
Iterating global reduction 1 with 10097 rules applied. Total rules applied 10697 place count 21202 transition count 50699
Discarding 596 places :
Symmetric choice reduction at 1 with 596 rule applications. Total rules 11293 place count 20606 transition count 50103
Deduced a syphon composed of 10101 places in 16 ms
Iterating global reduction 1 with 596 rules applied. Total rules applied 11889 place count 20606 transition count 50103
Deduced a syphon composed of 10101 places in 10 ms
Applied a total of 11889 rules in 13998 ms. Remains 20606 /21202 variables (removed 596) and now considering 50103/40800 (removed -9303) transitions.
// Phase 1: matrix 50103 rows 20606 cols
[2022-05-16 00:58:39] [INFO ] Computed 201 place invariants in 342 ms
[2022-05-16 00:58:40] [INFO ] Dead Transitions using invariants and state equation in 1896 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20606/21202 places, 50103/40800 transitions.
Finished structural reductions, in 1 iterations. Remains : 20606/21202 places, 50103/40800 transitions.
Product exploration timeout after 12660 steps with 3615 reset in 10012 ms.
Product exploration timeout after 8700 steps with 2508 reset in 10002 ms.
Built C files in :
/tmp/ltsmin16827335024005528131
[2022-05-16 00:59:00] [INFO ] Built C files in 261ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16827335024005528131
Running compilation step : cd /tmp/ltsmin16827335024005528131;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16827335024005528131;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16827335024005528131;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 5 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 313 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:59:05] [INFO ] Computed 201 place invariants in 1068 ms
[2022-05-16 00:59:12] [INFO ] Implicit Places using invariants in 8005 ms returned []
Implicit Place search using SMT only with invariants took 8005 ms to find 0 implicit places.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:59:12] [INFO ] Computed 201 place invariants in 679 ms
[2022-05-16 00:59:20] [INFO ] Dead Transitions using invariants and state equation in 8067 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21202/21202 places, 40800/40800 transitions.
Built C files in :
/tmp/ltsmin8708204568887322609
[2022-05-16 00:59:20] [INFO ] Built C files in 492ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8708204568887322609
Running compilation step : cd /tmp/ltsmin8708204568887322609;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8708204568887322609;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8708204568887322609;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 00:59:28] [INFO ] Flatten gal took : 2037 ms
[2022-05-16 00:59:31] [INFO ] Flatten gal took : 2968 ms
[2022-05-16 00:59:31] [INFO ] Time to serialize gal into /tmp/LTL16691621656703498872.gal : 258 ms
[2022-05-16 00:59:31] [INFO ] Time to serialize properties into /tmp/LTL365016795361094562.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16691621656703498872.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL365016795361094562.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1669162...266
Read 1 LTL properties
Detected timeout of ITS tools.
[2022-05-16 00:59:48] [INFO ] Flatten gal took : 2306 ms
[2022-05-16 00:59:48] [INFO ] Applying decomposition
[2022-05-16 00:59:51] [INFO ] Flatten gal took : 2188 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17049907415643332007.txt' '-o' '/tmp/graph17049907415643332007.bin' '-w' '/tmp/graph17049907415643332007.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17049907415643332007.bin' '-l' '-1' '-v' '-w' '/tmp/graph17049907415643332007.weights' '-q' '0' '-e' '0.001'
[2022-05-16 00:59:56] [INFO ] Decomposing Gal with order
[2022-05-16 01:00:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:00:15] [INFO ] Removed a total of 17283 redundant transitions.
[2022-05-16 01:00:16] [INFO ] Flatten gal took : 6522 ms
[2022-05-16 01:00:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 379 labels/synchronizations in 2053 ms.
[2022-05-16 01:00:21] [INFO ] Time to serialize gal into /tmp/LTL9785737714034059195.gal : 257 ms
[2022-05-16 01:00:21] [INFO ] Time to serialize properties into /tmp/LTL702109885490664020.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9785737714034059195.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL702109885490664020.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9785737...244
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7908588052447749193
[2022-05-16 01:00:56] [INFO ] Built C files in 7607ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7908588052447749193
Running compilation step : cd /tmp/ltsmin7908588052447749193;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7908588052447749193;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7908588052447749193;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CANConstruction-PT-100-LTLFireability-14 finished in 508330 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(G(p0))&&X(p1)))))'
Support contains 5 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 2337 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 01:01:05] [INFO ] Computed 201 place invariants in 2661 ms
[2022-05-16 01:01:09] [INFO ] Implicit Places using invariants in 6683 ms returned []
Implicit Place search using SMT only with invariants took 6701 ms to find 0 implicit places.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 01:01:11] [INFO ] Computed 201 place invariants in 1687 ms
[2022-05-16 01:01:39] [INFO ] Dead Transitions using invariants and state equation in 29959 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 16460 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s4727 1) (GEQ s1014 1) (GEQ s8078 1)) (GEQ s17055 1) (LT s1014 1) (LT s8078 1)), p1:(GEQ s20063 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 12 ms.
FORMULA CANConstruction-PT-100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-15 finished in 56542 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((X(F(p0))&&X(p1))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(X(X((F(p0)||(G(p1)&&F(p1)))))))))'
Found a SL insensitive property : CANConstruction-PT-100-LTLFireability-13
Spot timed out Subprocess running cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--hoaf=tv' '-f' '(G p0 | G!p0)&(G p1 | G!p1)' killed by timeout after 10 SECONDS
Stuttering acceptance computed with spot in 16170 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 21202 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 698 transitions
Trivial Post-agglo rules discarded 698 transitions
Performed 698 trivial Post agglomeration. Transition count delta: 698
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 21202 transition count 40102
Reduce places removed 698 places and 0 transitions.
Iterating post reduction 1 with 698 rules applied. Total rules applied 1396 place count 20504 transition count 40102
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1396 place count 20504 transition count 40101
Deduced a syphon composed of 1 places in 1949 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1398 place count 20503 transition count 40101

BK_STOP 1652662957439

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination 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=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANConstruction-PT-100"
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-100, 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 r024-tall-165251918700564"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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