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.r069-tall-171620504400363.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 greatspnxred
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 r069-tall-171620504400363
=====================================================================

--------------------
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 1716431577994

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-384
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 02:32:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 02:32:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:32:59] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-05-23 02:32:59] [INFO ] Transformed 768 places.
[2024-05-23 02:32:59] [INFO ] Transformed 384 transitions.
[2024-05-23 02:32:59] [INFO ] Parsed PT model containing 768 places and 384 transitions and 1536 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 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 96 ms. Remains 768 /768 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 768 cols
[2024-05-23 02:32:59] [INFO ] Computed 385 invariants in 49 ms
[2024-05-23 02:33:00] [INFO ] Implicit Places using invariants in 820 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 871 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 41 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 1024 ms. Remains : 646/768 places, 384/384 transitions.
Support contains 37 out of 646 places after structural reductions.
[2024-05-23 02:33:00] [INFO ] Flatten gal took : 61 ms
[2024-05-23 02:33:00] [INFO ] Flatten gal took : 33 ms
[2024-05-23 02:33:00] [INFO ] Input system was already deterministic with 384 transitions.
RANDOM walk for 40000 steps (8 resets) in 2298 ms. (17 steps per ms) remains 5/22 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 321 ms. (124 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 271 ms. (147 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 5/5 properties
// Phase 1: matrix 384 rows 646 cols
[2024-05-23 02:33:02] [INFO ] Computed 263 invariants in 21 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 205 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 252ms 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 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 60 ms. Remains 519 /646 variables (removed 127) and now considering 257/384 (removed 127) transitions.
// Phase 1: matrix 257 rows 519 cols
[2024-05-23 02:33:02] [INFO ] Computed 263 invariants in 4 ms
[2024-05-23 02:33:03] [INFO ] Implicit Places using invariants in 346 ms returned [12, 80, 155, 280, 428]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 348 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 16 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 424 ms. Remains : 514/646 places, 257/384 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-00
Product exploration explored 100000 steps with 1056 reset in 1919 ms.
Product exploration explored 100000 steps with 1008 reset in 2001 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 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 28 ms :[(NOT p0)]
RANDOM walk for 196 steps (0 resets) in 10 ms. (17 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 175 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 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
// Phase 1: matrix 257 rows 514 cols
[2024-05-23 02:33:07] [INFO ] Computed 258 invariants in 6 ms
[2024-05-23 02:33:08] [INFO ] [Real]Absence check using 256 positive place invariants in 77 ms returned sat
[2024-05-23 02:33:08] [INFO ] [Real]Absence check using 256 positive and 2 generalized place invariants in 25 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 222 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 5678 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 1 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 44 ms. Remains 519 /646 variables (removed 127) and now considering 257/384 (removed 127) transitions.
// Phase 1: matrix 257 rows 519 cols
[2024-05-23 02:33:08] [INFO ] Computed 263 invariants in 3 ms
[2024-05-23 02:33:08] [INFO ] Implicit Places using invariants in 307 ms returned [12, 33, 79, 154, 279, 428]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 308 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 13 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 365 ms. Remains : 513/646 places, 257/384 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-02
Product exploration explored 100000 steps with 510 reset in 1660 ms.
Product exploration explored 100000 steps with 479 reset in 1783 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 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 39 ms :[(NOT p0)]
RANDOM walk for 447 steps (0 resets) in 28 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 225 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 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
// Phase 1: matrix 257 rows 513 cols
[2024-05-23 02:33:12] [INFO ] Computed 257 invariants in 4 ms
[2024-05-23 02:33:13] [INFO ] [Real]Absence check using 255 positive place invariants in 74 ms returned sat
[2024-05-23 02:33:13] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 11 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 258 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 5044 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 1 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 1 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-23 02:33:13] [INFO ] Computed 263 invariants in 7 ms
[2024-05-23 02:33:13] [INFO ] Implicit Places using invariants in 316 ms returned [12, 33, 79, 279, 427]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 323 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 13 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 372 ms. Remains : 513/646 places, 256/384 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-03
Product exploration explored 100000 steps with 1148 reset in 1717 ms.
Product exploration explored 100000 steps with 1180 reset in 1874 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 140 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 37 ms :[(NOT p0)]
RANDOM walk for 259 steps (0 resets) in 14 ms. (17 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 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)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
// Phase 1: matrix 256 rows 513 cols
[2024-05-23 02:33:17] [INFO ] Computed 258 invariants in 3 ms
[2024-05-23 02:33:18] [INFO ] [Real]Absence check using 255 positive place invariants in 73 ms returned sat
[2024-05-23 02:33:18] [INFO ] [Real]Absence check using 255 positive and 3 generalized place invariants in 37 ms returned sat
[2024-05-23 02:33:19] [INFO ] [Real]Absence check using state equation in 867 ms returned sat
[2024-05-23 02:33:19] [INFO ] Computed and/alt/rep : 128/256/128 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-23 02:33:32] [INFO ] Added : 110 causal constraints over 22 iterations in 13830 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 15 ms. Remains 513 /513 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-05-23 02:33:32] [INFO ] Invariant cache hit.
[2024-05-23 02:33:33] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-23 02:33:33] [INFO ] Invariant cache hit.
[2024-05-23 02:33:33] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 740 ms to find 0 implicit places.
[2024-05-23 02:33:33] [INFO ] Redundant transitions in 10 ms returned []
Running 128 sub problems to find dead transitions.
[2024-05-23 02:33:33] [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 8601 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 30012 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 38645ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 38648ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39426 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 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 45 ms :[(NOT p0)]
RANDOM walk for 154 steps (0 resets) in 11 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 164 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 38 ms :[(NOT p0)]
[2024-05-23 02:34:12] [INFO ] Invariant cache hit.
[2024-05-23 02:34:13] [INFO ] [Real]Absence check using 255 positive place invariants in 69 ms returned sat
[2024-05-23 02:34:13] [INFO ] [Real]Absence check using 255 positive and 3 generalized place invariants in 21 ms returned sat
[2024-05-23 02:34:14] [INFO ] [Real]Absence check using state equation in 876 ms returned sat
[2024-05-23 02:34:14] [INFO ] Computed and/alt/rep : 128/256/128 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-23 02:34:27] [INFO ] Added : 120 causal constraints over 24 iterations in 13875 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1124 reset in 1708 ms.
Product exploration explored 100000 steps with 1095 reset in 1825 ms.
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 10 ms. Remains 513 /513 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-05-23 02:34:31] [INFO ] Invariant cache hit.
[2024-05-23 02:34:31] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-23 02:34:31] [INFO ] Invariant cache hit.
[2024-05-23 02:34:32] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
[2024-05-23 02:34:32] [INFO ] Redundant transitions in 3 ms returned []
Running 128 sub problems to find dead transitions.
[2024-05-23 02:34: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) 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 8244 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 30019 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 38280ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 38282ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38953 ms. Remains : 513/513 places, 256/256 transitions.
Treatment of property CircularTrains-PT-384-LTLCardinality-03 finished in 117162 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 1 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 30 ms. Remains 519 /646 variables (removed 127) and now considering 257/384 (removed 127) transitions.
// Phase 1: matrix 257 rows 519 cols
[2024-05-23 02:35:10] [INFO ] Computed 263 invariants in 2 ms
[2024-05-23 02:35:11] [INFO ] Implicit Places using invariants in 467 ms returned [12, 33, 79, 154, 279, 427]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 472 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 11 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 513 ms. Remains : 513/646 places, 257/384 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 1277 ms.
Product exploration explored 100000 steps with 0 reset in 1547 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 117 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 36 ms :[(NOT p0)]
RANDOM walk for 871 steps (0 resets) in 33 ms. (25 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 128 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
// Phase 1: matrix 257 rows 513 cols
[2024-05-23 02:35:14] [INFO ] Computed 257 invariants in 4 ms
[2024-05-23 02:35:14] [INFO ] [Real]Absence check using 255 positive place invariants in 79 ms returned sat
[2024-05-23 02:35:14] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 27 ms returned sat
[2024-05-23 02:35:15] [INFO ] [Real]Absence check using state equation in 804 ms returned sat
[2024-05-23 02:35:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:35:15] [INFO ] [Nat]Absence check using 255 positive place invariants in 72 ms returned sat
[2024-05-23 02:35:15] [INFO ] [Nat]Absence check using 255 positive and 2 generalized place invariants in 28 ms returned sat
[2024-05-23 02:35:16] [INFO ] [Nat]Absence check using state equation in 832 ms returned sat
[2024-05-23 02:35:16] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 21 ms.
[2024-05-23 02:35:28] [INFO ] Added : 126 causal constraints over 26 iterations in 12261 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 13 ms. Remains 513 /513 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-23 02:35:28] [INFO ] Invariant cache hit.
[2024-05-23 02:35:29] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-23 02:35:29] [INFO ] Invariant cache hit.
[2024-05-23 02:35:29] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
[2024-05-23 02:35:29] [INFO ] Redundant transitions in 3 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-23 02:35:29] [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 8347 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 38369ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38371ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39122 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 130 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 41 ms :[(NOT p0)]
RANDOM walk for 1688 steps (0 resets) in 48 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 136 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2024-05-23 02:36:08] [INFO ] Invariant cache hit.
[2024-05-23 02:36:08] [INFO ] [Real]Absence check using 255 positive place invariants in 72 ms returned sat
[2024-05-23 02:36:08] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 13 ms returned sat
[2024-05-23 02:36:09] [INFO ] [Real]Absence check using state equation in 794 ms returned sat
[2024-05-23 02:36:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:36:09] [INFO ] [Nat]Absence check using 255 positive place invariants in 73 ms returned sat
[2024-05-23 02:36:09] [INFO ] [Nat]Absence check using 255 positive and 2 generalized place invariants in 13 ms returned sat
[2024-05-23 02:36:10] [INFO ] [Nat]Absence check using state equation in 793 ms returned sat
[2024-05-23 02:36:10] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-23 02:36:22] [INFO ] Added : 126 causal constraints over 26 iterations in 11511 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 92 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1248 ms.
Product exploration explored 100000 steps with 0 reset in 1434 ms.
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 10 ms. Remains 513 /513 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-23 02:36:24] [INFO ] Invariant cache hit.
[2024-05-23 02:36:25] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-23 02:36:25] [INFO ] Invariant cache hit.
[2024-05-23 02:36:25] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
[2024-05-23 02:36:25] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-23 02:36:25] [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 8217 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 30013 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 38247ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38249ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38938 ms. Remains : 513/513 places, 257/257 transitions.
Treatment of property CircularTrains-PT-384-LTLCardinality-04 finished in 113319 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 1 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 28 ms. Remains 518 /646 variables (removed 128) and now considering 256/384 (removed 128) transitions.
// Phase 1: matrix 256 rows 518 cols
[2024-05-23 02:37:03] [INFO ] Computed 263 invariants in 2 ms
[2024-05-23 02:37:04] [INFO ] Implicit Places using invariants in 318 ms returned [12, 33, 79, 154, 279, 427]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 322 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 360 ms. Remains : 512/646 places, 256/384 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-05
Product exploration explored 100000 steps with 1791 reset in 1792 ms.
Product exploration explored 100000 steps with 1732 reset in 1928 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 161 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 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 366 steps (0 resets) in 11 ms. (30 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 150 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 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 256 rows 512 cols
[2024-05-23 02:37:08] [INFO ] Computed 257 invariants in 2 ms
[2024-05-23 02:37:08] [INFO ] [Real]Absence check using 255 positive place invariants in 68 ms returned sat
[2024-05-23 02:37:08] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 19 ms returned sat
[2024-05-23 02:37:09] [INFO ] [Real]Absence check using state equation in 872 ms returned sat
[2024-05-23 02:37:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:37:10] [INFO ] [Nat]Absence check using 255 positive place invariants in 70 ms returned sat
[2024-05-23 02:37:10] [INFO ] [Nat]Absence check using 255 positive and 2 generalized place invariants in 6 ms returned sat
[2024-05-23 02:37:16] [INFO ] [Nat]Absence check using state equation in 6263 ms returned sat
[2024-05-23 02:37:16] [INFO ] Computed and/alt/rep : 128/256/128 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-23 02:37:24] [INFO ] Added : 126 causal constraints over 26 iterations in 8491 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 17 ms. Remains 512 /512 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-05-23 02:37:24] [INFO ] Invariant cache hit.
[2024-05-23 02:37:25] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-23 02:37:25] [INFO ] Invariant cache hit.
[2024-05-23 02:37:25] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
[2024-05-23 02:37:25] [INFO ] Redundant transitions in 1 ms returned []
Running 128 sub problems to find dead transitions.
[2024-05-23 02:37:25] [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 8393 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/768 variables, and 897 constraints, problems are : Problem set: 0 solved, 128 unsolved in 30009 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 38417ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 38419ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39078 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 168 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 81 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 130 steps (0 resets) in 9 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 190 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 72 ms :[(NOT p0), (NOT p0)]
[2024-05-23 02:38:04] [INFO ] Invariant cache hit.
[2024-05-23 02:38:04] [INFO ] [Real]Absence check using 255 positive place invariants in 73 ms returned sat
[2024-05-23 02:38:04] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 13 ms returned sat
[2024-05-23 02:38:05] [INFO ] [Real]Absence check using state equation in 1103 ms returned sat
[2024-05-23 02:38:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:38:06] [INFO ] [Nat]Absence check using 255 positive place invariants in 72 ms returned sat
[2024-05-23 02:38:06] [INFO ] [Nat]Absence check using 255 positive and 2 generalized place invariants in 9 ms returned sat
[2024-05-23 02:38:07] [INFO ] [Nat]Absence check using state equation in 938 ms returned sat
[2024-05-23 02:38:07] [INFO ] Computed and/alt/rep : 128/256/128 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-23 02:38:20] [INFO ] Added : 95 causal constraints over 19 iterations in 13829 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 1805 reset in 1917 ms.
Product exploration explored 100000 steps with 1812 reset in 2027 ms.
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 12 ms. Remains 512 /512 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-05-23 02:38:25] [INFO ] Invariant cache hit.
[2024-05-23 02:38:25] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-05-23 02:38:25] [INFO ] Invariant cache hit.
[2024-05-23 02:38:25] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
[2024-05-23 02:38:25] [INFO ] Redundant transitions in 1 ms returned []
Running 128 sub problems to find dead transitions.
[2024-05-23 02:38:25] [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 8217 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 30018 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 38249ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 38251ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38942 ms. Remains : 512/512 places, 256/256 transitions.
Treatment of property CircularTrains-PT-384-LTLCardinality-05 finished in 120099 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 25 ms. Remains 518 /646 variables (removed 128) and now considering 256/384 (removed 128) transitions.
// Phase 1: matrix 256 rows 518 cols
[2024-05-23 02:39:03] [INFO ] Computed 263 invariants in 3 ms
[2024-05-23 02:39:04] [INFO ] Implicit Places using invariants in 307 ms returned [12, 33, 79, 154, 279, 427]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 308 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 343 ms. Remains : 512/646 places, 256/384 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-06
Product exploration explored 100000 steps with 428 reset in 1578 ms.
Product exploration explored 100000 steps with 444 reset in 1712 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 191 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 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 420 steps (0 resets) in 13 ms. (30 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 165 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 66 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-23 02:39:08] [INFO ] Computed 257 invariants in 3 ms
[2024-05-23 02:39:08] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-23 02:39:08] [INFO ] Invariant cache hit.
[2024-05-23 02:39:09] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
[2024-05-23 02:39:09] [INFO ] Redundant transitions in 1 ms returned []
Running 128 sub problems to find dead transitions.
[2024-05-23 02:39:09] [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 8408 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 30010 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 38434ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 38436ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39105 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 156 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 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 825 steps (0 resets) in 30 ms. (26 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 186 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 440 reset in 1621 ms.
Product exploration explored 100000 steps with 458 reset in 1760 ms.
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 9 ms. Remains 512 /512 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-05-23 02:39:51] [INFO ] Invariant cache hit.
[2024-05-23 02:39:51] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-23 02:39:51] [INFO ] Invariant cache hit.
[2024-05-23 02:39:52] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
[2024-05-23 02:39:52] [INFO ] Redundant transitions in 1 ms returned []
Running 128 sub problems to find dead transitions.
[2024-05-23 02:39:52] [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 8466 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 30006 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 38487ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 38488ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39161 ms. Remains : 512/512 places, 256/256 transitions.
Treatment of property CircularTrains-PT-384-LTLCardinality-06 finished in 86845 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 9 ms. Remains 646 /646 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 646 cols
[2024-05-23 02:40:30] [INFO ] Computed 263 invariants in 4 ms
[2024-05-23 02:40:31] [INFO ] Implicit Places using invariants in 312 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 331 ms. Remains : 640/646 places, 384/384 transitions.
Stuttering acceptance computed with spot in 213 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 402 steps with 0 reset in 8 ms.
FORMULA CircularTrains-PT-384-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLCardinality-08 finished in 567 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-23 02:40:31] [INFO ] Invariant cache hit.
[2024-05-23 02:40:31] [INFO ] Implicit Places using invariants in 306 ms returned [14, 36, 90, 188, 341, 538]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 307 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 328 ms. Remains : 640/646 places, 384/384 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-09
Product exploration explored 100000 steps with 1814 reset in 1911 ms.
Product exploration explored 100000 steps with 1877 reset in 2058 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 159 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 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 130 steps (0 resets) in 8 ms. (14 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 200 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 57 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 384 rows 640 cols
[2024-05-23 02:40:36] [INFO ] Computed 257 invariants in 3 ms
[2024-05-23 02:40:36] [INFO ] [Real]Absence check using 255 positive place invariants in 84 ms returned sat
[2024-05-23 02:40:36] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 15 ms returned sat
[2024-05-23 02:40:37] [INFO ] [Real]Absence check using state equation in 1181 ms returned sat
[2024-05-23 02:40:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:40:38] [INFO ] [Nat]Absence check using 255 positive place invariants in 78 ms returned sat
[2024-05-23 02:40:38] [INFO ] [Nat]Absence check using 255 positive and 2 generalized place invariants in 34 ms returned sat
[2024-05-23 02:40:44] [INFO ] [Nat]Absence check using state equation in 6467 ms returned sat
[2024-05-23 02:40:44] [INFO ] Computed and/alt/rep : 256/384/256 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-23 02:40:52] [INFO ] Added : 65 causal constraints over 13 iterations in 8197 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 29 ms. Remains 513 /640 variables (removed 127) and now considering 257/384 (removed 127) transitions.
// Phase 1: matrix 257 rows 513 cols
[2024-05-23 02:40:52] [INFO ] Computed 257 invariants in 2 ms
[2024-05-23 02:40:53] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-23 02:40:53] [INFO ] Invariant cache hit.
[2024-05-23 02:40:53] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
[2024-05-23 02:40:53] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-23 02:40:53] [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 8481 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 38504ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38505ms
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 39213 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 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 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 109 steps (0 resets) in 8 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 205 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)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
[2024-05-23 02:41:32] [INFO ] Invariant cache hit.
[2024-05-23 02:41:33] [INFO ] [Real]Absence check using 255 positive place invariants in 74 ms returned sat
[2024-05-23 02:41:33] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 17 ms returned sat
[2024-05-23 02:41:34] [INFO ] [Real]Absence check using state equation in 1483 ms returned sat
[2024-05-23 02:41:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:41:34] [INFO ] [Nat]Absence check using 255 positive place invariants in 72 ms returned sat
[2024-05-23 02:41:34] [INFO ] [Nat]Absence check using 255 positive and 2 generalized place invariants in 9 ms returned sat
[2024-05-23 02:41:36] [INFO ] [Nat]Absence check using state equation in 1856 ms returned sat
[2024-05-23 02:41:36] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-23 02:41:42] [INFO ] Added : 127 causal constraints over 26 iterations in 5909 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2633 reset in 1908 ms.
Product exploration explored 100000 steps with 2546 reset in 2051 ms.
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 8 ms. Remains 513 /513 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-23 02:41:46] [INFO ] Invariant cache hit.
[2024-05-23 02:41:46] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-23 02:41:46] [INFO ] Invariant cache hit.
[2024-05-23 02:41:47] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2024-05-23 02:41:47] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-23 02:41:47] [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 8354 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 38376ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38377ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39039 ms. Remains : 513/513 places, 257/257 transitions.
Treatment of property CircularTrains-PT-384-LTLCardinality-09 finished in 114320 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 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-23 02:42:25] [INFO ] Computed 263 invariants in 3 ms
[2024-05-23 02:42:26] [INFO ] Implicit Places using invariants in 313 ms returned [14, 36, 90, 188, 538]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 313 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 339 ms. Remains : 641/646 places, 384/384 transitions.
Stuttering acceptance computed with spot in 116 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 468 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 9 ms. Remains 646 /646 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2024-05-23 02:42:26] [INFO ] Invariant cache hit.
[2024-05-23 02:42:26] [INFO ] Implicit Places using invariants in 316 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 335 ms. Remains : 640/646 places, 384/384 transitions.
Stuttering acceptance computed with spot in 163 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 24623 reset in 1784 ms.
Product exploration explored 100000 steps with 24569 reset in 1907 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 70 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 145 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 602 steps (0 resets) in 21 ms. (27 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 96 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 129 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 133 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 8 ms. Remains 640 /640 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 640 cols
[2024-05-23 02:42:30] [INFO ] Computed 257 invariants in 8 ms
[2024-05-23 02:42:31] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-23 02:42:31] [INFO ] Invariant cache hit.
[2024-05-23 02:42:31] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-05-23 02:42:31] [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 21607 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 30024 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 51655ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 51657ms
Finished structural reductions in LTL mode , in 1 iterations and 52449 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 71 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 132 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 798 steps (0 resets) in 25 ms. (30 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 79 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 147 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 24679 reset in 1784 ms.
Product exploration explored 100000 steps with 24423 reset in 1910 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 144 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-23 02:43:28] [INFO ] Redundant transitions in 2 ms returned []
Running 256 sub problems to find dead transitions.
// Phase 1: matrix 384 rows 640 cols
[2024-05-23 02:43:28] [INFO ] Computed 257 invariants in 3 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-23 02:43:31] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 12 ms to minimize.
[2024-05-23 02:43:31] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
[2024-05-23 02:43:31] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-23 02:43:31] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 2 ms to minimize.
[2024-05-23 02:43:31] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-23 02:43:31] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 2 ms to minimize.
[2024-05-23 02:43:31] [INFO ] Deduced a trap composed of 2 places in 61 ms of which 7 ms to minimize.
[2024-05-23 02:43:31] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 2 ms to minimize.
[2024-05-23 02:43:31] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 2 ms to minimize.
[2024-05-23 02:43:31] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
[2024-05-23 02:43:32] [INFO ] Deduced a trap composed of 2 places in 58 ms of which 1 ms to minimize.
[2024-05-23 02:43:32] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-23 02:43:32] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-23 02:43:32] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-23 02:43:32] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-23 02:43:32] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-23 02:43:32] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-23 02:43:32] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-23 02:43:32] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-23 02:43:32] [INFO ] Deduced a trap composed of 3 places in 51 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-23 02:43:34] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-23 02:43:34] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-23 02:43:34] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-23 02:43:34] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-23 02:43:34] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-23 02:43:35] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-23 02:43:35] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-23 02:43:35] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-23 02:43:35] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-23 02:43:35] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-23 02:43:35] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-23 02:43:35] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 0 ms to minimize.
[2024-05-23 02:43:35] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-23 02:43:35] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-23 02:43:35] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-05-23 02:43:35] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 0 ms to minimize.
[2024-05-23 02:43:35] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-23 02:43:35] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-23 02:43:35] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-23 02:43:35] [INFO ] Deduced a trap composed of 2 places in 19 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-23 02:43:35] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-23 02:43:35] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-23 02:43:35] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-05-23 02:43:35] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-23 02:43:35] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2024-05-23 02:43:36] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-23 02:43:36] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD126 is UNSAT
[2024-05-23 02:43:37] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-23 02:43:37] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-23 02:43:37] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2024-05-23 02:43:37] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 2 ms to minimize.
[2024-05-23 02:43:37] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-23 02:43:37] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-23 02:43:37] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-23 02:43:37] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-23 02:43:37] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-23 02:43:37] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 8 ms to minimize.
[2024-05-23 02:43:37] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-23 02:43:37] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2024-05-23 02:43:37] [INFO ] Deduced a trap composed of 2 places in 31 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-23 02:43:38] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-05-23 02:43:38] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-23 02:43:38] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 0 ms to minimize.
[2024-05-23 02:43:38] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-23 02:43:38] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-23 02:43:38] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-05-23 02:43:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-23 02:43:38] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-23 02:43:38] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-23 02:43:38] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-05-23 02:43:38] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-23 02:43:38] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2024-05-23 02:43:38] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-23 02:43:38] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-23 02:43:38] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-23 02:43:38] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-23 02:43:39] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-23 02:43:39] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-23 02:43:39] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-23 02:43:39] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 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-23 02:43:41] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-23 02:43:41] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-23 02:43:41] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-23 02:43:41] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-05-23 02:43:42] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-23 02:43:42] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-23 02:43:42] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2024-05-23 02:43:42] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 0 ms to minimize.
[2024-05-23 02:43:42] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-05-23 02:43:42] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-23 02:43:42] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-05-23 02:43:42] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2024-05-23 02:43:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-23 02:43:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-23 02:43:43] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 0 ms to minimize.
[2024-05-23 02:43:43] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-23 02:43:43] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-05-23 02:43:43] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-23 02:43:43] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-23 02:43:43] [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-23 02:43:43] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
[2024-05-23 02:43:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-23 02:43:43] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-23 02:43:43] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2024-05-23 02:43:44] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-05-23 02:43:44] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD70 is UNSAT
[2024-05-23 02:43:44] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-23 02:43:44] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD103 is UNSAT
[2024-05-23 02:43:44] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
Problem TDEAD108 is UNSAT
[2024-05-23 02:43:44] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
Problem TDEAD115 is UNSAT
[2024-05-23 02:43:44] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD120 is UNSAT
[2024-05-23 02:43:44] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD123 is UNSAT
Problem TDEAD199 is UNSAT
[2024-05-23 02:43:45] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 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-23 02:43:46] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
Problem TDEAD129 is UNSAT
[2024-05-23 02:43:46] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD139 is UNSAT
[2024-05-23 02:43:46] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2024-05-23 02:43:46] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
[2024-05-23 02:43:46] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-23 02:43:46] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2024-05-23 02:43:46] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-23 02:43:46] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-23 02:43:46] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 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-23 02:43:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD142 is UNSAT
[2024-05-23 02:43:49] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2024-05-23 02:43:49] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-23 02:43:49] [INFO ] Deduced a trap composed of 2 places in 15 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-23 02:43:50] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 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
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 30010 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 60048ms problems are : Problem set: 128 solved, 128 unsolved
Search for dead transitions found 128 dead transitions in 60051ms
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 24 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 60142 ms. Remains : 512/640 places, 256/384 transitions.
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 10 ms. Remains 640 /640 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 640 cols
[2024-05-23 02:44:28] [INFO ] Computed 257 invariants in 3 ms
[2024-05-23 02:44:28] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-23 02:44:28] [INFO ] Invariant cache hit.
[2024-05-23 02:44:29] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-05-23 02:44:29] [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 21137 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 51176ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 51179ms
Finished structural reductions in LTL mode , in 1 iterations and 51948 ms. Remains : 640/640 places, 384/384 transitions.
Treatment of property CircularTrains-PT-384-LTLCardinality-11 finished in 174146 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 13 ms. Remains 646 /646 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 646 cols
[2024-05-23 02:45:20] [INFO ] Computed 263 invariants in 3 ms
[2024-05-23 02:45:20] [INFO ] Implicit Places using invariants in 341 ms returned [14, 36, 90, 188, 341, 538]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 343 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 11 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 369 ms. Remains : 640/646 places, 384/384 transitions.
Stuttering acceptance computed with spot in 221 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 85 steps with 0 reset in 5 ms.
FORMULA CircularTrains-PT-384-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLCardinality-12 finished in 615 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 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 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-23 02:45:20] [INFO ] Computed 263 invariants in 4 ms
[2024-05-23 02:45:21] [INFO ] Implicit Places using invariants in 300 ms returned [12, 33, 79, 154, 279, 428]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 301 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 8 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 335 ms. Remains : 513/646 places, 257/384 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLCardinality-13
Product exploration explored 100000 steps with 1054 reset in 1786 ms.
Product exploration explored 100000 steps with 1008 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 163 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 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 454 steps (0 resets) in 15 ms. (28 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 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 82 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-23 02:45:25] [INFO ] Computed 257 invariants in 5 ms
[2024-05-23 02:45:25] [INFO ] [Real]Absence check using 255 positive place invariants in 70 ms returned sat
[2024-05-23 02:45:25] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 27 ms returned sat
[2024-05-23 02:45:26] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2024-05-23 02:45:26] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-23 02:45:40] [INFO ] Added : 90 causal constraints over 18 iterations in 14548 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 9 ms. Remains 513 /513 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-23 02:45:40] [INFO ] Invariant cache hit.
[2024-05-23 02:45:41] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-23 02:45:41] [INFO ] Invariant cache hit.
[2024-05-23 02:45:41] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
[2024-05-23 02:45:41] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-23 02:45:41] [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 8835 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 38857ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38860ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39529 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 179 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)]
RANDOM walk for 349 steps (0 resets) in 17 ms. (19 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 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 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
[2024-05-23 02:46:20] [INFO ] Invariant cache hit.
[2024-05-23 02:46:21] [INFO ] [Real]Absence check using 255 positive place invariants in 70 ms returned sat
[2024-05-23 02:46:21] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 26 ms returned sat
[2024-05-23 02:46:22] [INFO ] [Real]Absence check using state equation in 954 ms returned sat
[2024-05-23 02:46:22] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-23 02:46:35] [INFO ] Added : 126 causal constraints over 26 iterations in 13791 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1021 reset in 1748 ms.
Product exploration explored 100000 steps with 1037 reset in 1899 ms.
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 15 ms. Remains 513 /513 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-23 02:46:39] [INFO ] Invariant cache hit.
[2024-05-23 02:46:40] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-23 02:46:40] [INFO ] Invariant cache hit.
[2024-05-23 02:46:40] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
[2024-05-23 02:46:40] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-23 02:46:40] [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 8544 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 30007 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 38565ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38566ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39282 ms. Remains : 513/513 places, 257/257 transitions.
Treatment of property CircularTrains-PT-384-LTLCardinality-13 finished in 118051 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))))))'
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)))'
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 87 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 38 ms. Remains 519 /646 variables (removed 127) and now considering 257/384 (removed 127) transitions.
// Phase 1: matrix 257 rows 519 cols
[2024-05-23 02:47:19] [INFO ] Computed 263 invariants in 6 ms
[2024-05-23 02:47:19] [INFO ] Implicit Places using invariants in 290 ms returned [12, 33, 79, 154, 279, 428]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 291 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 10 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 339 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 2559 reset in 1916 ms.
Product exploration explored 100000 steps with 2573 reset in 2091 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 161 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 56 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 69 steps (0 resets) in 6 ms. (9 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 161 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 53 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 257 rows 513 cols
[2024-05-23 02:47:24] [INFO ] Computed 257 invariants in 3 ms
[2024-05-23 02:47:24] [INFO ] [Real]Absence check using 255 positive place invariants in 74 ms returned sat
[2024-05-23 02:47:24] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 12 ms returned sat
[2024-05-23 02:47:25] [INFO ] [Real]Absence check using state equation in 565 ms returned sat
[2024-05-23 02:47:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:47:25] [INFO ] [Nat]Absence check using 255 positive place invariants in 77 ms returned sat
[2024-05-23 02:47:25] [INFO ] [Nat]Absence check using 255 positive and 2 generalized place invariants in 13 ms returned sat
[2024-05-23 02:47:26] [INFO ] [Nat]Absence check using state equation in 908 ms returned sat
[2024-05-23 02:47:26] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-23 02:47:40] [INFO ] Added : 126 causal constraints over 26 iterations in 13847 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 15 ms. Remains 513 /513 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-23 02:47:40] [INFO ] Invariant cache hit.
[2024-05-23 02:47:40] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-23 02:47:40] [INFO ] Invariant cache hit.
[2024-05-23 02:47:41] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
[2024-05-23 02:47:41] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-23 02:47:41] [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 8586 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 38606ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38607ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39280 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 187 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 269 steps (0 resets) in 12 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 184 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 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
[2024-05-23 02:48:20] [INFO ] Invariant cache hit.
[2024-05-23 02:48:20] [INFO ] [Real]Absence check using 255 positive place invariants in 75 ms returned sat
[2024-05-23 02:48:20] [INFO ] [Real]Absence check using 255 positive and 2 generalized place invariants in 19 ms returned sat
[2024-05-23 02:48:22] [INFO ] [Real]Absence check using state equation in 1689 ms returned sat
[2024-05-23 02:48:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:48:22] [INFO ] [Nat]Absence check using 255 positive place invariants in 73 ms returned sat
[2024-05-23 02:48:22] [INFO ] [Nat]Absence check using 255 positive and 2 generalized place invariants in 13 ms returned sat
[2024-05-23 02:48:23] [INFO ] [Nat]Absence check using state equation in 1262 ms returned sat
[2024-05-23 02:48:23] [INFO ] Computed and/alt/rep : 129/257/129 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-23 02:48:32] [INFO ] Added : 126 causal constraints over 26 iterations in 8974 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2603 reset in 1958 ms.
Product exploration explored 100000 steps with 2532 reset in 2091 ms.
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 8 ms. Remains 513 /513 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-23 02:48:36] [INFO ] Invariant cache hit.
[2024-05-23 02:48:37] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-23 02:48:37] [INFO ] Invariant cache hit.
[2024-05-23 02:48:37] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
[2024-05-23 02:48:37] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-23 02:48:37] [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 8748 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 38769ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38770ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39459 ms. Remains : 513/513 places, 257/257 transitions.
Treatment of property CircularTrains-PT-384-LTLCardinality-09 finished in 117003 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-23 02:49:16] [INFO ] Flatten gal took : 23 ms
[2024-05-23 02:49:16] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-23 02:49:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 646 places, 384 transitions and 1292 arcs took 9 ms.
Total runtime 977466 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CircularTrains-PT-384

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 646
TRANSITIONS: 384
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.012s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2600
MODEL NAME: /home/mcc/execution/412/model
646 places, 384 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA CircularTrains-PT-384-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CircularTrains-PT-384-LTLCardinality-03 CANNOT_COMPUTE
FORMULA CircularTrains-PT-384-LTLCardinality-05 CANNOT_COMPUTE
FORMULA CircularTrains-PT-384-LTLCardinality-06 CANNOT_COMPUTE
FORMULA CircularTrains-PT-384-LTLCardinality-09 CANNOT_COMPUTE
FORMULA CircularTrains-PT-384-LTLCardinality-11 CANNOT_COMPUTE
FORMULA CircularTrains-PT-384-LTLCardinality-13 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716433376995

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

+ 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//../reducer/bin//../../itstools//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//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
Error in allocating array of size 1048576 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1048576 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="greatspnxred"
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 greatspnxred"
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 r069-tall-171620504400363"
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 ;