/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 01:11:34,887 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 01:11:34,889 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 01:11:34,925 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 01:11:34,925 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 01:11:34,928 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 01:11:34,931 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 01:11:34,933 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 01:11:34,937 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 01:11:34,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 01:11:34,941 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 01:11:34,942 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 01:11:34,942 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 01:11:34,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 01:11:34,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 01:11:34,947 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 01:11:34,948 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 01:11:34,948 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 01:11:34,950 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 01:11:34,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 01:11:34,954 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 01:11:34,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 01:11:34,956 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 01:11:34,956 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 01:11:34,962 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 01:11:34,962 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 01:11:34,962 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 01:11:34,963 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 01:11:34,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 01:11:34,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 01:11:34,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 01:11:34,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 01:11:34,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 01:11:34,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 01:11:34,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 01:11:34,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 01:11:34,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 01:11:34,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 01:11:34,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 01:11:34,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 01:11:34,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 01:11:34,970 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 01:11:34,995 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 01:11:34,995 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 01:11:34,996 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 01:11:34,997 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 01:11:34,997 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 01:11:34,997 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 01:11:34,997 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 01:11:34,998 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 01:11:34,998 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 01:11:34,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 01:11:34,998 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 01:11:34,999 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 01:11:34,999 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 01:11:34,999 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 01:11:34,999 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 01:11:34,999 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 01:11:34,999 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 01:11:34,999 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 01:11:34,999 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 01:11:34,999 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 01:11:35,000 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 01:11:35,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:11:35,000 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 01:11:35,000 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 01:11:35,000 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 01:11:35,000 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 01:11:35,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 01:11:35,000 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 01:11:35,001 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 01:11:35,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 01:11:35,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 01:11:35,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 01:11:35,276 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 01:11:35,276 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 01:11:35,277 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 01:11:36,352 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 01:11:36,538 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 01:11:36,538 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 01:11:36,548 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/966769d9e/b2b27ca86c3446808f3d2e9ee1df8447/FLAG4aad29f77 [2022-12-06 01:11:36,559 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/966769d9e/b2b27ca86c3446808f3d2e9ee1df8447 [2022-12-06 01:11:36,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 01:11:36,562 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 01:11:36,562 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 01:11:36,562 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 01:11:36,564 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 01:11:36,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:11:36" (1/1) ... [2022-12-06 01:11:36,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c865412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:11:36, skipping insertion in model container [2022-12-06 01:11:36,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:11:36" (1/1) ... [2022-12-06 01:11:36,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 01:11:36,599 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 01:11:36,721 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-12-06 01:11:36,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:11:36,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:11:36,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:11:36,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:11:36,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:11:36,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:11:36,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:11:36,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:11:36,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:11:36,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:11:36,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:11:36,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:11:36,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:11:36,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:11:36,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:11:36,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:11:36,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:11:36,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:11:36,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:11:36,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:11:36,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:11:36,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:11:36,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:11:36,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:11:36,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:11:36,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:11:36,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:11:36,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:11:36,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:11:36,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:11:36,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:11:36,954 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 01:11:36,963 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-12-06 01:11:36,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:11:36,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:11:36,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:11:36,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:11:36,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:11:36,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:11:36,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:11:36,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:11:36,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:11:36,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:11:36,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:11:36,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:11:36,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:11:36,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:11:36,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:11:36,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:11:36,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:11:37,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:11:37,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:11:37,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:11:37,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:11:37,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:11:37,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:11:37,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:11:37,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:11:37,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:11:37,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:11:37,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:11:37,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:11:37,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:11:37,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:11:37,063 INFO L208 MainTranslator]: Completed translation [2022-12-06 01:11:37,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:11:37 WrapperNode [2022-12-06 01:11:37,063 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 01:11:37,064 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 01:11:37,064 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 01:11:37,065 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 01:11:37,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:11:37" (1/1) ... [2022-12-06 01:11:37,095 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:11:37" (1/1) ... [2022-12-06 01:11:37,113 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-06 01:11:37,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 01:11:37,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 01:11:37,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 01:11:37,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 01:11:37,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:11:37" (1/1) ... [2022-12-06 01:11:37,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:11:37" (1/1) ... [2022-12-06 01:11:37,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:11:37" (1/1) ... [2022-12-06 01:11:37,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:11:37" (1/1) ... [2022-12-06 01:11:37,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:11:37" (1/1) ... [2022-12-06 01:11:37,154 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:11:37" (1/1) ... [2022-12-06 01:11:37,156 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:11:37" (1/1) ... [2022-12-06 01:11:37,157 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:11:37" (1/1) ... [2022-12-06 01:11:37,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 01:11:37,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 01:11:37,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 01:11:37,161 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 01:11:37,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:11:37" (1/1) ... [2022-12-06 01:11:37,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:11:37,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:11:37,189 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 01:11:37,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 01:11:37,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 01:11:37,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 01:11:37,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 01:11:37,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 01:11:37,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 01:11:37,214 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 01:11:37,214 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 01:11:37,214 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 01:11:37,214 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 01:11:37,214 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 01:11:37,214 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 01:11:37,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 01:11:37,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 01:11:37,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 01:11:37,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 01:11:37,215 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 01:11:37,360 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 01:11:37,361 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 01:11:37,618 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 01:11:37,754 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 01:11:37,754 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 01:11:37,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:11:37 BoogieIcfgContainer [2022-12-06 01:11:37,756 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 01:11:37,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 01:11:37,758 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 01:11:37,760 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 01:11:37,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 01:11:36" (1/3) ... [2022-12-06 01:11:37,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a127883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:11:37, skipping insertion in model container [2022-12-06 01:11:37,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:11:37" (2/3) ... [2022-12-06 01:11:37,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a127883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:11:37, skipping insertion in model container [2022-12-06 01:11:37,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:11:37" (3/3) ... [2022-12-06 01:11:37,762 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 01:11:37,775 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 01:11:37,775 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 01:11:37,775 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 01:11:37,824 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 01:11:37,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2022-12-06 01:11:37,906 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-06 01:11:37,906 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:11:37,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 59 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 01:11:37,912 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2022-12-06 01:11:37,915 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2022-12-06 01:11:37,916 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:11:37,941 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-06 01:11:37,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2022-12-06 01:11:37,959 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-06 01:11:37,959 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:11:37,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 59 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 01:11:37,962 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-06 01:11:37,962 INFO L188 LiptonReduction]: Number of co-enabled transitions 1920 [2022-12-06 01:11:42,307 INFO L203 LiptonReduction]: Total number of compositions: 81 [2022-12-06 01:11:42,318 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 01:11:42,324 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@52681d43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 01:11:42,324 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 01:11:42,327 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-06 01:11:42,327 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:11:42,327 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:11:42,328 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 01:11:42,329 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:11:42,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:11:42,332 INFO L85 PathProgramCache]: Analyzing trace with hash 525357, now seen corresponding path program 1 times [2022-12-06 01:11:42,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:11:42,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266503238] [2022-12-06 01:11:42,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:11:42,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:11:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:11:42,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:11:42,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:11:42,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266503238] [2022-12-06 01:11:42,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266503238] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:11:42,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:11:42,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:11:42,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829971500] [2022-12-06 01:11:42,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:11:42,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:11:42,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:11:42,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:11:42,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:11:42,635 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 01:11:42,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:11:42,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:11:42,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 01:11:42,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:11:42,946 INFO L130 PetriNetUnfolder]: 1106/1785 cut-off events. [2022-12-06 01:11:42,946 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 01:11:42,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3479 conditions, 1785 events. 1106/1785 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 9636 event pairs, 176 based on Foata normal form. 0/1604 useless extension candidates. Maximal degree in co-relation 3468. Up to 1336 conditions per place. [2022-12-06 01:11:42,960 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 31 selfloop transitions, 2 changer transitions 8/43 dead transitions. [2022-12-06 01:11:42,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 183 flow [2022-12-06 01:11:42,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:11:42,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:11:42,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-06 01:11:42,969 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2022-12-06 01:11:42,973 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 0 predicate places. [2022-12-06 01:11:42,974 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:11:42,974 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 43 transitions, 183 flow [2022-12-06 01:11:42,988 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 43 transitions, 183 flow [2022-12-06 01:11:42,988 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 01:11:43,257 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 01:11:43,259 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 285 [2022-12-06 01:11:43,259 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 41 transitions, 179 flow [2022-12-06 01:11:43,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:11:43,260 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:11:43,260 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:11:43,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 01:11:43,263 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:11:43,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:11:43,264 INFO L85 PathProgramCache]: Analyzing trace with hash -42487648, now seen corresponding path program 1 times [2022-12-06 01:11:43,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:11:43,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103808825] [2022-12-06 01:11:43,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:11:43,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:11:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:11:43,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:11:43,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:11:43,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103808825] [2022-12-06 01:11:43,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103808825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:11:43,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:11:43,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:11:43,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825402879] [2022-12-06 01:11:43,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:11:43,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:11:43,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:11:43,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:11:43,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:11:43,873 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 01:11:43,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 41 transitions, 179 flow. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:11:43,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:11:43,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 01:11:43,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:11:44,331 INFO L130 PetriNetUnfolder]: 1524/2325 cut-off events. [2022-12-06 01:11:44,331 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-06 01:11:44,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7035 conditions, 2325 events. 1524/2325 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11562 event pairs, 73 based on Foata normal form. 0/2111 useless extension candidates. Maximal degree in co-relation 7021. Up to 2006 conditions per place. [2022-12-06 01:11:44,340 INFO L137 encePairwiseOnDemand]: 12/24 looper letters, 55 selfloop transitions, 11 changer transitions 26/92 dead transitions. [2022-12-06 01:11:44,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 92 transitions, 579 flow [2022-12-06 01:11:44,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:11:44,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:11:44,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-06 01:11:44,344 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6354166666666666 [2022-12-06 01:11:44,344 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2022-12-06 01:11:44,346 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:11:44,346 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 92 transitions, 579 flow [2022-12-06 01:11:44,355 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 92 transitions, 579 flow [2022-12-06 01:11:44,356 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:11:44,357 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:11:44,358 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 01:11:44,359 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 92 transitions, 579 flow [2022-12-06 01:11:44,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:11:44,359 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:11:44,359 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:11:44,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 01:11:44,360 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:11:44,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:11:44,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1317116783, now seen corresponding path program 1 times [2022-12-06 01:11:44,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:11:44,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678845415] [2022-12-06 01:11:44,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:11:44,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:11:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:11:44,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:11:44,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:11:44,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678845415] [2022-12-06 01:11:44,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678845415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:11:44,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:11:44,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:11:44,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539526027] [2022-12-06 01:11:44,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:11:44,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:11:44,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:11:44,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:11:44,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:11:44,833 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 01:11:44,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 92 transitions, 579 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:11:44,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:11:44,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 01:11:44,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:11:45,149 INFO L130 PetriNetUnfolder]: 1452/2219 cut-off events. [2022-12-06 01:11:45,149 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-06 01:11:45,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8937 conditions, 2219 events. 1452/2219 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10425 event pairs, 38 based on Foata normal form. 0/2033 useless extension candidates. Maximal degree in co-relation 8920. Up to 1911 conditions per place. [2022-12-06 01:11:45,159 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 80 selfloop transitions, 12 changer transitions 48/140 dead transitions. [2022-12-06 01:11:45,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 140 transitions, 1147 flow [2022-12-06 01:11:45,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:11:45,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:11:45,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-06 01:11:45,160 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2022-12-06 01:11:45,161 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2022-12-06 01:11:45,161 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:11:45,161 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 140 transitions, 1147 flow [2022-12-06 01:11:45,169 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 140 transitions, 1147 flow [2022-12-06 01:11:45,169 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:11:45,170 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:11:45,170 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 01:11:45,170 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 140 transitions, 1147 flow [2022-12-06 01:11:45,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:11:45,171 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:11:45,171 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:11:45,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 01:11:45,171 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:11:45,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:11:45,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1269437721, now seen corresponding path program 1 times [2022-12-06 01:11:45,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:11:45,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204198581] [2022-12-06 01:11:45,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:11:45,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:11:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:11:45,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:11:45,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:11:45,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204198581] [2022-12-06 01:11:45,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204198581] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:11:45,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:11:45,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:11:45,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747823946] [2022-12-06 01:11:45,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:11:45,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:11:45,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:11:45,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:11:45,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:11:45,402 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 01:11:45,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 140 transitions, 1147 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:11:45,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:11:45,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 01:11:45,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:11:45,855 INFO L130 PetriNetUnfolder]: 2356/3601 cut-off events. [2022-12-06 01:11:45,855 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-06 01:11:45,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18067 conditions, 3601 events. 2356/3601 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 18860 event pairs, 40 based on Foata normal form. 0/3329 useless extension candidates. Maximal degree in co-relation 18047. Up to 3153 conditions per place. [2022-12-06 01:11:45,867 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 111 selfloop transitions, 11 changer transitions 144/266 dead transitions. [2022-12-06 01:11:45,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 266 transitions, 2690 flow [2022-12-06 01:11:45,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:11:45,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:11:45,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-06 01:11:45,869 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-06 01:11:45,870 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 7 predicate places. [2022-12-06 01:11:45,870 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:11:45,871 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 266 transitions, 2690 flow [2022-12-06 01:11:45,886 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 266 transitions, 2690 flow [2022-12-06 01:11:45,887 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:11:45,888 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:11:45,895 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 01:11:45,895 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 266 transitions, 2690 flow [2022-12-06 01:11:45,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:11:45,896 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:11:45,896 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:11:45,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 01:11:45,896 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:11:45,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:11:45,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1277740761, now seen corresponding path program 2 times [2022-12-06 01:11:45,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:11:45,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564217235] [2022-12-06 01:11:45,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:11:45,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:11:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:11:46,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:11:46,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:11:46,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564217235] [2022-12-06 01:11:46,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564217235] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:11:46,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:11:46,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:11:46,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397704112] [2022-12-06 01:11:46,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:11:46,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:11:46,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:11:46,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:11:46,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:11:46,428 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 01:11:46,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 266 transitions, 2690 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:11:46,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:11:46,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 01:11:46,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:11:47,132 INFO L130 PetriNetUnfolder]: 2499/3821 cut-off events. [2022-12-06 01:11:47,132 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-06 01:11:47,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22989 conditions, 3821 events. 2499/3821 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 20322 event pairs, 36 based on Foata normal form. 0/3538 useless extension candidates. Maximal degree in co-relation 22966. Up to 3230 conditions per place. [2022-12-06 01:11:47,149 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 112 selfloop transitions, 34 changer transitions 194/340 dead transitions. [2022-12-06 01:11:47,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 340 transitions, 4110 flow [2022-12-06 01:11:47,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 01:11:47,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 01:11:47,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-12-06 01:11:47,155 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2022-12-06 01:11:47,156 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 12 predicate places. [2022-12-06 01:11:47,157 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:11:47,157 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 340 transitions, 4110 flow [2022-12-06 01:11:47,173 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 340 transitions, 4110 flow [2022-12-06 01:11:47,173 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:11:47,174 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:11:47,176 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 01:11:47,176 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 340 transitions, 4110 flow [2022-12-06 01:11:47,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:11:47,176 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:11:47,176 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:11:47,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 01:11:47,176 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:11:47,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:11:47,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1299833617, now seen corresponding path program 1 times [2022-12-06 01:11:47,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:11:47,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497916971] [2022-12-06 01:11:47,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:11:47,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:11:47,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:11:47,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:11:47,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:11:47,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497916971] [2022-12-06 01:11:47,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497916971] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:11:47,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:11:47,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:11:47,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118166828] [2022-12-06 01:11:47,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:11:47,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:11:47,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:11:47,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:11:47,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:11:47,342 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 01:11:47,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 340 transitions, 4110 flow. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:11:47,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:11:47,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 01:11:47,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:11:47,970 INFO L130 PetriNetUnfolder]: 2996/4648 cut-off events. [2022-12-06 01:11:47,971 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-06 01:11:47,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32608 conditions, 4648 events. 2996/4648 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 26148 event pairs, 30 based on Foata normal form. 0/4317 useless extension candidates. Maximal degree in co-relation 32582. Up to 4057 conditions per place. [2022-12-06 01:11:47,985 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 143 selfloop transitions, 10 changer transitions 244/397 dead transitions. [2022-12-06 01:11:47,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 397 transitions, 5591 flow [2022-12-06 01:11:47,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:11:47,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:11:47,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 01:11:47,986 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5972222222222222 [2022-12-06 01:11:47,987 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 14 predicate places. [2022-12-06 01:11:47,987 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:11:47,987 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 397 transitions, 5591 flow [2022-12-06 01:11:48,040 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 397 transitions, 5591 flow [2022-12-06 01:11:48,041 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:11:48,042 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:11:48,042 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-06 01:11:48,042 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 397 transitions, 5591 flow [2022-12-06 01:11:48,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:11:48,043 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:11:48,043 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:11:48,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 01:11:48,043 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:11:48,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:11:48,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1299148424, now seen corresponding path program 1 times [2022-12-06 01:11:48,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:11:48,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433947387] [2022-12-06 01:11:48,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:11:48,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:11:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:11:48,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:11:48,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:11:48,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433947387] [2022-12-06 01:11:48,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433947387] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:11:48,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:11:48,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 01:11:48,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181678426] [2022-12-06 01:11:48,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:11:48,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 01:11:48,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:11:48,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 01:11:48,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 01:11:48,732 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 01:11:48,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 397 transitions, 5591 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:11:48,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:11:48,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 01:11:48,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:11:50,382 INFO L130 PetriNetUnfolder]: 4642/7270 cut-off events. [2022-12-06 01:11:50,383 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-06 01:11:50,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58245 conditions, 7270 events. 4642/7270 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 45067 event pairs, 33 based on Foata normal form. 0/6787 useless extension candidates. Maximal degree in co-relation 58216. Up to 6679 conditions per place. [2022-12-06 01:11:50,408 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 181 selfloop transitions, 103 changer transitions 499/783 dead transitions. [2022-12-06 01:11:50,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 783 transitions, 12576 flow [2022-12-06 01:11:50,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 01:11:50,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 01:11:50,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 171 transitions. [2022-12-06 01:11:50,410 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5480769230769231 [2022-12-06 01:11:50,410 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 26 predicate places. [2022-12-06 01:11:50,411 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:11:50,411 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 783 transitions, 12576 flow [2022-12-06 01:11:50,454 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 783 transitions, 12576 flow [2022-12-06 01:11:50,454 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:11:50,457 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:11:50,458 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-06 01:11:50,458 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 783 transitions, 12576 flow [2022-12-06 01:11:50,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:11:50,458 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:11:50,458 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:11:50,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 01:11:50,458 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:11:50,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:11:50,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1310813414, now seen corresponding path program 2 times [2022-12-06 01:11:50,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:11:50,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847192368] [2022-12-06 01:11:50,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:11:50,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:11:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:11:50,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:11:50,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:11:50,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847192368] [2022-12-06 01:11:50,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847192368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:11:50,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:11:50,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 01:11:50,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248018611] [2022-12-06 01:11:50,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:11:50,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 01:11:50,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:11:50,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 01:11:50,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 01:11:50,988 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 01:11:50,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 783 transitions, 12576 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:11:50,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:11:50,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 01:11:50,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:11:52,507 INFO L130 PetriNetUnfolder]: 4767/7447 cut-off events. [2022-12-06 01:11:52,508 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-06 01:11:52,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67109 conditions, 7447 events. 4767/7447 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 46184 event pairs, 32 based on Foata normal form. 0/6967 useless extension candidates. Maximal degree in co-relation 67077. Up to 6863 conditions per place. [2022-12-06 01:11:52,536 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 257 selfloop transitions, 58 changer transitions 637/952 dead transitions. [2022-12-06 01:11:52,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 952 transitions, 17184 flow [2022-12-06 01:11:52,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 01:11:52,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 01:11:52,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-12-06 01:11:52,538 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2022-12-06 01:11:52,538 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 31 predicate places. [2022-12-06 01:11:52,539 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:11:52,539 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 952 transitions, 17184 flow [2022-12-06 01:11:52,587 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 952 transitions, 17184 flow [2022-12-06 01:11:52,587 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:11:52,591 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:11:52,592 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-06 01:11:52,592 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 952 transitions, 17184 flow [2022-12-06 01:11:52,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:11:52,592 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:11:52,592 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:11:52,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 01:11:52,592 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:11:52,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:11:52,593 INFO L85 PathProgramCache]: Analyzing trace with hash 986657543, now seen corresponding path program 1 times [2022-12-06 01:11:52,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:11:52,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402094254] [2022-12-06 01:11:52,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:11:52,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:11:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:11:53,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:11:53,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:11:53,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402094254] [2022-12-06 01:11:53,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402094254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:11:53,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:11:53,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 01:11:53,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478231911] [2022-12-06 01:11:53,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:11:53,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 01:11:53,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:11:53,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 01:11:53,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 01:11:53,385 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 01:11:53,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 952 transitions, 17184 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:11:53,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:11:53,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 01:11:53,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:11:54,910 INFO L130 PetriNetUnfolder]: 4754/7428 cut-off events. [2022-12-06 01:11:54,910 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-06 01:11:54,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74367 conditions, 7428 events. 4754/7428 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 45903 event pairs, 39 based on Foata normal form. 0/6954 useless extension candidates. Maximal degree in co-relation 74332. Up to 6857 conditions per place. [2022-12-06 01:11:54,935 INFO L137 encePairwiseOnDemand]: 20/24 looper letters, 290 selfloop transitions, 24 changer transitions 637/951 dead transitions. [2022-12-06 01:11:54,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 951 transitions, 19068 flow [2022-12-06 01:11:54,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:11:54,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:11:54,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-06 01:11:54,937 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5520833333333334 [2022-12-06 01:11:54,938 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 34 predicate places. [2022-12-06 01:11:54,938 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:11:54,938 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 951 transitions, 19068 flow [2022-12-06 01:11:54,978 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 951 transitions, 19068 flow [2022-12-06 01:11:54,978 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:11:54,982 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:11:54,983 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-06 01:11:54,983 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 951 transitions, 19068 flow [2022-12-06 01:11:54,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:11:54,983 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:11:54,983 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:11:54,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 01:11:54,983 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:11:54,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:11:54,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1645422478, now seen corresponding path program 1 times [2022-12-06 01:11:54,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:11:54,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748940800] [2022-12-06 01:11:54,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:11:54,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:11:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:11:55,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:11:55,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:11:55,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748940800] [2022-12-06 01:11:55,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748940800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:11:55,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:11:55,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 01:11:55,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759467105] [2022-12-06 01:11:55,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:11:55,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 01:11:55,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:11:55,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 01:11:55,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 01:11:55,990 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 01:11:55,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 951 transitions, 19068 flow. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:11:55,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:11:55,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 01:11:55,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:11:58,097 INFO L130 PetriNetUnfolder]: 5561/8750 cut-off events. [2022-12-06 01:11:58,098 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-06 01:11:58,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96338 conditions, 8750 events. 5561/8750 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 56311 event pairs, 53 based on Foata normal form. 0/8236 useless extension candidates. Maximal degree in co-relation 96300. Up to 8179 conditions per place. [2022-12-06 01:11:58,134 INFO L137 encePairwiseOnDemand]: 12/24 looper letters, 226 selfloop transitions, 36 changer transitions 1106/1368 dead transitions. [2022-12-06 01:11:58,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 1368 transitions, 30147 flow [2022-12-06 01:11:58,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 01:11:58,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 01:11:58,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-12-06 01:11:58,136 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2022-12-06 01:11:58,136 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 39 predicate places. [2022-12-06 01:11:58,136 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:11:58,137 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 1368 transitions, 30147 flow [2022-12-06 01:11:58,192 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 1368 transitions, 30147 flow [2022-12-06 01:11:58,192 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:11:58,197 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:11:58,198 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-06 01:11:58,198 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 1368 transitions, 30147 flow [2022-12-06 01:11:58,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:11:58,198 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:11:58,198 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:11:58,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 01:11:58,198 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:11:58,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:11:58,199 INFO L85 PathProgramCache]: Analyzing trace with hash 2011391807, now seen corresponding path program 1 times [2022-12-06 01:11:58,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:11:58,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956249152] [2022-12-06 01:11:58,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:11:58,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:11:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:11:59,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:11:59,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:11:59,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956249152] [2022-12-06 01:11:59,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956249152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:11:59,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:11:59,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:11:59,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759227920] [2022-12-06 01:11:59,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:11:59,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 01:11:59,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:11:59,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 01:11:59,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 01:11:59,006 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 01:11:59,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 1368 transitions, 30147 flow. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:11:59,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:11:59,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 01:11:59,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:12:01,212 INFO L130 PetriNetUnfolder]: 5889/9270 cut-off events. [2022-12-06 01:12:01,212 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-06 01:12:01,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111329 conditions, 9270 events. 5889/9270 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 60433 event pairs, 40 based on Foata normal form. 0/8734 useless extension candidates. Maximal degree in co-relation 111288. Up to 8699 conditions per place. [2022-12-06 01:12:01,255 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 207 selfloop transitions, 57 changer transitions 1231/1495 dead transitions. [2022-12-06 01:12:01,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 1495 transitions, 35931 flow [2022-12-06 01:12:01,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:12:01,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:12:01,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-12-06 01:12:01,257 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 01:12:01,258 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 43 predicate places. [2022-12-06 01:12:01,259 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:12:01,259 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 1495 transitions, 35931 flow [2022-12-06 01:12:01,329 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 1495 transitions, 35931 flow [2022-12-06 01:12:01,329 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:12:01,336 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:12:01,337 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 01:12:01,337 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 1495 transitions, 35931 flow [2022-12-06 01:12:01,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:12:01,337 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:12:01,337 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:12:01,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 01:12:01,337 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:12:01,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:12:01,338 INFO L85 PathProgramCache]: Analyzing trace with hash -448902539, now seen corresponding path program 1 times [2022-12-06 01:12:01,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:12:01,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947989881] [2022-12-06 01:12:01,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:12:01,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:12:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:12:01,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:12:01,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:12:01,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947989881] [2022-12-06 01:12:01,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947989881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:12:01,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:12:01,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:12:01,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471032992] [2022-12-06 01:12:01,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:12:01,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:12:01,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:12:01,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:12:01,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:12:01,708 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 01:12:01,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 1495 transitions, 35931 flow. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:12:01,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:12:01,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 01:12:01,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:12:05,201 INFO L130 PetriNetUnfolder]: 7300/11621 cut-off events. [2022-12-06 01:12:05,201 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-06 01:12:05,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151163 conditions, 11621 events. 7300/11621 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 836. Compared 80327 event pairs, 102 based on Foata normal form. 0/11041 useless extension candidates. Maximal degree in co-relation 151119. Up to 11034 conditions per place. [2022-12-06 01:12:05,230 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 161 selfloop transitions, 19 changer transitions 1800/1980 dead transitions. [2022-12-06 01:12:05,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 1980 transitions, 51531 flow [2022-12-06 01:12:05,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:12:05,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:12:05,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-06 01:12:05,232 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 01:12:05,232 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 47 predicate places. [2022-12-06 01:12:05,233 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:12:05,234 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 1980 transitions, 51531 flow [2022-12-06 01:12:05,356 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 1980 transitions, 51531 flow [2022-12-06 01:12:05,357 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:12:05,361 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:12:05,362 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-06 01:12:05,362 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 1980 transitions, 51531 flow [2022-12-06 01:12:05,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:12:05,362 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:12:05,362 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:12:05,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 01:12:05,363 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:12:05,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:12:05,363 INFO L85 PathProgramCache]: Analyzing trace with hash -2071433674, now seen corresponding path program 1 times [2022-12-06 01:12:05,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:12:05,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781801477] [2022-12-06 01:12:05,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:12:05,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:12:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:12:06,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:12:06,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:12:06,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781801477] [2022-12-06 01:12:06,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781801477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:12:06,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:12:06,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 01:12:06,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019405538] [2022-12-06 01:12:06,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:12:06,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 01:12:06,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:12:06,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 01:12:06,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 01:12:06,335 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 01:12:06,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 1980 transitions, 51531 flow. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:12:06,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:12:06,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 01:12:06,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:12:11,614 INFO L130 PetriNetUnfolder]: 9208/14871 cut-off events. [2022-12-06 01:12:11,615 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-06 01:12:11,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208285 conditions, 14871 events. 9208/14871 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 1126. Compared 109543 event pairs, 70 based on Foata normal form. 0/14153 useless extension candidates. Maximal degree in co-relation 208238. Up to 14284 conditions per place. [2022-12-06 01:12:11,695 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 71 selfloop transitions, 13 changer transitions 2366/2450 dead transitions. [2022-12-06 01:12:11,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 2450 transitions, 68651 flow [2022-12-06 01:12:11,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 01:12:11,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 01:12:11,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2022-12-06 01:12:11,697 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2022-12-06 01:12:11,698 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 54 predicate places. [2022-12-06 01:12:11,700 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:12:11,700 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 2450 transitions, 68651 flow [2022-12-06 01:12:11,923 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 2450 transitions, 68651 flow [2022-12-06 01:12:11,923 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:12:11,948 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:12:11,948 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 250 [2022-12-06 01:12:11,948 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 2450 transitions, 68651 flow [2022-12-06 01:12:11,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:12:11,949 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:12:11,949 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:12:11,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 01:12:11,949 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:12:11,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:12:11,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1054541467, now seen corresponding path program 1 times [2022-12-06 01:12:11,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:12:11,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821437556] [2022-12-06 01:12:11,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:12:11,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:12:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:12:13,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:12:13,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:12:13,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821437556] [2022-12-06 01:12:13,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821437556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:12:13,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:12:13,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 01:12:13,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545364935] [2022-12-06 01:12:13,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:12:13,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 01:12:13,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:12:13,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 01:12:13,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 01:12:13,163 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 01:12:13,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 2450 transitions, 68651 flow. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:12:13,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:12:13,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 01:12:13,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:12:19,551 INFO L130 PetriNetUnfolder]: 9584/15475 cut-off events. [2022-12-06 01:12:19,551 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-06 01:12:19,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232217 conditions, 15475 events. 9584/15475 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 1195. Compared 114806 event pairs, 125 based on Foata normal form. 0/14745 useless extension candidates. Maximal degree in co-relation 232167. Up to 14776 conditions per place. [2022-12-06 01:12:19,601 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 69 selfloop transitions, 12 changer transitions 2547/2628 dead transitions. [2022-12-06 01:12:19,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 2628 transitions, 78891 flow [2022-12-06 01:12:19,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 01:12:19,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 01:12:19,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2022-12-06 01:12:19,603 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-06 01:12:19,603 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 60 predicate places. [2022-12-06 01:12:19,604 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:12:19,604 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 2628 transitions, 78891 flow [2022-12-06 01:12:19,720 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 2628 transitions, 78891 flow [2022-12-06 01:12:19,721 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:12:19,728 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:12:19,729 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-06 01:12:19,729 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 2628 transitions, 78891 flow [2022-12-06 01:12:19,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:12:19,729 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:12:19,729 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:12:19,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 01:12:19,729 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:12:19,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:12:19,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1009202107, now seen corresponding path program 2 times [2022-12-06 01:12:19,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:12:19,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065766776] [2022-12-06 01:12:19,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:12:19,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:12:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:12:21,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:12:21,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:12:21,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065766776] [2022-12-06 01:12:21,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065766776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:12:21,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:12:21,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 01:12:21,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406685121] [2022-12-06 01:12:21,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:12:21,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 01:12:21,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:12:21,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 01:12:21,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 01:12:21,144 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 01:12:21,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 2628 transitions, 78891 flow. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:12:21,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:12:21,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 01:12:21,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:12:28,246 INFO L130 PetriNetUnfolder]: 9661/15602 cut-off events. [2022-12-06 01:12:28,246 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-06 01:12:28,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249725 conditions, 15602 events. 9661/15602 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 1215. Compared 115830 event pairs, 109 based on Foata normal form. 0/14872 useless extension candidates. Maximal degree in co-relation 249672. Up to 14903 conditions per place. [2022-12-06 01:12:28,298 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 63 selfloop transitions, 7 changer transitions 2600/2670 dead transitions. [2022-12-06 01:12:28,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 2670 transitions, 85491 flow [2022-12-06 01:12:28,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 01:12:28,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 01:12:28,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2022-12-06 01:12:28,299 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2022-12-06 01:12:28,300 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 67 predicate places. [2022-12-06 01:12:28,300 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:12:28,300 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 2670 transitions, 85491 flow [2022-12-06 01:12:28,427 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 2670 transitions, 85491 flow [2022-12-06 01:12:28,427 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:12:28,434 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:12:28,435 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-06 01:12:28,435 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 2670 transitions, 85491 flow [2022-12-06 01:12:28,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:12:28,435 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:12:28,435 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:12:28,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 01:12:28,436 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:12:28,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:12:28,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1009854967, now seen corresponding path program 3 times [2022-12-06 01:12:28,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:12:28,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585206535] [2022-12-06 01:12:28,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:12:28,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:12:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:12:29,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:12:29,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:12:29,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585206535] [2022-12-06 01:12:29,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585206535] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:12:29,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:12:29,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 01:12:29,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132368426] [2022-12-06 01:12:29,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:12:29,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 01:12:29,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:12:29,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 01:12:29,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-06 01:12:29,678 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 01:12:29,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 2670 transitions, 85491 flow. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:12:29,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:12:29,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 01:12:29,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:12:37,629 INFO L130 PetriNetUnfolder]: 9751/15760 cut-off events. [2022-12-06 01:12:37,629 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-06 01:12:37,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268014 conditions, 15760 events. 9751/15760 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 1239. Compared 117734 event pairs, 115 based on Foata normal form. 0/15034 useless extension candidates. Maximal degree in co-relation 267958. Up to 15037 conditions per place. [2022-12-06 01:12:37,683 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 38 selfloop transitions, 3 changer transitions 2678/2719 dead transitions. [2022-12-06 01:12:37,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 2719 transitions, 92497 flow [2022-12-06 01:12:37,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 01:12:37,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 01:12:37,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2022-12-06 01:12:37,684 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-06 01:12:37,684 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 72 predicate places. [2022-12-06 01:12:37,685 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:12:37,685 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 2719 transitions, 92497 flow [2022-12-06 01:12:37,820 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 2719 transitions, 92497 flow [2022-12-06 01:12:37,820 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:12:37,828 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:12:37,828 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-06 01:12:37,829 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 2719 transitions, 92497 flow [2022-12-06 01:12:37,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:12:37,829 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:12:37,829 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:12:37,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 01:12:37,829 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:12:37,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:12:37,829 INFO L85 PathProgramCache]: Analyzing trace with hash -600688417, now seen corresponding path program 1 times [2022-12-06 01:12:37,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:12:37,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491953120] [2022-12-06 01:12:37,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:12:37,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:12:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:12:38,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:12:38,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:12:38,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491953120] [2022-12-06 01:12:38,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491953120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:12:38,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:12:38,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:12:38,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524707102] [2022-12-06 01:12:38,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:12:38,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:12:38,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:12:38,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:12:38,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:12:38,423 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 01:12:38,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 2719 transitions, 92497 flow. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:12:38,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:12:38,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 01:12:38,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:12:46,460 INFO L130 PetriNetUnfolder]: 10291/16776 cut-off events. [2022-12-06 01:12:46,461 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-06 01:12:46,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302063 conditions, 16776 events. 10291/16776 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 1326. Compared 127840 event pairs, 132 based on Foata normal form. 0/16006 useless extension candidates. Maximal degree in co-relation 302004. Up to 16053 conditions per place. [2022-12-06 01:12:46,509 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 29 selfloop transitions, 5 changer transitions 2826/2860 dead transitions. [2022-12-06 01:12:46,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 2860 transitions, 103011 flow [2022-12-06 01:12:46,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:12:46,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:12:46,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-12-06 01:12:46,510 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 01:12:46,511 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 76 predicate places. [2022-12-06 01:12:46,511 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:12:46,511 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 2860 transitions, 103011 flow [2022-12-06 01:12:46,641 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 2860 transitions, 103011 flow [2022-12-06 01:12:46,641 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:12:46,648 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:12:46,648 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-06 01:12:46,649 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 2860 transitions, 103011 flow [2022-12-06 01:12:46,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:12:46,649 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:12:46,649 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:12:46,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 01:12:46,649 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:12:46,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:12:46,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1441474104, now seen corresponding path program 1 times [2022-12-06 01:12:46,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:12:46,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330732153] [2022-12-06 01:12:46,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:12:46,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:12:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:12:46,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:12:46,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:12:46,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330732153] [2022-12-06 01:12:46,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330732153] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:12:46,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:12:46,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:12:46,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640449344] [2022-12-06 01:12:46,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:12:46,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 01:12:46,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:12:46,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 01:12:46,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 01:12:46,918 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 01:12:46,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 2860 transitions, 103011 flow. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:12:46,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:12:46,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 01:12:46,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:12:58,160 INFO L130 PetriNetUnfolder]: 11092/18263 cut-off events. [2022-12-06 01:12:58,160 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-06 01:12:58,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347093 conditions, 18263 events. 11092/18263 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 1455. Compared 143463 event pairs, 141 based on Foata normal form. 0/17501 useless extension candidates. Maximal degree in co-relation 347031. Up to 17540 conditions per place. [2022-12-06 01:12:58,225 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 0 selfloop transitions, 0 changer transitions 3219/3219 dead transitions. [2022-12-06 01:12:58,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 3219 transitions, 122373 flow [2022-12-06 01:12:58,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 01:12:58,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 01:12:58,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-12-06 01:12:58,227 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5046296296296297 [2022-12-06 01:12:58,227 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 82 predicate places. [2022-12-06 01:12:58,227 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:12:58,227 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 3219 transitions, 122373 flow [2022-12-06 01:12:58,396 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 3219 transitions, 122373 flow [2022-12-06 01:12:58,396 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:12:58,404 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:12:58,407 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 01:12:58,407 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 3219 transitions, 122373 flow [2022-12-06 01:12:58,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:12:58,409 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 01:12:58,410 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 01:12:58,410 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 01:12:58,417 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 01:12:58,417 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 01:12:58,418 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 01:12:58,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 01:12:58,418 INFO L458 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:12:58,421 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 01:12:58,422 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 01:12:58,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 01:12:58 BasicIcfg [2022-12-06 01:12:58,438 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 01:12:58,438 INFO L158 Benchmark]: Toolchain (without parser) took 81876.94ms. Allocated memory was 179.3MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 154.4MB in the beginning and 1.1GB in the end (delta: -947.9MB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2022-12-06 01:12:58,439 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 179.3MB. Free memory is still 156.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 01:12:58,440 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.28ms. Allocated memory is still 179.3MB. Free memory was 154.4MB in the beginning and 125.6MB in the end (delta: 28.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 01:12:58,440 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.01ms. Allocated memory is still 179.3MB. Free memory was 125.6MB in the beginning and 123.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 01:12:58,441 INFO L158 Benchmark]: Boogie Preprocessor took 46.59ms. Allocated memory is still 179.3MB. Free memory was 123.0MB in the beginning and 120.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 01:12:58,442 INFO L158 Benchmark]: RCFGBuilder took 595.23ms. Allocated memory was 179.3MB in the beginning and 221.2MB in the end (delta: 41.9MB). Free memory was 120.9MB in the beginning and 181.5MB in the end (delta: -60.6MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-06 01:12:58,442 INFO L158 Benchmark]: TraceAbstraction took 80680.36ms. Allocated memory was 221.2MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 180.9MB in the beginning and 1.1GB in the end (delta: -921.4MB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2022-12-06 01:12:58,446 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 179.3MB. Free memory is still 156.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 501.28ms. Allocated memory is still 179.3MB. Free memory was 154.4MB in the beginning and 125.6MB in the end (delta: 28.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.01ms. Allocated memory is still 179.3MB. Free memory was 125.6MB in the beginning and 123.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.59ms. Allocated memory is still 179.3MB. Free memory was 123.0MB in the beginning and 120.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 595.23ms. Allocated memory was 179.3MB in the beginning and 221.2MB in the end (delta: 41.9MB). Free memory was 120.9MB in the beginning and 181.5MB in the end (delta: -60.6MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 80680.36ms. Allocated memory was 221.2MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 180.9MB in the beginning and 1.1GB in the end (delta: -921.4MB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 112 PlacesBefore, 37 PlacesAfterwards, 104 TransitionsBefore, 28 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1413, independent: 1360, independent conditional: 1360, independent unconditional: 0, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1413, independent: 1360, independent conditional: 0, independent unconditional: 1360, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1413, independent: 1360, independent conditional: 0, independent unconditional: 1360, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1413, independent: 1360, independent conditional: 0, independent unconditional: 1360, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1173, independent: 1129, independent conditional: 0, independent unconditional: 1129, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1173, independent: 1106, independent conditional: 0, independent unconditional: 1106, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 252, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 231, dependent conditional: 0, dependent unconditional: 231, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1413, independent: 231, independent conditional: 0, independent unconditional: 231, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 1173, unknown conditional: 0, unknown unconditional: 1173] , Statistics on independence cache: Total cache size (in pairs): 1723, Positive cache size: 1679, Positive conditional cache size: 0, Positive unconditional cache size: 1679, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 37 PlacesBefore, 35 PlacesAfterwards, 43 TransitionsBefore, 41 TransitionsAfterwards, 92 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 92 TransitionsBefore, 92 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 140 TransitionsBefore, 140 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 266 TransitionsBefore, 266 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 340 TransitionsBefore, 340 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 397 TransitionsBefore, 397 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 63 PlacesBefore, 63 PlacesAfterwards, 783 TransitionsBefore, 783 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 68 PlacesBefore, 68 PlacesAfterwards, 952 TransitionsBefore, 952 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 71 PlacesBefore, 71 PlacesAfterwards, 951 TransitionsBefore, 951 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 76 PlacesBefore, 76 PlacesAfterwards, 1368 TransitionsBefore, 1368 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 80 PlacesBefore, 80 PlacesAfterwards, 1495 TransitionsBefore, 1495 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 84 PlacesBefore, 84 PlacesAfterwards, 1980 TransitionsBefore, 1980 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 91 PlacesBefore, 91 PlacesAfterwards, 2450 TransitionsBefore, 2450 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 97 PlacesBefore, 97 PlacesAfterwards, 2628 TransitionsBefore, 2628 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 104 PlacesBefore, 104 PlacesAfterwards, 2670 TransitionsBefore, 2670 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 109 PlacesBefore, 109 PlacesAfterwards, 2719 TransitionsBefore, 2719 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 113 PlacesBefore, 113 PlacesAfterwards, 2860 TransitionsBefore, 2860 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 119 PlacesBefore, 119 PlacesAfterwards, 3219 TransitionsBefore, 3219 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 80.6s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 62.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1057 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1057 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 417 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2307 IncrementalHoareTripleChecker+Invalid, 2724 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 417 mSolverCounterUnsat, 0 mSDtfsCounter, 2307 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122373occurred in iteration=18, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 213 ConstructedInterpolants, 0 QuantifiedInterpolants, 4937 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 01:12:58,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...