Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 14:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 13 14:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.1M May 18 16:42 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 Medical-PT-16-LTLCardinality-00
FORMULA_NAME Medical-PT-16-LTLCardinality-01
FORMULA_NAME Medical-PT-16-LTLCardinality-02
FORMULA_NAME Medical-PT-16-LTLCardinality-03
FORMULA_NAME Medical-PT-16-LTLCardinality-04
FORMULA_NAME Medical-PT-16-LTLCardinality-05
FORMULA_NAME Medical-PT-16-LTLCardinality-06
FORMULA_NAME Medical-PT-16-LTLCardinality-07
FORMULA_NAME Medical-PT-16-LTLCardinality-08
FORMULA_NAME Medical-PT-16-LTLCardinality-09
FORMULA_NAME Medical-PT-16-LTLCardinality-10
FORMULA_NAME Medical-PT-16-LTLCardinality-11
FORMULA_NAME Medical-PT-16-LTLCardinality-12
FORMULA_NAME Medical-PT-16-LTLCardinality-13
FORMULA_NAME Medical-PT-16-LTLCardinality-14
FORMULA_NAME Medical-PT-16-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716575910911

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Medical-PT-16
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-24 18:38:32] [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]
[2024-05-24 18:38:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 18:38:32] [INFO ] Load time of PNML (sax parser for PT used): 247 ms
[2024-05-24 18:38:32] [INFO ] Transformed 312 places.
[2024-05-24 18:38:32] [INFO ] Transformed 5431 transitions.
[2024-05-24 18:38:32] [INFO ] Parsed PT model containing 312 places and 5431 transitions and 28790 arcs in 347 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 242 places in 19 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA Medical-PT-16-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 227/227 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 67 transition count 227
Applied a total of 2 rules in 14 ms. Remains 67 /69 variables (removed 2) and now considering 227/227 (removed 0) transitions.
[2024-05-24 18:38:33] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
// Phase 1: matrix 182 rows 67 cols
[2024-05-24 18:38:33] [INFO ] Computed 8 invariants in 6 ms
[2024-05-24 18:38:33] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-24 18:38:33] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2024-05-24 18:38:33] [INFO ] Invariant cache hit.
[2024-05-24 18:38:33] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-24 18:38:33] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2024-05-24 18:38:33] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2024-05-24 18:38:33] [INFO ] Invariant cache hit.
[2024-05-24 18:38:33] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 67/69 places, 227/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 534 ms. Remains : 67/69 places, 227/227 transitions.
Support contains 4 out of 67 places after structural reductions.
[2024-05-24 18:38:33] [INFO ] Flatten gal took : 53 ms
[2024-05-24 18:38:33] [INFO ] Flatten gal took : 27 ms
[2024-05-24 18:38:33] [INFO ] Input system was already deterministic with 227 transitions.
Incomplete random walk after 10000 steps, including 39 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-24 18:38:34] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2024-05-24 18:38:34] [INFO ] Invariant cache hit.
[2024-05-24 18:38:34] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 18:38:34] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-24 18:38:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 18:38:34] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-24 18:38:34] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-24 18:38:34] [INFO ] After 27ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-24 18:38:34] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-24 18:38:34] [INFO ] After 366ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 227/227 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 67 transition count 224
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 64 transition count 224
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 0 with 2 rules applied. Total rules applied 8 place count 63 transition count 224
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 63 transition count 222
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 61 transition count 222
Applied a total of 12 rules in 26 ms. Remains 61 /67 variables (removed 6) and now considering 222/227 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 61/67 places, 222/227 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 435792 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :{}
Probabilistic random walk after 435792 steps, saw 248063 distinct states, run finished after 3002 ms. (steps per millisecond=145 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 18:38:37] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2024-05-24 18:38:37] [INFO ] Computed 8 invariants in 2 ms
[2024-05-24 18:38:37] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 18:38:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 18:38:37] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 18:38:37] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-24 18:38:37] [INFO ] After 25ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 18:38:38] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2024-05-24 18:38:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2024-05-24 18:38:38] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-24 18:38:38] [INFO ] After 204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 12 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 61/61 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 9 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-05-24 18:38:38] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2024-05-24 18:38:38] [INFO ] Invariant cache hit.
[2024-05-24 18:38:38] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-24 18:38:38] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2024-05-24 18:38:38] [INFO ] Invariant cache hit.
[2024-05-24 18:38:38] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-24 18:38:38] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2024-05-24 18:38:38] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-24 18:38:38] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2024-05-24 18:38:38] [INFO ] Invariant cache hit.
[2024-05-24 18:38:38] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 297 ms. Remains : 61/61 places, 222/222 transitions.
Drop transitions removed 13 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 61 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 52 place count 61 transition count 169
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 54 place count 60 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 56 place count 59 transition count 168
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 56 transition count 199
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 56 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 55 transition count 198
Applied a total of 63 rules in 15 ms. Remains 55 /61 variables (removed 6) and now considering 198/222 (removed 24) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 198 rows 55 cols
[2024-05-24 18:38:38] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 18:38:38] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 18:38:38] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-05-24 18:38:38] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 18:38:38] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-24 18:38:38] [INFO ] After 112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 1 atomic propositions for a total of 4 simplifications.
FORMULA Medical-PT-16-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 33 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 227/227 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 67 transition count 224
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 64 transition count 224
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 0 with 2 rules applied. Total rules applied 8 place count 63 transition count 224
Applied a total of 8 rules in 19 ms. Remains 63 /67 variables (removed 4) and now considering 224/227 (removed 3) transitions.
[2024-05-24 18:38:38] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
// Phase 1: matrix 178 rows 63 cols
[2024-05-24 18:38:38] [INFO ] Computed 8 invariants in 4 ms
[2024-05-24 18:38:38] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-24 18:38:38] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2024-05-24 18:38:38] [INFO ] Invariant cache hit.
[2024-05-24 18:38:38] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-24 18:38:38] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2024-05-24 18:38:38] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-24 18:38:38] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2024-05-24 18:38:38] [INFO ] Invariant cache hit.
[2024-05-24 18:38:38] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/67 places, 224/227 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 332 ms. Remains : 63/67 places, 224/227 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 172 ms :[(NOT p0)]
Running random walk in product with property : Medical-PT-16-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s32)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 240 steps with 3 reset in 10 ms.
FORMULA Medical-PT-16-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Medical-PT-16-LTLCardinality-03 finished in 587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 227/227 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 67 transition count 224
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 64 transition count 224
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 0 with 2 rules applied. Total rules applied 8 place count 63 transition count 224
Applied a total of 8 rules in 18 ms. Remains 63 /67 variables (removed 4) and now considering 224/227 (removed 3) transitions.
[2024-05-24 18:38:39] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2024-05-24 18:38:39] [INFO ] Invariant cache hit.
[2024-05-24 18:38:39] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-24 18:38:39] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2024-05-24 18:38:39] [INFO ] Invariant cache hit.
[2024-05-24 18:38:39] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-24 18:38:39] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-05-24 18:38:39] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-24 18:38:39] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2024-05-24 18:38:39] [INFO ] Invariant cache hit.
[2024-05-24 18:38:39] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/67 places, 224/227 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 320 ms. Remains : 63/67 places, 224/227 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Medical-PT-16-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s22 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 659 reset in 299 ms.
Product exploration explored 100000 steps with 657 reset in 225 ms.
Computed a total of 6 stabilizing places and 33 stable transitions
Computed a total of 6 stabilizing places and 33 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 45 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1237550 steps, run timeout after 3001 ms. (steps per millisecond=412 ) properties seen :{}
Probabilistic random walk after 1237550 steps, saw 718139 distinct states, run finished after 3001 ms. (steps per millisecond=412 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 18:38:43] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2024-05-24 18:38:43] [INFO ] Invariant cache hit.
[2024-05-24 18:38:43] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 18:38:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 18:38:43] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 18:38:43] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-24 18:38:43] [INFO ] After 15ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 18:38:43] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-24 18:38:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-05-24 18:38:43] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-24 18:38:43] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 224/224 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 222
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 222
Applied a total of 4 rules in 9 ms. Remains 61 /63 variables (removed 2) and now considering 222/224 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 61/63 places, 222/224 transitions.
Incomplete random walk after 10008 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1251 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1372353 steps, run timeout after 3001 ms. (steps per millisecond=457 ) properties seen :{}
Probabilistic random walk after 1372353 steps, saw 784702 distinct states, run finished after 3001 ms. (steps per millisecond=457 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 18:38:46] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2024-05-24 18:38:46] [INFO ] Computed 8 invariants in 5 ms
[2024-05-24 18:38:46] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 18:38:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 18:38:46] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 18:38:46] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-24 18:38:46] [INFO ] After 18ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 18:38:46] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-24 18:38:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2024-05-24 18:38:46] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-24 18:38:46] [INFO ] After 131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 5 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 61/61 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-05-24 18:38:46] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2024-05-24 18:38:46] [INFO ] Invariant cache hit.
[2024-05-24 18:38:46] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-24 18:38:46] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2024-05-24 18:38:46] [INFO ] Invariant cache hit.
[2024-05-24 18:38:46] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-24 18:38:46] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-05-24 18:38:46] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-24 18:38:46] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2024-05-24 18:38:46] [INFO ] Invariant cache hit.
[2024-05-24 18:38:46] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 271 ms. Remains : 61/61 places, 222/222 transitions.
Drop transitions removed 13 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 61 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 52 place count 61 transition count 169
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 54 place count 60 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 56 place count 59 transition count 168
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 56 transition count 199
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 56 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 55 transition count 198
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 55 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 54 transition count 221
Applied a total of 65 rules in 17 ms. Remains 54 /61 variables (removed 7) and now considering 221/222 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 221 rows 54 cols
[2024-05-24 18:38:46] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 18:38:47] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 18:38:47] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 18:38:47] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 18:38:47] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-24 18:38:47] [INFO ] After 5ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 18:38:47] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-24 18:38:47] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 224/224 transitions.
Applied a total of 0 rules in 16 ms. Remains 63 /63 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-24 18:38:47] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
// Phase 1: matrix 178 rows 63 cols
[2024-05-24 18:38:47] [INFO ] Computed 8 invariants in 3 ms
[2024-05-24 18:38:47] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-24 18:38:47] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2024-05-24 18:38:47] [INFO ] Invariant cache hit.
[2024-05-24 18:38:47] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-24 18:38:47] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-24 18:38:47] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-24 18:38:47] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2024-05-24 18:38:47] [INFO ] Invariant cache hit.
[2024-05-24 18:38:47] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 289 ms. Remains : 63/63 places, 224/224 transitions.
Computed a total of 6 stabilizing places and 33 stable transitions
Computed a total of 6 stabilizing places and 33 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 59 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1162452 steps, run timeout after 3001 ms. (steps per millisecond=387 ) properties seen :{}
Probabilistic random walk after 1162452 steps, saw 688886 distinct states, run finished after 3001 ms. (steps per millisecond=387 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 18:38:50] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2024-05-24 18:38:50] [INFO ] Invariant cache hit.
[2024-05-24 18:38:50] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 18:38:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 18:38:50] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 18:38:50] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-24 18:38:50] [INFO ] After 15ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 18:38:51] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-24 18:38:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-24 18:38:51] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-24 18:38:51] [INFO ] After 155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 224/224 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 222
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 222
Applied a total of 4 rules in 9 ms. Remains 61 /63 variables (removed 2) and now considering 222/224 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 61/63 places, 222/224 transitions.
Incomplete random walk after 10008 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1429 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1395818 steps, run timeout after 3001 ms. (steps per millisecond=465 ) properties seen :{}
Probabilistic random walk after 1395818 steps, saw 798781 distinct states, run finished after 3001 ms. (steps per millisecond=465 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 18:38:54] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2024-05-24 18:38:54] [INFO ] Computed 8 invariants in 6 ms
[2024-05-24 18:38:54] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 18:38:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-24 18:38:54] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 18:38:54] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-24 18:38:54] [INFO ] After 14ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 18:38:54] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-24 18:38:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2024-05-24 18:38:54] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-24 18:38:54] [INFO ] After 136ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 61/61 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-05-24 18:38:54] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2024-05-24 18:38:54] [INFO ] Invariant cache hit.
[2024-05-24 18:38:54] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-24 18:38:54] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2024-05-24 18:38:54] [INFO ] Invariant cache hit.
[2024-05-24 18:38:54] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-24 18:38:54] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-24 18:38:54] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 18:38:54] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2024-05-24 18:38:54] [INFO ] Invariant cache hit.
[2024-05-24 18:38:54] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 297 ms. Remains : 61/61 places, 222/222 transitions.
Drop transitions removed 13 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 61 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 52 place count 61 transition count 169
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 54 place count 60 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 56 place count 59 transition count 168
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 56 transition count 199
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 56 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 55 transition count 198
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 55 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 54 transition count 221
Applied a total of 65 rules in 14 ms. Remains 54 /61 variables (removed 7) and now considering 221/222 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 221 rows 54 cols
[2024-05-24 18:38:54] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 18:38:54] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 18:38:54] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 18:38:54] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 18:38:54] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-24 18:38:54] [INFO ] After 13ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 18:38:54] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-24 18:38:54] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 655 reset in 166 ms.
Product exploration explored 100000 steps with 665 reset in 167 ms.
Built C files in :
/tmp/ltsmin13667877832971867530
[2024-05-24 18:38:55] [INFO ] Computing symmetric may disable matrix : 224 transitions.
[2024-05-24 18:38:55] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 18:38:55] [INFO ] Computing symmetric may enable matrix : 224 transitions.
[2024-05-24 18:38:55] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 18:38:55] [INFO ] Computing Do-Not-Accords matrix : 224 transitions.
[2024-05-24 18:38:55] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 18:38:55] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13667877832971867530
Running compilation step : cd /tmp/ltsmin13667877832971867530;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 557 ms.
Running link step : cd /tmp/ltsmin13667877832971867530;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin13667877832971867530;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11412419590757059126.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 224/224 transitions.
Applied a total of 0 rules in 11 ms. Remains 63 /63 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-24 18:39:10] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
// Phase 1: matrix 178 rows 63 cols
[2024-05-24 18:39:10] [INFO ] Computed 8 invariants in 8 ms
[2024-05-24 18:39:10] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-24 18:39:10] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2024-05-24 18:39:10] [INFO ] Invariant cache hit.
[2024-05-24 18:39:10] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-24 18:39:10] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-05-24 18:39:10] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 18:39:10] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2024-05-24 18:39:10] [INFO ] Invariant cache hit.
[2024-05-24 18:39:10] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 300 ms. Remains : 63/63 places, 224/224 transitions.
Built C files in :
/tmp/ltsmin11390541156515085544
[2024-05-24 18:39:10] [INFO ] Computing symmetric may disable matrix : 224 transitions.
[2024-05-24 18:39:10] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 18:39:10] [INFO ] Computing symmetric may enable matrix : 224 transitions.
[2024-05-24 18:39:10] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 18:39:10] [INFO ] Computing Do-Not-Accords matrix : 224 transitions.
[2024-05-24 18:39:10] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 18:39:11] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11390541156515085544
Running compilation step : cd /tmp/ltsmin11390541156515085544;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 458 ms.
Running link step : cd /tmp/ltsmin11390541156515085544;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin11390541156515085544;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6410330898126875071.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 18:39:26] [INFO ] Flatten gal took : 19 ms
[2024-05-24 18:39:26] [INFO ] Flatten gal took : 16 ms
[2024-05-24 18:39:26] [INFO ] Time to serialize gal into /tmp/LTL10468327435498708837.gal : 5 ms
[2024-05-24 18:39:26] [INFO ] Time to serialize properties into /tmp/LTL8751740771036755205.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10468327435498708837.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13774117107512849559.hoa' '-atoms' '/tmp/LTL8751740771036755205.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8751740771036755205.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13774117107512849559.hoa
Detected timeout of ITS tools.
[2024-05-24 18:39:41] [INFO ] Flatten gal took : 15 ms
[2024-05-24 18:39:41] [INFO ] Flatten gal took : 15 ms
[2024-05-24 18:39:41] [INFO ] Time to serialize gal into /tmp/LTL10711205939318519664.gal : 2 ms
[2024-05-24 18:39:41] [INFO ] Time to serialize properties into /tmp/LTL2619186763053453393.ltl : 4 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10711205939318519664.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2619186763053453393.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(x1_AA_q1<=0)"))))
Formula 0 simplified : FG!"(x1_AA_q1<=0)"
Detected timeout of ITS tools.
[2024-05-24 18:39:56] [INFO ] Flatten gal took : 14 ms
[2024-05-24 18:39:56] [INFO ] Applying decomposition
[2024-05-24 18:39:56] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8115615572127994607.txt' '-o' '/tmp/graph8115615572127994607.bin' '-w' '/tmp/graph8115615572127994607.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8115615572127994607.bin' '-l' '-1' '-v' '-w' '/tmp/graph8115615572127994607.weights' '-q' '0' '-e' '0.001'
[2024-05-24 18:39:56] [INFO ] Decomposing Gal with order
[2024-05-24 18:39:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 18:39:56] [INFO ] Removed a total of 83 redundant transitions.
[2024-05-24 18:39:56] [INFO ] Flatten gal took : 52 ms
[2024-05-24 18:39:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 73 labels/synchronizations in 4 ms.
[2024-05-24 18:39:56] [INFO ] Time to serialize gal into /tmp/LTL16448398700383787437.gal : 3 ms
[2024-05-24 18:39:56] [INFO ] Time to serialize properties into /tmp/LTL4409770143136316819.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16448398700383787437.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4409770143136316819.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("(u1.x1_AA_q1<=0)"))))
Formula 0 simplified : FG!"(u1.x1_AA_q1<=0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1673861876138837986
[2024-05-24 18:40:11] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1673861876138837986
Running compilation step : cd /tmp/ltsmin1673861876138837986;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 369 ms.
Running link step : cd /tmp/ltsmin1673861876138837986;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1673861876138837986;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Medical-PT-16-LTLCardinality-04 finished in 107510 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 227/227 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 67 transition count 224
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 64 transition count 224
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 0 with 2 rules applied. Total rules applied 8 place count 63 transition count 224
Applied a total of 8 rules in 7 ms. Remains 63 /67 variables (removed 4) and now considering 224/227 (removed 3) transitions.
[2024-05-24 18:40:26] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2024-05-24 18:40:26] [INFO ] Invariant cache hit.
[2024-05-24 18:40:26] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-24 18:40:26] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2024-05-24 18:40:26] [INFO ] Invariant cache hit.
[2024-05-24 18:40:26] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-24 18:40:26] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-05-24 18:40:26] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 18:40:26] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2024-05-24 18:40:26] [INFO ] Invariant cache hit.
[2024-05-24 18:40:27] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/67 places, 224/227 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 305 ms. Remains : 63/67 places, 224/227 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Running random walk in product with property : Medical-PT-16-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s19 0)], 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 638 reset in 181 ms.
Product exploration explored 100000 steps with 672 reset in 183 ms.
Computed a total of 6 stabilizing places and 33 stable transitions
Computed a total of 6 stabilizing places and 33 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 75 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1165420 steps, run timeout after 3001 ms. (steps per millisecond=388 ) properties seen :{}
Probabilistic random walk after 1165420 steps, saw 688886 distinct states, run finished after 3002 ms. (steps per millisecond=388 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 18:40:30] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2024-05-24 18:40:30] [INFO ] Invariant cache hit.
[2024-05-24 18:40:30] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 18:40:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 18:40:30] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 18:40:30] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-24 18:40:30] [INFO ] After 16ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 18:40:30] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-24 18:40:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-05-24 18:40:30] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-24 18:40:30] [INFO ] After 147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 224/224 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 222
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 222
Applied a total of 4 rules in 9 ms. Remains 61 /63 variables (removed 2) and now considering 222/224 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 61/63 places, 222/224 transitions.
Incomplete random walk after 10011 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1668 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1290946 steps, run timeout after 3001 ms. (steps per millisecond=430 ) properties seen :{}
Probabilistic random walk after 1290946 steps, saw 735858 distinct states, run finished after 3001 ms. (steps per millisecond=430 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 18:40:33] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2024-05-24 18:40:33] [INFO ] Computed 8 invariants in 8 ms
[2024-05-24 18:40:33] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 18:40:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 18:40:33] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 18:40:33] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-24 18:40:33] [INFO ] After 21ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 18:40:33] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-24 18:40:34] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-24 18:40:34] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-24 18:40:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 149 ms
[2024-05-24 18:40:34] [INFO ] After 179ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-24 18:40:34] [INFO ] After 247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 61/61 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-05-24 18:40:34] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2024-05-24 18:40:34] [INFO ] Invariant cache hit.
[2024-05-24 18:40:34] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-24 18:40:34] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2024-05-24 18:40:34] [INFO ] Invariant cache hit.
[2024-05-24 18:40:34] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-24 18:40:34] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-05-24 18:40:34] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 18:40:34] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2024-05-24 18:40:34] [INFO ] Invariant cache hit.
[2024-05-24 18:40:34] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 268 ms. Remains : 61/61 places, 222/222 transitions.
Drop transitions removed 13 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 61 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 52 place count 61 transition count 169
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 54 place count 60 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 56 place count 59 transition count 168
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 56 transition count 199
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 56 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 55 transition count 198
Applied a total of 63 rules in 8 ms. Remains 55 /61 variables (removed 6) and now considering 198/222 (removed 24) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 198 rows 55 cols
[2024-05-24 18:40:34] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 18:40:34] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 18:40:34] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-05-24 18:40:34] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 18:40:34] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-24 18:40:34] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 224/224 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-24 18:40:34] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
// Phase 1: matrix 178 rows 63 cols
[2024-05-24 18:40:34] [INFO ] Computed 8 invariants in 2 ms
[2024-05-24 18:40:34] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-24 18:40:34] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2024-05-24 18:40:34] [INFO ] Invariant cache hit.
[2024-05-24 18:40:34] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-24 18:40:34] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-05-24 18:40:34] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 18:40:34] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2024-05-24 18:40:34] [INFO ] Invariant cache hit.
[2024-05-24 18:40:34] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 282 ms. Remains : 63/63 places, 224/224 transitions.
Computed a total of 6 stabilizing places and 33 stable transitions
Computed a total of 6 stabilizing places and 33 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 52 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1265556 steps, run timeout after 3001 ms. (steps per millisecond=421 ) properties seen :{}
Probabilistic random walk after 1265556 steps, saw 731533 distinct states, run finished after 3001 ms. (steps per millisecond=421 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 18:40:38] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2024-05-24 18:40:38] [INFO ] Invariant cache hit.
[2024-05-24 18:40:38] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 18:40:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 18:40:38] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 18:40:38] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-24 18:40:38] [INFO ] After 11ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 18:40:38] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-24 18:40:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-05-24 18:40:38] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-24 18:40:38] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 224/224 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 222
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 222
Applied a total of 4 rules in 7 ms. Remains 61 /63 variables (removed 2) and now considering 222/224 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 61/63 places, 222/224 transitions.
Incomplete random walk after 10011 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1251 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1307576 steps, run timeout after 3001 ms. (steps per millisecond=435 ) properties seen :{}
Probabilistic random walk after 1307576 steps, saw 745836 distinct states, run finished after 3001 ms. (steps per millisecond=435 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 18:40:41] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2024-05-24 18:40:41] [INFO ] Computed 8 invariants in 2 ms
[2024-05-24 18:40:41] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 18:40:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 18:40:41] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 18:40:41] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-24 18:40:41] [INFO ] After 18ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 18:40:41] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 0 ms to minimize.
[2024-05-24 18:40:41] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-24 18:40:41] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-24 18:40:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 142 ms
[2024-05-24 18:40:41] [INFO ] After 169ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-24 18:40:41] [INFO ] After 244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 6 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 61/61 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-05-24 18:40:41] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2024-05-24 18:40:41] [INFO ] Invariant cache hit.
[2024-05-24 18:40:41] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-24 18:40:41] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2024-05-24 18:40:41] [INFO ] Invariant cache hit.
[2024-05-24 18:40:41] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-24 18:40:41] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-05-24 18:40:41] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 18:40:41] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2024-05-24 18:40:41] [INFO ] Invariant cache hit.
[2024-05-24 18:40:41] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 61/61 places, 222/222 transitions.
Drop transitions removed 13 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 61 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 52 place count 61 transition count 169
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 54 place count 60 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 56 place count 59 transition count 168
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 56 transition count 199
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 56 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 55 transition count 198
Applied a total of 63 rules in 9 ms. Remains 55 /61 variables (removed 6) and now considering 198/222 (removed 24) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 198 rows 55 cols
[2024-05-24 18:40:41] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 18:40:41] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 18:40:41] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-05-24 18:40:41] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 18:40:41] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-24 18:40:41] [INFO ] After 88ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 660 reset in 176 ms.
Product exploration explored 100000 steps with 654 reset in 181 ms.
Built C files in :
/tmp/ltsmin12484418159981708621
[2024-05-24 18:40:42] [INFO ] Computing symmetric may disable matrix : 224 transitions.
[2024-05-24 18:40:42] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 18:40:42] [INFO ] Computing symmetric may enable matrix : 224 transitions.
[2024-05-24 18:40:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 18:40:42] [INFO ] Computing Do-Not-Accords matrix : 224 transitions.
[2024-05-24 18:40:42] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 18:40:42] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12484418159981708621
Running compilation step : cd /tmp/ltsmin12484418159981708621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 458 ms.
Running link step : cd /tmp/ltsmin12484418159981708621;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin12484418159981708621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased293137906180645254.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 224/224 transitions.
Applied a total of 0 rules in 5 ms. Remains 63 /63 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-24 18:40:57] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
// Phase 1: matrix 178 rows 63 cols
[2024-05-24 18:40:57] [INFO ] Computed 8 invariants in 3 ms
[2024-05-24 18:40:57] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-24 18:40:57] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2024-05-24 18:40:57] [INFO ] Invariant cache hit.
[2024-05-24 18:40:57] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-24 18:40:57] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-05-24 18:40:57] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 18:40:57] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2024-05-24 18:40:57] [INFO ] Invariant cache hit.
[2024-05-24 18:40:58] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 302 ms. Remains : 63/63 places, 224/224 transitions.
Built C files in :
/tmp/ltsmin6463060075459896740
[2024-05-24 18:40:58] [INFO ] Computing symmetric may disable matrix : 224 transitions.
[2024-05-24 18:40:58] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 18:40:58] [INFO ] Computing symmetric may enable matrix : 224 transitions.
[2024-05-24 18:40:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 18:40:58] [INFO ] Computing Do-Not-Accords matrix : 224 transitions.
[2024-05-24 18:40:58] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 18:40:58] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6463060075459896740
Running compilation step : cd /tmp/ltsmin6463060075459896740;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 458 ms.
Running link step : cd /tmp/ltsmin6463060075459896740;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6463060075459896740;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13294998358651179010.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 18:41:13] [INFO ] Flatten gal took : 13 ms
[2024-05-24 18:41:13] [INFO ] Flatten gal took : 12 ms
[2024-05-24 18:41:13] [INFO ] Time to serialize gal into /tmp/LTL17183848367760957974.gal : 2 ms
[2024-05-24 18:41:13] [INFO ] Time to serialize properties into /tmp/LTL10599372477316021570.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17183848367760957974.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3897305481116801825.hoa' '-atoms' '/tmp/LTL10599372477316021570.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10599372477316021570.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3897305481116801825.hoa
Detected timeout of ITS tools.
[2024-05-24 18:41:28] [INFO ] Flatten gal took : 19 ms
[2024-05-24 18:41:28] [INFO ] Flatten gal took : 11 ms
[2024-05-24 18:41:28] [INFO ] Time to serialize gal into /tmp/LTL4545009353787442579.gal : 3 ms
[2024-05-24 18:41:28] [INFO ] Time to serialize properties into /tmp/LTL7708841610854148783.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4545009353787442579.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7708841610854148783.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(x0_HA_q5<=0)"))))
Formula 0 simplified : GF!"(x0_HA_q5<=0)"
Detected timeout of ITS tools.
[2024-05-24 18:41:43] [INFO ] Flatten gal took : 12 ms
[2024-05-24 18:41:43] [INFO ] Applying decomposition
[2024-05-24 18:41:43] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7323703596283514362.txt' '-o' '/tmp/graph7323703596283514362.bin' '-w' '/tmp/graph7323703596283514362.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7323703596283514362.bin' '-l' '-1' '-v' '-w' '/tmp/graph7323703596283514362.weights' '-q' '0' '-e' '0.001'
[2024-05-24 18:41:43] [INFO ] Decomposing Gal with order
[2024-05-24 18:41:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 18:41:43] [INFO ] Removed a total of 83 redundant transitions.
[2024-05-24 18:41:43] [INFO ] Flatten gal took : 22 ms
[2024-05-24 18:41:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 73 labels/synchronizations in 2 ms.
[2024-05-24 18:41:43] [INFO ] Time to serialize gal into /tmp/LTL13376201954842923724.gal : 2 ms
[2024-05-24 18:41:43] [INFO ] Time to serialize properties into /tmp/LTL5284906317894766556.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13376201954842923724.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5284906317894766556.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(u0.x0_HA_q5<=0)"))))
Formula 0 simplified : GF!"(u0.x0_HA_q5<=0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10893402033257691103
[2024-05-24 18:41:58] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10893402033257691103
Running compilation step : cd /tmp/ltsmin10893402033257691103;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 380 ms.
Running link step : cd /tmp/ltsmin10893402033257691103;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10893402033257691103;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Medical-PT-16-LTLCardinality-14 finished in 106916 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-24 18:42:13] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17803846225917581440
[2024-05-24 18:42:13] [INFO ] Computing symmetric may disable matrix : 227 transitions.
[2024-05-24 18:42:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 18:42:13] [INFO ] Computing symmetric may enable matrix : 227 transitions.
[2024-05-24 18:42:13] [INFO ] Applying decomposition
[2024-05-24 18:42:13] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 18:42:13] [INFO ] Computing Do-Not-Accords matrix : 227 transitions.
[2024-05-24 18:42:13] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11440389388291811014.txt' '-o' '/tmp/graph11440389388291811014.bin' '-w' '/tmp/graph11440389388291811014.weights'
[2024-05-24 18:42:13] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11440389388291811014.bin' '-l' '-1' '-v' '-w' '/tmp/graph11440389388291811014.weights' '-q' '0' '-e' '0.001'
[2024-05-24 18:42:13] [INFO ] Decomposing Gal with order
[2024-05-24 18:42:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 18:42:13] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17803846225917581440
Running compilation step : cd /tmp/ltsmin17803846225917581440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-24 18:42:13] [INFO ] Removed a total of 94 redundant transitions.
[2024-05-24 18:42:13] [INFO ] Flatten gal took : 23 ms
[2024-05-24 18:42:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 83 labels/synchronizations in 2 ms.
[2024-05-24 18:42:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality8225950483727448303.gal : 2 ms
[2024-05-24 18:42:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality16213770359191044543.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8225950483727448303.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16213770359191044543.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((G(F("(u1.x1_AA_q1<=0)"))))
Formula 0 simplified : FG!"(u1.x1_AA_q1<=0)"
Compilation finished in 514 ms.
Running link step : cd /tmp/ltsmin17803846225917581440;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17803846225917581440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.237: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.245: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.249: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.261: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.261: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.261: Initializing POR dependencies: labels 229, guards 227
pins2lts-mc-linux64( 7/ 8), 0.272: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.272: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.272: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.385: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 4/ 8), 0.385: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.385: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.441: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.443: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.457: There are 231 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.457: State length is 68, there are 230 groups
pins2lts-mc-linux64( 0/ 8), 0.457: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.457: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.457: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.457: Visible groups: 0 / 230, labels: 1 / 231
pins2lts-mc-linux64( 0/ 8), 0.457: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.457: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.500: [Blue] ~120 levels ~960 states ~2192 transitions
pins2lts-mc-linux64( 3/ 8), 0.523: [Blue] ~240 levels ~1920 states ~3800 transitions
pins2lts-mc-linux64( 3/ 8), 0.550: [Blue] ~437 levels ~3840 states ~6632 transitions
pins2lts-mc-linux64( 3/ 8), 0.616: [Blue] ~763 levels ~7680 states ~12168 transitions
pins2lts-mc-linux64( 1/ 8), 0.742: [Blue] ~1004 levels ~15360 states ~18408 transitions
pins2lts-mc-linux64( 3/ 8), 0.946: [Blue] ~2203 levels ~30720 states ~39048 transitions
pins2lts-mc-linux64( 3/ 8), 1.376: [Blue] ~4123 levels ~61440 states ~74888 transitions
pins2lts-mc-linux64( 3/ 8), 2.155: [Blue] ~7963 levels ~122880 states ~146568 transitions
pins2lts-mc-linux64( 3/ 8), 3.389: [Blue] ~15643 levels ~245760 states ~289928 transitions
pins2lts-mc-linux64( 3/ 8), 5.374: [Blue] ~31003 levels ~491520 states ~576648 transitions
pins2lts-mc-linux64( 3/ 8), 8.822: [Blue] ~61723 levels ~983040 states ~1150088 transitions
pins2lts-mc-linux64( 1/ 8), 15.368: [Blue] ~122924 levels ~1966080 states ~2294248 transitions
pins2lts-mc-linux64( 1/ 8), 28.182: [Blue] ~245804 levels ~3932160 states ~4588008 transitions
pins2lts-mc-linux64( 1/ 8), 54.111: [Blue] ~491564 levels ~7864320 states ~9175528 transitions
pins2lts-mc-linux64( 1/ 8), 106.260: [Blue] ~983084 levels ~15728640 states ~18350568 transitions
pins2lts-mc-linux64( 2/ 8), 170.712: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 170.806:
pins2lts-mc-linux64( 0/ 8), 170.806: Explored 17126812 states 35674380 transitions, fanout: 2.083
pins2lts-mc-linux64( 0/ 8), 170.806: Total exploration time 170.310 sec (170.240 sec minimum, 170.268 sec on average)
pins2lts-mc-linux64( 0/ 8), 170.806: States per second: 100563, Transitions per second: 209467
pins2lts-mc-linux64( 0/ 8), 170.806:
pins2lts-mc-linux64( 0/ 8), 170.806: State space has 33954219 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 170.806: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 170.806: blue states: 17126812 (50.44%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 170.806: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 170.806: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 170.806:
pins2lts-mc-linux64( 0/ 8), 170.806: Total memory used for local state coloring: 212.6MB
pins2lts-mc-linux64( 0/ 8), 170.806:
pins2lts-mc-linux64( 0/ 8), 170.806: Queue width: 8B, total height: 13936196, memory: 106.32MB
pins2lts-mc-linux64( 0/ 8), 170.806: Tree memory: 515.0MB, 15.9 B/state, compr.: 5.8%
pins2lts-mc-linux64( 0/ 8), 170.806: Tree fill ratio (roots/leafs): 25.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 170.806: Stored 227 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 170.806: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 170.806: Est. total memory use: 621.4MB (~1130.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17803846225917581440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17803846225917581440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-24 19:03:27] [INFO ] Flatten gal took : 22 ms
[2024-05-24 19:03:27] [INFO ] Time to serialize gal into /tmp/LTLCardinality3333382917665987104.gal : 2 ms
[2024-05-24 19:03:27] [INFO ] Time to serialize properties into /tmp/LTLCardinality3057540093037561747.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3333382917665987104.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3057540093037561747.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 2 LTL properties
Checking formula 0 : !((G(F("(x1_AA_q1<=0)"))))
Formula 0 simplified : FG!"(x1_AA_q1<=0)"
Detected timeout of ITS tools.
[2024-05-24 19:24:40] [INFO ] Flatten gal took : 19 ms
[2024-05-24 19:24:40] [INFO ] Input system was already deterministic with 227 transitions.
[2024-05-24 19:24:40] [INFO ] Transformed 67 places.
[2024-05-24 19:24:40] [INFO ] Transformed 227 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-24 19:24:40] [INFO ] Time to serialize gal into /tmp/LTLCardinality14895925523814038894.gal : 2 ms
[2024-05-24 19:24:40] [INFO ] Time to serialize properties into /tmp/LTLCardinality2097884624990075578.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14895925523814038894.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2097884624990075578.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("(x1_AA_q1<=0)"))))
Formula 0 simplified : FG!"(x1_AA_q1<=0)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5056008 kB
After kill :
MemTotal: 16393216 kB
MemFree: 14455016 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="Medical-PT-16"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is Medical-PT-16, 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 r241-tall-171649628700357"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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