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.r373-tall-171683789000327.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldPPPs-PT-100B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789000327
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 13 11:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 13 11:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 13 11:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 13 11:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.8M 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 ShieldPPPs-PT-100B-LTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716981186213

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-100B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-29 11:13:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 11:13:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 11:13:08] [INFO ] Load time of PNML (sax parser for PT used): 266 ms
[2024-05-29 11:13:08] [INFO ] Transformed 6803 places.
[2024-05-29 11:13:08] [INFO ] Transformed 6303 transitions.
[2024-05-29 11:13:08] [INFO ] Found NUPN structural information;
[2024-05-29 11:13:08] [INFO ] Parsed PT model containing 6803 places and 6303 transitions and 17406 arcs in 614 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 6803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6803/6803 places, 6303/6303 transitions.
Discarding 692 places :
Symmetric choice reduction at 0 with 692 rule applications. Total rules 692 place count 6111 transition count 5611
Iterating global reduction 0 with 692 rules applied. Total rules applied 1384 place count 6111 transition count 5611
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1385 place count 6110 transition count 5610
Iterating global reduction 0 with 1 rules applied. Total rules applied 1386 place count 6110 transition count 5610
Applied a total of 1386 rules in 2746 ms. Remains 6110 /6803 variables (removed 693) and now considering 5610/6303 (removed 693) transitions.
// Phase 1: matrix 5610 rows 6110 cols
[2024-05-29 11:13:12] [INFO ] Computed 1101 invariants in 63 ms
[2024-05-29 11:13:14] [INFO ] Implicit Places using invariants in 2774 ms returned []
[2024-05-29 11:13:14] [INFO ] Invariant cache hit.
[2024-05-29 11:13:17] [INFO ] Implicit Places using invariants and state equation in 2519 ms returned []
Implicit Place search using SMT with State Equation took 5334 ms to find 0 implicit places.
[2024-05-29 11:13:17] [INFO ] Invariant cache hit.
[2024-05-29 11:13:21] [INFO ] Dead Transitions using invariants and state equation in 4668 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6110/6803 places, 5610/6303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12752 ms. Remains : 6110/6803 places, 5610/6303 transitions.
Support contains 38 out of 6110 places after structural reductions.
[2024-05-29 11:13:22] [INFO ] Flatten gal took : 333 ms
[2024-05-29 11:13:22] [INFO ] Flatten gal took : 189 ms
[2024-05-29 11:13:23] [INFO ] Input system was already deterministic with 5610 transitions.
Support contains 37 out of 6110 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 523 ms. (steps per millisecond=19 ) properties (out of 23) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2024-05-29 11:13:24] [INFO ] Invariant cache hit.
[2024-05-29 11:13:26] [INFO ] [Real]Absence check using 1101 positive place invariants in 634 ms returned sat
[2024-05-29 11:13:26] [INFO ] After 2763ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-29 11:13:29] [INFO ] [Nat]Absence check using 1101 positive place invariants in 712 ms returned sat
[2024-05-29 11:13:37] [INFO ] After 7525ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2024-05-29 11:13:40] [INFO ] Deduced a trap composed of 19 places in 2688 ms of which 13 ms to minimize.
[2024-05-29 11:13:43] [INFO ] Deduced a trap composed of 22 places in 2622 ms of which 4 ms to minimize.
[2024-05-29 11:13:46] [INFO ] Deduced a trap composed of 17 places in 2581 ms of which 4 ms to minimize.
[2024-05-29 11:13:49] [INFO ] Deduced a trap composed of 16 places in 2713 ms of which 6 ms to minimize.
[2024-05-29 11:13:52] [INFO ] Deduced a trap composed of 30 places in 2629 ms of which 6 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 11:13:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 11:13:52] [INFO ] After 25208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
Fused 14 Parikh solutions to 12 different solutions.
Parikh walk visited 2 properties in 2929 ms.
Support contains 23 out of 6110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6110/6110 places, 5610/5610 transitions.
Drop transitions removed 695 transitions
Trivial Post-agglo rules discarded 695 transitions
Performed 695 trivial Post agglomeration. Transition count delta: 695
Iterating post reduction 0 with 695 rules applied. Total rules applied 695 place count 6110 transition count 4915
Reduce places removed 695 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 697 rules applied. Total rules applied 1392 place count 5415 transition count 4913
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1394 place count 5413 transition count 4913
Performed 496 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 496 Pre rules applied. Total rules applied 1394 place count 5413 transition count 4417
Deduced a syphon composed of 496 places in 25 ms
Reduce places removed 496 places and 0 transitions.
Iterating global reduction 3 with 992 rules applied. Total rules applied 2386 place count 4917 transition count 4417
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 2389 place count 4914 transition count 4414
Iterating global reduction 3 with 3 rules applied. Total rules applied 2392 place count 4914 transition count 4414
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 2392 place count 4914 transition count 4413
Deduced a syphon composed of 1 places in 27 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2394 place count 4913 transition count 4413
Performed 1793 Post agglomeration using F-continuation condition.Transition count delta: 1793
Deduced a syphon composed of 1793 places in 8 ms
Reduce places removed 1793 places and 0 transitions.
Iterating global reduction 3 with 3586 rules applied. Total rules applied 5980 place count 3120 transition count 2620
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 892 times.
Drop transitions removed 892 transitions
Iterating global reduction 3 with 892 rules applied. Total rules applied 6872 place count 3120 transition count 2620
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6873 place count 3119 transition count 2619
Applied a total of 6873 rules in 2340 ms. Remains 3119 /6110 variables (removed 2991) and now considering 2619/5610 (removed 2991) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2341 ms. Remains : 3119/6110 places, 2619/5610 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 449 ms. (steps per millisecond=22 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2619 rows 3119 cols
[2024-05-29 11:13:59] [INFO ] Computed 1101 invariants in 179 ms
[2024-05-29 11:14:00] [INFO ] [Real]Absence check using 1049 positive place invariants in 210 ms returned sat
[2024-05-29 11:14:00] [INFO ] [Real]Absence check using 1049 positive and 52 generalized place invariants in 14 ms returned sat
[2024-05-29 11:14:00] [INFO ] After 1150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-29 11:14:01] [INFO ] [Nat]Absence check using 1049 positive place invariants in 222 ms returned sat
[2024-05-29 11:14:01] [INFO ] [Nat]Absence check using 1049 positive and 52 generalized place invariants in 12 ms returned sat
[2024-05-29 11:14:04] [INFO ] After 2958ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-29 11:14:05] [INFO ] Deduced a trap composed of 12 places in 462 ms of which 1 ms to minimize.
[2024-05-29 11:14:05] [INFO ] Deduced a trap composed of 6 places in 397 ms of which 1 ms to minimize.
[2024-05-29 11:14:06] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 1 ms to minimize.
[2024-05-29 11:14:06] [INFO ] Deduced a trap composed of 6 places in 338 ms of which 1 ms to minimize.
[2024-05-29 11:14:07] [INFO ] Deduced a trap composed of 8 places in 329 ms of which 1 ms to minimize.
[2024-05-29 11:14:07] [INFO ] Deduced a trap composed of 8 places in 305 ms of which 0 ms to minimize.
[2024-05-29 11:14:07] [INFO ] Deduced a trap composed of 12 places in 302 ms of which 1 ms to minimize.
[2024-05-29 11:14:08] [INFO ] Deduced a trap composed of 6 places in 301 ms of which 0 ms to minimize.
[2024-05-29 11:14:08] [INFO ] Deduced a trap composed of 6 places in 291 ms of which 1 ms to minimize.
[2024-05-29 11:14:09] [INFO ] Deduced a trap composed of 6 places in 288 ms of which 1 ms to minimize.
[2024-05-29 11:14:09] [INFO ] Deduced a trap composed of 6 places in 309 ms of which 4 ms to minimize.
[2024-05-29 11:14:09] [INFO ] Deduced a trap composed of 4 places in 283 ms of which 1 ms to minimize.
[2024-05-29 11:14:10] [INFO ] Deduced a trap composed of 3 places in 274 ms of which 1 ms to minimize.
[2024-05-29 11:14:10] [INFO ] Deduced a trap composed of 6 places in 272 ms of which 1 ms to minimize.
[2024-05-29 11:14:10] [INFO ] Deduced a trap composed of 6 places in 274 ms of which 1 ms to minimize.
[2024-05-29 11:14:11] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 0 ms to minimize.
[2024-05-29 11:14:11] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 1 ms to minimize.
[2024-05-29 11:14:12] [INFO ] Deduced a trap composed of 4 places in 281 ms of which 1 ms to minimize.
[2024-05-29 11:14:12] [INFO ] Deduced a trap composed of 6 places in 235 ms of which 0 ms to minimize.
[2024-05-29 11:14:12] [INFO ] Deduced a trap composed of 6 places in 238 ms of which 1 ms to minimize.
[2024-05-29 11:14:13] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2024-05-29 11:14:13] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 1 ms to minimize.
[2024-05-29 11:14:13] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 0 ms to minimize.
[2024-05-29 11:14:14] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 2 ms to minimize.
[2024-05-29 11:14:14] [INFO ] Deduced a trap composed of 8 places in 204 ms of which 1 ms to minimize.
[2024-05-29 11:14:14] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 1 ms to minimize.
[2024-05-29 11:14:14] [INFO ] Deduced a trap composed of 8 places in 199 ms of which 1 ms to minimize.
[2024-05-29 11:14:15] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 0 ms to minimize.
[2024-05-29 11:14:15] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 3 ms to minimize.
[2024-05-29 11:14:15] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 1 ms to minimize.
[2024-05-29 11:14:15] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 1 ms to minimize.
[2024-05-29 11:14:15] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 0 ms to minimize.
[2024-05-29 11:14:16] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 1 ms to minimize.
[2024-05-29 11:14:16] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-05-29 11:14:16] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 11709 ms
[2024-05-29 11:14:16] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 2 ms to minimize.
[2024-05-29 11:14:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 296 ms
[2024-05-29 11:14:17] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 0 ms to minimize.
[2024-05-29 11:14:17] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
[2024-05-29 11:14:17] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 0 ms to minimize.
[2024-05-29 11:14:17] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-05-29 11:14:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 847 ms
[2024-05-29 11:14:18] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 0 ms to minimize.
[2024-05-29 11:14:18] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 1 ms to minimize.
[2024-05-29 11:14:18] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 1 ms to minimize.
[2024-05-29 11:14:19] [INFO ] Deduced a trap composed of 5 places in 212 ms of which 1 ms to minimize.
[2024-05-29 11:14:19] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 1 ms to minimize.
[2024-05-29 11:14:19] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 1 ms to minimize.
[2024-05-29 11:14:20] [INFO ] Deduced a trap composed of 5 places in 228 ms of which 1 ms to minimize.
[2024-05-29 11:14:20] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 1 ms to minimize.
[2024-05-29 11:14:20] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 1 ms to minimize.
[2024-05-29 11:14:21] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 1 ms to minimize.
[2024-05-29 11:14:21] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 0 ms to minimize.
[2024-05-29 11:14:21] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 2 ms to minimize.
[2024-05-29 11:14:22] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 1 ms to minimize.
[2024-05-29 11:14:22] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 1 ms to minimize.
[2024-05-29 11:14:22] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 0 ms to minimize.
[2024-05-29 11:14:22] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 0 ms to minimize.
[2024-05-29 11:14:23] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 0 ms to minimize.
[2024-05-29 11:14:23] [INFO ] Deduced a trap composed of 6 places in 195 ms of which 1 ms to minimize.
[2024-05-29 11:14:23] [INFO ] Deduced a trap composed of 16 places in 192 ms of which 1 ms to minimize.
[2024-05-29 11:14:23] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 1 ms to minimize.
[2024-05-29 11:14:24] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 1 ms to minimize.
[2024-05-29 11:14:24] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 6334 ms
[2024-05-29 11:14:24] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 1 ms to minimize.
[2024-05-29 11:14:25] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 1 ms to minimize.
[2024-05-29 11:14:25] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 0 ms to minimize.
[2024-05-29 11:14:25] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 5 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 11:14:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 11:14:25] [INFO ] After 25181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Parikh walk visited 0 properties in 1574 ms.
Support contains 15 out of 3119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3119/3119 places, 2619/2619 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 3119 transition count 2617
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 3117 transition count 2617
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 3117 transition count 2614
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 3114 transition count 2614
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 3111 transition count 2611
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 3111 transition count 2611
Applied a total of 19 rules in 452 ms. Remains 3111 /3119 variables (removed 8) and now considering 2611/2619 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 467 ms. Remains : 3111/3119 places, 2611/2619 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 580 ms. (steps per millisecond=17 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 61949 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61949 steps, saw 56954 distinct states, run finished after 3002 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2611 rows 3111 cols
[2024-05-29 11:14:32] [INFO ] Computed 1101 invariants in 27 ms
[2024-05-29 11:14:33] [INFO ] [Real]Absence check using 1041 positive place invariants in 200 ms returned sat
[2024-05-29 11:14:33] [INFO ] [Real]Absence check using 1041 positive and 60 generalized place invariants in 15 ms returned sat
[2024-05-29 11:14:33] [INFO ] After 1114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-29 11:14:34] [INFO ] [Nat]Absence check using 1041 positive place invariants in 223 ms returned sat
[2024-05-29 11:14:34] [INFO ] [Nat]Absence check using 1041 positive and 60 generalized place invariants in 13 ms returned sat
[2024-05-29 11:14:38] [INFO ] After 3460ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-29 11:14:39] [INFO ] Deduced a trap composed of 9 places in 453 ms of which 2 ms to minimize.
[2024-05-29 11:14:39] [INFO ] Deduced a trap composed of 6 places in 433 ms of which 1 ms to minimize.
[2024-05-29 11:14:40] [INFO ] Deduced a trap composed of 4 places in 418 ms of which 1 ms to minimize.
[2024-05-29 11:14:40] [INFO ] Deduced a trap composed of 5 places in 453 ms of which 1 ms to minimize.
[2024-05-29 11:14:41] [INFO ] Deduced a trap composed of 6 places in 454 ms of which 1 ms to minimize.
[2024-05-29 11:14:41] [INFO ] Deduced a trap composed of 6 places in 452 ms of which 1 ms to minimize.
[2024-05-29 11:14:42] [INFO ] Deduced a trap composed of 6 places in 436 ms of which 1 ms to minimize.
[2024-05-29 11:14:42] [INFO ] Deduced a trap composed of 4 places in 436 ms of which 1 ms to minimize.
[2024-05-29 11:14:43] [INFO ] Deduced a trap composed of 5 places in 436 ms of which 1 ms to minimize.
[2024-05-29 11:14:43] [INFO ] Deduced a trap composed of 3 places in 417 ms of which 1 ms to minimize.
[2024-05-29 11:14:44] [INFO ] Deduced a trap composed of 4 places in 411 ms of which 1 ms to minimize.
[2024-05-29 11:14:44] [INFO ] Deduced a trap composed of 4 places in 416 ms of which 1 ms to minimize.
[2024-05-29 11:14:45] [INFO ] Deduced a trap composed of 5 places in 390 ms of which 1 ms to minimize.
[2024-05-29 11:14:45] [INFO ] Deduced a trap composed of 4 places in 388 ms of which 1 ms to minimize.
[2024-05-29 11:14:46] [INFO ] Deduced a trap composed of 5 places in 367 ms of which 1 ms to minimize.
[2024-05-29 11:14:46] [INFO ] Deduced a trap composed of 6 places in 370 ms of which 2 ms to minimize.
[2024-05-29 11:14:47] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 1 ms to minimize.
[2024-05-29 11:14:47] [INFO ] Deduced a trap composed of 6 places in 299 ms of which 0 ms to minimize.
[2024-05-29 11:14:47] [INFO ] Deduced a trap composed of 6 places in 290 ms of which 1 ms to minimize.
[2024-05-29 11:14:48] [INFO ] Deduced a trap composed of 12 places in 279 ms of which 0 ms to minimize.
[2024-05-29 11:14:48] [INFO ] Deduced a trap composed of 8 places in 292 ms of which 1 ms to minimize.
[2024-05-29 11:14:49] [INFO ] Deduced a trap composed of 6 places in 298 ms of which 1 ms to minimize.
[2024-05-29 11:14:49] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 0 ms to minimize.
[2024-05-29 11:14:49] [INFO ] Deduced a trap composed of 6 places in 277 ms of which 1 ms to minimize.
[2024-05-29 11:14:50] [INFO ] Deduced a trap composed of 6 places in 261 ms of which 1 ms to minimize.
[2024-05-29 11:14:50] [INFO ] Deduced a trap composed of 8 places in 258 ms of which 1 ms to minimize.
[2024-05-29 11:14:50] [INFO ] Deduced a trap composed of 9 places in 220 ms of which 1 ms to minimize.
[2024-05-29 11:14:51] [INFO ] Deduced a trap composed of 11 places in 227 ms of which 1 ms to minimize.
[2024-05-29 11:14:51] [INFO ] Deduced a trap composed of 17 places in 216 ms of which 1 ms to minimize.
[2024-05-29 11:14:51] [INFO ] Deduced a trap composed of 6 places in 203 ms of which 1 ms to minimize.
[2024-05-29 11:14:52] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 1 ms to minimize.
[2024-05-29 11:14:52] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 1 ms to minimize.
[2024-05-29 11:14:52] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 1 ms to minimize.
[2024-05-29 11:14:52] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 1 ms to minimize.
[2024-05-29 11:14:53] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 1 ms to minimize.
[2024-05-29 11:14:53] [INFO ] Deduced a trap composed of 8 places in 210 ms of which 1 ms to minimize.
[2024-05-29 11:14:53] [INFO ] Deduced a trap composed of 8 places in 194 ms of which 0 ms to minimize.
[2024-05-29 11:14:54] [INFO ] Deduced a trap composed of 28 places in 193 ms of which 0 ms to minimize.
[2024-05-29 11:14:54] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 15696 ms
[2024-05-29 11:14:54] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 0 ms to minimize.
[2024-05-29 11:14:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 365 ms
[2024-05-29 11:14:55] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 1 ms to minimize.
[2024-05-29 11:14:55] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 1 ms to minimize.
[2024-05-29 11:14:55] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 0 ms to minimize.
[2024-05-29 11:14:56] [INFO ] Deduced a trap composed of 5 places in 191 ms of which 0 ms to minimize.
[2024-05-29 11:14:56] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-05-29 11:14:56] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 0 ms to minimize.
[2024-05-29 11:14:56] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 0 ms to minimize.
[2024-05-29 11:14:57] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2084 ms
[2024-05-29 11:14:57] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 0 ms to minimize.
[2024-05-29 11:14:57] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2024-05-29 11:14:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 545 ms
[2024-05-29 11:14:58] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 0 ms to minimize.
[2024-05-29 11:14:58] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 1 ms to minimize.
[2024-05-29 11:14:58] [INFO ] Deduced a trap composed of 8 places in 208 ms of which 1 ms to minimize.
[2024-05-29 11:14:58] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 909 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 11:14:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 11:14:58] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Parikh walk visited 0 properties in 1464 ms.
Support contains 15 out of 3111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3111/3111 places, 2611/2611 transitions.
Applied a total of 0 rules in 203 ms. Remains 3111 /3111 variables (removed 0) and now considering 2611/2611 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 3111/3111 places, 2611/2611 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3111/3111 places, 2611/2611 transitions.
Applied a total of 0 rules in 219 ms. Remains 3111 /3111 variables (removed 0) and now considering 2611/2611 (removed 0) transitions.
[2024-05-29 11:15:00] [INFO ] Invariant cache hit.
[2024-05-29 11:15:03] [INFO ] Implicit Places using invariants in 2485 ms returned []
[2024-05-29 11:15:03] [INFO ] Invariant cache hit.
[2024-05-29 11:15:10] [INFO ] Implicit Places using invariants and state equation in 7718 ms returned []
Implicit Place search using SMT with State Equation took 10204 ms to find 0 implicit places.
[2024-05-29 11:15:10] [INFO ] Redundant transitions in 194 ms returned []
[2024-05-29 11:15:10] [INFO ] Invariant cache hit.
[2024-05-29 11:15:13] [INFO ] Dead Transitions using invariants and state equation in 2147 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12772 ms. Remains : 3111/3111 places, 2611/2611 transitions.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1203 stabilizing places and 1203 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U p1)||F(p2))))'
Support contains 3 out of 6110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6110/6110 places, 5610/5610 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6109 transition count 4908
Reduce places removed 701 places and 0 transitions.
Iterating post reduction 1 with 701 rules applied. Total rules applied 1402 place count 5408 transition count 4908
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1402 place count 5408 transition count 4408
Deduced a syphon composed of 500 places in 22 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2402 place count 4908 transition count 4408
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 2409 place count 4901 transition count 4401
Iterating global reduction 2 with 7 rules applied. Total rules applied 2416 place count 4901 transition count 4401
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2416 place count 4901 transition count 4399
Deduced a syphon composed of 2 places in 20 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2420 place count 4899 transition count 4399
Performed 1794 Post agglomeration using F-continuation condition.Transition count delta: 1794
Deduced a syphon composed of 1794 places in 7 ms
Reduce places removed 1794 places and 0 transitions.
Iterating global reduction 2 with 3588 rules applied. Total rules applied 6008 place count 3105 transition count 2605
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6010 place count 3103 transition count 2603
Applied a total of 6010 rules in 2094 ms. Remains 3103 /6110 variables (removed 3007) and now considering 2603/5610 (removed 3007) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2024-05-29 11:15:15] [INFO ] Computed 1101 invariants in 13 ms
[2024-05-29 11:15:17] [INFO ] Implicit Places using invariants in 2119 ms returned []
[2024-05-29 11:15:17] [INFO ] Invariant cache hit.
[2024-05-29 11:15:22] [INFO ] Implicit Places using invariants and state equation in 4602 ms returned []
Implicit Place search using SMT with State Equation took 6725 ms to find 0 implicit places.
[2024-05-29 11:15:22] [INFO ] Redundant transitions in 138 ms returned []
[2024-05-29 11:15:22] [INFO ] Invariant cache hit.
[2024-05-29 11:15:24] [INFO ] Dead Transitions using invariants and state equation in 1970 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3103/6110 places, 2603/5610 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10934 ms. Remains : 3103/6110 places, 2603/5610 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s114 1), p0:(OR (EQ s1684 0) (EQ s964 1)), p2:(AND (EQ s964 0) (EQ s1684 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 14853 steps with 2 reset in 325 ms.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-01 finished in 11602 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||F(p1))))'
Support contains 5 out of 6110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6110/6110 places, 5610/5610 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 6103 transition count 5603
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 6103 transition count 5603
Applied a total of 14 rules in 1961 ms. Remains 6103 /6110 variables (removed 7) and now considering 5603/5610 (removed 7) transitions.
// Phase 1: matrix 5603 rows 6103 cols
[2024-05-29 11:15:27] [INFO ] Computed 1101 invariants in 29 ms
[2024-05-29 11:15:29] [INFO ] Implicit Places using invariants in 2617 ms returned []
[2024-05-29 11:15:29] [INFO ] Invariant cache hit.
[2024-05-29 11:15:32] [INFO ] Implicit Places using invariants and state equation in 2438 ms returned []
Implicit Place search using SMT with State Equation took 5057 ms to find 0 implicit places.
[2024-05-29 11:15:32] [INFO ] Invariant cache hit.
[2024-05-29 11:15:36] [INFO ] Dead Transitions using invariants and state equation in 4088 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6103/6110 places, 5603/5610 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11111 ms. Remains : 6103/6110 places, 5603/5610 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s2687 0) (EQ s4841 1) (EQ s5913 1)), p0:(AND (EQ s5269 0) (EQ s1104 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 4042 ms.
Product exploration explored 100000 steps with 50000 reset in 3984 ms.
Computed a total of 1200 stabilizing places and 1200 stable transitions
Computed a total of 1200 stabilizing places and 1200 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-100B-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-03 finished in 19505 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(((p1||X(p2))&&(X(p2)||F(p3)))))||p0)))'
Support contains 8 out of 6110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6110/6110 places, 5610/5610 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 6105 transition count 5605
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 6105 transition count 5605
Applied a total of 10 rules in 1910 ms. Remains 6105 /6110 variables (removed 5) and now considering 5605/5610 (removed 5) transitions.
// Phase 1: matrix 5605 rows 6105 cols
[2024-05-29 11:15:46] [INFO ] Computed 1101 invariants in 23 ms
[2024-05-29 11:15:49] [INFO ] Implicit Places using invariants in 2611 ms returned []
[2024-05-29 11:15:49] [INFO ] Invariant cache hit.
[2024-05-29 11:15:51] [INFO ] Implicit Places using invariants and state equation in 2350 ms returned []
Implicit Place search using SMT with State Equation took 4963 ms to find 0 implicit places.
[2024-05-29 11:15:51] [INFO ] Invariant cache hit.
[2024-05-29 11:15:56] [INFO ] Dead Transitions using invariants and state equation in 4616 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6105/6110 places, 5605/5610 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11491 ms. Remains : 6105/6110 places, 5605/5610 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), false, (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p0:(OR (EQ s5128 0) (EQ s3215 1)), p1:(AND (EQ s684 0) (EQ s2378 1)), p3:(OR (EQ s4165 0) (EQ s603 1)), p2:(OR (EQ s4112 0) (EQ s2846 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3977 ms.
Product exploration explored 100000 steps with 50000 reset in 3974 ms.
Computed a total of 1200 stabilizing places and 1200 stable transitions
Computed a total of 1200 stabilizing places and 1200 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p3 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X p0), true, (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p2)), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 22 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-100B-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-04 finished in 19882 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 6110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6110/6110 places, 5610/5610 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 6102 transition count 5602
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 6102 transition count 5602
Applied a total of 16 rules in 1870 ms. Remains 6102 /6110 variables (removed 8) and now considering 5602/5610 (removed 8) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2024-05-29 11:16:06] [INFO ] Computed 1101 invariants in 23 ms
[2024-05-29 11:16:08] [INFO ] Implicit Places using invariants in 2574 ms returned []
[2024-05-29 11:16:08] [INFO ] Invariant cache hit.
[2024-05-29 11:16:11] [INFO ] Implicit Places using invariants and state equation in 2535 ms returned []
Implicit Place search using SMT with State Equation took 5110 ms to find 0 implicit places.
[2024-05-29 11:16:11] [INFO ] Invariant cache hit.
[2024-05-29 11:16:15] [INFO ] Dead Transitions using invariants and state equation in 4500 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6110 places, 5602/5610 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11488 ms. Remains : 6102/6110 places, 5602/5610 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s2578 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-06 finished in 11642 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 6 out of 6110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6110/6110 places, 5610/5610 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 6109 transition count 4910
Reduce places removed 699 places and 0 transitions.
Iterating post reduction 1 with 699 rules applied. Total rules applied 1398 place count 5410 transition count 4910
Performed 497 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 497 Pre rules applied. Total rules applied 1398 place count 5410 transition count 4413
Deduced a syphon composed of 497 places in 21 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 2 with 994 rules applied. Total rules applied 2392 place count 4913 transition count 4413
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 2400 place count 4905 transition count 4405
Iterating global reduction 2 with 8 rules applied. Total rules applied 2408 place count 4905 transition count 4405
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2408 place count 4905 transition count 4403
Deduced a syphon composed of 2 places in 21 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2412 place count 4903 transition count 4403
Performed 1793 Post agglomeration using F-continuation condition.Transition count delta: 1793
Deduced a syphon composed of 1793 places in 7 ms
Reduce places removed 1793 places and 0 transitions.
Iterating global reduction 2 with 3586 rules applied. Total rules applied 5998 place count 3110 transition count 2610
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6000 place count 3108 transition count 2608
Applied a total of 6000 rules in 2027 ms. Remains 3108 /6110 variables (removed 3002) and now considering 2608/5610 (removed 3002) transitions.
// Phase 1: matrix 2608 rows 3108 cols
[2024-05-29 11:16:18] [INFO ] Computed 1101 invariants in 7 ms
[2024-05-29 11:16:20] [INFO ] Implicit Places using invariants in 2152 ms returned []
[2024-05-29 11:16:20] [INFO ] Invariant cache hit.
[2024-05-29 11:16:25] [INFO ] Implicit Places using invariants and state equation in 4730 ms returned []
Implicit Place search using SMT with State Equation took 6883 ms to find 0 implicit places.
[2024-05-29 11:16:25] [INFO ] Redundant transitions in 71 ms returned []
[2024-05-29 11:16:25] [INFO ] Invariant cache hit.
[2024-05-29 11:16:27] [INFO ] Dead Transitions using invariants and state equation in 2141 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3108/6110 places, 2608/5610 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11131 ms. Remains : 3108/6110 places, 2608/5610 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (OR (EQ s2180 0) (EQ s1178 1))) (NOT (OR (EQ s2703 0) (EQ s2205 1))) (OR (EQ s2047 0) (EQ s1038 1))), p0:(OR (EQ s2703 0) (EQ s2205 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11337 steps with 2 reset in 199 ms.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-08 finished in 11433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||X(F((!p0&&F(p0))))) U X(G(p0))))'
Support contains 2 out of 6110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6110/6110 places, 5610/5610 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6109 transition count 4908
Reduce places removed 701 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 702 rules applied. Total rules applied 1403 place count 5408 transition count 4907
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1404 place count 5407 transition count 4907
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 1404 place count 5407 transition count 4407
Deduced a syphon composed of 500 places in 21 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 2404 place count 4907 transition count 4407
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2412 place count 4899 transition count 4399
Iterating global reduction 3 with 8 rules applied. Total rules applied 2420 place count 4899 transition count 4399
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 2420 place count 4899 transition count 4397
Deduced a syphon composed of 2 places in 19 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 2424 place count 4897 transition count 4397
Performed 1795 Post agglomeration using F-continuation condition.Transition count delta: 1795
Deduced a syphon composed of 1795 places in 6 ms
Reduce places removed 1795 places and 0 transitions.
Iterating global reduction 3 with 3590 rules applied. Total rules applied 6014 place count 3102 transition count 2602
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6016 place count 3100 transition count 2600
Applied a total of 6016 rules in 1996 ms. Remains 3100 /6110 variables (removed 3010) and now considering 2600/5610 (removed 3010) transitions.
// Phase 1: matrix 2600 rows 3100 cols
[2024-05-29 11:16:29] [INFO ] Computed 1101 invariants in 5 ms
[2024-05-29 11:16:31] [INFO ] Implicit Places using invariants in 2113 ms returned []
[2024-05-29 11:16:31] [INFO ] Invariant cache hit.
[2024-05-29 11:16:36] [INFO ] Implicit Places using invariants and state equation in 4527 ms returned []
Implicit Place search using SMT with State Equation took 6642 ms to find 0 implicit places.
[2024-05-29 11:16:36] [INFO ] Redundant transitions in 72 ms returned []
[2024-05-29 11:16:36] [INFO ] Invariant cache hit.
[2024-05-29 11:16:38] [INFO ] Dead Transitions using invariants and state equation in 2066 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3100/6110 places, 2600/5610 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10783 ms. Remains : 3100/6110 places, 2600/5610 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s2243 0) (EQ s1302 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 15 reset in 1762 ms.
Product exploration explored 100000 steps with 15 reset in 2280 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 1924 steps, including 0 resets, run visited all 1 properties in 35 ms. (steps per millisecond=54 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 3100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 191 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-29 11:16:42] [INFO ] Invariant cache hit.
[2024-05-29 11:16:45] [INFO ] Implicit Places using invariants in 2102 ms returned []
[2024-05-29 11:16:45] [INFO ] Invariant cache hit.
[2024-05-29 11:16:49] [INFO ] Implicit Places using invariants and state equation in 4287 ms returned []
Implicit Place search using SMT with State Equation took 6393 ms to find 0 implicit places.
[2024-05-29 11:16:49] [INFO ] Redundant transitions in 69 ms returned []
[2024-05-29 11:16:49] [INFO ] Invariant cache hit.
[2024-05-29 11:16:51] [INFO ] Dead Transitions using invariants and state equation in 2050 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8708 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 1962 steps, including 0 resets, run visited all 1 properties in 40 ms. (steps per millisecond=49 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14 reset in 1736 ms.
Stuttering criterion allowed to conclude after 93728 steps with 13 reset in 2086 ms.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-09 finished in 28194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X((F(p0)||p1)))))'
Support contains 3 out of 6110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6110/6110 places, 5610/5610 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 6102 transition count 5602
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 6102 transition count 5602
Applied a total of 16 rules in 1881 ms. Remains 6102 /6110 variables (removed 8) and now considering 5602/5610 (removed 8) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2024-05-29 11:16:57] [INFO ] Computed 1101 invariants in 25 ms
[2024-05-29 11:17:00] [INFO ] Implicit Places using invariants in 2530 ms returned []
[2024-05-29 11:17:00] [INFO ] Invariant cache hit.
[2024-05-29 11:17:02] [INFO ] Implicit Places using invariants and state equation in 2533 ms returned []
Implicit Place search using SMT with State Equation took 5065 ms to find 0 implicit places.
[2024-05-29 11:17:02] [INFO ] Invariant cache hit.
[2024-05-29 11:17:06] [INFO ] Dead Transitions using invariants and state equation in 4167 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6110 places, 5602/5610 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11114 ms. Remains : 6102/6110 places, 5602/5610 transitions.
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}]], initial=1, aps=[p0:(EQ s1734 1), p1:(OR (EQ s413 0) (EQ s5364 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2698 ms.
Product exploration explored 100000 steps with 33333 reset in 2707 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-100B-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-12 finished in 16936 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 6110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6110/6110 places, 5610/5610 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 6109 transition count 4909
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 5409 transition count 4909
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 1400 place count 5409 transition count 4408
Deduced a syphon composed of 501 places in 21 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2402 place count 4908 transition count 4408
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 2408 place count 4902 transition count 4402
Iterating global reduction 2 with 6 rules applied. Total rules applied 2414 place count 4902 transition count 4402
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2414 place count 4902 transition count 4401
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2416 place count 4901 transition count 4401
Performed 1795 Post agglomeration using F-continuation condition.Transition count delta: 1795
Deduced a syphon composed of 1795 places in 6 ms
Reduce places removed 1795 places and 0 transitions.
Iterating global reduction 2 with 3590 rules applied. Total rules applied 6006 place count 3106 transition count 2606
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6008 place count 3104 transition count 2604
Applied a total of 6008 rules in 2004 ms. Remains 3104 /6110 variables (removed 3006) and now considering 2604/5610 (removed 3006) transitions.
// Phase 1: matrix 2604 rows 3104 cols
[2024-05-29 11:17:14] [INFO ] Computed 1101 invariants in 13 ms
[2024-05-29 11:17:16] [INFO ] Implicit Places using invariants in 2181 ms returned []
[2024-05-29 11:17:16] [INFO ] Invariant cache hit.
[2024-05-29 11:17:21] [INFO ] Implicit Places using invariants and state equation in 4604 ms returned []
Implicit Place search using SMT with State Equation took 6787 ms to find 0 implicit places.
[2024-05-29 11:17:21] [INFO ] Redundant transitions in 72 ms returned []
[2024-05-29 11:17:21] [INFO ] Invariant cache hit.
[2024-05-29 11:17:23] [INFO ] Dead Transitions using invariants and state equation in 1967 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3104/6110 places, 2604/5610 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10836 ms. Remains : 3104/6110 places, 2604/5610 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s211 0) (EQ s2877 1)), p0:(EQ s170 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 21 reset in 1746 ms.
Product exploration explored 100000 steps with 19 reset in 2262 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 1 factoid took 268 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 2) seen :1
Finished Best-First random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 315 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 3104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 189 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2024-05-29 11:17:28] [INFO ] Invariant cache hit.
[2024-05-29 11:17:30] [INFO ] Implicit Places using invariants in 2177 ms returned []
[2024-05-29 11:17:31] [INFO ] Invariant cache hit.
[2024-05-29 11:17:35] [INFO ] Implicit Places using invariants and state equation in 4424 ms returned []
Implicit Place search using SMT with State Equation took 6619 ms to find 0 implicit places.
[2024-05-29 11:17:35] [INFO ] Redundant transitions in 72 ms returned []
[2024-05-29 11:17:35] [INFO ] Invariant cache hit.
[2024-05-29 11:17:37] [INFO ] Dead Transitions using invariants and state equation in 2106 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8997 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 1 factoid took 481 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 3336 steps, including 1 resets, run visited all 2 properties in 62 ms. (steps per millisecond=53 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 259 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 19 reset in 1725 ms.
Product exploration explored 100000 steps with 21 reset in 2237 ms.
Built C files in :
/tmp/ltsmin3494724036676880800
[2024-05-29 11:17:42] [INFO ] Too many transitions (2604) to apply POR reductions. Disabling POR matrices.
[2024-05-29 11:17:42] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3494724036676880800
Running compilation step : cd /tmp/ltsmin3494724036676880800;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3494724036676880800;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3494724036676880800;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 3104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 212 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2024-05-29 11:17:46] [INFO ] Invariant cache hit.
[2024-05-29 11:17:48] [INFO ] Implicit Places using invariants in 2208 ms returned []
[2024-05-29 11:17:48] [INFO ] Invariant cache hit.
[2024-05-29 11:17:52] [INFO ] Implicit Places using invariants and state equation in 4537 ms returned []
Implicit Place search using SMT with State Equation took 6748 ms to find 0 implicit places.
[2024-05-29 11:17:52] [INFO ] Redundant transitions in 71 ms returned []
[2024-05-29 11:17:52] [INFO ] Invariant cache hit.
[2024-05-29 11:17:55] [INFO ] Dead Transitions using invariants and state equation in 2247 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9286 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Built C files in :
/tmp/ltsmin14103791858679434339
[2024-05-29 11:17:55] [INFO ] Too many transitions (2604) to apply POR reductions. Disabling POR matrices.
[2024-05-29 11:17:55] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14103791858679434339
Running compilation step : cd /tmp/ltsmin14103791858679434339;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14103791858679434339;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14103791858679434339;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 11:17:58] [INFO ] Flatten gal took : 99 ms
[2024-05-29 11:17:58] [INFO ] Flatten gal took : 99 ms
[2024-05-29 11:17:58] [INFO ] Time to serialize gal into /tmp/LTL11330799141049396337.gal : 20 ms
[2024-05-29 11:17:58] [INFO ] Time to serialize properties into /tmp/LTL5414342493160210514.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11330799141049396337.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6991479342315425428.hoa' '-atoms' '/tmp/LTL5414342493160210514.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5414342493160210514.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6991479342315425428.hoa
Detected timeout of ITS tools.
[2024-05-29 11:18:13] [INFO ] Flatten gal took : 87 ms
[2024-05-29 11:18:14] [INFO ] Flatten gal took : 88 ms
[2024-05-29 11:18:14] [INFO ] Time to serialize gal into /tmp/LTL597874577831311633.gal : 15 ms
[2024-05-29 11:18:14] [INFO ] Time to serialize properties into /tmp/LTL10868415347424659207.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL597874577831311633.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10868415347424659207.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p463==1)")||(G("((p546==0)||(p6304==1))"))))))
Formula 0 simplified : G(F!"((p546==0)||(p6304==1))" & FG!"(p463==1)")
Detected timeout of ITS tools.
[2024-05-29 11:18:29] [INFO ] Flatten gal took : 82 ms
[2024-05-29 11:18:29] [INFO ] Applying decomposition
[2024-05-29 11:18:29] [INFO ] Flatten gal took : 83 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph18291496953722278553.txt' '-o' '/tmp/graph18291496953722278553.bin' '-w' '/tmp/graph18291496953722278553.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18291496953722278553.bin' '-l' '-1' '-v' '-w' '/tmp/graph18291496953722278553.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:18:29] [INFO ] Decomposing Gal with order
[2024-05-29 11:18:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:18:30] [INFO ] Removed a total of 601 redundant transitions.
[2024-05-29 11:18:30] [INFO ] Flatten gal took : 206 ms
[2024-05-29 11:18:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 1196 labels/synchronizations in 35 ms.
[2024-05-29 11:18:30] [INFO ] Time to serialize gal into /tmp/LTL16925618235898797736.gal : 37 ms
[2024-05-29 11:18:30] [INFO ] Time to serialize properties into /tmp/LTL7523208579146646846.ltl : 31 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16925618235898797736.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7523208579146646846.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i3.i0.i1.u61.p463==1)")||(G("((i3.i1.i0.u75.p546==0)||(i52.u1021.p6304==1))"))))))
Formula 0 simplified : G(F!"((i3.i1.i0.u75.p546==0)||(i52.u1021.p6304==1))" & FG!"(i3.i0.i1.u61.p463==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11409554960823957806
[2024-05-29 11:18:45] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11409554960823957806
Running compilation step : cd /tmp/ltsmin11409554960823957806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11409554960823957806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11409554960823957806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-13 finished in 95829 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 2 out of 6110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6110/6110 places, 5610/5610 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 6103 transition count 5603
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 6103 transition count 5603
Applied a total of 14 rules in 2083 ms. Remains 6103 /6110 variables (removed 7) and now considering 5603/5610 (removed 7) transitions.
// Phase 1: matrix 5603 rows 6103 cols
[2024-05-29 11:18:50] [INFO ] Computed 1101 invariants in 27 ms
[2024-05-29 11:18:53] [INFO ] Implicit Places using invariants in 2672 ms returned []
[2024-05-29 11:18:53] [INFO ] Invariant cache hit.
[2024-05-29 11:18:55] [INFO ] Implicit Places using invariants and state equation in 2379 ms returned []
Implicit Place search using SMT with State Equation took 5053 ms to find 0 implicit places.
[2024-05-29 11:18:55] [INFO ] Invariant cache hit.
[2024-05-29 11:19:00] [INFO ] Dead Transitions using invariants and state equation in 4386 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6103/6110 places, 5603/5610 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11528 ms. Remains : 6103/6110 places, 5603/5610 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s4969 0) (EQ s4111 1)), p0:(AND (EQ s4111 0) (EQ s4969 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 501 steps with 0 reset in 4 ms.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-14 finished in 11733 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1&&X(p2))))'
Support contains 3 out of 6110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6110/6110 places, 5610/5610 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 6103 transition count 5603
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 6103 transition count 5603
Applied a total of 14 rules in 1927 ms. Remains 6103 /6110 variables (removed 7) and now considering 5603/5610 (removed 7) transitions.
// Phase 1: matrix 5603 rows 6103 cols
[2024-05-29 11:19:02] [INFO ] Computed 1101 invariants in 19 ms
[2024-05-29 11:19:04] [INFO ] Implicit Places using invariants in 2639 ms returned []
[2024-05-29 11:19:04] [INFO ] Invariant cache hit.
[2024-05-29 11:19:07] [INFO ] Implicit Places using invariants and state equation in 2615 ms returned []
Implicit Place search using SMT with State Equation took 5256 ms to find 0 implicit places.
[2024-05-29 11:19:07] [INFO ] Invariant cache hit.
[2024-05-29 11:19:12] [INFO ] Dead Transitions using invariants and state equation in 4671 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6103/6110 places, 5603/5610 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11857 ms. Remains : 6103/6110 places, 5603/5610 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s2874 1), p0:(NEQ s2967 1), p2:(AND (EQ s3740 1) (NEQ s2874 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8669 steps with 0 reset in 150 ms.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-15 finished in 12198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
[2024-05-29 11:19:12] [INFO ] Flatten gal took : 142 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4769697000886749384
[2024-05-29 11:19:12] [INFO ] Too many transitions (5610) to apply POR reductions. Disabling POR matrices.
[2024-05-29 11:19:12] [INFO ] Applying decomposition
[2024-05-29 11:19:12] [INFO ] Built C files in 109ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4769697000886749384
Running compilation step : cd /tmp/ltsmin4769697000886749384;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 11:19:13] [INFO ] Flatten gal took : 143 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13297926299273339066.txt' '-o' '/tmp/graph13297926299273339066.bin' '-w' '/tmp/graph13297926299273339066.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13297926299273339066.bin' '-l' '-1' '-v' '-w' '/tmp/graph13297926299273339066.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:19:13] [INFO ] Decomposing Gal with order
[2024-05-29 11:19:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:19:15] [INFO ] Removed a total of 900 redundant transitions.
[2024-05-29 11:19:15] [INFO ] Flatten gal took : 252 ms
[2024-05-29 11:19:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 22 ms.
[2024-05-29 11:19:15] [INFO ] Time to serialize gal into /tmp/LTLCardinality4830159193708847653.gal : 48 ms
[2024-05-29 11:19:15] [INFO ] Time to serialize properties into /tmp/LTLCardinality13276060054093361602.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4830159193708847653.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13276060054093361602.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i3.u168.p463==1)")||(G("((i4.u197.p546==0)||(i64.u2227.p6304==1))"))))))
Formula 0 simplified : G(F!"((i4.u197.p546==0)||(i64.u2227.p6304==1))" & FG!"(i3.u168.p463==1)")
Compilation finished in 22925 ms.
Running link step : cd /tmp/ltsmin4769697000886749384;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 252 ms.
Running LTSmin : cd /tmp/ltsmin4769697000886749384;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-29 11:41:19] [INFO ] Applying decomposition
[2024-05-29 11:41:20] [INFO ] Flatten gal took : 1312 ms
[2024-05-29 11:41:21] [INFO ] Decomposing Gal with order
[2024-05-29 11:41:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:41:33] [INFO ] Removed a total of 600 redundant transitions.
[2024-05-29 11:41:33] [INFO ] Flatten gal took : 497 ms
[2024-05-29 11:41:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 173 ms.
[2024-05-29 11:41:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality4165751730206083062.gal : 177 ms
[2024-05-29 11:41:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality4097277625414390623.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4165751730206083062.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4097277625414390623.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...718
Formula 0 simplified : G(F!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...711
Detected timeout of ITS tools.
[2024-05-29 12:03:41] [INFO ] Flatten gal took : 1531 ms
[2024-05-29 12:03:43] [INFO ] Input system was already deterministic with 5610 transitions.
[2024-05-29 12:03:43] [INFO ] Transformed 6110 places.
[2024-05-29 12:03:43] [INFO ] Transformed 5610 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-29 12:03:53] [INFO ] Time to serialize gal into /tmp/LTLCardinality5809705292227549592.gal : 51 ms
[2024-05-29 12:03:53] [INFO ] Time to serialize properties into /tmp/LTLCardinality3705164059498733180.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5809705292227549592.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3705164059498733180.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("(p463==1)")||(G("((p546==0)||(p6304==1))"))))))
Formula 0 simplified : G(F!"((p546==0)||(p6304==1))" & FG!"(p463==1)")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 11004708 kB
After kill :
MemTotal: 16393232 kB
MemFree: 15809296 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-100B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ShieldPPPs-PT-100B, 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 r373-tall-171683789000327"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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