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.r070-tall-171620505700363.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 itstools
Input is CircularTrains-PT-384, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505700363
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 14:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 14:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 14:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 14:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 293K 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 CircularTrains-PT-384-LTLCardinality-00
FORMULA_NAME CircularTrains-PT-384-LTLCardinality-01
FORMULA_NAME CircularTrains-PT-384-LTLCardinality-02
FORMULA_NAME CircularTrains-PT-384-LTLCardinality-03
FORMULA_NAME CircularTrains-PT-384-LTLCardinality-04
FORMULA_NAME CircularTrains-PT-384-LTLCardinality-05
FORMULA_NAME CircularTrains-PT-384-LTLCardinality-06
FORMULA_NAME CircularTrains-PT-384-LTLCardinality-07
FORMULA_NAME CircularTrains-PT-384-LTLCardinality-08
FORMULA_NAME CircularTrains-PT-384-LTLCardinality-09
FORMULA_NAME CircularTrains-PT-384-LTLCardinality-10
FORMULA_NAME CircularTrains-PT-384-LTLCardinality-11
FORMULA_NAME CircularTrains-PT-384-LTLCardinality-12
FORMULA_NAME CircularTrains-PT-384-LTLCardinality-13
FORMULA_NAME CircularTrains-PT-384-LTLCardinality-14
FORMULA_NAME CircularTrains-PT-384-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716287224104

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-384
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 10:27:05] [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-21 10:27:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 10:27:05] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-05-21 10:27:05] [INFO ] Transformed 768 places.
[2024-05-21 10:27:05] [INFO ] Transformed 384 transitions.
[2024-05-21 10:27:05] [INFO ] Parsed PT model containing 768 places and 384 transitions and 1536 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CircularTrains-PT-384-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-384-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 384/384 transitions.
Applied a total of 0 rules in 87 ms. Remains 768 /768 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 768 cols
[2024-05-21 10:27:05] [INFO ] Computed 385 invariants in 44 ms
[2024-05-21 10:27:06] [INFO ] Implicit Places using invariants in 801 ms returned [1, 7, 9, 21, 26, 32, 46, 48, 58, 63, 64, 71, 85, 86, 88, 98, 103, 107, 108, 133, 135, 137, 158, 162, 167, 174, 179, 185, 193, 198, 203, 215, 220, 230, 245, 246, 254, 270, 276, 287, 293, 301, 303, 331, 334, 340, 346, 347, 350, 351, 353, 354, 357, 365, 383, 390, 403, 411, 412, 422, 426, 433, 447, 448, 449, 470, 475, 476, 485, 496, 502, 504, 505, 507, 508, 522, 525, 538, 539, 545, 551, 576, 579, 580, 586, 600, 607, 619, 622, 625, 638, 643, 644, 647, 648, 662, 666, 671, 674, 677, 689, 693, 700, 708, 715, 718, 719, 723, 732, 735, 740, 741, 743, 746, 747, 749, 755, 758, 759, 760, 763, 764]
Discarding 122 places :
Implicit Place search using SMT only with invariants took 838 ms to find 122 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/768 places, 384/384 transitions.
Applied a total of 0 rules in 38 ms. Remains 646 /646 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 984 ms. Remains : 646/768 places, 384/384 transitions.
Support contains 37 out of 646 places after structural reductions.
[2024-05-21 10:27:06] [INFO ] Flatten gal took : 57 ms
[2024-05-21 10:27:06] [INFO ] Flatten gal took : 34 ms
[2024-05-21 10:27:06] [INFO ] Input system was already deterministic with 384 transitions.
RANDOM walk for 40000 steps (8 resets) in 2666 ms. (14 steps per ms) remains 5/22 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 5/5 properties
// Phase 1: matrix 384 rows 646 cols
[2024-05-21 10:27:08] [INFO ] Computed 263 invariants in 17 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 1 (OVERLAPS) 10/15 variables, 5/5 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/21 variables, 3/8 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 300/321 variables, 3/11 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/11 constraints. Problems are: Problem set: 4 solved, 1 unsolved
Problem AtomicPropp20 is UNSAT
After SMT solving in domain Real declared 642/1030 variables, and 259 constraints, problems are : Problem set: 5 solved, 0 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 256/257 constraints, Generalized P Invariants (flows): 3/6 constraints, State Equation: 0/646 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 249ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 14 simplifications.
FORMULA CircularTrains-PT-384-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA CircularTrains-PT-384-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 646 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 646/646 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 115 place count 646 transition count 269
Reduce places removed 115 places and 0 transitions.
Iterating post reduction 1 with 115 rules applied. Total rules applied 230 place count 531 transition count 269
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 230 place count 531 transition count 263
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 242 place count 525 transition count 263
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 254 place count 519 transition count 257
Applied a total of 254 rules in 62 ms. Remains 519 /646 variables (removed 127) and now considering 257/384 (removed 127) transitions.
// Phase 1: matrix 257 rows 519 cols
[2024-05-21 10:27:08] [INFO ] Computed 263 invariants in 2 ms
[2024-05-21 10:27:09] [INFO ] Implicit Places using invariants in 327 ms returned [12, 80, 155, 280, 428]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 334 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 514/646 places, 257/384 transitions.
Applied a total of 0 rules in 22 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 419 ms. Remains : 514/646 places, 257/384 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-00
Product exploration explored 100000 steps with 1019 reset in 1818 ms.
Product exploration explored 100000 steps with 1104 reset in 1864 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 160 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 140 steps (0 resets) in 15 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 144 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
// Phase 1: matrix 257 rows 514 cols
[2024-05-21 10:27:13] [INFO ] Computed 258 invariants in 8 ms
[2024-05-21 10:27:13] [INFO ] [Real]Absence check using 256 positive place invariants in 70 ms returned sat
[2024-05-21 10:27:13] [INFO ] [Real]Absence check using 256 positive and 2 generalized place invariants in 16 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 1 factoid took 205 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CircularTrains-PT-384-LTLCardinality-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-384-LTLCardinality-00 finished in 5306 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 646 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 646/646 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 114 place count 646 transition count 270
Reduce places removed 114 places and 0 transitions.
Iterating post reduction 1 with 114 rules applied. Total rules applied 228 place count 532 transition count 270
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 228 place count 532 transition count 263
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 242 place count 525 transition count 263
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 254 place count 519 transition count 257
Applied a total of 254 rules in 47 ms. Remains 519 /646 variables (removed 127) and now considering 257/384 (removed 127) transitions.
// Phase 1: matrix 257 rows 519 cols
[2024-05-21 10:27:13] [INFO ] Computed 263 invariants in 6 ms
[2024-05-21 10:27:14] [INFO ] Implicit Places using invariants in 309 ms returned [12, 33, 79, 154, 279, 428]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 310 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 513/646 places, 257/384 transitions.
Applied a total of 0 rules in 14 ms. Remains 513 /513 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 372 ms. Remains : 513/646 places, 257/384 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-02
Product exploration explored 100000 steps with 513 reset in 1538 ms.
Product exploration explored 100000 steps with 543 reset in 1670 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 135 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
RANDOM walk for 1877 steps (0 resets) in 50 ms. (36 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 155 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
// Phase 1: matrix 257 rows 513 cols
[2024-05-21 10:27:18] [INFO ] Computed 257 invariants in 2 ms
[2024-05-21 10:27:18] [INFO ] [Real]Absence check using 255 positive place invariants in 70 ms returned sat
[2024-05-21 10:27:18] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 10 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 1 factoid took 200 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CircularTrains-PT-384-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-384-LTLCardinality-02 finished in 4586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(X(F(p0))))))'
Support contains 2 out of 646 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 646/646 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 115 place count 646 transition count 269
Reduce places removed 115 places and 0 transitions.
Iterating post reduction 1 with 115 rules applied. Total rules applied 230 place count 531 transition count 269
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 230 place count 531 transition count 262
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 244 place count 524 transition count 262
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 256 place count 518 transition count 256
Applied a total of 256 rules in 36 ms. Remains 518 /646 variables (removed 128) and now considering 256/384 (removed 128) transitions.
// Phase 1: matrix 256 rows 518 cols
[2024-05-21 10:27:18] [INFO ] Computed 263 invariants in 6 ms
[2024-05-21 10:27:18] [INFO ] Implicit Places using invariants in 299 ms returned [12, 33, 79, 279, 427]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 300 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 513/646 places, 256/384 transitions.
Applied a total of 0 rules in 12 ms. Remains 513 /513 variables (removed 0) and now considering 256/256 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 349 ms. Remains : 513/646 places, 256/384 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-03
Product exploration explored 100000 steps with 1168 reset in 1687 ms.
Product exploration explored 100000 steps with 1134 reset in 1804 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 119 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
RANDOM walk for 292 steps (0 resets) in 13 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 191 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
// Phase 1: matrix 256 rows 513 cols
[2024-05-21 10:27:22] [INFO ] Computed 258 invariants in 2 ms
[2024-05-21 10:27:23] [INFO ] [Real]Absence check using 255 positive place invariants in 67 ms returned sat
[2024-05-21 10:27:23] [INFO ] [Real]Absence check using 255 positive and 3 generalized place invariants in 41 ms returned sat
[2024-05-21 10:27:23] [INFO ] [Real]Absence check using state equation in 844 ms returned sat
[2024-05-21 10:27:24] [INFO ] Computed and/alt/rep : 128/256/128 causal constraints (skipped 0 transitions) in 22 ms.
[2024-05-21 10:27:37] [INFO ] Added : 110 causal constraints over 22 iterations in 13896 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 256/256 transitions.
Applied a total of 0 rules in 12 ms. Remains 513 /513 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-05-21 10:27:37] [INFO ] Invariant cache hit.
[2024-05-21 10:27:38] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-05-21 10:27:38] [INFO ] Invariant cache hit.
[2024-05-21 10:27:38] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
[2024-05-21 10:27:38] [INFO ] Redundant transitions in 14 ms returned []
Running 128 sub problems to find dead transitions.
[2024-05-21 10:27:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 255/511 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 2/513 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 256/769 variables, 513/771 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/769 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/769 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 769/769 variables, and 771 constraints, problems are : Problem set: 0 solved, 128 unsolved in 8123 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 255/511 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 2/513 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 256/769 variables, 513/771 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/769 variables, 128/899 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/769 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 0/769 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 769/769 variables, and 899 constraints, problems are : Problem set: 0 solved, 128 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 38166ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 38168ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38886 ms. Remains : 513/513 places, 256/256 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 149 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
RANDOM walk for 264 steps (0 resets) in 15 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 172 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
[2024-05-21 10:28:17] [INFO ] Invariant cache hit.
[2024-05-21 10:28:17] [INFO ] [Real]Absence check using 255 positive place invariants in 68 ms returned sat
[2024-05-21 10:28:17] [INFO ] [Real]Absence check using 255 positive and 3 generalized place invariants in 24 ms returned sat
[2024-05-21 10:28:18] [INFO ] [Real]Absence check using state equation in 846 ms returned sat
[2024-05-21 10:28:18] [INFO ] Computed and/alt/rep : 128/256/128 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-21 10:28:32] [INFO ] Added : 125 causal constraints over 25 iterations in 13909 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1110 reset in 1684 ms.
Product exploration explored 100000 steps with 1135 reset in 1808 ms.
Built C files in :
/tmp/ltsmin3269758961618718944
[2024-05-21 10:28:35] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2024-05-21 10:28:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:28:35] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2024-05-21 10:28:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:28:35] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
[2024-05-21 10:28:35] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:28:35] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3269758961618718944
Running compilation step : cd /tmp/ltsmin3269758961618718944;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 771 ms.
Running link step : cd /tmp/ltsmin3269758961618718944;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin3269758961618718944;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1535211101312194607.hoa' '--buchi-type=spotba'
LTSmin run took 2735 ms.
FORMULA CircularTrains-PT-384-LTLCardinality-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-384-LTLCardinality-03 finished in 81043 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 646 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 646/646 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 114 place count 646 transition count 270
Reduce places removed 114 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 115 rules applied. Total rules applied 229 place count 532 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 230 place count 531 transition count 269
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 230 place count 531 transition count 263
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 242 place count 525 transition count 263
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 254 place count 519 transition count 257
Applied a total of 254 rules in 32 ms. Remains 519 /646 variables (removed 127) and now considering 257/384 (removed 127) transitions.
// Phase 1: matrix 257 rows 519 cols
[2024-05-21 10:28:39] [INFO ] Computed 263 invariants in 6 ms
[2024-05-21 10:28:39] [INFO ] Implicit Places using invariants in 285 ms returned [12, 33, 79, 154, 279, 427]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 288 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 513/646 places, 257/384 transitions.
Applied a total of 0 rules in 10 ms. Remains 513 /513 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 330 ms. Remains : 513/646 places, 257/384 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 1237 ms.
Product exploration explored 100000 steps with 0 reset in 1435 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 214 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)]
RANDOM walk for 624 steps (0 resets) in 21 ms. (28 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 141 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 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
// Phase 1: matrix 257 rows 513 cols
[2024-05-21 10:28:43] [INFO ] Computed 257 invariants in 2 ms
[2024-05-21 10:28:43] [INFO ] [Real]Absence check using 255 positive place invariants in 68 ms returned sat
[2024-05-21 10:28:43] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 25 ms returned sat
[2024-05-21 10:28:44] [INFO ] [Real]Absence check using state equation in 765 ms returned sat
[2024-05-21 10:28:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:28:44] [INFO ] [Nat]Absence check using 255 positive place invariants in 68 ms returned sat
[2024-05-21 10:28:44] [INFO ] [Nat]Absence check using 255 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-21 10:28:45] [INFO ] [Nat]Absence check using state equation in 786 ms returned sat
[2024-05-21 10:28:45] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-21 10:28:57] [INFO ] Added : 126 causal constraints over 26 iterations in 11872 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 257/257 transitions.
Applied a total of 0 rules in 17 ms. Remains 513 /513 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-21 10:28:57] [INFO ] Invariant cache hit.
[2024-05-21 10:28:57] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-21 10:28:57] [INFO ] Invariant cache hit.
[2024-05-21 10:28:57] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
[2024-05-21 10:28:57] [INFO ] Redundant transitions in 3 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-21 10:28:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/512 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/770 variables, 513/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/770 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 770/770 variables, and 770 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8049 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/512 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/770 variables, 513/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 129/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/770 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/770 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 770/770 variables, and 899 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 38091ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38094ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38755 ms. Remains : 513/513 places, 257/257 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 120 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 37 ms :[(NOT p0)]
RANDOM walk for 1115 steps (0 resets) in 31 ms. (34 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 141 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 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2024-05-21 10:29:36] [INFO ] Invariant cache hit.
[2024-05-21 10:29:36] [INFO ] [Real]Absence check using 255 positive place invariants in 67 ms returned sat
[2024-05-21 10:29:36] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 9 ms returned sat
[2024-05-21 10:29:37] [INFO ] [Real]Absence check using state equation in 776 ms returned sat
[2024-05-21 10:29:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:29:37] [INFO ] [Nat]Absence check using 255 positive place invariants in 68 ms returned sat
[2024-05-21 10:29:37] [INFO ] [Nat]Absence check using 255 positive and 2 generalized place invariants in 11 ms returned sat
[2024-05-21 10:29:38] [INFO ] [Nat]Absence check using state equation in 777 ms returned sat
[2024-05-21 10:29:38] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-21 10:29:49] [INFO ] Added : 126 causal constraints over 26 iterations in 11315 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1223 ms.
Product exploration explored 100000 steps with 0 reset in 1432 ms.
Built C files in :
/tmp/ltsmin2354782457713039911
[2024-05-21 10:29:52] [INFO ] Computing symmetric may disable matrix : 257 transitions.
[2024-05-21 10:29:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:29:52] [INFO ] Computing symmetric may enable matrix : 257 transitions.
[2024-05-21 10:29:52] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:29:52] [INFO ] Computing Do-Not-Accords matrix : 257 transitions.
[2024-05-21 10:29:52] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:29:52] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2354782457713039911
Running compilation step : cd /tmp/ltsmin2354782457713039911;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 632 ms.
Running link step : cd /tmp/ltsmin2354782457713039911;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2354782457713039911;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8963903426638225736.hoa' '--buchi-type=spotba'
LTSmin run took 3412 ms.
FORMULA CircularTrains-PT-384-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-384-LTLCardinality-04 finished in 76993 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 646 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 646/646 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 114 place count 646 transition count 270
Reduce places removed 114 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 115 rules applied. Total rules applied 229 place count 532 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 230 place count 531 transition count 269
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 230 place count 531 transition count 262
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 244 place count 524 transition count 262
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 256 place count 518 transition count 256
Applied a total of 256 rules in 27 ms. Remains 518 /646 variables (removed 128) and now considering 256/384 (removed 128) transitions.
// Phase 1: matrix 256 rows 518 cols
[2024-05-21 10:29:56] [INFO ] Computed 263 invariants in 5 ms
[2024-05-21 10:29:56] [INFO ] Implicit Places using invariants in 290 ms returned [12, 33, 79, 154, 279, 427]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 291 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 512/646 places, 256/384 transitions.
Applied a total of 0 rules in 10 ms. Remains 512 /512 variables (removed 0) and now considering 256/256 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 328 ms. Remains : 512/646 places, 256/384 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-05
Product exploration explored 100000 steps with 1742 reset in 1773 ms.
Product exploration explored 100000 steps with 1792 reset in 1900 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 182 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 78 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 111 steps (0 resets) in 6 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 152 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 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 256 rows 512 cols
[2024-05-21 10:30:01] [INFO ] Computed 257 invariants in 6 ms
[2024-05-21 10:30:01] [INFO ] [Real]Absence check using 255 positive place invariants in 66 ms returned sat
[2024-05-21 10:30:01] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-21 10:30:02] [INFO ] [Real]Absence check using state equation in 813 ms returned sat
[2024-05-21 10:30:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:30:02] [INFO ] [Nat]Absence check using 255 positive place invariants in 66 ms returned sat
[2024-05-21 10:30:02] [INFO ] [Nat]Absence check using 255 positive and 2 generalized place invariants in 9 ms returned sat
[2024-05-21 10:30:08] [INFO ] [Nat]Absence check using state equation in 6197 ms returned sat
[2024-05-21 10:30:08] [INFO ] Computed and/alt/rep : 128/256/128 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-21 10:30:17] [INFO ] Added : 126 causal constraints over 26 iterations in 8568 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 2 out of 512 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 512/512 places, 256/256 transitions.
Applied a total of 0 rules in 16 ms. Remains 512 /512 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-05-21 10:30:17] [INFO ] Invariant cache hit.
[2024-05-21 10:30:17] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-21 10:30:17] [INFO ] Invariant cache hit.
[2024-05-21 10:30:17] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
[2024-05-21 10:30:17] [INFO ] Redundant transitions in 2 ms returned []
Running 128 sub problems to find dead transitions.
[2024-05-21 10:30:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 255/511 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/512 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 256/768 variables, 512/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/768 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/768 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 768/768 variables, and 769 constraints, problems are : Problem set: 0 solved, 128 unsolved in 7866 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 512/512 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 255/511 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/512 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 256/768 variables, 512/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/768 variables, 128/897 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/768 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 0/768 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 768/768 variables, and 897 constraints, problems are : Problem set: 0 solved, 128 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 512/512 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 37894ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 37896ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38562 ms. Remains : 512/512 places, 256/256 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 171 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 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 156 steps (0 resets) in 12 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 134 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 52 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
[2024-05-21 10:30:56] [INFO ] Invariant cache hit.
[2024-05-21 10:30:56] [INFO ] [Real]Absence check using 255 positive place invariants in 67 ms returned sat
[2024-05-21 10:30:56] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 12 ms returned sat
[2024-05-21 10:30:57] [INFO ] [Real]Absence check using state equation in 1016 ms returned sat
[2024-05-21 10:30:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:30:57] [INFO ] [Nat]Absence check using 255 positive place invariants in 84 ms returned sat
[2024-05-21 10:30:57] [INFO ] [Nat]Absence check using 255 positive and 2 generalized place invariants in 9 ms returned sat
[2024-05-21 10:30:58] [INFO ] [Nat]Absence check using state equation in 872 ms returned sat
[2024-05-21 10:30:58] [INFO ] Computed and/alt/rep : 128/256/128 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-21 10:31:12] [INFO ] Added : 95 causal constraints over 19 iterations in 13901 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1659 reset in 1728 ms.
Product exploration explored 100000 steps with 1739 reset in 1877 ms.
Built C files in :
/tmp/ltsmin4631784734828782391
[2024-05-21 10:31:16] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2024-05-21 10:31:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:31:16] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2024-05-21 10:31:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:31:16] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
[2024-05-21 10:31:16] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:31:16] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4631784734828782391
Running compilation step : cd /tmp/ltsmin4631784734828782391;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 634 ms.
Running link step : cd /tmp/ltsmin4631784734828782391;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4631784734828782391;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3870930396483792550.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 512 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 512/512 places, 256/256 transitions.
Applied a total of 0 rules in 16 ms. Remains 512 /512 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-05-21 10:31:31] [INFO ] Invariant cache hit.
[2024-05-21 10:31:31] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-21 10:31:31] [INFO ] Invariant cache hit.
[2024-05-21 10:31:32] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
[2024-05-21 10:31:32] [INFO ] Redundant transitions in 1 ms returned []
Running 128 sub problems to find dead transitions.
[2024-05-21 10:31:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 255/511 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/512 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 256/768 variables, 512/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/768 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/768 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 768/768 variables, and 769 constraints, problems are : Problem set: 0 solved, 128 unsolved in 7705 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 512/512 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 255/511 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/512 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 256/768 variables, 512/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/768 variables, 128/897 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/768 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 0/768 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 768/768 variables, and 897 constraints, problems are : Problem set: 0 solved, 128 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 512/512 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 37736ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 37738ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38436 ms. Remains : 512/512 places, 256/256 transitions.
Built C files in :
/tmp/ltsmin7014547842054829473
[2024-05-21 10:32:09] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2024-05-21 10:32:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:32:09] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2024-05-21 10:32:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:32:09] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
[2024-05-21 10:32:10] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:32:10] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7014547842054829473
Running compilation step : cd /tmp/ltsmin7014547842054829473;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 627 ms.
Running link step : cd /tmp/ltsmin7014547842054829473;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin7014547842054829473;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17926411643762066314.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 10:32:25] [INFO ] Flatten gal took : 19 ms
[2024-05-21 10:32:25] [INFO ] Flatten gal took : 19 ms
[2024-05-21 10:32:25] [INFO ] Time to serialize gal into /tmp/LTL11514026459688893322.gal : 5 ms
[2024-05-21 10:32:25] [INFO ] Time to serialize properties into /tmp/LTL7968068118941929955.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11514026459688893322.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5088511809900262155.hoa' '-atoms' '/tmp/LTL7968068118941929955.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7968068118941929955.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5088511809900262155.hoa
Detected timeout of ITS tools.
[2024-05-21 10:32:40] [INFO ] Flatten gal took : 16 ms
[2024-05-21 10:32:40] [INFO ] Flatten gal took : 16 ms
[2024-05-21 10:32:40] [INFO ] Time to serialize gal into /tmp/LTL5986977722117000051.gal : 8 ms
[2024-05-21 10:32:40] [INFO ] Time to serialize properties into /tmp/LTL6890765831946096792.ltl : 2 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5986977722117000051.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6890765831946096792.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(F58<=F249)"))))
Formula 0 simplified : FG!"(F58<=F249)"
Detected timeout of ITS tools.
[2024-05-21 10:32:55] [INFO ] Flatten gal took : 17 ms
[2024-05-21 10:32:55] [INFO ] Applying decomposition
[2024-05-21 10:32:55] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13888716409371192858.txt' '-o' '/tmp/graph13888716409371192858.bin' '-w' '/tmp/graph13888716409371192858.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13888716409371192858.bin' '-l' '-1' '-v' '-w' '/tmp/graph13888716409371192858.weights' '-q' '0' '-e' '0.001'
[2024-05-21 10:32:55] [INFO ] Decomposing Gal with order
[2024-05-21 10:32:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 10:32:55] [INFO ] Flatten gal took : 52 ms
[2024-05-21 10:32:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-21 10:32:55] [INFO ] Time to serialize gal into /tmp/LTL16675427033917205819.gal : 7 ms
[2024-05-21 10:32:55] [INFO ] Time to serialize properties into /tmp/LTL3550068972196246095.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16675427033917205819.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3550068972196246095.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu80.F58<=gu80.F249)"))))
Formula 0 simplified : FG!"(gu80.F58<=gu80.F249)"
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-384-LTLCardinality-05 finished in 194333 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 646 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 646/646 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 114 place count 646 transition count 270
Reduce places removed 114 places and 0 transitions.
Iterating post reduction 1 with 114 rules applied. Total rules applied 228 place count 532 transition count 270
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 228 place count 532 transition count 262
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 244 place count 524 transition count 262
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 256 place count 518 transition count 256
Applied a total of 256 rules in 30 ms. Remains 518 /646 variables (removed 128) and now considering 256/384 (removed 128) transitions.
// Phase 1: matrix 256 rows 518 cols
[2024-05-21 10:33:10] [INFO ] Computed 263 invariants in 6 ms
[2024-05-21 10:33:11] [INFO ] Implicit Places using invariants in 314 ms returned [12, 33, 79, 154, 279, 427]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 314 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 512/646 places, 256/384 transitions.
Applied a total of 0 rules in 10 ms. Remains 512 /512 variables (removed 0) and now considering 256/256 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 354 ms. Remains : 512/646 places, 256/384 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-06
Product exploration explored 100000 steps with 442 reset in 1552 ms.
Product exploration explored 100000 steps with 410 reset in 1668 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 188 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 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 763 steps (0 resets) in 34 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 178 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 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 512 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 512/512 places, 256/256 transitions.
Applied a total of 0 rules in 14 ms. Remains 512 /512 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 512 cols
[2024-05-21 10:33:15] [INFO ] Computed 257 invariants in 4 ms
[2024-05-21 10:33:15] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-05-21 10:33:15] [INFO ] Invariant cache hit.
[2024-05-21 10:33:15] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
[2024-05-21 10:33:15] [INFO ] Redundant transitions in 1 ms returned []
Running 128 sub problems to find dead transitions.
[2024-05-21 10:33:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 255/511 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/512 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 256/768 variables, 512/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/768 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/768 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 768/768 variables, and 769 constraints, problems are : Problem set: 0 solved, 128 unsolved in 7895 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 512/512 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 255/511 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/512 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 256/768 variables, 512/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/768 variables, 128/897 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/768 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 0/768 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 768/768 variables, and 897 constraints, problems are : Problem set: 0 solved, 128 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 512/512 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 37923ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 37925ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38565 ms. Remains : 512/512 places, 256/256 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 153 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 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 569 steps (0 resets) in 21 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 166 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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 442 reset in 1566 ms.
Product exploration explored 100000 steps with 439 reset in 1676 ms.
Built C files in :
/tmp/ltsmin12365080577802927813
[2024-05-21 10:33:57] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2024-05-21 10:33:57] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:33:57] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2024-05-21 10:33:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:33:57] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
[2024-05-21 10:33:57] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:33:57] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12365080577802927813
Running compilation step : cd /tmp/ltsmin12365080577802927813;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 740 ms.
Running link step : cd /tmp/ltsmin12365080577802927813;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12365080577802927813;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8156902428558001748.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 512 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 512/512 places, 256/256 transitions.
Applied a total of 0 rules in 15 ms. Remains 512 /512 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-05-21 10:34:12] [INFO ] Invariant cache hit.
[2024-05-21 10:34:13] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-21 10:34:13] [INFO ] Invariant cache hit.
[2024-05-21 10:34:13] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
[2024-05-21 10:34:13] [INFO ] Redundant transitions in 1 ms returned []
Running 128 sub problems to find dead transitions.
[2024-05-21 10:34:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 255/511 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/512 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 256/768 variables, 512/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/768 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/768 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 768/768 variables, and 769 constraints, problems are : Problem set: 0 solved, 128 unsolved in 8009 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 512/512 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 255/511 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/512 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 256/768 variables, 512/769 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/768 variables, 128/897 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/768 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 0/768 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 768/768 variables, and 897 constraints, problems are : Problem set: 0 solved, 128 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 512/512 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 38045ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 38047ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38689 ms. Remains : 512/512 places, 256/256 transitions.
Built C files in :
/tmp/ltsmin8131724735924161659
[2024-05-21 10:34:51] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2024-05-21 10:34:51] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:34:51] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2024-05-21 10:34:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:34:51] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
[2024-05-21 10:34:51] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:34:51] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8131724735924161659
Running compilation step : cd /tmp/ltsmin8131724735924161659;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 652 ms.
Running link step : cd /tmp/ltsmin8131724735924161659;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8131724735924161659;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12895290409226666589.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 10:35:06] [INFO ] Flatten gal took : 15 ms
[2024-05-21 10:35:06] [INFO ] Flatten gal took : 12 ms
[2024-05-21 10:35:06] [INFO ] Time to serialize gal into /tmp/LTL12789539689847008929.gal : 2 ms
[2024-05-21 10:35:06] [INFO ] Time to serialize properties into /tmp/LTL3221758598673151724.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12789539689847008929.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2698824261021595587.hoa' '-atoms' '/tmp/LTL3221758598673151724.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3221758598673151724.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2698824261021595587.hoa
Detected timeout of ITS tools.
[2024-05-21 10:35:21] [INFO ] Flatten gal took : 14 ms
[2024-05-21 10:35:21] [INFO ] Flatten gal took : 12 ms
[2024-05-21 10:35:21] [INFO ] Time to serialize gal into /tmp/LTL7422391276948140465.gal : 2 ms
[2024-05-21 10:35:21] [INFO ] Time to serialize properties into /tmp/LTL2541515837274499333.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7422391276948140465.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2541515837274499333.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(Section_380<=F270)"))))
Formula 0 simplified : FG!"(Section_380<=F270)"
Detected timeout of ITS tools.
[2024-05-21 10:35:36] [INFO ] Flatten gal took : 17 ms
[2024-05-21 10:35:36] [INFO ] Applying decomposition
[2024-05-21 10:35:36] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14983658348237213293.txt' '-o' '/tmp/graph14983658348237213293.bin' '-w' '/tmp/graph14983658348237213293.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14983658348237213293.bin' '-l' '-1' '-v' '-w' '/tmp/graph14983658348237213293.weights' '-q' '0' '-e' '0.001'
[2024-05-21 10:35:36] [INFO ] Decomposing Gal with order
[2024-05-21 10:35:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 10:35:36] [INFO ] Flatten gal took : 18 ms
[2024-05-21 10:35:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 10:35:36] [INFO ] Time to serialize gal into /tmp/LTL16406239962703446519.gal : 4 ms
[2024-05-21 10:35:36] [INFO ] Time to serialize properties into /tmp/LTL2114003703156947515.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16406239962703446519.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2114003703156947515.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu53.Section_380<=gu53.F270)"))))
Formula 0 simplified : FG!"(gu53.Section_380<=gu53.F270)"
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-384-LTLCardinality-06 finished in 161125 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U G(p1))&&X(G(p2)))))'
Support contains 5 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 384/384 transitions.
Applied a total of 0 rules in 16 ms. Remains 646 /646 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 646 cols
[2024-05-21 10:35:52] [INFO ] Computed 263 invariants in 3 ms
[2024-05-21 10:35:52] [INFO ] Implicit Places using invariants in 315 ms returned [14, 36, 90, 188, 341, 538]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 316 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 640/646 places, 384/384 transitions.
Applied a total of 0 rules in 9 ms. Remains 640 /640 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 342 ms. Remains : 640/646 places, 384/384 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 185 steps with 0 reset in 9 ms.
FORMULA CircularTrains-PT-384-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLCardinality-08 finished in 592 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 5 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 384/384 transitions.
Applied a total of 0 rules in 12 ms. Remains 646 /646 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2024-05-21 10:35:52] [INFO ] Invariant cache hit.
[2024-05-21 10:35:52] [INFO ] Implicit Places using invariants in 297 ms returned [14, 36, 90, 188, 341, 538]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 298 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 640/646 places, 384/384 transitions.
Applied a total of 0 rules in 9 ms. Remains 640 /640 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 319 ms. Remains : 640/646 places, 384/384 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-09
Product exploration explored 100000 steps with 1727 reset in 1861 ms.
Product exploration explored 100000 steps with 1768 reset in 1963 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 1 factoid took 150 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 270 steps (0 resets) in 20 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 172 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 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 384 rows 640 cols
[2024-05-21 10:35:57] [INFO ] Computed 257 invariants in 11 ms
[2024-05-21 10:35:57] [INFO ] [Real]Absence check using 255 positive place invariants in 78 ms returned sat
[2024-05-21 10:35:57] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 24 ms returned sat
[2024-05-21 10:35:58] [INFO ] [Real]Absence check using state equation in 1114 ms returned sat
[2024-05-21 10:35:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:35:59] [INFO ] [Nat]Absence check using 255 positive place invariants in 77 ms returned sat
[2024-05-21 10:35:59] [INFO ] [Nat]Absence check using 255 positive and 2 generalized place invariants in 34 ms returned sat
[2024-05-21 10:36:05] [INFO ] [Nat]Absence check using state equation in 6274 ms returned sat
[2024-05-21 10:36:05] [INFO ] Computed and/alt/rep : 256/384/256 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-21 10:36:13] [INFO ] Added : 70 causal constraints over 14 iterations in 8379 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 5 out of 640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 640/640 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 123 rules applied. Total rules applied 123 place count 640 transition count 261
Reduce places removed 123 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 125 rules applied. Total rules applied 248 place count 517 transition count 259
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 250 place count 515 transition count 259
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 250 place count 515 transition count 257
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 254 place count 513 transition count 257
Applied a total of 254 rules in 21 ms. Remains 513 /640 variables (removed 127) and now considering 257/384 (removed 127) transitions.
// Phase 1: matrix 257 rows 513 cols
[2024-05-21 10:36:13] [INFO ] Computed 257 invariants in 2 ms
[2024-05-21 10:36:14] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-21 10:36:14] [INFO ] Invariant cache hit.
[2024-05-21 10:36:14] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
[2024-05-21 10:36:14] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-21 10:36:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/512 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/770 variables, 513/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/770 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 770/770 variables, and 770 constraints, problems are : Problem set: 0 solved, 129 unsolved in 7845 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/512 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/770 variables, 513/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 129/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/770 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/770 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 770/770 variables, and 899 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 37876ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 37877ms
Starting structural reductions in SI_LTL mode, iteration 1 : 513/640 places, 257/384 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38526 ms. Remains : 513/640 places, 257/384 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 127 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 95 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 151 steps (0 resets) in 12 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 170 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 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
[2024-05-21 10:36:53] [INFO ] Invariant cache hit.
[2024-05-21 10:36:53] [INFO ] [Real]Absence check using 255 positive place invariants in 73 ms returned sat
[2024-05-21 10:36:53] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 16 ms returned sat
[2024-05-21 10:36:54] [INFO ] [Real]Absence check using state equation in 1478 ms returned sat
[2024-05-21 10:36:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:36:55] [INFO ] [Nat]Absence check using 255 positive place invariants in 71 ms returned sat
[2024-05-21 10:36:55] [INFO ] [Nat]Absence check using 255 positive and 2 generalized place invariants in 9 ms returned sat
[2024-05-21 10:36:56] [INFO ] [Nat]Absence check using state equation in 1798 ms returned sat
[2024-05-21 10:36:56] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-21 10:37:02] [INFO ] Added : 127 causal constraints over 26 iterations in 5693 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2515 reset in 1846 ms.
Product exploration explored 100000 steps with 2568 reset in 1990 ms.
Built C files in :
/tmp/ltsmin11339011609270059792
[2024-05-21 10:37:06] [INFO ] Computing symmetric may disable matrix : 257 transitions.
[2024-05-21 10:37:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:37:06] [INFO ] Computing symmetric may enable matrix : 257 transitions.
[2024-05-21 10:37:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:37:06] [INFO ] Computing Do-Not-Accords matrix : 257 transitions.
[2024-05-21 10:37:06] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:37:06] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11339011609270059792
Running compilation step : cd /tmp/ltsmin11339011609270059792;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 616 ms.
Running link step : cd /tmp/ltsmin11339011609270059792;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11339011609270059792;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16843319110124813721.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 257/257 transitions.
Applied a total of 0 rules in 19 ms. Remains 513 /513 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-21 10:37:21] [INFO ] Invariant cache hit.
[2024-05-21 10:37:21] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-21 10:37:21] [INFO ] Invariant cache hit.
[2024-05-21 10:37:22] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
[2024-05-21 10:37:22] [INFO ] Redundant transitions in 0 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-21 10:37:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/512 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/770 variables, 513/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/770 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 770/770 variables, and 770 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8181 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/512 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/770 variables, 513/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 129/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/770 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/770 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 770/770 variables, and 899 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 38210ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38211ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38917 ms. Remains : 513/513 places, 257/257 transitions.
Built C files in :
/tmp/ltsmin8625741370089924221
[2024-05-21 10:38:00] [INFO ] Computing symmetric may disable matrix : 257 transitions.
[2024-05-21 10:38:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:38:00] [INFO ] Computing symmetric may enable matrix : 257 transitions.
[2024-05-21 10:38:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:38:00] [INFO ] Computing Do-Not-Accords matrix : 257 transitions.
[2024-05-21 10:38:00] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:38:00] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8625741370089924221
Running compilation step : cd /tmp/ltsmin8625741370089924221;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 662 ms.
Running link step : cd /tmp/ltsmin8625741370089924221;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8625741370089924221;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9263636824387477036.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 10:38:15] [INFO ] Flatten gal took : 14 ms
[2024-05-21 10:38:15] [INFO ] Flatten gal took : 9 ms
[2024-05-21 10:38:15] [INFO ] Time to serialize gal into /tmp/LTL17658855694973988783.gal : 2 ms
[2024-05-21 10:38:15] [INFO ] Time to serialize properties into /tmp/LTL1788686974028732885.prop : 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17658855694973988783.gal' '-t' 'CGAL' '-hoa' '/tmp/aut272010645313686765.hoa' '-atoms' '/tmp/LTL1788686974028732885.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1788686974028732885.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut272010645313686765.hoa
Detected timeout of ITS tools.
[2024-05-21 10:38:30] [INFO ] Flatten gal took : 17 ms
[2024-05-21 10:38:30] [INFO ] Flatten gal took : 9 ms
[2024-05-21 10:38:30] [INFO ] Time to serialize gal into /tmp/LTL6108829634182626294.gal : 2 ms
[2024-05-21 10:38:30] [INFO ] Time to serialize properties into /tmp/LTL16022176694716297564.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6108829634182626294.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16022176694716297564.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F("((Section_184>=1)||((F138<=F223)&&(Section_360<=F111)))"))))
Formula 0 simplified : XG!"((Section_184>=1)||((F138<=F223)&&(Section_360<=F111)))"
Detected timeout of ITS tools.
[2024-05-21 10:38:45] [INFO ] Flatten gal took : 12 ms
[2024-05-21 10:38:45] [INFO ] Applying decomposition
[2024-05-21 10:38:45] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2715346032701960201.txt' '-o' '/tmp/graph2715346032701960201.bin' '-w' '/tmp/graph2715346032701960201.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2715346032701960201.bin' '-l' '-1' '-v' '-w' '/tmp/graph2715346032701960201.weights' '-q' '0' '-e' '0.001'
[2024-05-21 10:38:45] [INFO ] Decomposing Gal with order
[2024-05-21 10:38:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 10:38:45] [INFO ] Flatten gal took : 15 ms
[2024-05-21 10:38:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 10:38:45] [INFO ] Time to serialize gal into /tmp/LTL13508098573064930550.gal : 3 ms
[2024-05-21 10:38:45] [INFO ] Time to serialize properties into /tmp/LTL8649106907170008042.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13508098573064930550.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8649106907170008042.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F("((gi2.gu189.Section_184>=1)||((gu191.F138<=gu191.F223)&&(gu156.Section_360<=gu156.F111)))"))))
Formula 0 simplified : XG!"((gi2.gu189.Section_184>=1)||((gu191.F138<=gu191.F223)&&(gu156.Section_360<=gu156.F111)))"
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-384-LTLCardinality-09 finished in 188433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 384/384 transitions.
Applied a total of 0 rules in 15 ms. Remains 646 /646 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 646 cols
[2024-05-21 10:39:01] [INFO ] Computed 263 invariants in 5 ms
[2024-05-21 10:39:01] [INFO ] Implicit Places using invariants in 330 ms returned [14, 36, 90, 188, 538]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 332 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 641/646 places, 384/384 transitions.
Applied a total of 0 rules in 9 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 356 ms. Remains : 641/646 places, 384/384 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-384-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLCardinality-10 finished in 503 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(F(p1))))))'
Support contains 2 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 384/384 transitions.
Applied a total of 0 rules in 14 ms. Remains 646 /646 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2024-05-21 10:39:01] [INFO ] Invariant cache hit.
[2024-05-21 10:39:01] [INFO ] Implicit Places using invariants in 321 ms returned [14, 36, 90, 188, 341, 538]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 322 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 640/646 places, 384/384 transitions.
Applied a total of 0 rules in 9 ms. Remains 640 /640 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 345 ms. Remains : 640/646 places, 384/384 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-11
Product exploration explored 100000 steps with 24718 reset in 1776 ms.
Product exploration explored 100000 steps with 24533 reset in 1917 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 692 steps (0 resets) in 25 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X p0)]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 640 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 640/640 places, 384/384 transitions.
Applied a total of 0 rules in 15 ms. Remains 640 /640 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 640 cols
[2024-05-21 10:39:06] [INFO ] Computed 257 invariants in 5 ms
[2024-05-21 10:39:06] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-21 10:39:06] [INFO ] Invariant cache hit.
[2024-05-21 10:39:07] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-05-21 10:39:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 255/639 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/639 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/639 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/640 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 384/1024 variables, 640/897 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1024 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (OVERLAPS) 0/1024 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 897 constraints, problems are : Problem set: 0 solved, 256 unsolved in 20391 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 640/640 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 255/639 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/639 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/639 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/640 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 384/1024 variables, 640/897 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1024 variables, 256/1153 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1024 variables, 0/1153 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 1153 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 640/640 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 50432ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 50435ms
Finished structural reductions in LTL mode , in 1 iterations and 51241 ms. Remains : 640/640 places, 384/384 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 64 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 574 steps (0 resets) in 22 ms. (24 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 84 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 24842 reset in 1766 ms.
Product exploration explored 100000 steps with 24804 reset in 1919 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 640/640 places, 384/384 transitions.
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 640 transition count 384
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 127 place count 640 transition count 384
Deduced a syphon composed of 128 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 640 transition count 384
Deduced a syphon composed of 128 places in 0 ms
Applied a total of 128 rules in 59 ms. Remains 640 /640 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2024-05-21 10:40:02] [INFO ] Redundant transitions in 2 ms returned []
Running 256 sub problems to find dead transitions.
// Phase 1: matrix 384 rows 640 cols
[2024-05-21 10:40:02] [INFO ] Computed 257 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 255/639 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/639 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-21 10:40:05] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 12 ms to minimize.
[2024-05-21 10:40:05] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
[2024-05-21 10:40:05] [INFO ] Deduced a trap composed of 2 places in 58 ms of which 1 ms to minimize.
[2024-05-21 10:40:05] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 2 ms to minimize.
[2024-05-21 10:40:05] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 2 ms to minimize.
[2024-05-21 10:40:05] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 1 ms to minimize.
[2024-05-21 10:40:06] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 5 ms to minimize.
[2024-05-21 10:40:06] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-21 10:40:06] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 2 ms to minimize.
[2024-05-21 10:40:06] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-21 10:40:06] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-21 10:40:06] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-21 10:40:06] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-21 10:40:06] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-21 10:40:06] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-21 10:40:06] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-21 10:40:06] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-21 10:40:06] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-21 10:40:06] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-21 10:40:06] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD250 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/639 variables, 20/276 constraints. Problems are: Problem set: 20 solved, 236 unsolved
[2024-05-21 10:40:08] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 2 ms to minimize.
[2024-05-21 10:40:08] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-21 10:40:09] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 0 ms to minimize.
[2024-05-21 10:40:09] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-05-21 10:40:09] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-21 10:40:09] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-05-21 10:40:09] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2024-05-21 10:40:09] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-21 10:40:09] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-21 10:40:09] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-05-21 10:40:09] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 0 ms to minimize.
[2024-05-21 10:40:09] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-21 10:40:09] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 0 ms to minimize.
[2024-05-21 10:40:09] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 4 ms to minimize.
[2024-05-21 10:40:09] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-21 10:40:09] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-21 10:40:09] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-21 10:40:09] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2024-05-21 10:40:09] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-21 10:40:09] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD244 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/639 variables, 20/296 constraints. Problems are: Problem set: 40 solved, 216 unsolved
[2024-05-21 10:40:09] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-21 10:40:09] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-21 10:40:09] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-21 10:40:09] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-21 10:40:09] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-21 10:40:10] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-21 10:40:10] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD126 is UNSAT
[2024-05-21 10:40:11] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-21 10:40:11] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-21 10:40:11] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-21 10:40:11] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 2 ms to minimize.
[2024-05-21 10:40:11] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-21 10:40:11] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-21 10:40:11] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-21 10:40:11] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 6 ms to minimize.
[2024-05-21 10:40:11] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-21 10:40:11] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-05-21 10:40:11] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-21 10:40:11] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2024-05-21 10:40:11] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD217 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/639 variables, 20/316 constraints. Problems are: Problem set: 59 solved, 197 unsolved
[2024-05-21 10:40:12] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 0 ms to minimize.
[2024-05-21 10:40:12] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-21 10:40:12] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 0 ms to minimize.
[2024-05-21 10:40:12] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-05-21 10:40:12] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
[2024-05-21 10:40:12] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2024-05-21 10:40:12] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-21 10:40:12] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-21 10:40:12] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-21 10:40:12] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-21 10:40:12] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-05-21 10:40:12] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-21 10:40:12] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-05-21 10:40:12] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-21 10:40:12] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-21 10:40:12] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-21 10:40:13] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-05-21 10:40:13] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
[2024-05-21 10:40:13] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-21 10:40:13] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 0 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD212 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/639 variables, 20/336 constraints. Problems are: Problem set: 79 solved, 177 unsolved
[2024-05-21 10:40:15] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-21 10:40:15] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-21 10:40:15] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-21 10:40:15] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-05-21 10:40:16] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-21 10:40:16] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-21 10:40:16] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-05-21 10:40:16] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 0 ms to minimize.
[2024-05-21 10:40:16] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-21 10:40:16] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 0 ms to minimize.
[2024-05-21 10:40:16] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-05-21 10:40:17] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-21 10:40:17] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-21 10:40:17] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-21 10:40:17] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 0 ms to minimize.
[2024-05-21 10:40:17] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2024-05-21 10:40:17] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-05-21 10:40:17] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-21 10:40:17] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-21 10:40:17] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD189 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/639 variables, 20/356 constraints. Problems are: Problem set: 98 solved, 158 unsolved
[2024-05-21 10:40:17] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2024-05-21 10:40:17] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-21 10:40:17] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-21 10:40:18] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-05-21 10:40:18] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-05-21 10:40:18] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD70 is UNSAT
[2024-05-21 10:40:18] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-21 10:40:18] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD103 is UNSAT
[2024-05-21 10:40:18] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD108 is UNSAT
[2024-05-21 10:40:18] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD115 is UNSAT
[2024-05-21 10:40:18] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD120 is UNSAT
[2024-05-21 10:40:18] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD123 is UNSAT
Problem TDEAD199 is UNSAT
[2024-05-21 10:40:19] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD224 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 13/369 constraints. Problems are: Problem set: 111 solved, 145 unsolved
[2024-05-21 10:40:20] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD129 is UNSAT
[2024-05-21 10:40:20] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD139 is UNSAT
[2024-05-21 10:40:20] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2024-05-21 10:40:20] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2024-05-21 10:40:20] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 1 ms to minimize.
[2024-05-21 10:40:20] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-21 10:40:20] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-21 10:40:20] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-21 10:40:20] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD222 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 9/378 constraints. Problems are: Problem set: 120 solved, 136 unsolved
[2024-05-21 10:40:23] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD142 is UNSAT
[2024-05-21 10:40:23] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-21 10:40:23] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-21 10:40:23] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD192 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 4/382 constraints. Problems are: Problem set: 124 solved, 132 unsolved
[2024-05-21 10:40:24] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/639 variables, 1/383 constraints. Problems are: Problem set: 124 solved, 132 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 0/383 constraints. Problems are: Problem set: 124 solved, 132 unsolved
At refinement iteration 13 (OVERLAPS) 1/640 variables, 1/384 constraints. Problems are: Problem set: 124 solved, 132 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/640 variables, 0/384 constraints. Problems are: Problem set: 124 solved, 132 unsolved
Problem TDEAD96 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD195 is UNSAT
At refinement iteration 15 (OVERLAPS) 384/1024 variables, 640/1024 constraints. Problems are: Problem set: 128 solved, 128 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1024 variables, 0/1024 constraints. Problems are: Problem set: 128 solved, 128 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 1024 constraints, problems are : Problem set: 128 solved, 128 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 640/640 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 127/127 constraints]
Escalating to Integer solving :Problem set: 128 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 128 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 383/639 variables, 255/255 constraints. Problems are: Problem set: 128 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/639 variables, 1/256 constraints. Problems are: Problem set: 128 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/639 variables, 127/383 constraints. Problems are: Problem set: 128 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/639 variables, 0/383 constraints. Problems are: Problem set: 128 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 1/640 variables, 1/384 constraints. Problems are: Problem set: 128 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/640 variables, 0/384 constraints. Problems are: Problem set: 128 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 384/1024 variables, 640/1024 constraints. Problems are: Problem set: 128 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1024 variables, 128/1152 constraints. Problems are: Problem set: 128 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1024 variables, 0/1152 constraints. Problems are: Problem set: 128 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 0/1024 variables, 0/1152 constraints. Problems are: Problem set: 128 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 1152 constraints, problems are : Problem set: 128 solved, 128 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 640/640 constraints, PredecessorRefiner: 128/256 constraints, Known Traps: 127/127 constraints]
After SMT, in 60063ms problems are : Problem set: 128 solved, 128 unsolved
Search for dead transitions found 128 dead transitions in 60066ms
Found 128 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 128 transitions
Dead transitions reduction (with SMT) removed 128 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 640/640 places, 256/384 transitions.
Graph (complete) has 1024 edges and 640 vertex of which 512 are kept as prefixes of interest. Removing 128 places using SCC suffix rule.2 ms
Discarding 128 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 512 /640 variables (removed 128) and now considering 256/256 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 512/640 places, 256/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60170 ms. Remains : 512/640 places, 256/384 transitions.
Built C files in :
/tmp/ltsmin4101908350395641420
[2024-05-21 10:41:02] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4101908350395641420
Running compilation step : cd /tmp/ltsmin4101908350395641420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 755 ms.
Running link step : cd /tmp/ltsmin4101908350395641420;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4101908350395641420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14674257672493701150.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 640/640 places, 384/384 transitions.
Applied a total of 0 rules in 18 ms. Remains 640 /640 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 640 cols
[2024-05-21 10:41:17] [INFO ] Computed 257 invariants in 4 ms
[2024-05-21 10:41:18] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-05-21 10:41:18] [INFO ] Invariant cache hit.
[2024-05-21 10:41:18] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-05-21 10:41:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 255/639 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/639 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/639 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/640 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 384/1024 variables, 640/897 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1024 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (OVERLAPS) 0/1024 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 897 constraints, problems are : Problem set: 0 solved, 256 unsolved in 20313 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 640/640 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 255/639 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/639 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/639 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/640 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 384/1024 variables, 640/897 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1024 variables, 256/1153 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1024 variables, 0/1153 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 1153 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 640/640 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 50366ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 50369ms
Finished structural reductions in LTL mode , in 1 iterations and 51138 ms. Remains : 640/640 places, 384/384 transitions.
Built C files in :
/tmp/ltsmin3849015912719504597
[2024-05-21 10:42:08] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3849015912719504597
Running compilation step : cd /tmp/ltsmin3849015912719504597;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 746 ms.
Running link step : cd /tmp/ltsmin3849015912719504597;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin3849015912719504597;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased672551619261835825.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 10:42:24] [INFO ] Flatten gal took : 13 ms
[2024-05-21 10:42:24] [INFO ] Flatten gal took : 11 ms
[2024-05-21 10:42:24] [INFO ] Time to serialize gal into /tmp/LTL237111176017289122.gal : 3 ms
[2024-05-21 10:42:24] [INFO ] Time to serialize properties into /tmp/LTL5401721666585832921.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL237111176017289122.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6476685030040872782.hoa' '-atoms' '/tmp/LTL5401721666585832921.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL5401721666585832921.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6476685030040872782.hoa
Detected timeout of ITS tools.
[2024-05-21 10:42:39] [INFO ] Flatten gal took : 15 ms
[2024-05-21 10:42:39] [INFO ] Flatten gal took : 11 ms
[2024-05-21 10:42:39] [INFO ] Time to serialize gal into /tmp/LTL7279245296572408096.gal : 2 ms
[2024-05-21 10:42:39] [INFO ] Time to serialize properties into /tmp/LTL3479447734798600795.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7279245296572408096.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3479447734798600795.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(("(F150<1)")&&(X(X(F("(Section_65<1)")))))))
Formula 0 simplified : X(!"(F150<1)" | XXG!"(Section_65<1)")
Detected timeout of ITS tools.
[2024-05-21 10:42:54] [INFO ] Flatten gal took : 11 ms
[2024-05-21 10:42:54] [INFO ] Applying decomposition
[2024-05-21 10:42:54] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14983113387434820752.txt' '-o' '/tmp/graph14983113387434820752.bin' '-w' '/tmp/graph14983113387434820752.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14983113387434820752.bin' '-l' '-1' '-v' '-w' '/tmp/graph14983113387434820752.weights' '-q' '0' '-e' '0.001'
[2024-05-21 10:42:54] [INFO ] Decomposing Gal with order
[2024-05-21 10:42:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 10:42:54] [INFO ] Flatten gal took : 14 ms
[2024-05-21 10:42:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 10:42:54] [INFO ] Time to serialize gal into /tmp/LTL14608157895041548859.gal : 25 ms
[2024-05-21 10:42:54] [INFO ] Time to serialize properties into /tmp/LTL2704851142666114181.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14608157895041548859.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2704851142666114181.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(("(i2.i1.u79.F150<1)")&&(X(X(F("(i3.i0.u12.Section_65<1)")))))))
Formula 0 simplified : X(!"(i2.i1.u79.F150<1)" | XXG!"(i3.i0.u12.Section_65<1)")
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-384-LTLCardinality-11 finished in 247866 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||G(p1)))'
Support contains 4 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 384/384 transitions.
Applied a total of 0 rules in 20 ms. Remains 646 /646 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 646 cols
[2024-05-21 10:43:09] [INFO ] Computed 263 invariants in 9 ms
[2024-05-21 10:43:09] [INFO ] Implicit Places using invariants in 313 ms returned [14, 36, 90, 188, 341, 538]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 314 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 640/646 places, 384/384 transitions.
Applied a total of 0 rules in 8 ms. Remains 640 /640 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 343 ms. Remains : 640/646 places, 384/384 transitions.
Stuttering acceptance computed with spot in 255 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 401 steps with 0 reset in 10 ms.
FORMULA CircularTrains-PT-384-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLCardinality-12 finished in 643 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 646 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 646/646 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 115 place count 646 transition count 269
Reduce places removed 115 places and 0 transitions.
Iterating post reduction 1 with 115 rules applied. Total rules applied 230 place count 531 transition count 269
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 230 place count 531 transition count 263
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 242 place count 525 transition count 263
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 254 place count 519 transition count 257
Applied a total of 254 rules in 24 ms. Remains 519 /646 variables (removed 127) and now considering 257/384 (removed 127) transitions.
// Phase 1: matrix 257 rows 519 cols
[2024-05-21 10:43:10] [INFO ] Computed 263 invariants in 7 ms
[2024-05-21 10:43:10] [INFO ] Implicit Places using invariants in 296 ms returned [12, 33, 79, 154, 279, 428]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 297 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 513/646 places, 257/384 transitions.
Applied a total of 0 rules in 12 ms. Remains 513 /513 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 334 ms. Remains : 513/646 places, 257/384 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-13
Product exploration explored 100000 steps with 1079 reset in 1723 ms.
Product exploration explored 100000 steps with 1028 reset in 1883 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 192 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 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 259 steps (0 resets) in 16 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 197 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 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 257 rows 513 cols
[2024-05-21 10:43:14] [INFO ] Computed 257 invariants in 7 ms
[2024-05-21 10:43:15] [INFO ] [Real]Absence check using 255 positive place invariants in 68 ms returned sat
[2024-05-21 10:43:15] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-21 10:43:15] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2024-05-21 10:43:15] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-21 10:43:29] [INFO ] Added : 95 causal constraints over 19 iterations in 14584 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 1 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 257/257 transitions.
Applied a total of 0 rules in 14 ms. Remains 513 /513 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-21 10:43:29] [INFO ] Invariant cache hit.
[2024-05-21 10:43:30] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-21 10:43:30] [INFO ] Invariant cache hit.
[2024-05-21 10:43:30] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 709 ms to find 0 implicit places.
[2024-05-21 10:43:30] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-21 10:43:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/512 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/770 variables, 513/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/770 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 770/770 variables, and 770 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8033 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/512 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/770 variables, 513/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 129/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/770 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/770 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 770/770 variables, and 899 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30006 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 38052ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38054ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38781 ms. Remains : 513/513 places, 257/257 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 141 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 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 176 steps (0 resets) in 10 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 189 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 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
[2024-05-21 10:44:09] [INFO ] Invariant cache hit.
[2024-05-21 10:44:09] [INFO ] [Real]Absence check using 255 positive place invariants in 64 ms returned sat
[2024-05-21 10:44:09] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 25 ms returned sat
[2024-05-21 10:44:10] [INFO ] [Real]Absence check using state equation in 845 ms returned sat
[2024-05-21 10:44:10] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-21 10:44:24] [INFO ] Added : 126 causal constraints over 26 iterations in 13901 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1020 reset in 1677 ms.
Product exploration explored 100000 steps with 1007 reset in 1810 ms.
Built C files in :
/tmp/ltsmin5804630181597117177
[2024-05-21 10:44:27] [INFO ] Computing symmetric may disable matrix : 257 transitions.
[2024-05-21 10:44:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:44:27] [INFO ] Computing symmetric may enable matrix : 257 transitions.
[2024-05-21 10:44:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:44:27] [INFO ] Computing Do-Not-Accords matrix : 257 transitions.
[2024-05-21 10:44:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:44:27] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5804630181597117177
Running compilation step : cd /tmp/ltsmin5804630181597117177;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 637 ms.
Running link step : cd /tmp/ltsmin5804630181597117177;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5804630181597117177;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15826313412223278132.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 257/257 transitions.
Applied a total of 0 rules in 14 ms. Remains 513 /513 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-21 10:44:42] [INFO ] Invariant cache hit.
[2024-05-21 10:44:43] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-21 10:44:43] [INFO ] Invariant cache hit.
[2024-05-21 10:44:43] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
[2024-05-21 10:44:43] [INFO ] Redundant transitions in 0 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-21 10:44:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/512 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/770 variables, 513/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/770 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 770/770 variables, and 770 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8133 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/512 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/770 variables, 513/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 129/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/770 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/770 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 770/770 variables, and 899 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 38162ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38164ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38870 ms. Remains : 513/513 places, 257/257 transitions.
Built C files in :
/tmp/ltsmin9332681382390516325
[2024-05-21 10:45:21] [INFO ] Computing symmetric may disable matrix : 257 transitions.
[2024-05-21 10:45:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:45:21] [INFO ] Computing symmetric may enable matrix : 257 transitions.
[2024-05-21 10:45:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:45:21] [INFO ] Computing Do-Not-Accords matrix : 257 transitions.
[2024-05-21 10:45:21] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:45:21] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9332681382390516325
Running compilation step : cd /tmp/ltsmin9332681382390516325;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 645 ms.
Running link step : cd /tmp/ltsmin9332681382390516325;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9332681382390516325;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13991206275284776648.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 10:45:36] [INFO ] Flatten gal took : 19 ms
[2024-05-21 10:45:36] [INFO ] Flatten gal took : 15 ms
[2024-05-21 10:45:36] [INFO ] Time to serialize gal into /tmp/LTL10718582919792230363.gal : 5 ms
[2024-05-21 10:45:36] [INFO ] Time to serialize properties into /tmp/LTL15767172401171093394.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10718582919792230363.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4835684904724638407.hoa' '-atoms' '/tmp/LTL15767172401171093394.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15767172401171093394.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4835684904724638407.hoa
Detected timeout of ITS tools.
[2024-05-21 10:45:52] [INFO ] Flatten gal took : 9 ms
[2024-05-21 10:45:52] [INFO ] Flatten gal took : 10 ms
[2024-05-21 10:45:52] [INFO ] Time to serialize gal into /tmp/LTL5870840090430858764.gal : 2 ms
[2024-05-21 10:45:52] [INFO ] Time to serialize properties into /tmp/LTL9971286904945183947.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5870840090430858764.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9971286904945183947.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(Section_79>=1)"))))
Formula 0 simplified : FG!"(Section_79>=1)"
Detected timeout of ITS tools.
[2024-05-21 10:46:07] [INFO ] Flatten gal took : 11 ms
[2024-05-21 10:46:07] [INFO ] Applying decomposition
[2024-05-21 10:46:07] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11513838696256441127.txt' '-o' '/tmp/graph11513838696256441127.bin' '-w' '/tmp/graph11513838696256441127.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11513838696256441127.bin' '-l' '-1' '-v' '-w' '/tmp/graph11513838696256441127.weights' '-q' '0' '-e' '0.001'
[2024-05-21 10:46:07] [INFO ] Decomposing Gal with order
[2024-05-21 10:46:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 10:46:07] [INFO ] Flatten gal took : 13 ms
[2024-05-21 10:46:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 10:46:07] [INFO ] Time to serialize gal into /tmp/LTL17579052874312501453.gal : 4 ms
[2024-05-21 10:46:07] [INFO ] Time to serialize properties into /tmp/LTL16849212054583025017.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17579052874312501453.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16849212054583025017.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("(i7.u3.Section_79>=1)"))))
Formula 0 simplified : FG!"(i7.u3.Section_79>=1)"
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-384-LTLCardinality-13 finished in 192229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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.202405141337/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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : CircularTrains-PT-384-LTLCardinality-09
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 5 out of 646 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 646/646 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 111 place count 646 transition count 273
Reduce places removed 111 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 113 rules applied. Total rules applied 224 place count 535 transition count 271
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 226 place count 533 transition count 271
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 226 place count 533 transition count 263
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 242 place count 525 transition count 263
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 254 place count 519 transition count 257
Applied a total of 254 rules in 25 ms. Remains 519 /646 variables (removed 127) and now considering 257/384 (removed 127) transitions.
// Phase 1: matrix 257 rows 519 cols
[2024-05-21 10:46:22] [INFO ] Computed 263 invariants in 4 ms
[2024-05-21 10:46:22] [INFO ] Implicit Places using invariants in 285 ms returned [12, 33, 79, 154, 279, 428]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 289 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 513/646 places, 257/384 transitions.
Applied a total of 0 rules in 7 ms. Remains 513 /513 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 321 ms. Remains : 513/646 places, 257/384 transitions.
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-09
Product exploration explored 100000 steps with 2652 reset in 1877 ms.
Product exploration explored 100000 steps with 2544 reset in 2025 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 1 factoid took 145 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 222 steps (0 resets) in 15 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 131 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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 257 rows 513 cols
[2024-05-21 10:46:27] [INFO ] Computed 257 invariants in 3 ms
[2024-05-21 10:46:27] [INFO ] [Real]Absence check using 255 positive place invariants in 71 ms returned sat
[2024-05-21 10:46:27] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-21 10:46:28] [INFO ] [Real]Absence check using state equation in 559 ms returned sat
[2024-05-21 10:46:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:46:28] [INFO ] [Nat]Absence check using 255 positive place invariants in 70 ms returned sat
[2024-05-21 10:46:28] [INFO ] [Nat]Absence check using 255 positive and 2 generalized place invariants in 12 ms returned sat
[2024-05-21 10:46:29] [INFO ] [Nat]Absence check using state equation in 869 ms returned sat
[2024-05-21 10:46:29] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-21 10:46:43] [INFO ] Added : 126 causal constraints over 26 iterations in 13904 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 5 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 257/257 transitions.
Applied a total of 0 rules in 17 ms. Remains 513 /513 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-21 10:46:43] [INFO ] Invariant cache hit.
[2024-05-21 10:46:43] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-21 10:46:43] [INFO ] Invariant cache hit.
[2024-05-21 10:46:43] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
[2024-05-21 10:46:43] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-21 10:46:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/512 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/770 variables, 513/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/770 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 770/770 variables, and 770 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8124 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/512 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/770 variables, 513/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 129/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/770 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/770 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 770/770 variables, and 899 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 38147ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38148ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38793 ms. Remains : 513/513 places, 257/257 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 147 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 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 80 steps (0 resets) in 8 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 177 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
[2024-05-21 10:47:22] [INFO ] Invariant cache hit.
[2024-05-21 10:47:22] [INFO ] [Real]Absence check using 255 positive place invariants in 72 ms returned sat
[2024-05-21 10:47:22] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-21 10:47:24] [INFO ] [Real]Absence check using state equation in 1673 ms returned sat
[2024-05-21 10:47:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:47:24] [INFO ] [Nat]Absence check using 255 positive place invariants in 70 ms returned sat
[2024-05-21 10:47:24] [INFO ] [Nat]Absence check using 255 positive and 2 generalized place invariants in 13 ms returned sat
[2024-05-21 10:47:26] [INFO ] [Nat]Absence check using state equation in 1225 ms returned sat
[2024-05-21 10:47:26] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-21 10:47:34] [INFO ] Added : 126 causal constraints over 26 iterations in 8614 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2628 reset in 1874 ms.
Product exploration explored 100000 steps with 2569 reset in 2026 ms.
Built C files in :
/tmp/ltsmin13565323088554516244
[2024-05-21 10:47:38] [INFO ] Computing symmetric may disable matrix : 257 transitions.
[2024-05-21 10:47:38] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:47:38] [INFO ] Computing symmetric may enable matrix : 257 transitions.
[2024-05-21 10:47:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:47:38] [INFO ] Computing Do-Not-Accords matrix : 257 transitions.
[2024-05-21 10:47:38] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:47:38] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13565323088554516244
Running compilation step : cd /tmp/ltsmin13565323088554516244;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 643 ms.
Running link step : cd /tmp/ltsmin13565323088554516244;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin13565323088554516244;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8715163595631777940.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 257/257 transitions.
Applied a total of 0 rules in 20 ms. Remains 513 /513 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-21 10:47:53] [INFO ] Invariant cache hit.
[2024-05-21 10:47:54] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-21 10:47:54] [INFO ] Invariant cache hit.
[2024-05-21 10:47:54] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
[2024-05-21 10:47:54] [INFO ] Redundant transitions in 0 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-21 10:47:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/512 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/770 variables, 513/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/770 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 770/770 variables, and 770 constraints, problems are : Problem set: 0 solved, 129 unsolved in 7909 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/512 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/770 variables, 513/770 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 129/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/770 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/770 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 770/770 variables, and 899 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 37936ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 37937ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38580 ms. Remains : 513/513 places, 257/257 transitions.
Built C files in :
/tmp/ltsmin16025394065593621031
[2024-05-21 10:48:32] [INFO ] Computing symmetric may disable matrix : 257 transitions.
[2024-05-21 10:48:32] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:48:32] [INFO ] Computing symmetric may enable matrix : 257 transitions.
[2024-05-21 10:48:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:48:32] [INFO ] Computing Do-Not-Accords matrix : 257 transitions.
[2024-05-21 10:48:32] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:48:32] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16025394065593621031
Running compilation step : cd /tmp/ltsmin16025394065593621031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 654 ms.
Running link step : cd /tmp/ltsmin16025394065593621031;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin16025394065593621031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4647723348169345307.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 10:48:47] [INFO ] Flatten gal took : 9 ms
[2024-05-21 10:48:47] [INFO ] Flatten gal took : 9 ms
[2024-05-21 10:48:47] [INFO ] Time to serialize gal into /tmp/LTL14360593939996472426.gal : 2 ms
[2024-05-21 10:48:47] [INFO ] Time to serialize properties into /tmp/LTL16848973527130951469.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14360593939996472426.gal' '-t' 'CGAL' '-hoa' '/tmp/aut902582703967572793.hoa' '-atoms' '/tmp/LTL16848973527130951469.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16848973527130951469.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut902582703967572793.hoa
Detected timeout of ITS tools.
[2024-05-21 10:49:02] [INFO ] Flatten gal took : 8 ms
[2024-05-21 10:49:02] [INFO ] Flatten gal took : 15 ms
[2024-05-21 10:49:02] [INFO ] Time to serialize gal into /tmp/LTL18009777443655510088.gal : 2 ms
[2024-05-21 10:49:02] [INFO ] Time to serialize properties into /tmp/LTL1838513114968935124.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18009777443655510088.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1838513114968935124.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F("((Section_184>=1)||((F138<=F223)&&(Section_360<=F111)))"))))
Formula 0 simplified : XG!"((Section_184>=1)||((F138<=F223)&&(Section_360<=F111)))"
Detected timeout of ITS tools.
[2024-05-21 10:49:17] [INFO ] Flatten gal took : 7 ms
[2024-05-21 10:49:17] [INFO ] Applying decomposition
[2024-05-21 10:49:17] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18431109077928004974.txt' '-o' '/tmp/graph18431109077928004974.bin' '-w' '/tmp/graph18431109077928004974.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18431109077928004974.bin' '-l' '-1' '-v' '-w' '/tmp/graph18431109077928004974.weights' '-q' '0' '-e' '0.001'
[2024-05-21 10:49:17] [INFO ] Decomposing Gal with order
[2024-05-21 10:49:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 10:49:17] [INFO ] Flatten gal took : 12 ms
[2024-05-21 10:49:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 10:49:17] [INFO ] Time to serialize gal into /tmp/LTL14271904355724037117.gal : 12 ms
[2024-05-21 10:49:17] [INFO ] Time to serialize properties into /tmp/LTL1412192585235298673.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14271904355724037117.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1412192585235298673.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F("((gi0.gu193.Section_184>=1)||((gu27.F138<=gu27.F223)&&(gu239.Section_360<=gu239.F111)))"))))
Formula 0 simplified : XG!"((gi0.gu193.Section_184>=1)||((gu27.F138<=gu27.F223)&&(gu239.Section_360<=gu239.F111)))"
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-384-LTLCardinality-09 finished in 190412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(F(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-21 10:49:33] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6331209695940903414
[2024-05-21 10:49:33] [INFO ] Applying decomposition
[2024-05-21 10:49:33] [INFO ] Computing symmetric may disable matrix : 384 transitions.
[2024-05-21 10:49:33] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:49:33] [INFO ] Computing symmetric may enable matrix : 384 transitions.
[2024-05-21 10:49:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 10:49:33] [INFO ] Flatten gal took : 10 ms
[2024-05-21 10:49:33] [INFO ] Computing Do-Not-Accords matrix : 384 transitions.
[2024-05-21 10:49:33] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18391628711483827061.txt' '-o' '/tmp/graph18391628711483827061.bin' '-w' '/tmp/graph18391628711483827061.weights'
[2024-05-21 10:49:33] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6331209695940903414
Running compilation step : cd /tmp/ltsmin6331209695940903414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18391628711483827061.bin' '-l' '-1' '-v' '-w' '/tmp/graph18391628711483827061.weights' '-q' '0' '-e' '0.001'
[2024-05-21 10:49:33] [INFO ] Decomposing Gal with order
[2024-05-21 10:49:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 10:49:33] [INFO ] Flatten gal took : 18 ms
[2024-05-21 10:49:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 10:49:33] [INFO ] Time to serialize gal into /tmp/LTLCardinality13371890281573382707.gal : 3 ms
[2024-05-21 10:49:33] [INFO ] Time to serialize properties into /tmp/LTLCardinality8408579737371354447.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13371890281573382707.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8408579737371354447.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 5 LTL properties
Checking formula 0 : !((G(F("(gu7.F58<=gu7.F249)"))))
Formula 0 simplified : FG!"(gu7.F58<=gu7.F249)"
Compilation finished in 1000 ms.
Running link step : cd /tmp/ltsmin6331209695940903414;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin6331209695940903414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin6331209695940903414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6331209695940903414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin6331209695940903414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp1==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6331209695940903414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin6331209695940903414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6331209695940903414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp3==true)&&X(X(<>((LTLAPp4==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin6331209695940903414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp3==true)&&X(X(<>((LTLAPp4==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6331209695940903414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp5==true)))' '--buchi-type=spotba'
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin6331209695940903414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp5==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 5760 s
Running LTSmin : cd /tmp/ltsmin6331209695940903414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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.002: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.031: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.031: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.187: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.190: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.194: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.205: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.224: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.235: Initializing POR dependencies: labels 390, guards 384
pins2lts-mc-linux64( 2/ 8), 0.237: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.254: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.255: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 2.940: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 6/ 8), 2.940: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 2.940: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 3.129: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 3.165: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 3.186: There are 392 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 3.186: State length is 647, there are 387 groups
pins2lts-mc-linux64( 0/ 8), 3.186: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 3.186: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 3.186: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 3.186: Visible groups: 0 / 387, labels: 1 / 392
pins2lts-mc-linux64( 0/ 8), 3.186: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 3.186: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 6/ 8), 3.220: [Blue] ~120 levels ~960 states ~968 transitions
pins2lts-mc-linux64( 6/ 8), 3.248: [Blue] ~240 levels ~1920 states ~1928 transitions
pins2lts-mc-linux64( 6/ 8), 3.297: [Blue] ~480 levels ~3840 states ~3848 transitions
pins2lts-mc-linux64( 0/ 8), 3.373: [Blue] ~960 levels ~7680 states ~7688 transitions
pins2lts-mc-linux64( 5/ 8), 3.502: [Blue] ~1920 levels ~15360 states ~15368 transitions
pins2lts-mc-linux64( 1/ 8), 3.742: [Blue] ~3840 levels ~30720 states ~30728 transitions
pins2lts-mc-linux64( 3/ 8), 4.259: [Blue] ~6083 levels ~61440 states ~74208 transitions
pins2lts-mc-linux64( 1/ 8), 5.217: [Blue] ~9575 levels ~122880 states ~172080 transitions
pins2lts-mc-linux64( 3/ 8), 7.153: [Blue] ~22178 levels ~245760 states ~339136 transitions
pins2lts-mc-linux64( 0/ 8), 10.766: [Blue] ~54897 levels ~491520 states ~549376 transitions
pins2lts-mc-linux64( 0/ 8), 17.386: [Blue] ~116061 levels ~983040 states ~1045640 transitions
pins2lts-mc-linux64( 5/ 8), 29.765: [Blue] ~238968 levels ~1966080 states ~2030800 transitions
pins2lts-mc-linux64( 5/ 8), 53.596: [Blue] ~484215 levels ~3932160 states ~4108168 transitions
pins2lts-mc-linux64( 5/ 8), 102.636: [Blue] ~972494 levels ~7864320 states ~8140632 transitions
pins2lts-mc-linux64( 5/ 8), 202.354: [Blue] ~1948120 levels ~15728640 states ~16167640 transitions
pins2lts-mc-linux64( 1/ 8), 248.996: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 249.139:
pins2lts-mc-linux64( 0/ 8), 249.139: Explored 18339915 states 20383955 transitions, fanout: 1.111
pins2lts-mc-linux64( 0/ 8), 249.139: Total exploration time 245.950 sec (245.800 sec minimum, 245.830 sec on average)
pins2lts-mc-linux64( 0/ 8), 249.139: States per second: 74568, Transitions per second: 82878
pins2lts-mc-linux64( 0/ 8), 249.139:
pins2lts-mc-linux64( 0/ 8), 249.139: State space has 18626115 states, 1774492 are accepting
pins2lts-mc-linux64( 0/ 8), 249.139: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 249.139: blue states: 18339915 (98.46%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 249.139: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 249.139: all-red states: 1774492 (9.53%), bogus 42756 (0.23%)
pins2lts-mc-linux64( 0/ 8), 249.139:
pins2lts-mc-linux64( 0/ 8), 249.139: Total memory used for local state coloring: 250.8MB
pins2lts-mc-linux64( 0/ 8), 249.139:
pins2lts-mc-linux64( 0/ 8), 249.139: Queue width: 8B, total height: 16437134, memory: 125.41MB
pins2lts-mc-linux64( 0/ 8), 249.139: Tree memory: 398.1MB, 22.4 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 249.139: Tree fill ratio (roots/leafs): 13.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 249.139: Stored 386 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 249.139: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 249.139: Est. total memory use: 523.5MB (~1149.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6331209695940903414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin6331209695940903414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:121)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-21 11:17:02] [INFO ] Flatten gal took : 10 ms
[2024-05-21 11:17:02] [INFO ] Time to serialize gal into /tmp/LTLCardinality10054693367325751936.gal : 2 ms
[2024-05-21 11:17:02] [INFO ] Time to serialize properties into /tmp/LTLCardinality9482044018736556850.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10054693367325751936.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9482044018736556850.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 5 LTL properties
Checking formula 0 : !((G(F("(F58<=F249)"))))
Formula 0 simplified : FG!"(F58<=F249)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="CircularTrains-PT-384"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is CircularTrains-PT-384, 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 r070-tall-171620505700363"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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