fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r267-smll-171654406300403
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for Philosophers-COL-000050

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
394.300 142980.00 180070.00 637.80 FTFFTFFFFFFFFTFF 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.r267-smll-171654406300403.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is Philosophers-COL-000050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654406300403
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 6.4K Apr 13 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 13 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 13 09:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 13 09:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.6K Apr 13 10:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 45K Apr 13 10:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 10:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Apr 13 10:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 12K May 18 16:43 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 Philosophers-COL-000050-LTLCardinality-00
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-01
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-02
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-03
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-04
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-05
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-06
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-07
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-08
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-09
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-10
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-11
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-12
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-13
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-14
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716850784236

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-000050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 22:59:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-27 22:59:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 22:59:46] [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-27 22:59:47] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 22:59:47] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1038 ms
[2024-05-27 22:59:47] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 250 PT places and 250.0 transition bindings in 31 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2024-05-27 22:59:48] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 7 ms.
[2024-05-27 22:59:48] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Philosophers-COL-000050-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000050-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000050-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000050-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40118 steps (767 resets) in 419 ms. (95 steps per ms) remains 2/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 365 ms. (109 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (160 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
// Phase 1: matrix 5 rows 5 cols
[2024-05-27 22:59:48] [INFO ] Computed 2 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp16 is UNSAT
After SMT solving in domain Real declared 5/10 variables, and 2 constraints, problems are : Problem set: 2 solved, 0 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 224ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA Philosophers-COL-000050-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000050-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 22:59:48] [INFO ] Flatten gal took : 19 ms
[2024-05-27 22:59:48] [INFO ] Flatten gal took : 4 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 50) 50) 50)]] contains successor/predecessor on variables of sort Philo
[2024-05-27 22:59:49] [INFO ] Unfolded HLPN to a Petri net with 250 places and 250 transitions 800 arcs in 32 ms.
[2024-05-27 22:59:49] [INFO ] Unfolded 10 HLPN properties in 1 ms.
Support contains 250 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 28 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2024-05-27 22:59:49] [INFO ] Computed 100 invariants in 19 ms
[2024-05-27 22:59:49] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-27 22:59:49] [INFO ] Invariant cache hit.
[2024-05-27 22:59:49] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-27 22:59:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 350 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9502 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 150/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 500 constraints, problems are : Problem set: 0 solved, 150 unsolved in 7480 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
After SMT, in 17099ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 17119ms
Finished structural reductions in LTL mode , in 1 iterations and 17647 ms. Remains : 250/250 places, 250/250 transitions.
Support contains 250 out of 250 places after structural reductions.
[2024-05-27 23:00:06] [INFO ] Flatten gal took : 56 ms
[2024-05-27 23:00:06] [INFO ] Flatten gal took : 42 ms
[2024-05-27 23:00:06] [INFO ] Input system was already deterministic with 250 transitions.
RANDOM walk for 15591 steps (2 resets) in 435 ms. (35 steps per ms) remains 0/15 properties
FORMULA Philosophers-COL-000050-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Philosophers-COL-000050-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 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' '!((G(p0)||F(p1)||X(G(p2))))'
Support contains 200 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 7 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-05-27 23:00:07] [INFO ] Invariant cache hit.
[2024-05-27 23:00:07] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-27 23:00:07] [INFO ] Invariant cache hit.
[2024-05-27 23:00:07] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-27 23:00:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 350 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9233 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 150/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 500 constraints, problems are : Problem set: 0 solved, 150 unsolved in 8068 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
After SMT, in 17346ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 17352ms
Finished structural reductions in LTL mode , in 1 iterations and 17735 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 447 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-COL-000050-LTLCardinality-00
Stuttering criterion allowed to conclude after 1084 steps with 5 reset in 50 ms.
FORMULA Philosophers-COL-000050-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000050-LTLCardinality-00 finished in 18315 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))||(G(p1)&&X(F(p2))))))'
Support contains 200 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 8 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-05-27 23:00:25] [INFO ] Invariant cache hit.
[2024-05-27 23:00:26] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-27 23:00:26] [INFO ] Invariant cache hit.
[2024-05-27 23:00:26] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-27 23:00:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 350 constraints, problems are : Problem set: 0 solved, 150 unsolved in 8207 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 150/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 500 constraints, problems are : Problem set: 0 solved, 150 unsolved in 8527 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
After SMT, in 16785ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 16791ms
Finished structural reductions in LTL mode , in 1 iterations and 17344 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 453 ms :[true, (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000050-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 641 steps with 0 reset in 11 ms.
FORMULA Philosophers-COL-000050-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000050-LTLCardinality-05 finished in 17839 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 50 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 200 transition count 200
Applied a total of 100 rules in 81 ms. Remains 200 /250 variables (removed 50) and now considering 200/250 (removed 50) transitions.
// Phase 1: matrix 200 rows 200 cols
[2024-05-27 23:00:43] [INFO ] Computed 100 invariants in 4 ms
[2024-05-27 23:00:44] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-27 23:00:44] [INFO ] Invariant cache hit.
[2024-05-27 23:00:44] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
[2024-05-27 23:00:44] [INFO ] Redundant transitions in 13 ms returned []
Running 100 sub problems to find dead transitions.
[2024-05-27 23:00:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 50/200 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 200/400 variables, 200/300 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 0/400 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 300 constraints, problems are : Problem set: 0 solved, 100 unsolved in 5915 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 50/200 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 200/400 variables, 200/300 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 100/400 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/400 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 400 constraints, problems are : Problem set: 0 solved, 100 unsolved in 4025 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 9984ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 9987ms
Starting structural reductions in SI_LTL mode, iteration 1 : 200/250 places, 200/250 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10828 ms. Remains : 200/250 places, 200/250 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000050-LTLCardinality-06
Stuttering criterion allowed to conclude after 7354 steps with 24 reset in 65 ms.
FORMULA Philosophers-COL-000050-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000050-LTLCardinality-06 finished in 11003 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 50 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 200 transition count 200
Applied a total of 100 rules in 42 ms. Remains 200 /250 variables (removed 50) and now considering 200/250 (removed 50) transitions.
[2024-05-27 23:00:54] [INFO ] Invariant cache hit.
[2024-05-27 23:00:54] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-27 23:00:54] [INFO ] Invariant cache hit.
[2024-05-27 23:00:55] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2024-05-27 23:00:55] [INFO ] Redundant transitions in 14 ms returned []
Running 100 sub problems to find dead transitions.
[2024-05-27 23:00:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 50/200 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 200/400 variables, 200/300 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 0/400 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 300 constraints, problems are : Problem set: 0 solved, 100 unsolved in 4773 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 50/200 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 200/400 variables, 200/300 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 100/400 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/400 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 400 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3851 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 8655ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 8659ms
Starting structural reductions in SI_LTL mode, iteration 1 : 200/250 places, 200/250 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9369 ms. Remains : 200/250 places, 200/250 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000050-LTLCardinality-07
Stuttering criterion allowed to conclude after 798 steps with 0 reset in 12 ms.
FORMULA Philosophers-COL-000050-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000050-LTLCardinality-07 finished in 9450 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 X(p1)))||G(p2))))'
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 4 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2024-05-27 23:01:04] [INFO ] Computed 100 invariants in 4 ms
[2024-05-27 23:01:04] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-27 23:01:04] [INFO ] Invariant cache hit.
[2024-05-27 23:01:04] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-27 23:01:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 350 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9327 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 150/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 500 constraints, problems are : Problem set: 0 solved, 150 unsolved in 7903 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
After SMT, in 17263ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 17265ms
Finished structural reductions in LTL mode , in 1 iterations and 17861 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Philosophers-COL-000050-LTLCardinality-08
Product exploration explored 100000 steps with 3738 reset in 2970 ms.
Stack based approach found an accepted trace after 17184 steps with 651 reset with depth 15 and stack size 15 in 538 ms.
FORMULA Philosophers-COL-000050-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000050-LTLCardinality-08 finished in 21566 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' '!((p0 U G((p1&&F(p2)))))'
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 12 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-05-27 23:01:25] [INFO ] Invariant cache hit.
[2024-05-27 23:01:25] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-27 23:01:25] [INFO ] Invariant cache hit.
[2024-05-27 23:01:26] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
[2024-05-27 23:01:26] [INFO ] Redundant transitions in 6 ms returned []
Running 150 sub problems to find dead transitions.
[2024-05-27 23:01:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 350 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9616 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 50/250 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 250/500 variables, 250/350 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 150/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 500 constraints, problems are : Problem set: 0 solved, 150 unsolved in 7867 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
After SMT, in 17534ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 17537ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18180 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000050-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 5081 steps with 329 reset in 96 ms.
FORMULA Philosophers-COL-000050-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000050-LTLCardinality-09 finished in 18473 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 50 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 200 transition count 200
Applied a total of 100 rules in 17 ms. Remains 200 /250 variables (removed 50) and now considering 200/250 (removed 50) transitions.
// Phase 1: matrix 200 rows 200 cols
[2024-05-27 23:01:44] [INFO ] Computed 100 invariants in 2 ms
[2024-05-27 23:01:44] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-27 23:01:44] [INFO ] Invariant cache hit.
[2024-05-27 23:01:45] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 866 ms to find 0 implicit places.
[2024-05-27 23:01:45] [INFO ] Redundant transitions in 4 ms returned []
Running 100 sub problems to find dead transitions.
[2024-05-27 23:01:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 50/200 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 200/400 variables, 200/300 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 0/400 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 300 constraints, problems are : Problem set: 0 solved, 100 unsolved in 5074 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 50/200 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 200/400 variables, 200/300 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 100/400 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/400 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 400 constraints, problems are : Problem set: 0 solved, 100 unsolved in 4970 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 10072ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 10075ms
Starting structural reductions in SI_LTL mode, iteration 1 : 200/250 places, 200/250 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10968 ms. Remains : 200/250 places, 200/250 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000050-LTLCardinality-10
Stuttering criterion allowed to conclude after 6497 steps with 2 reset in 36 ms.
FORMULA Philosophers-COL-000050-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000050-LTLCardinality-10 finished in 11097 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 50 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 200 transition count 200
Applied a total of 100 rules in 16 ms. Remains 200 /250 variables (removed 50) and now considering 200/250 (removed 50) transitions.
[2024-05-27 23:01:55] [INFO ] Invariant cache hit.
[2024-05-27 23:01:55] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-27 23:01:55] [INFO ] Invariant cache hit.
[2024-05-27 23:01:55] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
[2024-05-27 23:01:55] [INFO ] Redundant transitions in 1 ms returned []
Running 100 sub problems to find dead transitions.
[2024-05-27 23:01:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 50/200 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 200/400 variables, 200/300 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 0/400 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 300 constraints, problems are : Problem set: 0 solved, 100 unsolved in 5728 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 50/200 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 200/400 variables, 200/300 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 100/400 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/400 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 400 constraints, problems are : Problem set: 0 solved, 100 unsolved in 4036 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 9791ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 9794ms
Starting structural reductions in SI_LTL mode, iteration 1 : 200/250 places, 200/250 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10365 ms. Remains : 200/250 places, 200/250 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000050-LTLCardinality-14
Product exploration explored 100000 steps with 32887 reset in 1477 ms.
Stack based approach found an accepted trace after 286 steps with 85 reset with depth 3 and stack size 3 in 4 ms.
FORMULA Philosophers-COL-000050-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000050-LTLCardinality-14 finished in 11902 ms.
All properties solved by simple procedures.
Total runtime 140636 ms.
ITS solved all properties within timeout

BK_STOP 1716850927216

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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="Philosophers-COL-000050"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is Philosophers-COL-000050, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r267-smll-171654406300403"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000050.tgz
mv Philosophers-COL-000050 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;