fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r070-tall-171620505300196
Last Updated
July 7, 2024

About the Execution of ITS-Tools for CSRepetitions-COL-04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1754.451 124571.00 266571.00 325.90 FFFFFTFTTFFFTFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 10K Apr 12 09:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 12 09:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 09:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 09:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 09:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 09:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 09:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 12 09:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 14K 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 CSRepetitions-COL-04-LTLFireability-00
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-01
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-02
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-03
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-04
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-05
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-06
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-07
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-08
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-09
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-10
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-11
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-12
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-13
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-14
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716269094037

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-COL-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-21 05:24:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 05:24:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 05:24:55] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-21 05:24:55] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 05:24:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 539 ms
[2024-05-21 05:24:55] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 117 PT places and 176.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-05-21 05:24:55] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 5 ms.
[2024-05-21 05:24:55] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 5 formulas.
FORMULA CSRepetitions-COL-04-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-04-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-04-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-04-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-04-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 1 stable transitions
Remains 7 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 1 stable transitions
RANDOM walk for 400 steps (11 resets) in 11 ms. (33 steps per ms) remains 0/4 properties
[2024-05-21 05:24:56] [INFO ] Flatten gal took : 12 ms
[2024-05-21 05:24:56] [INFO ] Flatten gal took : 1 ms
Transition Send_Answer forces synchronizations/join behavior on parameter c of sort Client
Symmetric sort wr.t. initial and guards and successors and join/free detected :Server
Symmetric sort wr.t. initial detected :Server
Symmetric sort wr.t. initial and guards detected :Server
Applying symmetric unfolding of full symmetric sort :Server domain size was 4
[2024-05-21 05:24:56] [INFO ] Unfolded HLPN to a Petri net with 66 places and 80 transitions 240 arcs in 12 ms.
[2024-05-21 05:24:56] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
FORMULA CSRepetitions-COL-04-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 5 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2024-05-21 05:24:56] [INFO ] Computed 17 invariants in 13 ms
[2024-05-21 05:24:56] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-21 05:24:56] [INFO ] Invariant cache hit.
[2024-05-21 05:24:56] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-21 05:24:56] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-21 05:24:56] [INFO ] Invariant cache hit.
[2024-05-21 05:24:56] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 16/66 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 80/146 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 99 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1169 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 16/66 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 80/146 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 64/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 163 constraints, problems are : Problem set: 0 solved, 64 unsolved in 925 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 2168ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 2180ms
Finished structural reductions in LTL mode , in 1 iterations and 2452 ms. Remains : 66/66 places, 80/80 transitions.
Support contains 66 out of 66 places after structural reductions.
[2024-05-21 05:24:58] [INFO ] Flatten gal took : 11 ms
[2024-05-21 05:24:58] [INFO ] Flatten gal took : 11 ms
[2024-05-21 05:24:58] [INFO ] Input system was already deterministic with 80 transitions.
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 160 steps (0 resets) in 11 ms. (13 steps per ms) remains 0/6 properties
Computed a total of 0 stabilizing places and 16 stable transitions
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 16 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 7 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-21 05:24:58] [INFO ] Invariant cache hit.
[2024-05-21 05:24:59] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 05:24:59] [INFO ] Invariant cache hit.
[2024-05-21 05:24:59] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-21 05:24:59] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-05-21 05:24:59] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-21 05:24:59] [INFO ] Invariant cache hit.
[2024-05-21 05:24:59] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 16/66 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 80/146 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 99 constraints, problems are : Problem set: 0 solved, 64 unsolved in 837 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 16/66 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 80/146 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 64/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 163 constraints, problems are : Problem set: 0 solved, 64 unsolved in 899 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 1768ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 1769ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1899 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-00
Product exploration explored 100000 steps with 2496 reset in 390 ms.
Stack based approach found an accepted trace after 1621 steps with 38 reset with depth 28 and stack size 28 in 5 ms.
FORMULA CSRepetitions-COL-04-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-04-LTLFireability-00 finished in 2509 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 U p1))))'
Support contains 48 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-21 05:25:01] [INFO ] Invariant cache hit.
[2024-05-21 05:25:01] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-21 05:25:01] [INFO ] Invariant cache hit.
[2024-05-21 05:25:01] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-21 05:25:01] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-05-21 05:25:01] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-21 05:25:01] [INFO ] Invariant cache hit.
[2024-05-21 05:25:01] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 16/66 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 80/146 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 99 constraints, problems are : Problem set: 0 solved, 64 unsolved in 915 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 16/66 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 80/146 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 64/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 163 constraints, problems are : Problem set: 0 solved, 64 unsolved in 933 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 1880ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 1881ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1967 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-01
Stuttering criterion allowed to conclude after 221 steps with 30 reset in 9 ms.
FORMULA CSRepetitions-COL-04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLFireability-01 finished in 2106 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(X(G((G(!(p0 U G(X((p1 U p0)))))&&G(!p1))))))'
Support contains 48 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-21 05:25:03] [INFO ] Invariant cache hit.
[2024-05-21 05:25:03] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 05:25:03] [INFO ] Invariant cache hit.
[2024-05-21 05:25:03] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-21 05:25:03] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-21 05:25:03] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-21 05:25:03] [INFO ] Invariant cache hit.
[2024-05-21 05:25:03] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 16/66 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 80/146 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 99 constraints, problems are : Problem set: 0 solved, 64 unsolved in 910 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 16/66 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 80/146 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 64/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 163 constraints, problems are : Problem set: 0 solved, 64 unsolved in 917 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 1857ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 1859ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1956 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR p1 p0), p0]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-02
Product exploration explored 100000 steps with 2664 reset in 326 ms.
Stack based approach found an accepted trace after 332 steps with 9 reset with depth 28 and stack size 28 in 2 ms.
FORMULA CSRepetitions-COL-04-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-04-LTLFireability-02 finished in 2393 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((G(p0) U (G(p1) U p2))))'
Support contains 65 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-21 05:25:05] [INFO ] Invariant cache hit.
[2024-05-21 05:25:05] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-21 05:25:05] [INFO ] Invariant cache hit.
[2024-05-21 05:25:06] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-21 05:25:06] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-21 05:25:06] [INFO ] Invariant cache hit.
[2024-05-21 05:25:06] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 16/66 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 80/146 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 99 constraints, problems are : Problem set: 0 solved, 64 unsolved in 871 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 16/66 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 80/146 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 64/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 163 constraints, problems are : Problem set: 0 solved, 64 unsolved in 872 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 1766ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 1767ms
Finished structural reductions in LTL mode , in 1 iterations and 1845 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 289 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-03
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLFireability-03 finished in 2165 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 33 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-21 05:25:08] [INFO ] Invariant cache hit.
[2024-05-21 05:25:08] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-21 05:25:08] [INFO ] Invariant cache hit.
[2024-05-21 05:25:08] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-21 05:25:08] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-21 05:25:08] [INFO ] Invariant cache hit.
[2024-05-21 05:25:08] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 16/66 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 80/146 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 99 constraints, problems are : Problem set: 0 solved, 64 unsolved in 904 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 16/66 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 80/146 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 64/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 163 constraints, problems are : Problem set: 0 solved, 64 unsolved in 883 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 1809ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 1810ms
Finished structural reductions in LTL mode , in 1 iterations and 1889 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLFireability-04 finished in 2030 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(F(!p1))||p0)))'
Support contains 33 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-21 05:25:10] [INFO ] Invariant cache hit.
[2024-05-21 05:25:10] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-21 05:25:10] [INFO ] Invariant cache hit.
[2024-05-21 05:25:10] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-21 05:25:10] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-05-21 05:25:10] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-21 05:25:10] [INFO ] Invariant cache hit.
[2024-05-21 05:25:10] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 16/66 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 80/146 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 99 constraints, problems are : Problem set: 0 solved, 64 unsolved in 866 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 16/66 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 80/146 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 64/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 163 constraints, problems are : Problem set: 0 solved, 64 unsolved in 923 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 1811ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 1811ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1922 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-05
Product exploration explored 100000 steps with 14876 reset in 254 ms.
Product exploration explored 100000 steps with 14895 reset in 261 ms.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 126 steps (0 resets) in 7 ms. (15 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (OR p0 (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 6 factoid took 401 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 33 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 5 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-21 05:25:13] [INFO ] Invariant cache hit.
[2024-05-21 05:25:13] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-21 05:25:13] [INFO ] Invariant cache hit.
[2024-05-21 05:25:13] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-21 05:25:13] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-21 05:25:13] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-21 05:25:13] [INFO ] Invariant cache hit.
[2024-05-21 05:25:13] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 16/66 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 80/146 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 99 constraints, problems are : Problem set: 0 solved, 64 unsolved in 822 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 16/66 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 80/146 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 64/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 163 constraints, problems are : Problem set: 0 solved, 64 unsolved in 858 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 1701ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 1701ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1806 ms. Remains : 66/66 places, 80/80 transitions.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 112 steps (0 resets) in 10 ms. (10 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (OR p0 (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 6 factoid took 185 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 14948 reset in 250 ms.
Product exploration explored 100000 steps with 14856 reset in 246 ms.
Built C files in :
/tmp/ltsmin4095351022311224946
[2024-05-21 05:25:16] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2024-05-21 05:25:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 05:25:16] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2024-05-21 05:25:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 05:25:16] [INFO ] Computing Do-Not-Accords matrix : 80 transitions.
[2024-05-21 05:25:16] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 05:25:16] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4095351022311224946
Running compilation step : cd /tmp/ltsmin4095351022311224946;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 332 ms.
Running link step : cd /tmp/ltsmin4095351022311224946;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin4095351022311224946;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18341077599864966623.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 33 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-21 05:25:31] [INFO ] Invariant cache hit.
[2024-05-21 05:25:31] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 05:25:31] [INFO ] Invariant cache hit.
[2024-05-21 05:25:31] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-21 05:25:31] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-21 05:25:31] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-21 05:25:31] [INFO ] Invariant cache hit.
[2024-05-21 05:25:31] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 16/66 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 80/146 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 99 constraints, problems are : Problem set: 0 solved, 64 unsolved in 862 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 16/66 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 80/146 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 64/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 163 constraints, problems are : Problem set: 0 solved, 64 unsolved in 864 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 1747ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 1748ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1850 ms. Remains : 66/66 places, 80/80 transitions.
Built C files in :
/tmp/ltsmin2243884997420982635
[2024-05-21 05:25:33] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2024-05-21 05:25:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 05:25:33] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2024-05-21 05:25:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 05:25:33] [INFO ] Computing Do-Not-Accords matrix : 80 transitions.
[2024-05-21 05:25:33] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 05:25:33] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2243884997420982635
Running compilation step : cd /tmp/ltsmin2243884997420982635;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 227 ms.
Running link step : cd /tmp/ltsmin2243884997420982635;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2243884997420982635;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16255764101984811317.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 05:25:48] [INFO ] Flatten gal took : 5 ms
[2024-05-21 05:25:48] [INFO ] Flatten gal took : 8 ms
[2024-05-21 05:25:48] [INFO ] Time to serialize gal into /tmp/LTL5138937487397336642.gal : 2 ms
[2024-05-21 05:25:48] [INFO ] Time to serialize properties into /tmp/LTL1468564752598212384.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5138937487397336642.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6271360043278977675.hoa' '-atoms' '/tmp/LTL1468564752598212384.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1468564752598212384.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6271360043278977675.hoa
Detected timeout of ITS tools.
[2024-05-21 05:26:03] [INFO ] Flatten gal took : 5 ms
[2024-05-21 05:26:03] [INFO ] Flatten gal took : 4 ms
[2024-05-21 05:26:03] [INFO ] Time to serialize gal into /tmp/LTL3624198313174821926.gal : 1 ms
[2024-05-21 05:26:03] [INFO ] Time to serialize properties into /tmp/LTL3709006137887548786.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3624198313174821926.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3709006137887548786.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((((((G(F("(((((Client_Waiting_0>=1)||(Client_Waiting_1>=1))||((Client_Waiting_2>=1)||(Client_Waiting_3>=1)))||(((Client_Waiting_5...1217
Formula 0 simplified : G(!"(((((RequestBuffer_12>=1)&&(Server_Waiting>=1))||((RequestBuffer_7>=1)&&(Server_Waiting>=1)))||(((RequestBuffer_2>=1)&&(Server_W...1201
Detected timeout of ITS tools.
[2024-05-21 05:26:18] [INFO ] Flatten gal took : 3 ms
[2024-05-21 05:26:18] [INFO ] Applying decomposition
[2024-05-21 05:26:18] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7103955120842691348.txt' '-o' '/tmp/graph7103955120842691348.bin' '-w' '/tmp/graph7103955120842691348.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7103955120842691348.bin' '-l' '-1' '-v' '-w' '/tmp/graph7103955120842691348.weights' '-q' '0' '-e' '0.001'
[2024-05-21 05:26:18] [INFO ] Decomposing Gal with order
[2024-05-21 05:26:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 05:26:18] [INFO ] Removed a total of 36 redundant transitions.
[2024-05-21 05:26:18] [INFO ] Flatten gal took : 20 ms
[2024-05-21 05:26:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 05:26:18] [INFO ] Time to serialize gal into /tmp/LTL14091795405969971572.gal : 2 ms
[2024-05-21 05:26:18] [INFO ] Time to serialize properties into /tmp/LTL17378895542852784065.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14091795405969971572.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17378895542852784065.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((((((G(F("(((((u1.Client_Waiting_0>=1)||(u2.Client_Waiting_1>=1))||((u12.Client_Waiting_2>=1)||(u3.Client_Waiting_3>=1)))||(((u4....1455
Formula 0 simplified : G(!"(((((u9.RequestBuffer_12>=1)&&(i0.u11.Server_Waiting>=1))||((i0.u0.RequestBuffer_7>=1)&&(i0.u11.Server_Waiting>=1)))||(((u12.Req...1439
Detected timeout of ITS tools.
Treatment of property CSRepetitions-COL-04-LTLFireability-05 finished in 83723 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(!p0))))'
Support contains 32 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-21 05:26:33] [INFO ] Invariant cache hit.
[2024-05-21 05:26:33] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-21 05:26:33] [INFO ] Invariant cache hit.
[2024-05-21 05:26:33] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-21 05:26:33] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-21 05:26:33] [INFO ] Invariant cache hit.
[2024-05-21 05:26:33] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 16/66 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 80/146 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 99 constraints, problems are : Problem set: 0 solved, 64 unsolved in 882 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 16/66 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 80/146 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 64/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 163 constraints, problems are : Problem set: 0 solved, 64 unsolved in 857 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 1762ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 1763ms
Finished structural reductions in LTL mode , in 1 iterations and 1838 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 130 ms :[p0, p0, p0, true]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-06
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLFireability-06 finished in 1984 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(((X(p1)||p0)&&(!p2||X(X(p2))))))'
Support contains 17 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-21 05:26:35] [INFO ] Invariant cache hit.
[2024-05-21 05:26:35] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 05:26:35] [INFO ] Invariant cache hit.
[2024-05-21 05:26:35] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-21 05:26:35] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-21 05:26:35] [INFO ] Invariant cache hit.
[2024-05-21 05:26:35] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 16/66 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 80/146 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 99 constraints, problems are : Problem set: 0 solved, 64 unsolved in 915 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 16/66 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 80/146 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 64/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 163 constraints, problems are : Problem set: 0 solved, 64 unsolved in 942 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 1878ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 1879ms
Finished structural reductions in LTL mode , in 1 iterations and 1976 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-07
Product exploration explored 100000 steps with 14920 reset in 251 ms.
Product exploration explored 100000 steps with 14901 reset in 308 ms.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 460 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 7 to 3
RANDOM walk for 116 steps (1 resets) in 9 ms. (11 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p2) p1))), (F p1), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 7 factoid took 632 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
[2024-05-21 05:26:40] [INFO ] Invariant cache hit.
[2024-05-21 05:26:40] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2024-05-21 05:26:40] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-21 05:26:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 05:26:40] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2024-05-21 05:26:40] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-21 05:26:40] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-21 05:26:40] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-21 05:26:40] [INFO ] Computed and/alt/rep : 64/80/64 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-21 05:26:40] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 17 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-21 05:26:40] [INFO ] Invariant cache hit.
[2024-05-21 05:26:40] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 05:26:40] [INFO ] Invariant cache hit.
[2024-05-21 05:26:40] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-21 05:26:40] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-21 05:26:40] [INFO ] Invariant cache hit.
[2024-05-21 05:26:40] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 16/66 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 80/146 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 99 constraints, problems are : Problem set: 0 solved, 64 unsolved in 907 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 16/66 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 80/146 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 64/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 163 constraints, problems are : Problem set: 0 solved, 64 unsolved in 874 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 1799ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 1800ms
Finished structural reductions in LTL mode , in 1 iterations and 1900 ms. Remains : 66/66 places, 80/80 transitions.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 324 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 7 to 3
RANDOM walk for 203 steps (3 resets) in 8 ms. (22 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p2) p1))), (F p1), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 7 factoid took 546 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
[2024-05-21 05:26:44] [INFO ] Invariant cache hit.
[2024-05-21 05:26:44] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-05-21 05:26:44] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-21 05:26:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 05:26:44] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2024-05-21 05:26:44] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-21 05:26:44] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-21 05:26:44] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-21 05:26:44] [INFO ] Computed and/alt/rep : 64/80/64 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-21 05:26:44] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 14946 reset in 263 ms.
Product exploration explored 100000 steps with 14943 reset in 261 ms.
Built C files in :
/tmp/ltsmin14486045611957373391
[2024-05-21 05:26:45] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14486045611957373391
Running compilation step : cd /tmp/ltsmin14486045611957373391;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 189 ms.
Running link step : cd /tmp/ltsmin14486045611957373391;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin14486045611957373391;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8496943002884843310.hoa' '--buchi-type=spotba'
LTSmin run took 2297 ms.
FORMULA CSRepetitions-COL-04-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CSRepetitions-COL-04-LTLFireability-07 finished in 11984 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 16 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 34 transition count 64
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 63 place count 19 transition count 49
Iterating global reduction 0 with 15 rules applied. Total rules applied 78 place count 19 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 81 place count 17 transition count 48
Applied a total of 81 rules in 15 ms. Remains 17 /66 variables (removed 49) and now considering 48/80 (removed 32) transitions.
// Phase 1: matrix 48 rows 17 cols
[2024-05-21 05:26:47] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 05:26:47] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 05:26:47] [INFO ] Invariant cache hit.
[2024-05-21 05:26:47] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-05-21 05:26:47] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-21 05:26:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 48/64 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 1/65 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 0/65 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 17 constraints, problems are : Problem set: 0 solved, 32 unsolved in 207 ms.
Refiners :[State Equation: 17/17 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 48/64 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 1/65 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 32/49 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 49 constraints, problems are : Problem set: 0 solved, 32 unsolved in 189 ms.
Refiners :[State Equation: 17/17 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 400ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 400ms
Starting structural reductions in SI_LTL mode, iteration 1 : 17/66 places, 48/80 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 518 ms. Remains : 17/66 places, 48/80 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 70 ms.
Product exploration explored 100000 steps with 50000 reset in 70 ms.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-04-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-04-LTLFireability-12 finished in 725 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 16 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 34 transition count 64
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 63 place count 19 transition count 49
Iterating global reduction 0 with 15 rules applied. Total rules applied 78 place count 19 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 81 place count 17 transition count 48
Applied a total of 81 rules in 6 ms. Remains 17 /66 variables (removed 49) and now considering 48/80 (removed 32) transitions.
[2024-05-21 05:26:48] [INFO ] Invariant cache hit.
[2024-05-21 05:26:48] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-21 05:26:48] [INFO ] Invariant cache hit.
[2024-05-21 05:26:48] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-21 05:26:48] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-21 05:26:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 48/64 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 1/65 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 0/65 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 17 constraints, problems are : Problem set: 0 solved, 32 unsolved in 178 ms.
Refiners :[State Equation: 17/17 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 48/64 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 1/65 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 32/49 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 49 constraints, problems are : Problem set: 0 solved, 32 unsolved in 151 ms.
Refiners :[State Equation: 17/17 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 334ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 335ms
Starting structural reductions in SI_LTL mode, iteration 1 : 17/66 places, 48/80 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 396 ms. Remains : 17/66 places, 48/80 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-15
Stuttering criterion allowed to conclude after 32 steps with 2 reset in 0 ms.
FORMULA CSRepetitions-COL-04-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLFireability-15 finished in 471 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(F(!p1))||p0)))'
[2024-05-21 05:26:49] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
[2024-05-21 05:26:49] [INFO ] Applying decomposition
[2024-05-21 05:26:49] [INFO ] Flatten gal took : 5 ms
Built C files in :
/tmp/ltsmin2418554128203395510
[2024-05-21 05:26:49] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2024-05-21 05:26:49] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 05:26:49] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2024-05-21 05:26:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 05:26:49] [INFO ] Computing Do-Not-Accords matrix : 80 transitions.
[2024-05-21 05:26:49] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 05:26:49] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2418554128203395510
Running compilation step : cd /tmp/ltsmin2418554128203395510;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1045513770414026503.txt' '-o' '/tmp/graph1045513770414026503.bin' '-w' '/tmp/graph1045513770414026503.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1045513770414026503.bin' '-l' '-1' '-v' '-w' '/tmp/graph1045513770414026503.weights' '-q' '0' '-e' '0.001'
[2024-05-21 05:26:49] [INFO ] Decomposing Gal with order
[2024-05-21 05:26:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 05:26:49] [INFO ] Removed a total of 36 redundant transitions.
[2024-05-21 05:26:49] [INFO ] Flatten gal took : 9 ms
[2024-05-21 05:26:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 05:26:49] [INFO ] Time to serialize gal into /tmp/LTLFireability4257710029941017404.gal : 1 ms
[2024-05-21 05:26:49] [INFO ] Time to serialize properties into /tmp/LTLFireability9458142176110278540.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4257710029941017404.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9458142176110278540.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(("((((((u9.RequestBuffer_1>=1)&&(u0.Server_Waiting>=1))||((u4.RequestBuffer_6>=1)&&(u0.Server_Waiting>=1)))||(((u7.RequestBuffer_...1345
Formula 0 simplified : G(!"((((((u9.RequestBuffer_1>=1)&&(u0.Server_Waiting>=1))||((u4.RequestBuffer_6>=1)&&(u0.Server_Waiting>=1)))||(((u7.RequestBuffer_1...1333
Compilation finished in 200 ms.
Running link step : cd /tmp/ltsmin2418554128203395510;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2418554128203395510;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([](<>(!(LTLAPp1==true)))||(LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 9140 ms.
FORMULA CSRepetitions-COL-04-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 123381 ms.

BK_STOP 1716269218608

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CSRepetitions-COL-04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is CSRepetitions-COL-04, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r070-tall-171620505300196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-04.tgz
mv CSRepetitions-COL-04 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;