Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918700563.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918700563
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-01
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-02
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-03
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-04
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-05
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-06
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-07
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-08
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-09
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-10
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-11
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-12
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-13
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-14
FORMULA_NAME CANConstruction-PT-100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652661198112

Running Version 202205111006
[2022-05-16 00:33:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 00:33:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 00:33:20] [INFO ] Load time of PNML (sax parser for PT used): 842 ms
[2022-05-16 00:33:20] [INFO ] Transformed 21202 places.
[2022-05-16 00:33:20] [INFO ] Transformed 40800 transitions.
[2022-05-16 00:33:20] [INFO ] Parsed PT model containing 21202 places and 40800 transitions in 1110 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 52 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANConstruction-PT-100-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-100-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-100-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-100-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-100-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-100-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-100-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 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 356 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:33:22] [INFO ] Computed 201 place invariants in 638 ms
[2022-05-16 00:33:24] [INFO ] Implicit Places using invariants in 2606 ms returned []
Implicit Place search using SMT only with invariants took 2641 ms to find 0 implicit places.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:33:24] [INFO ] Computed 201 place invariants in 398 ms
[2022-05-16 00:33:26] [INFO ] Dead Transitions using invariants and state equation in 2250 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21202/21202 places, 40800/40800 transitions.
Support contains 30 out of 21202 places after structural reductions.
[2022-05-16 00:33:28] [INFO ] Flatten gal took : 1290 ms
[2022-05-16 00:33:29] [INFO ] Flatten gal took : 1019 ms
[2022-05-16 00:33:30] [INFO ] Input system was already deterministic with 40800 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 1103 ms. (steps per millisecond=9 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) seen :0
Interrupted probabilistic random walk after 68940 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{15=1}
Probabilistic random walk after 68940 steps, saw 68059 distinct states, run finished after 3003 ms. (steps per millisecond=22 ) properties seen :1
Running SMT prover for 17 properties.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:33:36] [INFO ] Computed 201 place invariants in 361 ms
[2022-05-16 00:33:43] [INFO ] [Real]Absence check using 101 positive place invariants in 515 ms returned sat
[2022-05-16 00:33:44] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 169 ms returned sat
[2022-05-16 00:33:44] [INFO ] After 8288ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:16
[2022-05-16 00:33:51] [INFO ] [Nat]Absence check using 101 positive place invariants in 455 ms returned sat
[2022-05-16 00:33:51] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 180 ms returned sat
[2022-05-16 00:34:09] [INFO ] After 14046ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :13
[2022-05-16 00:34:09] [INFO ] State equation strengthened by 19900 read => feed constraints.
[2022-05-16 00:34:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 00:34:09] [INFO ] After 25308ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:16
Fused 17 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 25 out of 21202 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 695 transitions
Trivial Post-agglo rules discarded 695 transitions
Performed 695 trivial Post agglomeration. Transition count delta: 695
Iterating post reduction 0 with 695 rules applied. Total rules applied 695 place count 21202 transition count 40105
Reduce places removed 695 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 697 rules applied. Total rules applied 1392 place count 20507 transition count 40103
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1394 place count 20505 transition count 40103
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1394 place count 20505 transition count 40102
Deduced a syphon composed of 1 places in 22 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1396 place count 20504 transition count 40102
Performed 9986 Post agglomeration using F-continuation condition.Transition count delta: 9986
Deduced a syphon composed of 9986 places in 35 ms
Reduce places removed 9986 places and 0 transitions.
Iterating global reduction 3 with 19972 rules applied. Total rules applied 21368 place count 10518 transition count 30116
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21370 place count 10518 transition count 30114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 21372 place count 10516 transition count 30114
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 21373 place count 10516 transition count 30114
Applied a total of 21373 rules in 8050 ms. Remains 10516 /21202 variables (removed 10686) and now considering 30114/40800 (removed 10686) transitions.
Finished structural reductions, in 1 iterations. Remains : 10516/21202 places, 30114/40800 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 906 ms. (steps per millisecond=11 ) properties (out of 14) 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 11) 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 11) 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 11) 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 11) 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 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 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 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 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) 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 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 30114 rows 10516 cols
[2022-05-16 00:34:19] [INFO ] Computed 201 place invariants in 318 ms
[2022-05-16 00:34:21] [INFO ] After 2557ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-16 00:34:24] [INFO ] [Nat]Absence check using 101 positive place invariants in 213 ms returned sat
[2022-05-16 00:34:24] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 130 ms returned sat
[2022-05-16 00:34:47] [INFO ] After 21044ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 00:34:47] [INFO ] State equation strengthened by 29887 read => feed constraints.
[2022-05-16 00:34:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 00:34:47] [INFO ] After 25322ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 20 out of 10516 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10516/10516 places, 30114/30114 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 10512 transition count 30110
Applied a total of 8 rules in 363 ms. Remains 10512 /10516 variables (removed 4) and now considering 30110/30114 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 10512/10516 places, 30110/30114 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 965 ms. (steps per millisecond=10 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) 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 9) 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 9) 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 9) 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 9) 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 9) 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 9) 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 9) 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 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 30110 rows 10512 cols
[2022-05-16 00:34:49] [INFO ] Computed 201 place invariants in 233 ms
[2022-05-16 00:34:51] [INFO ] [Real]Absence check using 101 positive place invariants in 214 ms returned sat
[2022-05-16 00:34:51] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 133 ms returned sat
[2022-05-16 00:34:51] [INFO ] After 2674ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-16 00:34:54] [INFO ] [Nat]Absence check using 101 positive place invariants in 208 ms returned sat
[2022-05-16 00:34:54] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 135 ms returned sat
[2022-05-16 00:35:16] [INFO ] After 21448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-05-16 00:35:17] [INFO ] State equation strengthened by 29891 read => feed constraints.
[2022-05-16 00:35:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 00:35:17] [INFO ] After 25474ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 16 out of 10512 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10512/10512 places, 30110/30110 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 10510 transition count 30108
Applied a total of 4 rules in 311 ms. Remains 10510 /10512 variables (removed 2) and now considering 30108/30110 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 10510/10512 places, 30108/30110 transitions.
Successfully simplified 3 atomic propositions for a total of 9 simplifications.
Computed a total of 401 stabilizing places and 500 stable transitions
FORMULA CANConstruction-PT-100-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(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 16 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 5857 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:35:24] [INFO ] Computed 201 place invariants in 186 ms
[2022-05-16 00:35:25] [INFO ] Implicit Places using invariants in 1253 ms returned []
Implicit Place search using SMT only with invariants took 1257 ms to find 0 implicit places.
// Phase 1: matrix 30101 rows 10503 cols
[2022-05-16 00:35:25] [INFO ] Computed 201 place invariants in 190 ms
[2022-05-16 00:35:26] [INFO ] Dead Transitions using invariants and state equation in 1132 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 141 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s3554)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 625 steps with 0 reset in 104 ms.
FORMULA CANConstruction-PT-100-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLCardinality-00 finished in 8610 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(p0)||p1))||((G(!p1)||F(p2)) U X(p2))))'
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 119 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:27] [INFO ] Computed 201 place invariants in 337 ms
[2022-05-16 00:35:28] [INFO ] Implicit Places using invariants in 2048 ms returned []
Implicit Place search using SMT only with invariants took 2060 ms to find 0 implicit places.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:35:29] [INFO ] Computed 201 place invariants in 356 ms
[2022-05-16 00:35:30] [INFO ] Dead Transitions using invariants and state equation in 2057 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 :[(AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}]], initial=0, aps=[p2:(LEQ s18369 s12056), p1:(GT 1 s2858), p0:(GT s1522 s12798)], 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][false, false, false, false]]
Product exploration timeout after 87120 steps with 43560 reset in 10001 ms.
Product exploration timeout after 91920 steps with 45960 reset in 10001 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 p2 p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p2))))
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 4 states, 4 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA CANConstruction-PT-100-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-100-LTLCardinality-03 finished in 24705 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
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 126 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:51] [INFO ] Computed 201 place invariants in 354 ms
[2022-05-16 00:35:53] [INFO ] Implicit Places using invariants in 2006 ms returned []
Implicit Place search using SMT only with invariants took 2020 ms to find 0 implicit places.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:35:53] [INFO ] Computed 201 place invariants in 325 ms
[2022-05-16 00:35:55] [INFO ] Dead Transitions using invariants and state equation in 2017 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s7617 s777)], 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]]
Product exploration timeout after 91640 steps with 45820 reset in 10013 ms.
Product exploration timeout after 93300 steps with 46650 reset in 10001 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA CANConstruction-PT-100-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-100-LTLCardinality-04 finished in 24526 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(F(p0) U !p0))&&F(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 117 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:36:16] [INFO ] Computed 201 place invariants in 336 ms
[2022-05-16 00:36:17] [INFO ] Implicit Places using invariants in 1970 ms returned []
Implicit Place search using SMT only with invariants took 1996 ms to find 0 implicit places.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:36:18] [INFO ] Computed 201 place invariants in 322 ms
[2022-05-16 00:36:19] [INFO ] Dead Transitions using invariants and state equation in 1978 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 734 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ s19481 s5525), p1:(LEQ s8263 s11749)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 23069 steps with 12 reset in 649 ms.
FORMULA CANConstruction-PT-100-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLCardinality-05 finished in 5588 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
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 130 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:36:21] [INFO ] Computed 201 place invariants in 365 ms
[2022-05-16 00:36:23] [INFO ] Implicit Places using invariants in 2028 ms returned []
Implicit Place search using SMT only with invariants took 2060 ms to find 0 implicit places.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:36:24] [INFO ] Computed 201 place invariants in 391 ms
[2022-05-16 00:36:25] [INFO ] Dead Transitions using invariants and state equation in 2007 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s11436 s2866)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA CANConstruction-PT-100-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLCardinality-08 finished in 4348 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p0))&&p1)))'
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 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.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 699 rules applied. Total rules applied 1397 place count 20504 transition count 40101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 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 3 with 19998 rules applied. Total rules applied 21396 place count 10504 transition count 30102
Applied a total of 21396 rules in 6197 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:36:32] [INFO ] Computed 201 place invariants in 195 ms
[2022-05-16 00:36:33] [INFO ] Implicit Places using invariants in 1077 ms returned []
Implicit Place search using SMT only with invariants took 1081 ms to find 0 implicit places.
// Phase 1: matrix 30102 rows 10504 cols
[2022-05-16 00:36:33] [INFO ] Computed 201 place invariants in 191 ms
[2022-05-16 00:36:34] [INFO ] Dead Transitions using invariants and state equation in 1131 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 72 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s5257 s460), p0:(LEQ s6994 s6122)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 36036 steps with 52 reset in 1166 ms.
FORMULA CANConstruction-PT-100-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLCardinality-12 finished in 9723 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(G(p0))||p1))))'
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 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 13 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 6199 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:36:41] [INFO ] Computed 201 place invariants in 193 ms
[2022-05-16 00:36:42] [INFO ] Implicit Places using invariants in 1099 ms returned []
Implicit Place search using SMT only with invariants took 1118 ms to find 0 implicit places.
// Phase 1: matrix 30101 rows 10503 cols
[2022-05-16 00:36:43] [INFO ] Computed 201 place invariants in 191 ms
[2022-05-16 00:36:43] [INFO ] Dead Transitions using invariants and state equation in 1110 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 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s6934 s8310), p1:(LEQ s9203 s5067)], 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 145 reset in 3386 ms.
Product exploration explored 100000 steps with 143 reset in 3425 ms.
Computed a total of 302 stabilizing places and 300 stable transitions
Computed a total of 302 stabilizing places and 300 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 205 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 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 424 ms. (steps per millisecond=23 ) 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 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 80500 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80500 steps, saw 74445 distinct states, run finished after 3002 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 30101 rows 10503 cols
[2022-05-16 00:36:55] [INFO ] Computed 201 place invariants in 251 ms
[2022-05-16 00:36:56] [INFO ] After 1172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 00:36:57] [INFO ] [Nat]Absence check using 101 positive place invariants in 237 ms returned sat
[2022-05-16 00:36:57] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 138 ms returned sat
[2022-05-16 00:37:21] [INFO ] After 23215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 00:37:21] [INFO ] State equation strengthened by 29899 read => feed constraints.
[2022-05-16 00:37:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 00:37:21] [INFO ] After 25310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 10 ms.
Support contains 4 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 197 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 437 ms. (steps per millisecond=22 ) 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 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 81617 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81617 steps, saw 74641 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:37:25] [INFO ] Computed 201 place invariants in 216 ms
[2022-05-16 00:37:26] [INFO ] After 1175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 00:37:28] [INFO ] [Nat]Absence check using 101 positive place invariants in 212 ms returned sat
[2022-05-16 00:37:28] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 121 ms returned sat
[2022-05-16 00:37:51] [INFO ] After 23259ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 00:37:51] [INFO ] State equation strengthened by 29899 read => feed constraints.
[2022-05-16 00:37:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 00:37:51] [INFO ] After 25267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 7 ms.
Support contains 4 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 187 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 176 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:37:52] [INFO ] Computed 201 place invariants in 187 ms
[2022-05-16 00:37:53] [INFO ] Implicit Places using invariants in 1090 ms returned []
Implicit Place search using SMT only with invariants took 1111 ms to find 0 implicit places.
// Phase 1: matrix 30101 rows 10503 cols
[2022-05-16 00:37:53] [INFO ] Computed 201 place invariants in 234 ms
[2022-05-16 00:37:54] [INFO ] Dead Transitions using invariants and state equation in 1105 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10503/10503 places, 30101/30101 transitions.
Graph (trivial) has 29789 edges and 10503 vertex of which 10096 / 10503 are part of one of the 100 SCC in 24 ms
Free SCC test removed 9996 places
Drop transitions removed 19892 transitions
Ensure Unique test removed 9796 transitions
Reduce isomorphic transitions removed 29688 transitions.
Graph (complete) has 1014 edges and 507 vertex of which 13 are kept as prefixes of interest. Removing 494 places using SCC suffix rule.1 ms
Discarding 494 places :
Also discarding 388 output transitions
Drop transitions removed 388 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 10 place count 13 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 10 place count 13 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 12 transition count 16
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 12 transition count 16
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 20 place count 8 transition count 12
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 8 transition count 12
Applied a total of 24 rules in 214 ms. Remains 8 /10503 variables (removed 10495) and now considering 12/30101 (removed 30089) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 12 rows 8 cols
[2022-05-16 00:37:54] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 00:37:54] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 00:37:54] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 00:37:54] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-16 00:37:54] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-16 00:37:54] [INFO ] Flatten gal took : 0 ms
[2022-05-16 00:37:54] [INFO ] Flatten gal took : 1 ms
[2022-05-16 00:37:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13035881775907622506.gal : 6 ms
[2022-05-16 00:37:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5964211156784043664.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms12229794768668473629;'/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/ReachabilityCardinality13035881775907622506.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5964211156784043664.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/ReachabilityCardinality5964211156784043664.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 27
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,81,0.012229,3852,2,13,7,66,8,0,48,46,0
Total reachable state count : 81

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,4,0.012422,3852,2,9,7,66,8,0,59,46,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,14,0.012599,3852,2,13,7,66,8,0,63,46,0
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 283 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 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 10503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10503/10503 places, 30101/30101 transitions.
Applied a total of 0 rules in 319 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:37:56] [INFO ] Computed 201 place invariants in 200 ms
[2022-05-16 00:37:57] [INFO ] Implicit Places using invariants in 1273 ms returned []
Implicit Place search using SMT only with invariants took 1284 ms to find 0 implicit places.
// Phase 1: matrix 30101 rows 10503 cols
[2022-05-16 00:37:57] [INFO ] Computed 201 place invariants in 182 ms
[2022-05-16 00:37:58] [INFO ] Dead Transitions using invariants and state equation in 1100 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10503/10503 places, 30101/30101 transitions.
Computed a total of 302 stabilizing places and 300 stable transitions
Computed a total of 302 stabilizing places and 300 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 191 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 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 442 ms. (steps per millisecond=22 ) 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 80020 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80020 steps, saw 74387 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 30101 rows 10503 cols
[2022-05-16 00:38:02] [INFO ] Computed 201 place invariants in 205 ms
[2022-05-16 00:38:03] [INFO ] After 1115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 00:38:04] [INFO ] [Nat]Absence check using 101 positive place invariants in 212 ms returned sat
[2022-05-16 00:38:04] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 127 ms returned sat
[2022-05-16 00:38:28] [INFO ] After 23335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 00:38:28] [INFO ] State equation strengthened by 29899 read => feed constraints.
[2022-05-16 00:38:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 00:38:28] [INFO ] After 25310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 7 ms.
Support contains 4 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 227 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 412 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 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 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 79973 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79973 steps, saw 74377 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 30101 rows 10503 cols
[2022-05-16 00:38:32] [INFO ] Computed 201 place invariants in 183 ms
[2022-05-16 00:38:33] [INFO ] After 1266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 00:38:35] [INFO ] [Nat]Absence check using 101 positive place invariants in 257 ms returned sat
[2022-05-16 00:38:35] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 135 ms returned sat
[2022-05-16 00:38:58] [INFO ] After 23111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 00:38:59] [INFO ] State equation strengthened by 29899 read => feed constraints.
[2022-05-16 00:38:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 00:38:59] [INFO ] After 25260ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 5 ms.
Support contains 4 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 212 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:38:59] [INFO ] Computed 201 place invariants in 224 ms
[2022-05-16 00:39:00] [INFO ] Implicit Places using invariants in 1274 ms returned []
Implicit Place search using SMT only with invariants took 1285 ms to find 0 implicit places.
// Phase 1: matrix 30101 rows 10503 cols
[2022-05-16 00:39:01] [INFO ] Computed 201 place invariants in 223 ms
[2022-05-16 00:39:02] [INFO ] Dead Transitions using invariants and state equation in 1162 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10503/10503 places, 30101/30101 transitions.
Graph (trivial) has 29789 edges and 10503 vertex of which 10096 / 10503 are part of one of the 100 SCC in 7 ms
Free SCC test removed 9996 places
Drop transitions removed 19892 transitions
Ensure Unique test removed 9796 transitions
Reduce isomorphic transitions removed 29688 transitions.
Graph (complete) has 1014 edges and 507 vertex of which 13 are kept as prefixes of interest. Removing 494 places using SCC suffix rule.0 ms
Discarding 494 places :
Also discarding 388 output transitions
Drop transitions removed 388 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 10 place count 13 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 10 place count 13 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 12 transition count 16
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 12 transition count 16
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 20 place count 8 transition count 12
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 8 transition count 12
Applied a total of 24 rules in 171 ms. Remains 8 /10503 variables (removed 10495) and now considering 12/30101 (removed 30089) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 12 rows 8 cols
[2022-05-16 00:39:02] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 00:39:02] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 00:39:02] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 00:39:02] [INFO ] After 9ms 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:02] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-16 00:39:02] [INFO ] Flatten gal took : 1 ms
[2022-05-16 00:39:02] [INFO ] Flatten gal took : 1 ms
[2022-05-16 00:39:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality774588133247559101.gal : 0 ms
[2022-05-16 00:39:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4627115004305580613.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms11184839917367073861;'/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/ReachabilityCardinality774588133247559101.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4627115004305580613.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...318
Loading property file /tmp/ReachabilityCardinality4627115004305580613.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 27
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,81,0.007054,3956,2,13,7,66,8,0,48,46,0
Total reachable state count : 81

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,4,0.007273,3956,2,9,7,66,8,0,59,46,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,14,0.007464,3956,2,13,7,66,8,0,63,46,0
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 201 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 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 143 reset in 3335 ms.
Product exploration explored 100000 steps with 143 reset in 3428 ms.
Built C files in :
/tmp/ltsmin17003418707131812159
[2022-05-16 00:39:09] [INFO ] Too many transitions (30101) to apply POR reductions. Disabling POR matrices.
[2022-05-16 00:39:09] [INFO ] Built C files in 346ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17003418707131812159
Running compilation step : cd /tmp/ltsmin17003418707131812159;'/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/ltsmin17003418707131812159;'/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/ltsmin17003418707131812159;'/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 4 out of 10503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10503/10503 places, 30101/30101 transitions.
Applied a total of 0 rules in 466 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 317 ms
[2022-05-16 00:39:15] [INFO ] Implicit Places using invariants in 2422 ms returned []
Implicit Place search using SMT only with invariants took 2446 ms to find 0 implicit places.
// Phase 1: matrix 30101 rows 10503 cols
[2022-05-16 00:39:16] [INFO ] Computed 201 place invariants in 213 ms
[2022-05-16 00:39:17] [INFO ] Dead Transitions using invariants and state equation in 1829 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10503/10503 places, 30101/30101 transitions.
Built C files in :
/tmp/ltsmin3147380692305743006
[2022-05-16 00:39:17] [INFO ] Too many transitions (30101) to apply POR reductions. Disabling POR matrices.
[2022-05-16 00:39:18] [INFO ] Built C files in 209ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3147380692305743006
Running compilation step : cd /tmp/ltsmin3147380692305743006;'/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/ltsmin3147380692305743006;'/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/ltsmin3147380692305743006;'/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:39:22] [INFO ] Flatten gal took : 726 ms
[2022-05-16 00:39:23] [INFO ] Flatten gal took : 590 ms
[2022-05-16 00:39:23] [INFO ] Time to serialize gal into /tmp/LTL635814325177819271.gal : 186 ms
[2022-05-16 00:39:23] [INFO ] Time to serialize properties into /tmp/LTL12220956609478904415.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/LTL635814325177819271.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12220956609478904415.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/LTL6358143...266
Read 1 LTL properties
Checking formula 0 : !((G(F((F(G("(Node63requestsent96<=Node77GiveAnswer85)")))||("(Node86requestsent87<=Node45requestsent10)")))))
Formula 0 simplified : !GF("(Node86requestsent87<=Node45requestsent10)" | FG"(Node63requestsent96<=Node77GiveAnswer85)")
Detected timeout of ITS tools.
[2022-05-16 00:39:39] [INFO ] Flatten gal took : 1173 ms
[2022-05-16 00:39:39] [INFO ] Applying decomposition
[2022-05-16 00:39:41] [INFO ] Flatten gal took : 1186 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/graph12003115611327493441.txt' '-o' '/tmp/graph12003115611327493441.bin' '-w' '/tmp/graph12003115611327493441.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12003115611327493441.bin' '-l' '-1' '-v' '-w' '/tmp/graph12003115611327493441.weights' '-q' '0' '-e' '0.001'
[2022-05-16 00:39:45] [INFO ] Decomposing Gal with order
[2022-05-16 00:39:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 00:39:54] [INFO ] Removed a total of 29538 redundant transitions.
[2022-05-16 00:39:55] [INFO ] Flatten gal took : 8278 ms
[2022-05-16 00:40:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 29404 labels/synchronizations in 13088 ms.
[2022-05-16 00:40:11] [INFO ] Time to serialize gal into /tmp/LTL10347148901357971927.gal : 379 ms
[2022-05-16 00:40:11] [INFO ] Time to serialize properties into /tmp/LTL5448373574963268722.ltl : 12 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/LTL10347148901357971927.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5448373574963268722.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/LTL1034714...267
Read 1 LTL properties
Checking formula 0 : !((G(F((F(G("(gu102.Node63requestsent96<=gu102.Node77GiveAnswer85)")))||("(gu101.Node86requestsent87<=gu101.Node45requestsent10)")))))
Formula 0 simplified : !GF("(gu101.Node86requestsent87<=gu101.Node45requestsent10)" | FG"(gu102.Node63requestsent96<=gu102.Node77GiveAnswer85)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17420873662800786580
[2022-05-16 00:40:26] [INFO ] Built C files in 189ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17420873662800786580
Running compilation step : cd /tmp/ltsmin17420873662800786580;'/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/ltsmin17420873662800786580;'/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/ltsmin17420873662800786580;'/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-LTLCardinality-14 finished in 234363 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&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 129 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:40:30] [INFO ] Computed 201 place invariants in 347 ms
[2022-05-16 00:40:32] [INFO ] Implicit Places using invariants in 2060 ms returned []
Implicit Place search using SMT only with invariants took 2061 ms to find 0 implicit places.
// Phase 1: matrix 40800 rows 21202 cols
[2022-05-16 00:40:32] [INFO ] Computed 201 place invariants in 355 ms
[2022-05-16 00:40:34] [INFO ] Dead Transitions using invariants and state equation in 2001 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (LEQ 1 s11572) (LEQ s18149 s277)), p1:(LEQ s18149 s277)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6351 steps with 3 reset in 190 ms.
FORMULA CANConstruction-PT-100-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLCardinality-15 finished in 4575 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(G(p0))||p1))))'
[2022-05-16 00:40:35] [INFO ] Flatten gal took : 1160 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3549507206996980884
[2022-05-16 00:40:36] [INFO ] Too many transitions (40800) to apply POR reductions. Disabling POR matrices.
[2022-05-16 00:40:36] [INFO ] Built C files in 295ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3549507206996980884
Running compilation step : cd /tmp/ltsmin3549507206996980884;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
[2022-05-16 00:40:37] [INFO ] Applying decomposition
[2022-05-16 00:40:39] [INFO ] Flatten gal took : 1616 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/graph2776847317615271783.txt' '-o' '/tmp/graph2776847317615271783.bin' '-w' '/tmp/graph2776847317615271783.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2776847317615271783.bin' '-l' '-1' '-v' '-w' '/tmp/graph2776847317615271783.weights' '-q' '0' '-e' '0.001'
[2022-05-16 00:40:42] [INFO ] Decomposing Gal with order
[2022-05-16 00:40:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 00:40:53] [INFO ] Removed a total of 18722 redundant transitions.
[2022-05-16 00:40:54] [INFO ] Flatten gal took : 5487 ms
[2022-05-16 00:40:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 2823 labels/synchronizations in 3093 ms.
[2022-05-16 00:41:10] [INFO ] Time to serialize gal into /tmp/LTLCardinality12768950335760382197.gal : 678 ms
[2022-05-16 00:41:10] [INFO ] Time to serialize properties into /tmp/LTLCardinality4246902562708430154.ltl : 16 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/LTLCardinality12768950335760382197.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4246902562708430154.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/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !((G(F((F(G("(gu583.Node63requestsent96<=gu583.Node77GiveAnswer85)")))||("(gu567.Node86requestsent87<=gu567.Node45requestsent10)")))))
Formula 0 simplified : !GF("(gu567.Node86requestsent87<=gu567.Node45requestsent10)" | FG"(gu583.Node63requestsent96<=gu583.Node77GiveAnswer85)")
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/ltsmin3549507206996980884;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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 720 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3549507206996980884;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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 720 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)
Detected timeout of ITS tools.
[2022-05-16 01:03:37] [INFO ] Flatten gal took : 1231 ms
[2022-05-16 01:03:37] [INFO ] Time to serialize gal into /tmp/LTLCardinality5510566378098585341.gal : 97 ms
[2022-05-16 01:03:37] [INFO ] Time to serialize properties into /tmp/LTLCardinality4559682738701951744.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/LTLCardinality5510566378098585341.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4559682738701951744.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/LTLCardina...288
Read 1 LTL properties
Checking formula 0 : !((G(F((F(G("(Node63requestsent96<=Node77GiveAnswer85)")))||("(Node86requestsent87<=Node45requestsent10)")))))
Formula 0 simplified : !GF("(Node86requestsent87<=Node45requestsent10)" | FG"(Node63requestsent96<=Node77GiveAnswer85)")
Detected timeout of ITS tools.
[2022-05-16 01:26:04] [INFO ] Flatten gal took : 1079 ms
[2022-05-16 01:26:05] [INFO ] Input system was already deterministic with 40800 transitions.
[2022-05-16 01:26:05] [INFO ] Transformed 21202 places.
[2022-05-16 01:26:05] [INFO ] Transformed 40800 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 01:26:51] [INFO ] Time to serialize gal into /tmp/LTLCardinality10457015060915977926.gal : 77 ms
[2022-05-16 01:26:51] [INFO ] Time to serialize properties into /tmp/LTLCardinality3444590254851766508.ltl : 7 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/LTLCardinality10457015060915977926.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3444590254851766508.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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/LTLCardina...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F((F(G("(Node63requestsent96<=Node77GiveAnswer85)")))||("(Node86requestsent87<=Node45requestsent10)")))))
Formula 0 simplified : !GF("(Node86requestsent87<=Node45requestsent10)" | FG"(Node63requestsent96<=Node77GiveAnswer85)")

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ 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 LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@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="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is CANConstruction-PT-100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918700563"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;