Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.3M
-rw-r--r-- 1 mcc users 11K Feb 25 20:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 20:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 20:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 20:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 17:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 17:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 21:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 25 21:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 20:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 20:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 17:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 17:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 8.8M Mar 5 18:23 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 ViralEpidemic-PT-S02D1C1A10-LTLCardinality-00
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLCardinality-01
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLCardinality-02
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLCardinality-03
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLCardinality-04
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLCardinality-05
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLCardinality-06
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLCardinality-07
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLCardinality-08
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLCardinality-09
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLCardinality-10
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLCardinality-11
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLCardinality-12
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLCardinality-13
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLCardinality-14
FORMULA_NAME ViralEpidemic-PT-S02D1C1A10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679329468864

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ViralEpidemic-PT-S02D1C1A10
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-20 16:24:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-20 16:24:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 16:24:30] [INFO ] Load time of PNML (sax parser for PT used): 376 ms
[2023-03-20 16:24:30] [INFO ] Transformed 8189 places.
[2023-03-20 16:24:30] [INFO ] Transformed 10235 transitions.
[2023-03-20 16:24:30] [INFO ] Found NUPN structural information;
[2023-03-20 16:24:30] [INFO ] Parsed PT model containing 8189 places and 10235 transitions and 22517 arcs in 586 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 8189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8189/8189 places, 10235/10235 transitions.
Discarding 3046 places :
Symmetric choice reduction at 0 with 3046 rule applications. Total rules 3046 place count 5143 transition count 5149
Iterating global reduction 0 with 3046 rules applied. Total rules applied 6092 place count 5143 transition count 5149
Applied a total of 6092 rules in 2246 ms. Remains 5143 /8189 variables (removed 3046) and now considering 5149/10235 (removed 5086) transitions.
// Phase 1: matrix 5149 rows 5143 cols
[2023-03-20 16:24:33] [INFO ] Invariants computation overflowed in 504 ms
[2023-03-20 16:24:36] [INFO ] Implicit Places using invariants in 3045 ms returned []
// Phase 1: matrix 5149 rows 5143 cols
[2023-03-20 16:24:36] [INFO ] Invariants computation overflowed in 291 ms
[2023-03-20 16:24:37] [INFO ] Implicit Places using invariants and state equation in 1248 ms returned []
Implicit Place search using SMT with State Equation took 4327 ms to find 0 implicit places.
// Phase 1: matrix 5149 rows 5143 cols
[2023-03-20 16:24:37] [INFO ] Invariants computation overflowed in 188 ms
[2023-03-20 16:24:40] [INFO ] Dead Transitions using invariants and state equation in 3212 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5143/8189 places, 5149/10235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9789 ms. Remains : 5143/8189 places, 5149/10235 transitions.
Support contains 28 out of 5143 places after structural reductions.
[2023-03-20 16:24:41] [INFO ] Flatten gal took : 271 ms
[2023-03-20 16:24:41] [INFO ] Flatten gal took : 221 ms
[2023-03-20 16:24:41] [INFO ] Input system was already deterministic with 5149 transitions.
Incomplete random walk after 10000 steps, including 419 resets, run finished after 683 ms. (steps per millisecond=14 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 5149 rows 5143 cols
[2023-03-20 16:24:45] [INFO ] Invariants computation overflowed in 197 ms
[2023-03-20 16:24:46] [INFO ] After 1098ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 16:24:52] [INFO ] After 4031ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 16:24:54] [INFO ] After 6056ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1144 ms.
[2023-03-20 16:24:55] [INFO ] After 8748ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Finished Parikh walk after 488 steps, including 0 resets, run visited all 1 properties in 20 ms. (steps per millisecond=24 )
Parikh walk visited 8 properties in 130 ms.
Computed a total of 5143 stabilizing places and 5149 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5143 transition count 5149
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 5143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5143/5143 places, 5149/5149 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 5120 transition count 5120
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 5120 transition count 5120
Applied a total of 46 rules in 915 ms. Remains 5120 /5143 variables (removed 23) and now considering 5120/5149 (removed 29) transitions.
// Phase 1: matrix 5120 rows 5120 cols
[2023-03-20 16:24:57] [INFO ] Invariants computation overflowed in 184 ms
[2023-03-20 16:24:59] [INFO ] Implicit Places using invariants in 2474 ms returned []
// Phase 1: matrix 5120 rows 5120 cols
[2023-03-20 16:24:59] [INFO ] Invariants computation overflowed in 193 ms
[2023-03-20 16:25:00] [INFO ] Implicit Places using invariants and state equation in 1113 ms returned []
Implicit Place search using SMT with State Equation took 3590 ms to find 0 implicit places.
// Phase 1: matrix 5120 rows 5120 cols
[2023-03-20 16:25:00] [INFO ] Invariants computation overflowed in 180 ms
[2023-03-20 16:25:03] [INFO ] Dead Transitions using invariants and state equation in 3412 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5120/5143 places, 5120/5149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7921 ms. Remains : 5120/5143 places, 5120/5149 transitions.
Stuttering acceptance computed with spot in 356 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s2674 0) (EQ s1408 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 1272 steps with 56 reset in 42 ms.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLCardinality-00 finished in 8396 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0&&(!p1 U (p2||G(!p1)))))))))'
Support contains 5 out of 5143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5143/5143 places, 5149/5149 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 5123 transition count 5123
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 5123 transition count 5123
Applied a total of 40 rules in 1204 ms. Remains 5123 /5143 variables (removed 20) and now considering 5123/5149 (removed 26) transitions.
// Phase 1: matrix 5123 rows 5123 cols
[2023-03-20 16:25:05] [INFO ] Invariants computation overflowed in 184 ms
[2023-03-20 16:25:07] [INFO ] Implicit Places using invariants in 2354 ms returned []
// Phase 1: matrix 5123 rows 5123 cols
[2023-03-20 16:25:08] [INFO ] Invariants computation overflowed in 177 ms
[2023-03-20 16:25:08] [INFO ] Implicit Places using invariants and state equation in 1014 ms returned []
Implicit Place search using SMT with State Equation took 3380 ms to find 0 implicit places.
// Phase 1: matrix 5123 rows 5123 cols
[2023-03-20 16:25:09] [INFO ] Invariants computation overflowed in 179 ms
[2023-03-20 16:25:12] [INFO ] Dead Transitions using invariants and state equation in 3426 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5123/5143 places, 5123/5149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8015 ms. Remains : 5123/5143 places, 5123/5149 transitions.
Stuttering acceptance computed with spot in 201 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={} source=4 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(NEQ s1030 1), p2:(AND (NOT (OR (EQ s3720 0) (EQ s113 1))) (NOT (OR (EQ s115 0) (EQ s5111 1)))), p1:(OR (EQ s115 0) (EQ s5111 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLCardinality-03 finished in 8254 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 5143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5143/5143 places, 5149/5149 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 5121 transition count 5120
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 5121 transition count 5120
Applied a total of 44 rules in 1194 ms. Remains 5121 /5143 variables (removed 22) and now considering 5120/5149 (removed 29) transitions.
// Phase 1: matrix 5120 rows 5121 cols
[2023-03-20 16:25:13] [INFO ] Invariants computation overflowed in 184 ms
[2023-03-20 16:25:16] [INFO ] Implicit Places using invariants in 2324 ms returned []
// Phase 1: matrix 5120 rows 5121 cols
[2023-03-20 16:25:16] [INFO ] Invariants computation overflowed in 175 ms
[2023-03-20 16:25:17] [INFO ] Implicit Places using invariants and state equation in 1037 ms returned []
Implicit Place search using SMT with State Equation took 3366 ms to find 0 implicit places.
// Phase 1: matrix 5120 rows 5121 cols
[2023-03-20 16:25:17] [INFO ] Invariants computation overflowed in 180 ms
[2023-03-20 16:25:20] [INFO ] Dead Transitions using invariants and state equation in 3501 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5121/5143 places, 5120/5149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8067 ms. Remains : 5121/5143 places, 5120/5149 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (NEQ s2751 0) (NEQ s5093 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLCardinality-04 finished in 8257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 5143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5143/5143 places, 5149/5149 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 5121 transition count 5121
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 5121 transition count 5121
Applied a total of 44 rules in 1191 ms. Remains 5121 /5143 variables (removed 22) and now considering 5121/5149 (removed 28) transitions.
// Phase 1: matrix 5121 rows 5121 cols
[2023-03-20 16:25:22] [INFO ] Invariants computation overflowed in 193 ms
[2023-03-20 16:25:24] [INFO ] Implicit Places using invariants in 2587 ms returned []
// Phase 1: matrix 5121 rows 5121 cols
[2023-03-20 16:25:24] [INFO ] Invariants computation overflowed in 187 ms
[2023-03-20 16:25:25] [INFO ] Implicit Places using invariants and state equation in 1090 ms returned []
Implicit Place search using SMT with State Equation took 3680 ms to find 0 implicit places.
// Phase 1: matrix 5121 rows 5121 cols
[2023-03-20 16:25:25] [INFO ] Invariants computation overflowed in 186 ms
[2023-03-20 16:25:29] [INFO ] Dead Transitions using invariants and state equation in 3441 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5121/5143 places, 5121/5149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8316 ms. Remains : 5121/5143 places, 5121/5149 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s5067 0) (EQ s3687 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 1 ms.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLCardinality-06 finished in 8442 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 5143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5143/5143 places, 5149/5149 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 5120 transition count 5119
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 5120 transition count 5119
Applied a total of 46 rules in 1177 ms. Remains 5120 /5143 variables (removed 23) and now considering 5119/5149 (removed 30) transitions.
// Phase 1: matrix 5119 rows 5120 cols
[2023-03-20 16:25:30] [INFO ] Invariants computation overflowed in 192 ms
[2023-03-20 16:25:32] [INFO ] Implicit Places using invariants in 2321 ms returned []
// Phase 1: matrix 5119 rows 5120 cols
[2023-03-20 16:25:32] [INFO ] Invariants computation overflowed in 193 ms
[2023-03-20 16:25:33] [INFO ] Implicit Places using invariants and state equation in 1121 ms returned []
Implicit Place search using SMT with State Equation took 3451 ms to find 0 implicit places.
// Phase 1: matrix 5119 rows 5120 cols
[2023-03-20 16:25:34] [INFO ] Invariants computation overflowed in 178 ms
[2023-03-20 16:25:37] [INFO ] Dead Transitions using invariants and state equation in 3431 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5120/5143 places, 5119/5149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8065 ms. Remains : 5120/5143 places, 5119/5149 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s665 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 3451 ms.
Product exploration explored 100000 steps with 33333 reset in 4159 ms.
Computed a total of 5120 stabilizing places and 5119 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 transition count 5119
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLCardinality-07 finished in 17828 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 5143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5143/5143 places, 5149/5149 transitions.
Graph (complete) has 3084 edges and 5143 vertex of which 96 are kept as prefixes of interest. Removing 5047 places using SCC suffix rule.16 ms
Discarding 5047 places :
Also discarding 5020 output transitions
Drop transitions removed 5020 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 93 transition count 123
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 93 transition count 123
Applied a total of 5 rules in 39 ms. Remains 93 /5143 variables (removed 5050) and now considering 123/5149 (removed 5026) transitions.
// Phase 1: matrix 123 rows 93 cols
[2023-03-20 16:25:47] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 16:25:47] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-20 16:25:47] [INFO ] Invariant cache hit.
[2023-03-20 16:25:47] [INFO ] Implicit Places using invariants and state equation in 65 ms returned [0, 2, 10, 31, 33, 35, 37, 39, 47, 53, 55, 57, 63, 70, 72, 76, 78]
Discarding 17 places :
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Implicit Place search using SMT with State Equation took 98 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/5143 places, 111/5149 transitions.
Graph (complete) has 52 edges and 76 vertex of which 62 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 27 place count 49 transition count 84
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 34 place count 49 transition count 77
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 47 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 41 place count 47 transition count 77
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 46 place count 47 transition count 72
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 47 transition count 72
Applied a total of 47 rules in 23 ms. Remains 47 /76 variables (removed 29) and now considering 72/111 (removed 39) transitions.
// Phase 1: matrix 72 rows 47 cols
[2023-03-20 16:25:47] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 16:25:47] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-20 16:25:47] [INFO ] Invariant cache hit.
[2023-03-20 16:25:47] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/5143 places, 72/5149 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 219 ms. Remains : 47/5143 places, 72/5149 transitions.
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s40 0) (EQ s19 1)), p1:(OR (EQ s35 0) (EQ s26 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2297 reset in 257 ms.
Product exploration explored 100000 steps with 2305 reset in 283 ms.
Computed a total of 47 stabilizing places and 72 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 47 transition count 72
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 11 factoid took 253 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLCardinality-09 finished in 1098 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0) U p1))))'
Support contains 4 out of 5143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5143/5143 places, 5149/5149 transitions.
Graph (complete) has 3084 edges and 5143 vertex of which 73 are kept as prefixes of interest. Removing 5070 places using SCC suffix rule.11 ms
Discarding 5070 places :
Also discarding 5049 output transitions
Drop transitions removed 5049 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 70 transition count 93
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 70 transition count 93
Applied a total of 5 rules in 28 ms. Remains 70 /5143 variables (removed 5073) and now considering 93/5149 (removed 5056) transitions.
// Phase 1: matrix 93 rows 70 cols
[2023-03-20 16:25:48] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 16:25:48] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-20 16:25:48] [INFO ] Invariant cache hit.
[2023-03-20 16:25:48] [INFO ] Implicit Places using invariants and state equation in 51 ms returned [0, 2, 12, 20, 22, 24, 28, 30, 32, 44, 51, 57, 61, 63]
Discarding 14 places :
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Implicit Place search using SMT with State Equation took 85 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/5143 places, 82/5149 transitions.
Graph (complete) has 39 edges and 56 vertex of which 45 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 35 transition count 61
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 26 place count 35 transition count 56
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 33 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 33 transition count 55
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 33 transition count 53
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 33 transition count 53
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 33 transition count 52
Applied a total of 35 rules in 7 ms. Remains 33 /56 variables (removed 23) and now considering 52/82 (removed 30) transitions.
// Phase 1: matrix 52 rows 33 cols
[2023-03-20 16:25:48] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-20 16:25:48] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-20 16:25:48] [INFO ] Invariant cache hit.
[2023-03-20 16:25:48] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/5143 places, 52/5149 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 167 ms. Remains : 33/5143 places, 52/5149 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s32 0) (EQ s22 1)), p0:(OR (EQ s16 0) (EQ s10 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3571 reset in 197 ms.
Product exploration explored 100000 steps with 3562 reset in 126 ms.
Computed a total of 33 stabilizing places and 52 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33 transition count 52
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 13 factoid took 340 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLCardinality-11 finished in 1005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 5143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5143/5143 places, 5149/5149 transitions.
Graph (complete) has 3084 edges and 5143 vertex of which 39 are kept as prefixes of interest. Removing 5104 places using SCC suffix rule.8 ms
Discarding 5104 places :
Also discarding 5097 output transitions
Drop transitions removed 5097 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 17 ms. Remains 38 /5143 variables (removed 5105) and now considering 51/5149 (removed 5098) transitions.
// Phase 1: matrix 51 rows 38 cols
[2023-03-20 16:25:49] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 16:25:49] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-20 16:25:49] [INFO ] Invariant cache hit.
[2023-03-20 16:25:49] [INFO ] Implicit Places using invariants and state equation in 44 ms returned [13, 15, 17, 26, 28, 30, 32, 36]
Discarding 8 places :
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Implicit Place search using SMT with State Equation took 71 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/5143 places, 44/5149 transitions.
Graph (complete) has 22 edges and 30 vertex of which 23 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 18 transition count 32
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 13 place count 18 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 15 place count 17 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 17 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 17 transition count 28
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 17 transition count 28
Applied a total of 18 rules in 4 ms. Remains 17 /30 variables (removed 13) and now considering 28/44 (removed 16) transitions.
// Phase 1: matrix 28 rows 17 cols
[2023-03-20 16:25:49] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 16:25:49] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-20 16:25:49] [INFO ] Invariant cache hit.
[2023-03-20 16:25:49] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/5143 places, 28/5149 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 136 ms. Remains : 17/5143 places, 28/5149 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s16 0) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5876 reset in 75 ms.
Product exploration explored 100000 steps with 5911 reset in 77 ms.
Computed a total of 17 stabilizing places and 28 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 transition count 28
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLCardinality-12 finished in 481 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 5143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5143/5143 places, 5149/5149 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 5121 transition count 5120
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 5121 transition count 5120
Applied a total of 44 rules in 1217 ms. Remains 5121 /5143 variables (removed 22) and now considering 5120/5149 (removed 29) transitions.
// Phase 1: matrix 5120 rows 5121 cols
[2023-03-20 16:25:51] [INFO ] Invariants computation overflowed in 194 ms
[2023-03-20 16:25:53] [INFO ] Implicit Places using invariants in 2354 ms returned []
// Phase 1: matrix 5120 rows 5121 cols
[2023-03-20 16:25:53] [INFO ] Invariants computation overflowed in 194 ms
[2023-03-20 16:25:54] [INFO ] Implicit Places using invariants and state equation in 1192 ms returned []
Implicit Place search using SMT with State Equation took 3550 ms to find 0 implicit places.
// Phase 1: matrix 5120 rows 5121 cols
[2023-03-20 16:25:54] [INFO ] Invariants computation overflowed in 177 ms
[2023-03-20 16:25:57] [INFO ] Dead Transitions using invariants and state equation in 3368 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5121/5143 places, 5120/5149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8136 ms. Remains : 5121/5143 places, 5120/5149 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLCardinality-14 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:(OR (EQ s3000 0) (EQ s2176 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 45318 steps with 1951 reset in 1367 ms.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLCardinality-14 finished in 9682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(X(F(p1))))))'
Support contains 4 out of 5143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5143/5143 places, 5149/5149 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 5123 transition count 5123
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 5123 transition count 5123
Applied a total of 40 rules in 1169 ms. Remains 5123 /5143 variables (removed 20) and now considering 5123/5149 (removed 26) transitions.
// Phase 1: matrix 5123 rows 5123 cols
[2023-03-20 16:26:00] [INFO ] Invariants computation overflowed in 192 ms
[2023-03-20 16:26:02] [INFO ] Implicit Places using invariants in 2326 ms returned []
// Phase 1: matrix 5123 rows 5123 cols
[2023-03-20 16:26:03] [INFO ] Invariants computation overflowed in 183 ms
[2023-03-20 16:26:03] [INFO ] Implicit Places using invariants and state equation in 1151 ms returned []
Implicit Place search using SMT with State Equation took 3483 ms to find 0 implicit places.
// Phase 1: matrix 5123 rows 5123 cols
[2023-03-20 16:26:04] [INFO ] Invariants computation overflowed in 181 ms
[2023-03-20 16:26:07] [INFO ] Dead Transitions using invariants and state equation in 3413 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5123/5143 places, 5123/5149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8071 ms. Remains : 5123/5143 places, 5123/5149 transitions.
Stuttering acceptance computed with spot in 284 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 1}, { cond=(NOT p0), acceptance={} source=6 dest: 3}]], initial=5, aps=[p1:(OR (EQ s1689 0) (EQ s4384 1)), p0:(OR (EQ s240 0) (EQ s2469 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, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 3492 ms.
Product exploration explored 100000 steps with 25000 reset in 4291 ms.
Computed a total of 5123 stabilizing places and 5123 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5123 transition count 5123
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p0), true, (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 229 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 384 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5123 rows 5123 cols
[2023-03-20 16:26:18] [INFO ] Invariants computation overflowed in 185 ms
[2023-03-20 16:26:19] [INFO ] After 526ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 16:26:22] [INFO ] After 2753ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 16:26:22] [INFO ] After 3004ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 142 ms.
[2023-03-20 16:26:22] [INFO ] After 3677ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 375 steps, including 0 resets, run visited all 1 properties in 17 ms. (steps per millisecond=22 )
Parikh walk visited 1 properties in 18 ms.
Knowledge obtained : [(AND p1 p0), (X p0), true, (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 283 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 5123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5123/5123 places, 5123/5123 transitions.
Applied a total of 0 rules in 571 ms. Remains 5123 /5123 variables (removed 0) and now considering 5123/5123 (removed 0) transitions.
// Phase 1: matrix 5123 rows 5123 cols
[2023-03-20 16:26:24] [INFO ] Invariants computation overflowed in 177 ms
[2023-03-20 16:26:26] [INFO ] Implicit Places using invariants in 2300 ms returned []
// Phase 1: matrix 5123 rows 5123 cols
[2023-03-20 16:26:26] [INFO ] Invariants computation overflowed in 170 ms
[2023-03-20 16:26:27] [INFO ] Implicit Places using invariants and state equation in 1046 ms returned []
Implicit Place search using SMT with State Equation took 3352 ms to find 0 implicit places.
// Phase 1: matrix 5123 rows 5123 cols
[2023-03-20 16:26:27] [INFO ] Invariants computation overflowed in 186 ms
[2023-03-20 16:26:30] [INFO ] Dead Transitions using invariants and state equation in 3381 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7306 ms. Remains : 5123/5123 places, 5123/5123 transitions.
Computed a total of 5123 stabilizing places and 5123 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5123 transition count 5123
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 177 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 394 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5123 rows 5123 cols
[2023-03-20 16:26:33] [INFO ] Invariants computation overflowed in 179 ms
[2023-03-20 16:26:34] [INFO ] After 481ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 16:26:37] [INFO ] After 2588ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 16:26:37] [INFO ] After 2859ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 145 ms.
[2023-03-20 16:26:37] [INFO ] After 3479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 259 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 12 ms.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 223 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 3419 ms.
Product exploration explored 100000 steps with 25000 reset in 4289 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 5123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5123/5123 places, 5123/5123 transitions.
Graph (complete) has 3073 edges and 5123 vertex of which 90 are kept as prefixes of interest. Removing 5033 places using SCC suffix rule.5 ms
Discarding 5033 places :
Also discarding 5004 output transitions
Drop transitions removed 5004 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 89 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 89 transition count 116
Applied a total of 3 rules in 25 ms. Remains 89 /5123 variables (removed 5034) and now considering 116/5123 (removed 5007) transitions.
[2023-03-20 16:26:46] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 116 rows 89 cols
[2023-03-20 16:26:46] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 16:26:46] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/5123 places, 116/5123 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 90 ms. Remains : 89/5123 places, 116/5123 transitions.
Built C files in :
/tmp/ltsmin11113278264183311766
[2023-03-20 16:26:46] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11113278264183311766
Running compilation step : cd /tmp/ltsmin11113278264183311766;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin11113278264183311766;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin11113278264183311766;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 5123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5123/5123 places, 5123/5123 transitions.
Applied a total of 0 rules in 672 ms. Remains 5123 /5123 variables (removed 0) and now considering 5123/5123 (removed 0) transitions.
// Phase 1: matrix 5123 rows 5123 cols
[2023-03-20 16:26:50] [INFO ] Invariants computation overflowed in 180 ms
[2023-03-20 16:26:52] [INFO ] Implicit Places using invariants in 2385 ms returned []
// Phase 1: matrix 5123 rows 5123 cols
[2023-03-20 16:26:53] [INFO ] Invariants computation overflowed in 181 ms
[2023-03-20 16:26:53] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 3429 ms to find 0 implicit places.
// Phase 1: matrix 5123 rows 5123 cols
[2023-03-20 16:26:54] [INFO ] Invariants computation overflowed in 191 ms
[2023-03-20 16:26:57] [INFO ] Dead Transitions using invariants and state equation in 3419 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7526 ms. Remains : 5123/5123 places, 5123/5123 transitions.
Built C files in :
/tmp/ltsmin6212052602631986592
[2023-03-20 16:26:57] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6212052602631986592
Running compilation step : cd /tmp/ltsmin6212052602631986592;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin6212052602631986592;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin6212052602631986592;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-20 16:27:00] [INFO ] Flatten gal took : 148 ms
[2023-03-20 16:27:00] [INFO ] Flatten gal took : 145 ms
[2023-03-20 16:27:00] [INFO ] Time to serialize gal into /tmp/LTL14295923820731102098.gal : 30 ms
[2023-03-20 16:27:00] [INFO ] Time to serialize properties into /tmp/LTL8413594267821971030.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14295923820731102098.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18105837766841378480.hoa' '-atoms' '/tmp/LTL8413594267821971030.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8413594267821971030.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18105837766841378480.hoa
Detected timeout of ITS tools.
[2023-03-20 16:27:16] [INFO ] Flatten gal took : 124 ms
[2023-03-20 16:27:16] [INFO ] Flatten gal took : 123 ms
[2023-03-20 16:27:16] [INFO ] Time to serialize gal into /tmp/LTL13693422355565130325.gal : 30 ms
[2023-03-20 16:27:16] [INFO ] Time to serialize properties into /tmp/LTL18034104437581041022.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13693422355565130325.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18034104437581041022.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G("((patient11111212122==0)||(patient11222221112==1))"))||(X(X(X(F("((dFactor101121211222==0)||(dFactor821122221==1))")))))))
Formula 0 simplified : F!"((patient11111212122==0)||(patient11222221112==1))" & XXXG!"((dFactor101121211222==0)||(dFactor821122221==1))"
Detected timeout of ITS tools.
[2023-03-20 16:27:31] [INFO ] Flatten gal took : 110 ms
[2023-03-20 16:27:31] [INFO ] Applying decomposition
[2023-03-20 16:27:31] [INFO ] Flatten gal took : 114 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8616594165536490969.txt' '-o' '/tmp/graph8616594165536490969.bin' '-w' '/tmp/graph8616594165536490969.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8616594165536490969.bin' '-l' '-1' '-v' '-w' '/tmp/graph8616594165536490969.weights' '-q' '0' '-e' '0.001'
[2023-03-20 16:27:32] [INFO ] Decomposing Gal with order
[2023-03-20 16:27:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-20 16:27:34] [INFO ] Removed a total of 1391 redundant transitions.
[2023-03-20 16:27:34] [INFO ] Flatten gal took : 398 ms
[2023-03-20 16:27:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 2026 labels/synchronizations in 319 ms.
[2023-03-20 16:27:35] [INFO ] Time to serialize gal into /tmp/LTL16241756939753609761.gal : 55 ms
[2023-03-20 16:27:35] [INFO ] Time to serialize properties into /tmp/LTL17780994490966683125.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16241756939753609761.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17780994490966683125.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((G("((i75.u160.patient11111212122==0)||(i1014.u1644.patient11222221112==1))"))||(X(X(X(F("((u1127.dFactor101121211222==0)||(u2920.d...183
Formula 0 simplified : F!"((i75.u160.patient11111212122==0)||(i1014.u1644.patient11222221112==1))" & XXXG!"((u1127.dFactor101121211222==0)||(u2920.dFactor8...169
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8335535130436896486
[2023-03-20 16:27:50] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8335535130436896486
Running compilation step : cd /tmp/ltsmin8335535130436896486;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8335535130436896486;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8335535130436896486;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLCardinality-15 finished in 113924 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(X(F(p1))))))'
Found a Shortening insensitive property : ViralEpidemic-PT-S02D1C1A10-LTLCardinality-15
Stuttering acceptance computed with spot in 282 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 5143 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5143/5143 places, 5149/5149 transitions.
Graph (complete) has 3084 edges and 5143 vertex of which 90 are kept as prefixes of interest. Removing 5053 places using SCC suffix rule.5 ms
Discarding 5053 places :
Also discarding 5030 output transitions
Drop transitions removed 5030 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 88 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 88 transition count 115
Applied a total of 3 rules in 16 ms. Remains 88 /5143 variables (removed 5055) and now considering 115/5149 (removed 5034) transitions.
// Phase 1: matrix 115 rows 88 cols
[2023-03-20 16:27:53] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-20 16:27:53] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-20 16:27:53] [INFO ] Invariant cache hit.
[2023-03-20 16:27:53] [INFO ] Implicit Places using invariants and state equation in 65 ms returned [0, 2, 4, 6, 8, 12, 16, 20, 28, 32, 34, 54, 56, 58, 60, 68, 70, 80]
Discarding 18 places :
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Implicit Place search using SMT with State Equation took 110 ms to find 18 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 70/5143 places, 102/5149 transitions.
Graph (complete) has 50 edges and 70 vertex of which 55 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 15 output transitions
Drop transitions removed 15 transitions
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 29 place count 41 transition count 73
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 36 place count 41 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 39 transition count 69
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 43 place count 39 transition count 66
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 39 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 39 transition count 65
Applied a total of 45 rules in 5 ms. Remains 39 /70 variables (removed 31) and now considering 65/102 (removed 37) transitions.
// Phase 1: matrix 65 rows 39 cols
[2023-03-20 16:27:53] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-20 16:27:53] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-20 16:27:53] [INFO ] Invariant cache hit.
[2023-03-20 16:27:53] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 39/5143 places, 65/5149 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 182 ms. Remains : 39/5143 places, 65/5149 transitions.
Running random walk in product with property : ViralEpidemic-PT-S02D1C1A10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 1}, { cond=(NOT p0), acceptance={} source=6 dest: 3}]], initial=5, aps=[p1:(OR (EQ s16 0) (EQ s36 1)), p0:(OR (EQ s7 0) (EQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 188 ms.
Product exploration explored 100000 steps with 25000 reset in 174 ms.
Computed a total of 39 stabilizing places and 65 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 39 transition count 65
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p0), true, (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 259 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10001 steps, including 205 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :2
Finished Best-First random walk after 2390 steps, including 4 resets, run visited all 1 properties in 3 ms. (steps per millisecond=796 )
Knowledge obtained : [(AND p1 p0), (X p0), true, (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 344 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-20 16:27:55] [INFO ] Invariant cache hit.
[2023-03-20 16:27:55] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-20 16:27:55] [INFO ] Invariant cache hit.
[2023-03-20 16:27:55] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-20 16:27:55] [INFO ] Invariant cache hit.
[2023-03-20 16:27:55] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 39/39 places, 65/65 transitions.
Computed a total of 39 stabilizing places and 65 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 39 transition count 65
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 162 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10001 steps, including 203 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 16:27:55] [INFO ] Invariant cache hit.
[2023-03-20 16:27:55] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 16:27:56] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 16:27:56] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-20 16:27:56] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 220 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 236 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 138 ms.
Product exploration explored 100000 steps with 25000 reset in 135 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 65/65 transitions.
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 39 transition count 60
Applied a total of 5 rules in 3 ms. Remains 39 /39 variables (removed 0) and now considering 60/65 (removed 5) transitions.
[2023-03-20 16:27:57] [INFO ] Redundant transitions in 18 ms returned [3, 9, 28, 41]
Found 4 redundant transitions using SMT.
Drop transitions removed 4 transitions
Redundant transitions reduction (with SMT) removed 4 transitions.
// Phase 1: matrix 56 rows 39 cols
[2023-03-20 16:27:57] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-20 16:27:57] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/39 places, 56/65 transitions.
Graph (complete) has 19 edges and 39 vertex of which 35 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 35 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 35 transition count 57
Deduced a syphon composed of 4 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 35 transition count 55
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 7 rules in 4 ms. Remains 35 /39 variables (removed 4) and now considering 55/56 (removed 1) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/39 places, 55/65 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 65 ms. Remains : 35/39 places, 55/65 transitions.
Built C files in :
/tmp/ltsmin5446583931797626519
[2023-03-20 16:27:57] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5446583931797626519
Running compilation step : cd /tmp/ltsmin5446583931797626519;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 145 ms.
Running link step : cd /tmp/ltsmin5446583931797626519;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin5446583931797626519;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17335568775737141241.hoa' '--buchi-type=spotba'
LTSmin run took 311 ms.
Treatment of property ViralEpidemic-PT-S02D1C1A10-LTLCardinality-15 finished in 4809 ms.
FORMULA ViralEpidemic-PT-S02D1C1A10-LTLCardinality-15 TRUE TECHNIQUES SHORTENING_INSENSITIVE
[2023-03-20 16:27:58] [INFO ] Flatten gal took : 108 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 207768 ms.

BK_STOP 1679329679580

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="ViralEpidemic-PT-S02D1C1A10"
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-5348"
echo " Executing tool itstools"
echo " Input is ViralEpidemic-PT-S02D1C1A10, 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 r485-tall-167912700501243"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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