/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe013_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 12:01:26,256 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:01:26,258 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:01:26,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:01:26,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:01:26,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:01:26,295 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:01:26,298 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:01:26,301 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:01:26,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:01:26,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:01:26,307 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:01:26,307 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:01:26,309 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:01:26,309 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:01:26,312 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:01:26,312 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:01:26,313 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:01:26,315 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:01:26,318 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:01:26,319 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:01:26,320 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:01:26,321 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:01:26,321 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:01:26,327 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:01:26,327 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:01:26,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:01:26,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:01:26,329 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:01:26,330 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:01:26,330 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:01:26,331 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:01:26,332 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:01:26,332 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:01:26,333 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:01:26,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:01:26,333 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:01:26,333 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:01:26,334 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:01:26,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:01:26,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:01:26,336 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 12:01:26,360 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:01:26,360 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:01:26,361 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:01:26,362 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:01:26,362 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:01:26,362 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:01:26,362 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:01:26,363 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:01:26,363 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:01:26,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:01:26,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:01:26,364 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:01:26,364 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:01:26,364 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:01:26,364 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:01:26,364 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:01:26,364 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:01:26,364 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:01:26,364 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:01:26,365 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 12:01:26,365 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:01:26,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:01:26,365 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:01:26,365 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:01:26,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:01:26,365 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:01:26,365 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:01:26,366 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 12:01:26,366 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 [2022-12-13 12:01:26,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:01:26,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:01:26,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:01:26,858 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:01:26,861 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:01:26,863 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_tso.i [2022-12-13 12:01:27,888 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:01:28,281 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:01:28,282 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_tso.i [2022-12-13 12:01:28,317 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6af819a22/1cf3b431395241e3b9c0b33e2385ac2f/FLAGe42bf57e1 [2022-12-13 12:01:28,359 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6af819a22/1cf3b431395241e3b9c0b33e2385ac2f [2022-12-13 12:01:28,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:01:28,363 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 12:01:28,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:01:28,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:01:28,367 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:01:28,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:01:28" (1/1) ... [2022-12-13 12:01:28,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a4c0538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:28, skipping insertion in model container [2022-12-13 12:01:28,369 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:01:28" (1/1) ... [2022-12-13 12:01:28,375 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:01:28,455 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:01:28,761 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/safe013_tso.i[945,958] [2022-12-13 12:01:29,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:29,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:29,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:29,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:29,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:29,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:29,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:29,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:29,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:29,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:29,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:29,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:29,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:29,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:29,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:29,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:29,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:29,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:29,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:29,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:29,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:29,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:29,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:29,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:29,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:29,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:29,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:29,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:29,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:29,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:29,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:29,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:29,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:01:29,079 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:01:29,108 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/safe013_tso.i[945,958] [2022-12-13 12:01:29,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:29,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:29,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:29,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:29,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:29,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:29,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:29,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:29,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:29,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:29,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:29,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:29,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:29,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:29,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:29,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:29,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:29,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:29,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:29,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:29,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:29,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:29,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:29,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:29,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:29,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:29,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:29,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:29,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:29,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:29,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:29,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:29,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:01:29,242 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:01:29,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:29 WrapperNode [2022-12-13 12:01:29,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:01:29,244 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:01:29,244 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:01:29,244 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:01:29,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:29" (1/1) ... [2022-12-13 12:01:29,286 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:29" (1/1) ... [2022-12-13 12:01:29,319 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2022-12-13 12:01:29,319 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:01:29,329 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:01:29,329 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:01:29,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:01:29,336 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:29" (1/1) ... [2022-12-13 12:01:29,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:29" (1/1) ... [2022-12-13 12:01:29,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:29" (1/1) ... [2022-12-13 12:01:29,354 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:29" (1/1) ... [2022-12-13 12:01:29,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:29" (1/1) ... [2022-12-13 12:01:29,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:29" (1/1) ... [2022-12-13 12:01:29,359 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:29" (1/1) ... [2022-12-13 12:01:29,360 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:29" (1/1) ... [2022-12-13 12:01:29,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:01:29,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:01:29,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:01:29,362 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:01:29,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:29" (1/1) ... [2022-12-13 12:01:29,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:01:29,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:01:29,392 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-13 12:01:29,417 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-13 12:01:29,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:01:29,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 12:01:29,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:01:29,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:01:29,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:01:29,442 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 12:01:29,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 12:01:29,442 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 12:01:29,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 12:01:29,442 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 12:01:29,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 12:01:29,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:01:29,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 12:01:29,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:01:29,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:01:29,444 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 12:01:29,604 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 12:01:29,605 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:01:29,815 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 12:01:29,829 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:01:29,829 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:01:29,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:01:29 BoogieIcfgContainer [2022-12-13 12:01:29,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:01:29,835 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:01:29,836 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:01:29,839 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:01:29,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:01:28" (1/3) ... [2022-12-13 12:01:29,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53bafdfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:01:29, skipping insertion in model container [2022-12-13 12:01:29,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:29" (2/3) ... [2022-12-13 12:01:29,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53bafdfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:01:29, skipping insertion in model container [2022-12-13 12:01:29,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:01:29" (3/3) ... [2022-12-13 12:01:29,841 INFO L112 eAbstractionObserver]: Analyzing ICFG safe013_tso.i [2022-12-13 12:01:29,859 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:01:29,859 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 12:01:29,860 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:01:29,931 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 12:01:29,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 85 transitions, 185 flow [2022-12-13 12:01:30,026 INFO L130 PetriNetUnfolder]: 2/82 cut-off events. [2022-12-13 12:01:30,026 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:01:30,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 82 events. 2/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2022-12-13 12:01:30,030 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 85 transitions, 185 flow [2022-12-13 12:01:30,035 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 70 transitions, 149 flow [2022-12-13 12:01:30,037 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:01:30,054 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 70 transitions, 149 flow [2022-12-13 12:01:30,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 70 transitions, 149 flow [2022-12-13 12:01:30,069 INFO L130 PetriNetUnfolder]: 1/70 cut-off events. [2022-12-13 12:01:30,069 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:01:30,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 70 events. 1/70 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 38 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-13 12:01:30,072 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 70 transitions, 149 flow [2022-12-13 12:01:30,072 INFO L226 LiptonReduction]: Number of co-enabled transitions 1044 [2022-12-13 12:01:31,976 INFO L241 LiptonReduction]: Total number of compositions: 53 [2022-12-13 12:01:31,987 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:01:31,992 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;@1fee3afe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 12:01:31,992 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 12:01:31,999 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-13 12:01:32,000 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:01:32,000 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:01:32,001 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:32,002 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:01:32,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:32,009 INFO L85 PathProgramCache]: Analyzing trace with hash 225880474, now seen corresponding path program 1 times [2022-12-13 12:01:32,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:32,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863975995] [2022-12-13 12:01:32,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:32,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:32,359 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-13 12:01:32,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:01:32,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863975995] [2022-12-13 12:01:32,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863975995] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:01:32,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:01:32,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:01:32,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128629200] [2022-12-13 12:01:32,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:01:32,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:01:32,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:01:32,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:01:32,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:01:32,407 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2022-12-13 12:01:32,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-13 12:01:32,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:01:32,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2022-12-13 12:01:32,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:01:32,534 INFO L130 PetriNetUnfolder]: 869/1452 cut-off events. [2022-12-13 12:01:32,535 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-13 12:01:32,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2869 conditions, 1452 events. 869/1452 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 8572 event pairs, 316 based on Foata normal form. 64/1181 useless extension candidates. Maximal degree in co-relation 2858. Up to 886 conditions per place. [2022-12-13 12:01:32,544 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 29 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-13 12:01:32,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 165 flow [2022-12-13 12:01:32,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:01:32,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:01:32,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-12-13 12:01:32,552 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7160493827160493 [2022-12-13 12:01:32,553 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 58 transitions. [2022-12-13 12:01:32,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 165 flow [2022-12-13 12:01:32,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 160 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 12:01:32,557 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 87 flow [2022-12-13 12:01:32,558 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2022-12-13 12:01:32,561 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2022-12-13 12:01:32,561 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:01:32,562 INFO L89 Accepts]: Start accepts. Operand has 36 places, 29 transitions, 87 flow [2022-12-13 12:01:32,563 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:01:32,564 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:01:32,564 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 87 flow [2022-12-13 12:01:32,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 87 flow [2022-12-13 12:01:32,569 INFO L130 PetriNetUnfolder]: 11/79 cut-off events. [2022-12-13 12:01:32,570 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 12:01:32,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 79 events. 11/79 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 349 event pairs, 7 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 118. Up to 26 conditions per place. [2022-12-13 12:01:32,572 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 87 flow [2022-12-13 12:01:32,572 INFO L226 LiptonReduction]: Number of co-enabled transitions 392 [2022-12-13 12:01:32,600 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:01:32,602 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-13 12:01:32,602 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 87 flow [2022-12-13 12:01:32,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-13 12:01:32,602 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:01:32,602 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:32,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:01:32,603 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:01:32,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:32,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1587639342, now seen corresponding path program 1 times [2022-12-13 12:01:32,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:32,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269189095] [2022-12-13 12:01:32,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:32,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:32,679 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-13 12:01:32,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:01:32,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269189095] [2022-12-13 12:01:32,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269189095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:01:32,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:01:32,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:01:32,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255314316] [2022-12-13 12:01:32,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:01:32,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:01:32,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:01:32,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:01:32,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:01:32,681 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 26 [2022-12-13 12:01:32,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-13 12:01:32,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:01:32,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 26 [2022-12-13 12:01:32,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:01:32,763 INFO L130 PetriNetUnfolder]: 626/1184 cut-off events. [2022-12-13 12:01:32,763 INFO L131 PetriNetUnfolder]: For 149/149 co-relation queries the response was YES. [2022-12-13 12:01:32,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2548 conditions, 1184 events. 626/1184 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 7461 event pairs, 219 based on Foata normal form. 12/880 useless extension candidates. Maximal degree in co-relation 2537. Up to 812 conditions per place. [2022-12-13 12:01:32,769 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 23 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2022-12-13 12:01:32,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 36 transitions, 156 flow [2022-12-13 12:01:32,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:01:32,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:01:32,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-13 12:01:32,771 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 12:01:32,771 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 87 flow. Second operand 3 states and 52 transitions. [2022-12-13 12:01:32,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 36 transitions, 156 flow [2022-12-13 12:01:32,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 36 transitions, 150 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:01:32,773 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 93 flow [2022-12-13 12:01:32,773 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2022-12-13 12:01:32,774 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2022-12-13 12:01:32,774 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:01:32,774 INFO L89 Accepts]: Start accepts. Operand has 38 places, 29 transitions, 93 flow [2022-12-13 12:01:32,774 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:01:32,775 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:01:32,775 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 29 transitions, 93 flow [2022-12-13 12:01:32,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 29 transitions, 93 flow [2022-12-13 12:01:32,779 INFO L130 PetriNetUnfolder]: 8/68 cut-off events. [2022-12-13 12:01:32,779 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 12:01:32,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 68 events. 8/68 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 275 event pairs, 4 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 107. Up to 21 conditions per place. [2022-12-13 12:01:32,780 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 29 transitions, 93 flow [2022-12-13 12:01:32,780 INFO L226 LiptonReduction]: Number of co-enabled transitions 390 [2022-12-13 12:01:32,781 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:01:32,782 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 12:01:32,782 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 93 flow [2022-12-13 12:01:32,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-13 12:01:32,783 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:01:32,783 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:32,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:01:32,783 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:01:32,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:32,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1587639869, now seen corresponding path program 1 times [2022-12-13 12:01:32,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:32,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912406768] [2022-12-13 12:01:32,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:32,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:32,911 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-13 12:01:32,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:01:32,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912406768] [2022-12-13 12:01:32,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912406768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:01:32,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:01:32,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:01:32,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332719277] [2022-12-13 12:01:32,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:01:32,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:01:32,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:01:32,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:01:32,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:01:32,920 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 26 [2022-12-13 12:01:32,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-13 12:01:32,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:01:32,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 26 [2022-12-13 12:01:32,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:01:33,048 INFO L130 PetriNetUnfolder]: 801/1360 cut-off events. [2022-12-13 12:01:33,048 INFO L131 PetriNetUnfolder]: For 293/293 co-relation queries the response was YES. [2022-12-13 12:01:33,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3135 conditions, 1360 events. 801/1360 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 7719 event pairs, 199 based on Foata normal form. 4/1045 useless extension candidates. Maximal degree in co-relation 3122. Up to 789 conditions per place. [2022-12-13 12:01:33,056 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 33 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2022-12-13 12:01:33,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 47 transitions, 217 flow [2022-12-13 12:01:33,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:01:33,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:01:33,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-13 12:01:33,059 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6538461538461539 [2022-12-13 12:01:33,059 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 93 flow. Second operand 4 states and 68 transitions. [2022-12-13 12:01:33,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 47 transitions, 217 flow [2022-12-13 12:01:33,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 47 transitions, 211 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:01:33,062 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 115 flow [2022-12-13 12:01:33,062 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2022-12-13 12:01:33,063 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2022-12-13 12:01:33,063 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:01:33,063 INFO L89 Accepts]: Start accepts. Operand has 40 places, 31 transitions, 115 flow [2022-12-13 12:01:33,064 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:01:33,064 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:01:33,064 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 31 transitions, 115 flow [2022-12-13 12:01:33,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 115 flow [2022-12-13 12:01:33,072 INFO L130 PetriNetUnfolder]: 6/61 cut-off events. [2022-12-13 12:01:33,072 INFO L131 PetriNetUnfolder]: For 17/20 co-relation queries the response was YES. [2022-12-13 12:01:33,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 61 events. 6/61 cut-off events. For 17/20 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 232 event pairs, 3 based on Foata normal form. 1/42 useless extension candidates. Maximal degree in co-relation 109. Up to 18 conditions per place. [2022-12-13 12:01:33,074 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 31 transitions, 115 flow [2022-12-13 12:01:33,074 INFO L226 LiptonReduction]: Number of co-enabled transitions 416 [2022-12-13 12:01:33,075 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:01:33,076 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 12:01:33,076 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 115 flow [2022-12-13 12:01:33,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-13 12:01:33,077 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:01:33,077 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:33,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:01:33,077 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:01:33,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:33,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1972179317, now seen corresponding path program 1 times [2022-12-13 12:01:33,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:33,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164357491] [2022-12-13 12:01:33,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:33,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:33,221 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-13 12:01:33,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:01:33,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164357491] [2022-12-13 12:01:33,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164357491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:01:33,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:01:33,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:01:33,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047698164] [2022-12-13 12:01:33,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:01:33,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:01:33,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:01:33,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:01:33,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:01:33,222 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 12:01:33,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-13 12:01:33,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:01:33,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 12:01:33,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:01:33,404 INFO L130 PetriNetUnfolder]: 1122/1897 cut-off events. [2022-12-13 12:01:33,404 INFO L131 PetriNetUnfolder]: For 916/916 co-relation queries the response was YES. [2022-12-13 12:01:33,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4650 conditions, 1897 events. 1122/1897 cut-off events. For 916/916 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 10491 event pairs, 151 based on Foata normal form. 20/1528 useless extension candidates. Maximal degree in co-relation 4636. Up to 653 conditions per place. [2022-12-13 12:01:33,413 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 50 selfloop transitions, 18 changer transitions 0/74 dead transitions. [2022-12-13 12:01:33,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 74 transitions, 408 flow [2022-12-13 12:01:33,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:01:33,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:01:33,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-13 12:01:33,416 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7 [2022-12-13 12:01:33,416 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 115 flow. Second operand 5 states and 91 transitions. [2022-12-13 12:01:33,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 74 transitions, 408 flow [2022-12-13 12:01:33,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 74 transitions, 408 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 12:01:33,421 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 279 flow [2022-12-13 12:01:33,421 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=279, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2022-12-13 12:01:33,422 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places. [2022-12-13 12:01:33,422 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:01:33,422 INFO L89 Accepts]: Start accepts. Operand has 48 places, 44 transitions, 279 flow [2022-12-13 12:01:33,423 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:01:33,423 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:01:33,424 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 44 transitions, 279 flow [2022-12-13 12:01:33,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 44 transitions, 279 flow [2022-12-13 12:01:33,432 INFO L130 PetriNetUnfolder]: 22/138 cut-off events. [2022-12-13 12:01:33,432 INFO L131 PetriNetUnfolder]: For 136/149 co-relation queries the response was YES. [2022-12-13 12:01:33,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 138 events. 22/138 cut-off events. For 136/149 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 758 event pairs, 0 based on Foata normal form. 3/92 useless extension candidates. Maximal degree in co-relation 346. Up to 34 conditions per place. [2022-12-13 12:01:33,434 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 44 transitions, 279 flow [2022-12-13 12:01:33,434 INFO L226 LiptonReduction]: Number of co-enabled transitions 520 [2022-12-13 12:01:33,436 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:01:33,442 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-13 12:01:33,442 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 279 flow [2022-12-13 12:01:33,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-13 12:01:33,442 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:01:33,443 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:33,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:01:33,443 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:01:33,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:33,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1972195127, now seen corresponding path program 2 times [2022-12-13 12:01:33,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:33,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308166657] [2022-12-13 12:01:33,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:33,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:33,528 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-13 12:01:33,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:01:33,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308166657] [2022-12-13 12:01:33,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308166657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:01:33,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:01:33,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:01:33,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288340705] [2022-12-13 12:01:33,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:01:33,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:01:33,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:01:33,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:01:33,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:01:33,530 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 12:01:33,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 279 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-13 12:01:33,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:01:33,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 12:01:33,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:01:33,681 INFO L130 PetriNetUnfolder]: 1315/2274 cut-off events. [2022-12-13 12:01:33,681 INFO L131 PetriNetUnfolder]: For 3581/3581 co-relation queries the response was YES. [2022-12-13 12:01:33,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6470 conditions, 2274 events. 1315/2274 cut-off events. For 3581/3581 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 13427 event pairs, 318 based on Foata normal form. 80/1837 useless extension candidates. Maximal degree in co-relation 6450. Up to 807 conditions per place. [2022-12-13 12:01:33,692 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 37 selfloop transitions, 9 changer transitions 20/72 dead transitions. [2022-12-13 12:01:33,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 72 transitions, 520 flow [2022-12-13 12:01:33,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:01:33,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:01:33,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-12-13 12:01:33,693 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6307692307692307 [2022-12-13 12:01:33,693 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 279 flow. Second operand 5 states and 82 transitions. [2022-12-13 12:01:33,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 72 transitions, 520 flow [2022-12-13 12:01:33,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 72 transitions, 520 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 12:01:33,698 INFO L231 Difference]: Finished difference. Result has 54 places, 33 transitions, 205 flow [2022-12-13 12:01:33,698 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=205, PETRI_PLACES=54, PETRI_TRANSITIONS=33} [2022-12-13 12:01:33,698 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 18 predicate places. [2022-12-13 12:01:33,698 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:01:33,698 INFO L89 Accepts]: Start accepts. Operand has 54 places, 33 transitions, 205 flow [2022-12-13 12:01:33,699 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:01:33,699 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:01:33,699 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 33 transitions, 205 flow [2022-12-13 12:01:33,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 33 transitions, 205 flow [2022-12-13 12:01:33,730 INFO L130 PetriNetUnfolder]: 7/66 cut-off events. [2022-12-13 12:01:33,730 INFO L131 PetriNetUnfolder]: For 105/106 co-relation queries the response was YES. [2022-12-13 12:01:33,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 66 events. 7/66 cut-off events. For 105/106 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 251 event pairs, 3 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 190. Up to 19 conditions per place. [2022-12-13 12:01:33,731 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 33 transitions, 205 flow [2022-12-13 12:01:33,731 INFO L226 LiptonReduction]: Number of co-enabled transitions 364 [2022-12-13 12:01:33,732 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:01:33,732 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-13 12:01:33,732 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 33 transitions, 205 flow [2022-12-13 12:01:33,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-13 12:01:33,732 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:01:33,733 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:33,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:01:33,733 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:01:33,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:33,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1502237140, now seen corresponding path program 1 times [2022-12-13 12:01:33,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:33,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444251551] [2022-12-13 12:01:33,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:33,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:33,803 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-13 12:01:33,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:01:33,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444251551] [2022-12-13 12:01:33,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444251551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:01:33,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:01:33,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:01:33,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343093943] [2022-12-13 12:01:33,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:01:33,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:01:33,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:01:33,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:01:33,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:01:33,805 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 12:01:33,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 33 transitions, 205 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-13 12:01:33,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:01:33,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 12:01:33,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:01:34,011 INFO L130 PetriNetUnfolder]: 1310/2122 cut-off events. [2022-12-13 12:01:34,014 INFO L131 PetriNetUnfolder]: For 7074/7166 co-relation queries the response was YES. [2022-12-13 12:01:34,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6042 conditions, 2122 events. 1310/2122 cut-off events. For 7074/7166 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 12647 event pairs, 435 based on Foata normal form. 111/1164 useless extension candidates. Maximal degree in co-relation 6018. Up to 1546 conditions per place. [2022-12-13 12:01:34,025 INFO L137 encePairwiseOnDemand]: 14/26 looper letters, 44 selfloop transitions, 17 changer transitions 14/84 dead transitions. [2022-12-13 12:01:34,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 84 transitions, 602 flow [2022-12-13 12:01:34,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:01:34,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:01:34,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2022-12-13 12:01:34,028 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7153846153846154 [2022-12-13 12:01:34,028 INFO L175 Difference]: Start difference. First operand has 54 places, 33 transitions, 205 flow. Second operand 5 states and 93 transitions. [2022-12-13 12:01:34,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 84 transitions, 602 flow [2022-12-13 12:01:34,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 84 transitions, 485 flow, removed 10 selfloop flow, removed 10 redundant places. [2022-12-13 12:01:34,035 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 274 flow [2022-12-13 12:01:34,035 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=274, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2022-12-13 12:01:34,037 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places. [2022-12-13 12:01:34,037 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:01:34,037 INFO L89 Accepts]: Start accepts. Operand has 51 places, 49 transitions, 274 flow [2022-12-13 12:01:34,038 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:01:34,038 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:01:34,039 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 49 transitions, 274 flow [2022-12-13 12:01:34,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 49 transitions, 274 flow [2022-12-13 12:01:34,108 INFO L130 PetriNetUnfolder]: 889/1521 cut-off events. [2022-12-13 12:01:34,109 INFO L131 PetriNetUnfolder]: For 1321/1486 co-relation queries the response was YES. [2022-12-13 12:01:34,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4692 conditions, 1521 events. 889/1521 cut-off events. For 1321/1486 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 9834 event pairs, 412 based on Foata normal form. 2/648 useless extension candidates. Maximal degree in co-relation 4675. Up to 1346 conditions per place. [2022-12-13 12:01:34,118 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 49 transitions, 274 flow [2022-12-13 12:01:34,118 INFO L226 LiptonReduction]: Number of co-enabled transitions 500 [2022-12-13 12:01:34,142 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] L785-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39| (mod v_~main$tmp_guard0~0_42 256)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_123 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_42)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_39|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [191] L761-->L766: Formula: (= (+ v_~__unbuffered_cnt~0_6 1) v_~__unbuffered_cnt~0_5) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_6} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_5} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 12:01:34,159 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] L785-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39| (mod v_~main$tmp_guard0~0_42 256)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_123 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_42)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_39|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [185] L746-->L751: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 12:01:34,177 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] L785-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39| (mod v_~main$tmp_guard0~0_42 256)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_123 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_42)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_39|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [235] L761-->P2FINAL: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_88 1) v_~__unbuffered_cnt~0_87)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-13 12:01:34,205 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] L785-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39| (mod v_~main$tmp_guard0~0_42 256)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_123 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_42)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_39|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [234] L746-->P1FINAL: Formula: (and (= v_~__unbuffered_cnt~0_79 (+ v_~__unbuffered_cnt~0_80 1)) (= |v_P1Thread1of1ForFork2_#res.base_5| 0) (= |v_P1Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-13 12:01:34,231 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] L785-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39| (mod v_~main$tmp_guard0~0_42 256)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_123 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_42)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_39|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [255] L761-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_21| 0) (= v_~__unbuffered_cnt~0_171 (+ v_~__unbuffered_cnt~0_172 1)) (= |v_P2Thread1of1ForFork0_#res.base_21| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_172} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_21|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-13 12:01:34,256 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] L785-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39| (mod v_~main$tmp_guard0~0_42 256)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_123 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_42)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_39|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [241] L746-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.offset_9| 0) (= v_~__unbuffered_cnt~0_105 (+ v_~__unbuffered_cnt~0_106 1)) (= |v_P1Thread1of1ForFork2_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-13 12:01:34,594 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:01:34,595 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 558 [2022-12-13 12:01:34,595 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 232 flow [2022-12-13 12:01:34,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-13 12:01:34,595 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:01:34,595 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:34,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:01:34,595 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:01:34,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:34,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1555366855, now seen corresponding path program 1 times [2022-12-13 12:01:34,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:34,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151932073] [2022-12-13 12:01:34,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:34,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:34,744 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-13 12:01:34,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:01:34,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151932073] [2022-12-13 12:01:34,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151932073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:01:34,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:01:34,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:01:34,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663139463] [2022-12-13 12:01:34,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:01:34,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:01:34,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:01:34,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:01:34,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:01:34,745 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 12:01:34,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 232 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-13 12:01:34,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:01:34,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 12:01:34,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:01:34,953 INFO L130 PetriNetUnfolder]: 894/1588 cut-off events. [2022-12-13 12:01:34,953 INFO L131 PetriNetUnfolder]: For 2496/2694 co-relation queries the response was YES. [2022-12-13 12:01:34,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6344 conditions, 1588 events. 894/1588 cut-off events. For 2496/2694 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 9966 event pairs, 93 based on Foata normal form. 111/945 useless extension candidates. Maximal degree in co-relation 6324. Up to 1264 conditions per place. [2022-12-13 12:01:34,964 INFO L137 encePairwiseOnDemand]: 14/26 looper letters, 40 selfloop transitions, 26 changer transitions 17/92 dead transitions. [2022-12-13 12:01:34,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 92 transitions, 686 flow [2022-12-13 12:01:34,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:01:34,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:01:34,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2022-12-13 12:01:34,965 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7115384615384616 [2022-12-13 12:01:34,965 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 232 flow. Second operand 6 states and 111 transitions. [2022-12-13 12:01:34,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 92 transitions, 686 flow [2022-12-13 12:01:34,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 92 transitions, 674 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 12:01:34,972 INFO L231 Difference]: Finished difference. Result has 55 places, 58 transitions, 428 flow [2022-12-13 12:01:34,973 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=428, PETRI_PLACES=55, PETRI_TRANSITIONS=58} [2022-12-13 12:01:34,973 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2022-12-13 12:01:34,973 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:01:34,973 INFO L89 Accepts]: Start accepts. Operand has 55 places, 58 transitions, 428 flow [2022-12-13 12:01:34,974 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:01:34,974 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:01:34,974 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 58 transitions, 428 flow [2022-12-13 12:01:34,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 58 transitions, 428 flow [2022-12-13 12:01:35,044 INFO L130 PetriNetUnfolder]: 463/1019 cut-off events. [2022-12-13 12:01:35,044 INFO L131 PetriNetUnfolder]: For 1769/2018 co-relation queries the response was YES. [2022-12-13 12:01:35,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4530 conditions, 1019 events. 463/1019 cut-off events. For 1769/2018 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 7553 event pairs, 82 based on Foata normal form. 5/494 useless extension candidates. Maximal degree in co-relation 4510. Up to 904 conditions per place. [2022-12-13 12:01:35,056 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 58 transitions, 428 flow [2022-12-13 12:01:35,056 INFO L226 LiptonReduction]: Number of co-enabled transitions 458 [2022-12-13 12:01:35,062 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] L785-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39| (mod v_~main$tmp_guard0~0_42 256)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_123 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_42)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_39|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [191] L761-->L766: Formula: (= (+ v_~__unbuffered_cnt~0_6 1) v_~__unbuffered_cnt~0_5) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_6} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_5} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 12:01:35,080 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] L785-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39| (mod v_~main$tmp_guard0~0_42 256)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_123 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_42)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_39|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [235] L761-->P2FINAL: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_88 1) v_~__unbuffered_cnt~0_87)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-13 12:01:35,111 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] L785-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39| (mod v_~main$tmp_guard0~0_42 256)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_123 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_42)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_39|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [255] L761-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_21| 0) (= v_~__unbuffered_cnt~0_171 (+ v_~__unbuffered_cnt~0_172 1)) (= |v_P2Thread1of1ForFork0_#res.base_21| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_172} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_21|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-13 12:01:35,143 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] L785-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39| (mod v_~main$tmp_guard0~0_42 256)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_123 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_42)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_39|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [185] L746-->L751: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 12:01:35,163 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] L785-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39| (mod v_~main$tmp_guard0~0_42 256)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_123 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_42)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_39|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [234] L746-->P1FINAL: Formula: (and (= v_~__unbuffered_cnt~0_79 (+ v_~__unbuffered_cnt~0_80 1)) (= |v_P1Thread1of1ForFork2_#res.base_5| 0) (= |v_P1Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-13 12:01:35,192 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [249] L785-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39| (mod v_~main$tmp_guard0~0_42 256)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_123 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_42)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_39|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [241] L746-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.offset_9| 0) (= v_~__unbuffered_cnt~0_105 (+ v_~__unbuffered_cnt~0_106 1)) (= |v_P1Thread1of1ForFork2_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-13 12:01:35,331 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:01:35,332 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 359 [2022-12-13 12:01:35,332 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 360 flow [2022-12-13 12:01:35,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-13 12:01:35,333 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:01:35,333 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:35,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:01:35,333 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:01:35,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:35,334 INFO L85 PathProgramCache]: Analyzing trace with hash -742558162, now seen corresponding path program 1 times [2022-12-13 12:01:35,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:35,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945268713] [2022-12-13 12:01:35,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:35,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:35,423 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-13 12:01:35,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:01:35,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945268713] [2022-12-13 12:01:35,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945268713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:01:35,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:01:35,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:01:35,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338828083] [2022-12-13 12:01:35,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:01:35,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:01:35,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:01:35,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:01:35,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:01:35,425 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 26 [2022-12-13 12:01:35,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 360 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-13 12:01:35,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:01:35,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 26 [2022-12-13 12:01:35,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:01:35,572 INFO L130 PetriNetUnfolder]: 777/1500 cut-off events. [2022-12-13 12:01:35,572 INFO L131 PetriNetUnfolder]: For 3841/4004 co-relation queries the response was YES. [2022-12-13 12:01:35,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6994 conditions, 1500 events. 777/1500 cut-off events. For 3841/4004 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 9510 event pairs, 156 based on Foata normal form. 92/1250 useless extension candidates. Maximal degree in co-relation 6971. Up to 1164 conditions per place. [2022-12-13 12:01:35,580 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 33 selfloop transitions, 2 changer transitions 29/79 dead transitions. [2022-12-13 12:01:35,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 79 transitions, 684 flow [2022-12-13 12:01:35,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:01:35,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:01:35,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-13 12:01:35,581 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6442307692307693 [2022-12-13 12:01:35,582 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 360 flow. Second operand 4 states and 67 transitions. [2022-12-13 12:01:35,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 79 transitions, 684 flow [2022-12-13 12:01:35,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 79 transitions, 584 flow, removed 38 selfloop flow, removed 4 redundant places. [2022-12-13 12:01:35,622 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 266 flow [2022-12-13 12:01:35,622 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=266, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2022-12-13 12:01:35,622 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 18 predicate places. [2022-12-13 12:01:35,623 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:01:35,623 INFO L89 Accepts]: Start accepts. Operand has 54 places, 46 transitions, 266 flow [2022-12-13 12:01:35,623 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:01:35,623 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:01:35,624 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 46 transitions, 266 flow [2022-12-13 12:01:35,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 46 transitions, 266 flow [2022-12-13 12:01:35,672 INFO L130 PetriNetUnfolder]: 343/853 cut-off events. [2022-12-13 12:01:35,673 INFO L131 PetriNetUnfolder]: For 701/785 co-relation queries the response was YES. [2022-12-13 12:01:35,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2989 conditions, 853 events. 343/853 cut-off events. For 701/785 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 6745 event pairs, 82 based on Foata normal form. 3/418 useless extension candidates. Maximal degree in co-relation 2970. Up to 592 conditions per place. [2022-12-13 12:01:35,679 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 46 transitions, 266 flow [2022-12-13 12:01:35,679 INFO L226 LiptonReduction]: Number of co-enabled transitions 324 [2022-12-13 12:01:35,800 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:01:35,801 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-13 12:01:35,801 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 267 flow [2022-12-13 12:01:35,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-13 12:01:35,801 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:01:35,801 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:35,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:01:35,801 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 12:01:35,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:35,802 INFO L85 PathProgramCache]: Analyzing trace with hash -689032805, now seen corresponding path program 1 times [2022-12-13 12:01:35,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:35,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708301595] [2022-12-13 12:01:35,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:35,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:35,862 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-13 12:01:35,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:01:35,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708301595] [2022-12-13 12:01:35,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708301595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:01:35,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:01:35,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:01:35,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573377977] [2022-12-13 12:01:35,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:01:35,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:01:35,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:01:35,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:01:35,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:01:35,863 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 12:01:35,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 267 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-13 12:01:35,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:01:35,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 12:01:35,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:01:35,965 INFO L130 PetriNetUnfolder]: 403/795 cut-off events. [2022-12-13 12:01:35,965 INFO L131 PetriNetUnfolder]: For 884/1059 co-relation queries the response was YES. [2022-12-13 12:01:35,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3235 conditions, 795 events. 403/795 cut-off events. For 884/1059 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 4774 event pairs, 16 based on Foata normal form. 35/411 useless extension candidates. Maximal degree in co-relation 3213. Up to 406 conditions per place. [2022-12-13 12:01:35,970 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 0 selfloop transitions, 0 changer transitions 56/56 dead transitions. [2022-12-13 12:01:35,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 56 transitions, 405 flow [2022-12-13 12:01:35,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:01:35,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:01:35,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-12-13 12:01:35,971 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5846153846153846 [2022-12-13 12:01:35,971 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 267 flow. Second operand 5 states and 76 transitions. [2022-12-13 12:01:35,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 56 transitions, 405 flow [2022-12-13 12:01:35,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 56 transitions, 374 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-12-13 12:01:35,973 INFO L231 Difference]: Finished difference. Result has 51 places, 0 transitions, 0 flow [2022-12-13 12:01:35,974 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=51, PETRI_TRANSITIONS=0} [2022-12-13 12:01:35,974 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places. [2022-12-13 12:01:35,974 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:01:35,974 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 0 transitions, 0 flow [2022-12-13 12:01:35,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 12:01:35,975 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 12:01:35,975 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:01:35,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-13 12:01:35,975 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 12:01:35,975 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 12:01:35,975 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:01:35,976 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 12:01:35,976 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 12:01:35,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-13 12:01:35,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 12:01:35,979 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 12:01:35,979 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 12:01:35,979 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 12:01:35,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 12:01:35,979 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:35,982 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 12:01:35,982 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:01:35,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:01:35 BasicIcfg [2022-12-13 12:01:35,985 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:01:35,986 INFO L158 Benchmark]: Toolchain (without parser) took 7623.33ms. Allocated memory was 209.7MB in the beginning and 355.5MB in the end (delta: 145.8MB). Free memory was 184.1MB in the beginning and 317.6MB in the end (delta: -133.5MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. [2022-12-13 12:01:35,986 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 209.7MB. Free memory was 186.0MB in the beginning and 185.9MB in the end (delta: 94.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 12:01:35,986 INFO L158 Benchmark]: CACSL2BoogieTranslator took 877.87ms. Allocated memory is still 209.7MB. Free memory was 184.0MB in the beginning and 159.8MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-13 12:01:35,987 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.61ms. Allocated memory is still 209.7MB. Free memory was 159.8MB in the beginning and 157.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 12:01:35,987 INFO L158 Benchmark]: Boogie Preprocessor took 32.64ms. Allocated memory is still 209.7MB. Free memory was 157.7MB in the beginning and 156.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 12:01:35,987 INFO L158 Benchmark]: RCFGBuilder took 469.95ms. Allocated memory is still 209.7MB. Free memory was 156.2MB in the beginning and 142.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 12:01:35,987 INFO L158 Benchmark]: TraceAbstraction took 6150.01ms. Allocated memory was 209.7MB in the beginning and 355.5MB in the end (delta: 145.8MB). Free memory was 141.0MB in the beginning and 317.6MB in the end (delta: -176.6MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 12:01:35,989 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.11ms. Allocated memory is still 209.7MB. Free memory was 186.0MB in the beginning and 185.9MB in the end (delta: 94.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 877.87ms. Allocated memory is still 209.7MB. Free memory was 184.0MB in the beginning and 159.8MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 75.61ms. Allocated memory is still 209.7MB. Free memory was 159.8MB in the beginning and 157.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.64ms. Allocated memory is still 209.7MB. Free memory was 157.7MB in the beginning and 156.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 469.95ms. Allocated memory is still 209.7MB. Free memory was 156.2MB in the beginning and 142.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 6150.01ms. Allocated memory was 209.7MB in the beginning and 355.5MB in the end (delta: 145.8MB). Free memory was 141.0MB in the beginning and 317.6MB in the end (delta: -176.6MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 79 PlacesBefore, 36 PlacesAfterwards, 70 TransitionsBefore, 27 TransitionsAfterwards, 1044 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 20 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 53 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1151, independent: 1096, independent conditional: 1096, independent unconditional: 0, dependent: 55, dependent conditional: 55, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1151, independent: 1096, independent conditional: 0, independent unconditional: 1096, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1151, independent: 1096, independent conditional: 0, independent unconditional: 1096, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1151, independent: 1096, independent conditional: 0, independent unconditional: 1096, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 820, independent: 784, independent conditional: 0, independent unconditional: 784, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 820, independent: 739, independent conditional: 0, independent unconditional: 739, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 81, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 166, independent: 103, independent conditional: 0, independent unconditional: 103, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1151, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 820, unknown conditional: 0, unknown unconditional: 820] , Statistics on independence cache: Total cache size (in pairs): 1123, Positive cache size: 1087, Positive conditional cache size: 0, Positive unconditional cache size: 1087, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, 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, 36 PlacesBefore, 36 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 392 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 135, independent: 123, independent conditional: 123, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 135, independent: 123, independent conditional: 26, independent unconditional: 97, dependent: 12, dependent conditional: 5, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 135, independent: 123, independent conditional: 0, independent unconditional: 123, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 135, independent: 123, independent conditional: 0, independent unconditional: 123, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 92, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 92, independent: 64, independent conditional: 0, independent unconditional: 64, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 28, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 135, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 92, unknown conditional: 0, unknown unconditional: 92] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 82, Positive conditional cache size: 0, Positive unconditional cache size: 82, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 31, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 390 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 113, independent: 101, independent conditional: 101, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 113, independent: 101, independent conditional: 12, independent unconditional: 89, dependent: 12, dependent conditional: 4, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 117, independent: 101, independent conditional: 0, independent unconditional: 101, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 117, independent: 101, independent conditional: 0, independent unconditional: 101, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 117, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 84, Positive conditional cache size: 0, Positive unconditional cache size: 84, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 416 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 87, independent: 78, independent conditional: 78, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 87, independent: 78, independent conditional: 21, independent unconditional: 57, dependent: 9, dependent conditional: 4, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 87, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 87, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 9, dependent conditional: 0, dependent unconditional: 9, 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: 87, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 84, Positive conditional cache size: 0, Positive unconditional cache size: 84, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 25, independent: 22, independent conditional: 12, independent unconditional: 10, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 25, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 85, Positive conditional cache size: 0, Positive unconditional cache size: 85, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 13, independent conditional: 3, independent unconditional: 10, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 16, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 87, Positive conditional cache size: 0, Positive unconditional cache size: 87, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 51 PlacesBefore, 49 PlacesAfterwards, 49 TransitionsBefore, 42 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 165, independent: 161, independent conditional: 161, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 165, independent: 161, independent conditional: 145, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 165, independent: 161, independent conditional: 135, independent unconditional: 26, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 165, independent: 161, independent conditional: 135, independent unconditional: 26, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, independent: 31, independent conditional: 30, independent unconditional: 1, 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: 31, independent: 31, independent conditional: 0, independent unconditional: 31, 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: 165, independent: 130, independent conditional: 105, independent unconditional: 25, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 31, unknown conditional: 30, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 134, Positive cache size: 124, Positive conditional cache size: 30, Positive unconditional cache size: 94, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 55 PlacesBefore, 53 PlacesAfterwards, 58 TransitionsBefore, 51 TransitionsAfterwards, 458 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 133, independent: 129, independent conditional: 129, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 133, independent: 129, independent conditional: 121, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 133, independent: 129, independent conditional: 54, independent unconditional: 75, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 133, independent: 129, independent conditional: 54, independent unconditional: 75, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 36, independent: 36, independent conditional: 19, independent unconditional: 17, 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: 36, independent: 36, independent conditional: 0, independent unconditional: 36, 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: 133, independent: 93, independent conditional: 35, independent unconditional: 58, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 36, unknown conditional: 19, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 166, Positive conditional cache size: 49, Positive unconditional cache size: 117, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 67, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 54 PlacesBefore, 53 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 324 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 7, independent unconditional: 7, 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: 14, independent: 14, independent conditional: 4, independent unconditional: 10, 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: 14, independent: 14, independent conditional: 4, independent unconditional: 10, 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: 5, independent: 5, independent conditional: 3, independent unconditional: 2, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 14, independent: 9, independent conditional: 1, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 3, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 197, Positive cache size: 187, Positive conditional cache size: 52, Positive unconditional cache size: 135, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 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): 197, Positive cache size: 187, Positive conditional cache size: 52, Positive unconditional cache size: 135, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 108 locations, 4 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: 6.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 249 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 249 mSDsluCounter, 23 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 535 IncrementalHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 14 mSDtfsCounter, 535 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=428occurred in iteration=7, InterpolantAutomatonStates: 40, 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.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 101 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 384 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 12:01:36,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...