Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r295-tall-167873947500171.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Philosophers-COL-050000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873947500171
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 5.8K Feb 25 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 13:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 13:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 13:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 13:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 13:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 13:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 2.3M Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Philosophers-COL-050000-LTLCardinality-00
FORMULA_NAME Philosophers-COL-050000-LTLCardinality-01
FORMULA_NAME Philosophers-COL-050000-LTLCardinality-02
FORMULA_NAME Philosophers-COL-050000-LTLCardinality-03
FORMULA_NAME Philosophers-COL-050000-LTLCardinality-04
FORMULA_NAME Philosophers-COL-050000-LTLCardinality-05
FORMULA_NAME Philosophers-COL-050000-LTLCardinality-06
FORMULA_NAME Philosophers-COL-050000-LTLCardinality-07
FORMULA_NAME Philosophers-COL-050000-LTLCardinality-08
FORMULA_NAME Philosophers-COL-050000-LTLCardinality-09
FORMULA_NAME Philosophers-COL-050000-LTLCardinality-10
FORMULA_NAME Philosophers-COL-050000-LTLCardinality-11
FORMULA_NAME Philosophers-COL-050000-LTLCardinality-12
FORMULA_NAME Philosophers-COL-050000-LTLCardinality-13
FORMULA_NAME Philosophers-COL-050000-LTLCardinality-14
FORMULA_NAME Philosophers-COL-050000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678796094068

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-050000
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 12:14:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 12:14:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 12:14:55] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-14 12:14:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 12:14:56] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 906 ms
[2023-03-14 12:14:56] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 250000 PT places and 250000.0 transition bindings in 34 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2023-03-14 12:14:56] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 7 ms.
[2023-03-14 12:14:56] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Philosophers-COL-050000-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-050000-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 50001 steps, including 0 resets, run finished after 39 ms. (steps per millisecond=1282 ) properties (out of 24) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 22) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 17) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 5 rows 5 cols
[2023-03-14 12:14:56] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-14 12:14:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 12:14:57] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-14 12:14:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-14 12:14:57] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :12
[2023-03-14 12:14:57] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :12
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-14 12:14:57] [INFO ] After 119ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :12
Fused 13 Parikh solutions to 12 different solutions.
Finished Parikh walk after 50000 steps, including 0 resets, run visited all 2 properties in 239 ms. (steps per millisecond=209 )
Parikh walk visited 12 properties in 4005 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA Philosophers-COL-050000-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 12:15:01] [INFO ] Flatten gal took : 13 ms
[2023-03-14 12:15:01] [INFO ] Flatten gal took : 3 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 50000) 50000) 50000)]] contains successor/predecessor on variables of sort Philo
[2023-03-14 12:15:02] [INFO ] Unfolded HLPN to a Petri net with 250000 places and 250000 transitions 800000 arcs in 1227 ms.
[2023-03-14 12:15:02] [INFO ] Unfolded 13 HLPN properties in 116 ms.
Support contains 250000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 864 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
// Phase 1: matrix 250000 rows 250000 cols
[2023-03-14 12:15:13] [INFO ] Computed 100000 place invariants in 933 ms
[2023-03-14 12:15:32] [INFO ] Implicit Places using invariants in 20226 ms returned []
Implicit Place search using SMT only with invariants took 20228 ms to find 0 implicit places.
[2023-03-14 12:15:32] [INFO ] Invariant cache hit.
[2023-03-14 12:15:50] [INFO ] Dead Transitions using invariants and state equation in 17935 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39048 ms. Remains : 250000/250000 places, 250000/250000 transitions.
Support contains 250000 out of 250000 places after structural reductions.
[2023-03-14 12:16:02] [INFO ] Flatten gal took : 8137 ms
[2023-03-14 12:16:28] [INFO ] Flatten gal took : 8426 ms
[2023-03-14 12:17:02] [INFO ] Input system was already deterministic with 250000 transitions.
Interrupted random walk after 635 steps, including 0 resets, run timeout after 30040 ms. (steps per millisecond=0 ) properties seen 10
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 6103 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 15677 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 8673 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7761 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7954 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 5742 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7788 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 8032 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 5820 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7760 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 5719 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 5769 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7736 ms. (steps per millisecond=0 ) properties seen 0
Running SMT prover for 13 properties.
[2023-03-14 12:19:18] [INFO ] Invariant cache hit.
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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:611)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-14 12:19:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 12:19:43] [INFO ] After 25044ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 250000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1521 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1528 ms. Remains : 250000/250000 places, 250000/250000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 50000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 602 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
[2023-03-14 12:19:53] [INFO ] Invariant cache hit.
[2023-03-14 12:20:11] [INFO ] Implicit Places using invariants in 18019 ms returned []
Implicit Place search using SMT only with invariants took 18033 ms to find 0 implicit places.
[2023-03-14 12:20:11] [INFO ] Invariant cache hit.
[2023-03-14 12:20:29] [INFO ] Dead Transitions using invariants and state equation in 17543 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36185 ms. Remains : 250000/250000 places, 250000/250000 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-050000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s3...], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 77 ms.
FORMULA Philosophers-COL-050000-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-050000-LTLCardinality-00 finished in 37029 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((X(X(G(p2)))||p1)))))'
Support contains 150000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 666 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
[2023-03-14 12:20:31] [INFO ] Invariant cache hit.
[2023-03-14 12:20:48] [INFO ] Implicit Places using invariants in 17796 ms returned []
Implicit Place search using SMT only with invariants took 17798 ms to find 0 implicit places.
[2023-03-14 12:20:48] [INFO ] Invariant cache hit.
[2023-03-14 12:21:06] [INFO ] Dead Transitions using invariants and state equation in 17639 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36111 ms. Remains : 250000/250000 places, 250000/250000 transitions.
Stuttering acceptance computed with spot in 225 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Philosophers-COL-050000-LTLCardinality-01 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: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=5, aps=[p0:(LEQ (ADD s100000 s100001 s100002 s100003 s100004 s100005 s100006 s100007 s100008 s100009 s100010 s100011 s100012 s100013 s100014 s100015 s100016 s1000...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 146 ms.
FORMULA Philosophers-COL-050000-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-050000-LTLCardinality-01 finished in 37103 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 150000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 491 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
[2023-03-14 12:21:07] [INFO ] Invariant cache hit.
[2023-03-14 12:21:25] [INFO ] Implicit Places using invariants in 17797 ms returned []
Implicit Place search using SMT only with invariants took 17809 ms to find 0 implicit places.
[2023-03-14 12:21:25] [INFO ] Invariant cache hit.
[2023-03-14 12:21:43] [INFO ] Dead Transitions using invariants and state equation in 17901 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36209 ms. Remains : 250000/250000 places, 250000/250000 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-050000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ (ADD s200000 s200001 s200002 s200003 s200004 s200005 s200006 s200007 s200008 s200009 s200010 s200011 s200012 s200013 s200014 s200015 s200016 s...], 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][false, false]]
Product exploration timeout after 840 steps with 420 reset in 10087 ms.
Product exploration timeout after 810 steps with 405 reset in 10068 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)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 53 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-050000-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-050000-LTLCardinality-02 finished in 616740 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||F(p1)) U (p1||G((!p0||F(p1))))))'
Support contains 200000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 2188 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
[2023-03-14 12:31:26] [INFO ] Invariant cache hit.
[2023-03-14 12:31:44] [INFO ] Implicit Places using invariants in 17992 ms returned []
Implicit Place search using SMT only with invariants took 17996 ms to find 0 implicit places.
[2023-03-14 12:31:44] [INFO ] Invariant cache hit.
[2023-03-14 12:32:02] [INFO ] Dead Transitions using invariants and state equation in 17824 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38019 ms. Remains : 250000/250000 places, 250000/250000 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : Philosophers-COL-050000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(GT (ADD s150000 s150001 s150002 s150003 s150004 s150005 s150006 s150007 s150008 s150009 s150010 s150011 s150012 s150013 s150014 s150015 s150016 s15001...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 430 steps with 0 reset in 10169 ms.
Product exploration timeout after 420 steps with 0 reset in 10060 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (AND (NOT p1) p0)]
Interrupted random walk after 1231 steps, including 0 resets, run timeout after 30009 ms. (steps per millisecond=0 ) properties seen 2
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7968 ms. (steps per millisecond=0 ) properties seen 0
Running SMT prover for 1 properties.
[2023-03-14 13:09:28] [INFO ] Invariant cache hit.
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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:611)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-14 13:09:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 13:09:53] [INFO ] After 25046ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 100000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Partial Free-agglomeration rule applied 50000 times.
Drop transitions removed 50000 transitions
Iterating global reduction 0 with 50000 rules applied. Total rules applied 50000 place count 250000 transition count 250000
Applied a total of 50000 rules in 9062 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9069 ms. Remains : 250000/250000 places, 250000/250000 transitions.
Interrupted random walk after 1310 steps, including 0 resets, run timeout after 30009 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 8186 ms. (steps per millisecond=0 ) properties seen 0
Probabilistic random walk after 14999 steps, saw 15001 distinct states, run finished after 117805 ms. (steps per millisecond=0 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 250000 rows 250000 cols
[2023-03-14 13:12:41] [INFO ] Computed 100000 place invariants in 942 ms
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.verifyPossible(DeadlockTester.java:609)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-14 13:13:07] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 13:13:07] [INFO ] After 25986ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 100000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1587 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1587 ms. Remains : 250000/250000 places, 250000/250000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1580 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
[2023-03-14 13:13:10] [INFO ] Invariant cache hit.
[2023-03-14 13:13:28] [INFO ] Implicit Places using invariants in 17881 ms returned []
Implicit Place search using SMT only with invariants took 17882 ms to find 0 implicit places.
[2023-03-14 13:13:28] [INFO ] Invariant cache hit.
[2023-03-14 13:13:46] [INFO ] Dead Transitions using invariants and state equation in 18094 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37592 ms. Remains : 250000/250000 places, 250000/250000 transitions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 302 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (AND (NOT p1) p0)]
Support contains 200000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 2130 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
// Phase 1: matrix 250000 rows 250000 cols
[2023-03-14 13:13:51] [INFO ] Computed 100000 place invariants in 968 ms
[2023-03-14 13:14:08] [INFO ] Implicit Places using invariants in 18664 ms returned []
Implicit Place search using SMT only with invariants took 18665 ms to find 0 implicit places.
[2023-03-14 13:14:08] [INFO ] Invariant cache hit.
[2023-03-14 13:14:26] [INFO ] Dead Transitions using invariants and state equation in 17815 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38623 ms. Remains : 250000/250000 places, 250000/250000 transitions.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6443552 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16123928 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-COL-050000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is Philosophers-COL-050000, 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 r295-tall-167873947500171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-050000.tgz
mv Philosophers-COL-050000 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 ;