/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/weaver/popl20-bad-commit-2.wvr-bad.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 13:02:47,313 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:02:47,315 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:02:47,353 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:02:47,353 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:02:47,354 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:02:47,355 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:02:47,357 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:02:47,359 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:02:47,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:02:47,361 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:02:47,362 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:02:47,362 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:02:47,363 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:02:47,364 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:02:47,365 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:02:47,366 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:02:47,367 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:02:47,368 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:02:47,370 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:02:47,371 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:02:47,372 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:02:47,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:02:47,374 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:02:47,378 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:02:47,378 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:02:47,379 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:02:47,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:02:47,380 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:02:47,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:02:47,381 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:02:47,382 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:02:47,383 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:02:47,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:02:47,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:02:47,385 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:02:47,385 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:02:47,385 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:02:47,386 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:02:47,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:02:47,387 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:02:47,388 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 13:02:47,409 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:02:47,409 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:02:47,410 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:02:47,411 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:02:47,411 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:02:47,411 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:02:47,411 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:02:47,411 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:02:47,412 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:02:47,412 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:02:47,412 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 13:02:47,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:02:47,412 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 13:02:47,412 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:02:47,413 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:02:47,413 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:02:47,413 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 13:02:47,413 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:02:47,413 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:02:47,413 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 13:02:47,414 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:02:47,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:02:47,414 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:02:47,414 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:02:47,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:02:47,415 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 13:02:47,415 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:02:47,415 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 13:02:47,415 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 13:02:47,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:02:47,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:02:47,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:02:47,715 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:02:47,716 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:02:47,717 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c [2022-12-13 13:02:48,853 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:02:49,047 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:02:49,047 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c [2022-12-13 13:02:49,053 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c01980d69/342c41768caa4e42b5b0df232259cde9/FLAG07098e0fc [2022-12-13 13:02:49,065 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c01980d69/342c41768caa4e42b5b0df232259cde9 [2022-12-13 13:02:49,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:02:49,068 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 13:02:49,069 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:02:49,069 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:02:49,071 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:02:49,072 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:02:49" (1/1) ... [2022-12-13 13:02:49,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65834a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:02:49, skipping insertion in model container [2022-12-13 13:02:49,073 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:02:49" (1/1) ... [2022-12-13 13:02:49,078 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:02:49,097 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:02:49,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:02:49,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:02:49,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:02:49,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:02:49,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:02:49,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:02:49,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:02:49,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:02:49,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:02:49,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:02:49,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:02:49,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:02:49,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:02:49,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:02:49,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:02:49,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:02:49,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:02:49,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:02:49,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:02:49,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:02:49,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:02:49,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:02:49,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:02:49,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:02:49,269 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c[6687,6700] [2022-12-13 13:02:49,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:02:49,284 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:02:49,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:02:49,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:02:49,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:02:49,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:02:49,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:02:49,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:02:49,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:02:49,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:02:49,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:02:49,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:02:49,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:02:49,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:02:49,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:02:49,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:02:49,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:02:49,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:02:49,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:02:49,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:02:49,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:02:49,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:02:49,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:02:49,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:02:49,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:02:49,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:02:49,326 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c[6687,6700] [2022-12-13 13:02:49,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:02:49,352 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:02:49,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:02:49 WrapperNode [2022-12-13 13:02:49,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:02:49,353 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:02:49,353 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:02:49,353 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:02:49,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:02:49" (1/1) ... [2022-12-13 13:02:49,373 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:02:49" (1/1) ... [2022-12-13 13:02:49,428 INFO L138 Inliner]: procedures = 26, calls = 93, calls flagged for inlining = 27, calls inlined = 33, statements flattened = 460 [2022-12-13 13:02:49,428 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:02:49,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:02:49,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:02:49,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:02:49,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:02:49" (1/1) ... [2022-12-13 13:02:49,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:02:49" (1/1) ... [2022-12-13 13:02:49,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:02:49" (1/1) ... [2022-12-13 13:02:49,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:02:49" (1/1) ... [2022-12-13 13:02:49,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:02:49" (1/1) ... [2022-12-13 13:02:49,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:02:49" (1/1) ... [2022-12-13 13:02:49,486 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:02:49" (1/1) ... [2022-12-13 13:02:49,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:02:49" (1/1) ... [2022-12-13 13:02:49,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:02:49,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:02:49,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:02:49,502 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:02:49,503 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:02:49" (1/1) ... [2022-12-13 13:02:49,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:02:49,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:02:49,530 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 13:02:49,547 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 13:02:49,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:02:49,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 13:02:49,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:02:49,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 13:02:49,568 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 13:02:49,569 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 13:02:49,569 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 13:02:49,569 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 13:02:49,569 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 13:02:49,570 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 13:02:49,570 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-13 13:02:49,570 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-13 13:02:49,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:02:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 13:02:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 13:02:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 13:02:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:02:49,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:02:49,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:02:49,574 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 13:02:49,740 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 13:02:49,742 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:02:50,250 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 13:02:50,475 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:02:50,475 INFO L302 CfgBuilder]: Removed 8 assume(true) statements. [2022-12-13 13:02:50,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:02:50 BoogieIcfgContainer [2022-12-13 13:02:50,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:02:50,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:02:50,483 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:02:50,486 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:02:50,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:02:49" (1/3) ... [2022-12-13 13:02:50,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615ebcd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:02:50, skipping insertion in model container [2022-12-13 13:02:50,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:02:49" (2/3) ... [2022-12-13 13:02:50,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615ebcd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:02:50, skipping insertion in model container [2022-12-13 13:02:50,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:02:50" (3/3) ... [2022-12-13 13:02:50,488 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-2.wvr-bad.c [2022-12-13 13:02:50,525 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:02:50,526 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 13:02:50,526 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 13:02:50,635 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-13 13:02:50,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 307 places, 331 transitions, 694 flow [2022-12-13 13:02:50,834 INFO L130 PetriNetUnfolder]: 37/327 cut-off events. [2022-12-13 13:02:50,835 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 13:02:50,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 327 events. 37/327 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 240 event pairs, 0 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 285. Up to 8 conditions per place. [2022-12-13 13:02:50,843 INFO L82 GeneralOperation]: Start removeDead. Operand has 307 places, 331 transitions, 694 flow [2022-12-13 13:02:50,855 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 291 places, 315 transitions, 654 flow [2022-12-13 13:02:50,857 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:02:50,879 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 291 places, 315 transitions, 654 flow [2022-12-13 13:02:50,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 291 places, 315 transitions, 654 flow [2022-12-13 13:02:50,940 INFO L130 PetriNetUnfolder]: 37/315 cut-off events. [2022-12-13 13:02:50,940 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 13:02:50,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332 conditions, 315 events. 37/315 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 239 event pairs, 0 based on Foata normal form. 0/278 useless extension candidates. Maximal degree in co-relation 285. Up to 8 conditions per place. [2022-12-13 13:02:50,947 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 291 places, 315 transitions, 654 flow [2022-12-13 13:02:50,947 INFO L226 LiptonReduction]: Number of co-enabled transitions 5184 [2022-12-13 13:03:02,798 INFO L241 LiptonReduction]: Total number of compositions: 274 [2022-12-13 13:03:02,811 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:03:02,816 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;@7ec02e63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 13:03:02,817 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 13:03:02,824 INFO L130 PetriNetUnfolder]: 8/32 cut-off events. [2022-12-13 13:03:02,824 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 13:03:02,824 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:03:02,825 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:03:02,825 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 2 more)] === [2022-12-13 13:03:02,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:03:02,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1058262679, now seen corresponding path program 1 times [2022-12-13 13:03:02,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:03:02,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303279717] [2022-12-13 13:03:02,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:03:02,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:03:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:03:03,541 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 13:03:03,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:03:03,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303279717] [2022-12-13 13:03:03,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303279717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:03:03,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:03:03,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:03:03,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935401533] [2022-12-13 13:03:03,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:03:03,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:03:03,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:03:03,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:03:03,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:03:03,567 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 13:03:03,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 90 flow. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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 13:03:03,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:03:03,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 13:03:03,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:03:03,828 INFO L130 PetriNetUnfolder]: 501/685 cut-off events. [2022-12-13 13:03:03,828 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-12-13 13:03:03,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1464 conditions, 685 events. 501/685 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1774 event pairs, 117 based on Foata normal form. 1/418 useless extension candidates. Maximal degree in co-relation 1016. Up to 471 conditions per place. [2022-12-13 13:03:03,833 INFO L137 encePairwiseOnDemand]: 27/33 looper letters, 49 selfloop transitions, 5 changer transitions 1/55 dead transitions. [2022-12-13 13:03:03,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 55 transitions, 265 flow [2022-12-13 13:03:03,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:03:03,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:03:03,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-13 13:03:03,844 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5656565656565656 [2022-12-13 13:03:03,845 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 90 flow. Second operand 3 states and 56 transitions. [2022-12-13 13:03:03,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 55 transitions, 265 flow [2022-12-13 13:03:03,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 55 transitions, 235 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-12-13 13:03:03,850 INFO L231 Difference]: Finished difference. Result has 33 places, 37 transitions, 107 flow [2022-12-13 13:03:03,852 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=33, PETRI_TRANSITIONS=37} [2022-12-13 13:03:03,855 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, -5 predicate places. [2022-12-13 13:03:03,855 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:03:03,856 INFO L89 Accepts]: Start accepts. Operand has 33 places, 37 transitions, 107 flow [2022-12-13 13:03:03,859 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:03:03,859 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:03:03,859 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 37 transitions, 107 flow [2022-12-13 13:03:03,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 37 transitions, 107 flow [2022-12-13 13:03:03,868 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1652] L154-1-->L154-1: Formula: (let ((.cse1 (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|)) (.cse4 (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0))) (.cse0 (= v_~manager_back~0_Out_2 v_~manager_back~0_In_1)) (.cse2 (= v_~client_state~0_In_1 1)) (.cse8 (= v_~client_state~0_In_1 0)) (.cse7 (= v_~client_front~0_In_1 v_~client_front~0_Out_2)) (.cse9 (= |v_thread4Thread1of1ForFork2_#t~mem27#1_In_1| |v_thread4Thread1of1ForFork2_#t~mem27#1_Out_2|)) (.cse3 (not (= (mod |v_thread4Thread1of1ForFork2_#t~nondet24#1_In_1| 256) 0))) (.cse10 (= v_~safe~0_Out_2 v_~safe~0_In_3)) (.cse5 (= |v_thread4Thread1of1ForFork2_#t~post26#1_Out_2| |v_thread4Thread1of1ForFork2_#t~post26#1_In_1|)) (.cse6 (= |v_thread4Thread1of1ForFork2_#t~mem25#1_In_1| |v_thread4Thread1of1ForFork2_#t~mem25#1_Out_2|)) (.cse11 (= |v_thread4Thread1of1ForFork2_#t~post28#1_In_1| |v_thread4Thread1of1ForFork2_#t~post28#1_Out_2|))) (or (and .cse0 .cse1 (= v_~safe~0_Out_2 (ite (= (ite (= v_~ok~0_In_1 (select (select |v_#memory_int_In_3| v_~client~0.base_In_1) (+ v_~client~0.offset_In_1 (* v_~client_front~0_In_1 4)))) 1 0) 0) 0 1)) .cse2 (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (and (< v_~client_front~0_In_1 v_~client_back~0_In_1) (<= 0 v_~client_front~0_In_1) (< v_~client_back~0_In_1 v_~client_size~0_In_1)) 1 0)) .cse3 (= (+ v_~client_front~0_In_1 1) v_~client_front~0_Out_2) (= v_~client_state~0_Out_2 0) .cse4 .cse5 .cse6) (and .cse1 (= v_~manager_back~0_Out_2 (+ v_~manager_back~0_In_1 1)) (= v_~client_state~0_Out_2 1) .cse7 .cse8 .cse9 (not (= 0 (ite (and (<= 0 v_~manager_back~0_In_1) (< v_~manager_back~0_In_1 v_~manager_size~0_In_1)) 1 0))) .cse3 .cse10 .cse4 (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= v_~update~0_In_1 (select (select |v_#memory_int_In_3| v_~manager~0.base_In_1) (+ v_~manager~0.offset_In_1 (* v_~manager_back~0_In_1 4)))) 1 0)) .cse11) (and .cse0 (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_1|) (not .cse2) (not .cse8) .cse7 (= v_~client_state~0_Out_2 v_~client_state~0_In_1) .cse9 .cse3 (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_1|) .cse10 .cse5 .cse6 .cse11))) InVars {~client~0.offset=v_~client~0.offset_In_1, ~client_back~0=v_~client_back~0_In_1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_1|, ~manager~0.offset=v_~manager~0.offset_In_1, ~ok~0=v_~ok~0_In_1, ~manager~0.base=v_~manager~0.base_In_1, thread4Thread1of1ForFork2_#t~nondet24#1=|v_thread4Thread1of1ForFork2_#t~nondet24#1_In_1|, thread4Thread1of1ForFork2_#t~post26#1=|v_thread4Thread1of1ForFork2_#t~post26#1_In_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_1|, ~manager_back~0=v_~manager_back~0_In_1, thread4Thread1of1ForFork2_#t~mem27#1=|v_thread4Thread1of1ForFork2_#t~mem27#1_In_1|, thread4Thread1of1ForFork2_#t~post28#1=|v_thread4Thread1of1ForFork2_#t~post28#1_In_1|, thread4Thread1of1ForFork2_#t~mem25#1=|v_thread4Thread1of1ForFork2_#t~mem25#1_In_1|, ~client_front~0=v_~client_front~0_In_1, ~safe~0=v_~safe~0_In_3, #memory_int=|v_#memory_int_In_3|, ~client_state~0=v_~client_state~0_In_1, ~client_size~0=v_~client_size~0_In_1, ~manager_size~0=v_~manager_size~0_In_1, ~client~0.base=v_~client~0.base_In_1, ~update~0=v_~update~0_In_1} OutVars{~client~0.offset=v_~client~0.offset_In_1, ~client_back~0=v_~client_back~0_In_1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|, ~manager~0.offset=v_~manager~0.offset_In_1, ~ok~0=v_~ok~0_In_1, ~manager~0.base=v_~manager~0.base_In_1, thread4Thread1of1ForFork2_#t~post26#1=|v_thread4Thread1of1ForFork2_#t~post26#1_Out_2|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, ~manager_back~0=v_~manager_back~0_Out_2, thread4Thread1of1ForFork2_#t~mem27#1=|v_thread4Thread1of1ForFork2_#t~mem27#1_Out_2|, thread4Thread1of1ForFork2_#t~post28#1=|v_thread4Thread1of1ForFork2_#t~post28#1_Out_2|, thread4Thread1of1ForFork2_#t~mem25#1=|v_thread4Thread1of1ForFork2_#t~mem25#1_Out_2|, ~client_front~0=v_~client_front~0_Out_2, ~safe~0=v_~safe~0_Out_2, #memory_int=|v_#memory_int_In_3|, ~client_state~0=v_~client_state~0_Out_2, ~client_size~0=v_~client_size~0_In_1, ~manager_size~0=v_~manager_size~0_In_1, ~client~0.base=v_~client~0.base_In_1, ~update~0=v_~update~0_In_1} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~client_front~0, ~safe~0, thread4Thread1of1ForFork2_#t~nondet24#1, thread4Thread1of1ForFork2_#t~post26#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~manager_back~0, ~client_state~0, thread4Thread1of1ForFork2_#t~mem27#1, thread4Thread1of1ForFork2_#t~post28#1, thread4Thread1of1ForFork2_#t~mem25#1][26], [310#true, 141#L110-1true, 80#L154-1true, 175#L132-1true, 86#L199-4true, Black: 312#(= ~safe~0 1), 89#L88-1true]) [2022-12-13 13:03:03,869 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-13 13:03:03,869 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-13 13:03:03,869 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-13 13:03:03,869 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-13 13:03:03,874 INFO L130 PetriNetUnfolder]: 23/63 cut-off events. [2022-12-13 13:03:03,874 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:03:03,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 63 events. 23/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 52. Up to 22 conditions per place. [2022-12-13 13:03:03,876 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 37 transitions, 107 flow [2022-12-13 13:03:03,877 INFO L226 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-13 13:03:03,877 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:03:03,879 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 13:03:03,879 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 37 transitions, 107 flow [2022-12-13 13:03:03,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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 13:03:03,879 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:03:03,879 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:03:03,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:03:03,880 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 2 more)] === [2022-12-13 13:03:03,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:03:03,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1410111894, now seen corresponding path program 1 times [2022-12-13 13:03:03,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:03:03,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584780067] [2022-12-13 13:03:03,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:03:03,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:03:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:03:04,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:03:04,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:03:04,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584780067] [2022-12-13 13:03:04,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584780067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:03:04,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:03:04,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:03:04,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220651833] [2022-12-13 13:03:04,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:03:04,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:03:04,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:03:04,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:03:04,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:03:04,560 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 13:03:04,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 37 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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 13:03:04,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:03:04,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 13:03:04,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:03:04,871 INFO L130 PetriNetUnfolder]: 689/963 cut-off events. [2022-12-13 13:03:04,872 INFO L131 PetriNetUnfolder]: For 254/254 co-relation queries the response was YES. [2022-12-13 13:03:04,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2512 conditions, 963 events. 689/963 cut-off events. For 254/254 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2784 event pairs, 234 based on Foata normal form. 60/1015 useless extension candidates. Maximal degree in co-relation 886. Up to 535 conditions per place. [2022-12-13 13:03:04,880 INFO L137 encePairwiseOnDemand]: 20/33 looper letters, 64 selfloop transitions, 16 changer transitions 2/82 dead transitions. [2022-12-13 13:03:04,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 82 transitions, 381 flow [2022-12-13 13:03:04,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:03:04,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:03:04,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2022-12-13 13:03:04,884 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2022-12-13 13:03:04,885 INFO L175 Difference]: Start difference. First operand has 33 places, 37 transitions, 107 flow. Second operand 6 states and 84 transitions. [2022-12-13 13:03:04,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 82 transitions, 381 flow [2022-12-13 13:03:04,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 82 transitions, 374 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:03:04,888 INFO L231 Difference]: Finished difference. Result has 40 places, 47 transitions, 193 flow [2022-12-13 13:03:04,888 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=193, PETRI_PLACES=40, PETRI_TRANSITIONS=47} [2022-12-13 13:03:04,890 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 2 predicate places. [2022-12-13 13:03:04,890 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:03:04,890 INFO L89 Accepts]: Start accepts. Operand has 40 places, 47 transitions, 193 flow [2022-12-13 13:03:04,892 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:03:04,893 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:03:04,893 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 47 transitions, 193 flow [2022-12-13 13:03:04,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 47 transitions, 193 flow [2022-12-13 13:03:04,907 INFO L130 PetriNetUnfolder]: 24/84 cut-off events. [2022-12-13 13:03:04,907 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 13:03:04,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 84 events. 24/84 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 154 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 116. Up to 20 conditions per place. [2022-12-13 13:03:04,908 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 47 transitions, 193 flow [2022-12-13 13:03:04,909 INFO L226 LiptonReduction]: Number of co-enabled transitions 264 [2022-12-13 13:03:04,909 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:03:04,910 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-13 13:03:04,911 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 47 transitions, 193 flow [2022-12-13 13:03:04,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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 13:03:04,912 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:03:04,912 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:03:04,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:03:04,913 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 2 more)] === [2022-12-13 13:03:04,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:03:04,913 INFO L85 PathProgramCache]: Analyzing trace with hash 573276739, now seen corresponding path program 1 times [2022-12-13 13:03:04,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:03:04,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983743761] [2022-12-13 13:03:04,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:03:04,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:03:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:03:05,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:03:05,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:03:05,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983743761] [2022-12-13 13:03:05,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983743761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:03:05,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:03:05,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:03:05,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601979973] [2022-12-13 13:03:05,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:03:05,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:03:05,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:03:05,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:03:05,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:03:05,183 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 13:03:05,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 47 transitions, 193 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 13:03:05,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:03:05,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 13:03:05,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:03:05,690 INFO L130 PetriNetUnfolder]: 1499/2131 cut-off events. [2022-12-13 13:03:05,691 INFO L131 PetriNetUnfolder]: For 1453/1453 co-relation queries the response was YES. [2022-12-13 13:03:05,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5614 conditions, 2131 events. 1499/2131 cut-off events. For 1453/1453 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7527 event pairs, 918 based on Foata normal form. 120/2249 useless extension candidates. Maximal degree in co-relation 2946. Up to 962 conditions per place. [2022-12-13 13:03:05,702 INFO L137 encePairwiseOnDemand]: 24/33 looper letters, 101 selfloop transitions, 8 changer transitions 0/109 dead transitions. [2022-12-13 13:03:05,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 109 transitions, 622 flow [2022-12-13 13:03:05,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:03:05,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:03:05,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2022-12-13 13:03:05,704 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2022-12-13 13:03:05,704 INFO L175 Difference]: Start difference. First operand has 40 places, 47 transitions, 193 flow. Second operand 5 states and 95 transitions. [2022-12-13 13:03:05,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 109 transitions, 622 flow [2022-12-13 13:03:05,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 109 transitions, 596 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 13:03:05,709 INFO L231 Difference]: Finished difference. Result has 44 places, 52 transitions, 249 flow [2022-12-13 13:03:05,709 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=44, PETRI_TRANSITIONS=52} [2022-12-13 13:03:05,710 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2022-12-13 13:03:05,710 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:03:05,710 INFO L89 Accepts]: Start accepts. Operand has 44 places, 52 transitions, 249 flow [2022-12-13 13:03:05,711 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:03:05,711 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:03:05,711 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 52 transitions, 249 flow [2022-12-13 13:03:05,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 52 transitions, 249 flow [2022-12-13 13:03:05,734 INFO L130 PetriNetUnfolder]: 42/168 cut-off events. [2022-12-13 13:03:05,734 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-13 13:03:05,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 168 events. 42/168 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 588 event pairs, 0 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 191. Up to 38 conditions per place. [2022-12-13 13:03:05,736 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 52 transitions, 249 flow [2022-12-13 13:03:05,736 INFO L226 LiptonReduction]: Number of co-enabled transitions 264 [2022-12-13 13:03:11,406 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:03:11,408 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5698 [2022-12-13 13:03:11,408 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 52 transitions, 253 flow [2022-12-13 13:03:11,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 13:03:11,408 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:03:11,408 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:03:11,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:03:11,408 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 2 more)] === [2022-12-13 13:03:11,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:03:11,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1707706994, now seen corresponding path program 1 times [2022-12-13 13:03:11,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:03:11,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793386386] [2022-12-13 13:03:11,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:03:11,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:03:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:03:11,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:03:11,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:03:11,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793386386] [2022-12-13 13:03:11,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793386386] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:03:11,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:03:11,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:03:11,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355158845] [2022-12-13 13:03:11,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:03:11,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:03:11,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:03:11,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:03:11,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:03:11,699 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-13 13:03:11,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 52 transitions, 253 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 13:03:11,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:03:11,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-13 13:03:11,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:03:12,400 INFO L130 PetriNetUnfolder]: 2459/3535 cut-off events. [2022-12-13 13:03:12,401 INFO L131 PetriNetUnfolder]: For 1356/1356 co-relation queries the response was YES. [2022-12-13 13:03:12,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8650 conditions, 3535 events. 2459/3535 cut-off events. For 1356/1356 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 14701 event pairs, 894 based on Foata normal form. 240/3773 useless extension candidates. Maximal degree in co-relation 5622. Up to 1747 conditions per place. [2022-12-13 13:03:12,419 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 82 selfloop transitions, 4 changer transitions 1/87 dead transitions. [2022-12-13 13:03:12,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 87 transitions, 528 flow [2022-12-13 13:03:12,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:03:12,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:03:12,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-13 13:03:12,423 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5214285714285715 [2022-12-13 13:03:12,423 INFO L175 Difference]: Start difference. First operand has 44 places, 52 transitions, 253 flow. Second operand 4 states and 73 transitions. [2022-12-13 13:03:12,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 87 transitions, 528 flow [2022-12-13 13:03:12,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 87 transitions, 520 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-13 13:03:12,431 INFO L231 Difference]: Finished difference. Result has 48 places, 51 transitions, 257 flow [2022-12-13 13:03:12,431 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=257, PETRI_PLACES=48, PETRI_TRANSITIONS=51} [2022-12-13 13:03:12,432 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2022-12-13 13:03:12,432 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:03:12,432 INFO L89 Accepts]: Start accepts. Operand has 48 places, 51 transitions, 257 flow [2022-12-13 13:03:12,433 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:03:12,434 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:03:12,434 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 51 transitions, 257 flow [2022-12-13 13:03:12,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 51 transitions, 257 flow [2022-12-13 13:03:12,464 INFO L130 PetriNetUnfolder]: 45/216 cut-off events. [2022-12-13 13:03:12,464 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-12-13 13:03:12,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 216 events. 45/216 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 967 event pairs, 0 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 253. Up to 54 conditions per place. [2022-12-13 13:03:12,466 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 51 transitions, 257 flow [2022-12-13 13:03:12,466 INFO L226 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-13 13:03:12,467 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:03:12,472 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-13 13:03:12,473 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 51 transitions, 257 flow [2022-12-13 13:03:12,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 13:03:12,473 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:03:12,473 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:03:12,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 13:03:12,473 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 2 more)] === [2022-12-13 13:03:12,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:03:12,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1074394720, now seen corresponding path program 1 times [2022-12-13 13:03:12,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:03:12,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011077797] [2022-12-13 13:03:12,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:03:12,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:03:12,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:03:12,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:03:12,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:03:12,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011077797] [2022-12-13 13:03:12,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011077797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:03:12,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:03:12,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:03:12,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856229053] [2022-12-13 13:03:12,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:03:12,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:03:12,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:03:12,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:03:12,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:03:12,705 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 13:03:12,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 51 transitions, 257 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 13:03:12,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:03:12,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 13:03:12,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:03:13,068 INFO L130 PetriNetUnfolder]: 1387/2070 cut-off events. [2022-12-13 13:03:13,069 INFO L131 PetriNetUnfolder]: For 1533/1533 co-relation queries the response was YES. [2022-12-13 13:03:13,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5451 conditions, 2070 events. 1387/2070 cut-off events. For 1533/1533 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7938 event pairs, 612 based on Foata normal form. 172/2240 useless extension candidates. Maximal degree in co-relation 4489. Up to 1086 conditions per place. [2022-12-13 13:03:13,079 INFO L137 encePairwiseOnDemand]: 30/34 looper letters, 72 selfloop transitions, 3 changer transitions 6/81 dead transitions. [2022-12-13 13:03:13,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 81 transitions, 515 flow [2022-12-13 13:03:13,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:03:13,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:03:13,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-13 13:03:13,080 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49264705882352944 [2022-12-13 13:03:13,080 INFO L175 Difference]: Start difference. First operand has 47 places, 51 transitions, 257 flow. Second operand 4 states and 67 transitions. [2022-12-13 13:03:13,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 81 transitions, 515 flow [2022-12-13 13:03:13,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 81 transitions, 497 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-13 13:03:13,091 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 201 flow [2022-12-13 13:03:13,091 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=201, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2022-12-13 13:03:13,098 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2022-12-13 13:03:13,098 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:03:13,098 INFO L89 Accepts]: Start accepts. Operand has 51 places, 44 transitions, 201 flow [2022-12-13 13:03:13,101 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:03:13,101 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:03:13,101 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 44 transitions, 201 flow [2022-12-13 13:03:13,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 44 transitions, 201 flow [2022-12-13 13:03:13,117 INFO L130 PetriNetUnfolder]: 21/102 cut-off events. [2022-12-13 13:03:13,117 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-13 13:03:13,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 102 events. 21/102 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 256 event pairs, 1 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 177. Up to 26 conditions per place. [2022-12-13 13:03:13,119 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 44 transitions, 201 flow [2022-12-13 13:03:13,119 INFO L226 LiptonReduction]: Number of co-enabled transitions 200 [2022-12-13 13:03:13,120 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:03:13,122 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 13:03:13,122 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 201 flow [2022-12-13 13:03:13,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 13:03:13,122 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:03:13,123 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:03:13,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 13:03:13,123 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 2 more)] === [2022-12-13 13:03:13,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:03:13,123 INFO L85 PathProgramCache]: Analyzing trace with hash -336909090, now seen corresponding path program 1 times [2022-12-13 13:03:13,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:03:13,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150765381] [2022-12-13 13:03:13,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:03:13,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:03:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:03:13,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:03:13,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:03:13,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150765381] [2022-12-13 13:03:13,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150765381] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:03:13,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414734309] [2022-12-13 13:03:13,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:03:13,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:03:13,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:03:13,431 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:03:13,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 13:03:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:03:13,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 13:03:13,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:03:13,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:03:13,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:03:13,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:03:13,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414734309] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:03:13,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:03:13,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2022-12-13 13:03:13,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046579222] [2022-12-13 13:03:13,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:03:13,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:03:13,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:03:13,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:03:13,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:03:13,907 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 13:03:13,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 201 flow. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 13:03:13,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:03:13,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 13:03:13,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:03:14,246 INFO L130 PetriNetUnfolder]: 1276/1834 cut-off events. [2022-12-13 13:03:14,246 INFO L131 PetriNetUnfolder]: For 1331/1331 co-relation queries the response was YES. [2022-12-13 13:03:14,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4938 conditions, 1834 events. 1276/1834 cut-off events. For 1331/1331 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6607 event pairs, 394 based on Foata normal form. 1/1834 useless extension candidates. Maximal degree in co-relation 4885. Up to 1205 conditions per place. [2022-12-13 13:03:14,256 INFO L137 encePairwiseOnDemand]: 29/33 looper letters, 62 selfloop transitions, 5 changer transitions 3/70 dead transitions. [2022-12-13 13:03:14,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 70 transitions, 413 flow [2022-12-13 13:03:14,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:03:14,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:03:14,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-13 13:03:14,258 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4621212121212121 [2022-12-13 13:03:14,258 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 201 flow. Second operand 4 states and 61 transitions. [2022-12-13 13:03:14,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 70 transitions, 413 flow [2022-12-13 13:03:14,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 70 transitions, 394 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-13 13:03:14,262 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 218 flow [2022-12-13 13:03:14,262 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2022-12-13 13:03:14,264 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2022-12-13 13:03:14,264 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:03:14,264 INFO L89 Accepts]: Start accepts. Operand has 49 places, 46 transitions, 218 flow [2022-12-13 13:03:14,265 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:03:14,265 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:03:14,266 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 46 transitions, 218 flow [2022-12-13 13:03:14,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 46 transitions, 218 flow [2022-12-13 13:03:14,282 INFO L130 PetriNetUnfolder]: 22/106 cut-off events. [2022-12-13 13:03:14,283 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-12-13 13:03:14,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 106 events. 22/106 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 275 event pairs, 1 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 180. Up to 28 conditions per place. [2022-12-13 13:03:14,284 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 46 transitions, 218 flow [2022-12-13 13:03:14,284 INFO L226 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-13 13:03:14,285 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:03:14,285 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-13 13:03:14,285 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 218 flow [2022-12-13 13:03:14,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 13:03:14,286 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:03:14,286 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:03:14,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 13:03:14,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 13:03:14,492 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 2 more)] === [2022-12-13 13:03:14,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:03:14,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1105091396, now seen corresponding path program 2 times [2022-12-13 13:03:14,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:03:14,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228617695] [2022-12-13 13:03:14,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:03:14,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:03:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:03:14,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:03:14,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:03:14,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228617695] [2022-12-13 13:03:14,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228617695] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:03:14,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194660669] [2022-12-13 13:03:14,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:03:14,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:03:14,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:03:14,844 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:03:14,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 13:03:15,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:03:15,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:03:15,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 13:03:15,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:03:15,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:03:15,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:03:15,484 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:03:15,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 292 treesize of output 302 [2022-12-13 13:03:15,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:03:15,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194660669] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:03:15,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:03:15,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 11 [2022-12-13 13:03:15,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379216128] [2022-12-13 13:03:15,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:03:15,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 13:03:15,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:03:15,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 13:03:15,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:03:15,928 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 13:03:15,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 218 flow. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 11 states have internal predecessors, (74), 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 13:03:15,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:03:15,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 13:03:15,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:03:16,664 INFO L130 PetriNetUnfolder]: 2112/3101 cut-off events. [2022-12-13 13:03:16,665 INFO L131 PetriNetUnfolder]: For 2857/2857 co-relation queries the response was YES. [2022-12-13 13:03:16,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8385 conditions, 3101 events. 2112/3101 cut-off events. For 2857/2857 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13093 event pairs, 690 based on Foata normal form. 180/3279 useless extension candidates. Maximal degree in co-relation 4403. Up to 1032 conditions per place. [2022-12-13 13:03:16,680 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 97 selfloop transitions, 15 changer transitions 27/139 dead transitions. [2022-12-13 13:03:16,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 139 transitions, 784 flow [2022-12-13 13:03:16,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:03:16,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:03:16,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2022-12-13 13:03:16,682 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4377104377104377 [2022-12-13 13:03:16,682 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 218 flow. Second operand 9 states and 130 transitions. [2022-12-13 13:03:16,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 139 transitions, 784 flow [2022-12-13 13:03:16,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 139 transitions, 769 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-13 13:03:16,690 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 314 flow [2022-12-13 13:03:16,690 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=314, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2022-12-13 13:03:16,690 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2022-12-13 13:03:16,690 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:03:16,691 INFO L89 Accepts]: Start accepts. Operand has 58 places, 53 transitions, 314 flow [2022-12-13 13:03:16,692 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:03:16,693 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:03:16,693 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 53 transitions, 314 flow [2022-12-13 13:03:16,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 53 transitions, 314 flow [2022-12-13 13:03:16,719 INFO L130 PetriNetUnfolder]: 32/189 cut-off events. [2022-12-13 13:03:16,720 INFO L131 PetriNetUnfolder]: For 93/93 co-relation queries the response was YES. [2022-12-13 13:03:16,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 189 events. 32/189 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 789 event pairs, 1 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 329. Up to 41 conditions per place. [2022-12-13 13:03:16,721 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 53 transitions, 314 flow [2022-12-13 13:03:16,721 INFO L226 LiptonReduction]: Number of co-enabled transitions 284 [2022-12-13 13:03:18,048 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:03:18,049 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1359 [2022-12-13 13:03:18,049 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 318 flow [2022-12-13 13:03:18,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 11 states have internal predecessors, (74), 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 13:03:18,050 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:03:18,050 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:03:18,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 13:03:18,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-13 13:03:18,251 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 2 more)] === [2022-12-13 13:03:18,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:03:18,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1883957936, now seen corresponding path program 1 times [2022-12-13 13:03:18,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:03:18,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127846752] [2022-12-13 13:03:18,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:03:18,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:03:18,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:03:19,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:03:19,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:03:19,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127846752] [2022-12-13 13:03:19,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127846752] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:03:19,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11235308] [2022-12-13 13:03:19,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:03:19,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:03:19,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:03:19,226 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:03:19,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 13:03:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:03:19,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-13 13:03:19,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:03:19,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:03:19,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 13:03:19,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 13:03:19,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 13:03:19,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 13:03:19,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:03:19,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:03:27,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:03:27,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11235308] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:03:27,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:03:27,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 19 [2022-12-13 13:03:27,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226828729] [2022-12-13 13:03:27,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:03:27,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 13:03:27,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:03:27,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 13:03:27,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=290, Unknown=17, NotChecked=0, Total=420 [2022-12-13 13:03:27,166 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-13 13:03:27,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 318 flow. Second operand has 21 states, 20 states have (on average 3.45) internal successors, (69), 20 states have internal predecessors, (69), 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 13:03:27,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:03:27,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-13 13:03:27,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:03:30,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:03:32,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:03:34,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:03:36,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:03:39,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:03:41,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:03:46,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:03:48,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:03:51,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:03:53,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:03:55,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:03:57,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:03:59,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:04:00,430 INFO L130 PetriNetUnfolder]: 3962/5903 cut-off events. [2022-12-13 13:04:00,431 INFO L131 PetriNetUnfolder]: For 8298/8298 co-relation queries the response was YES. [2022-12-13 13:04:00,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17344 conditions, 5903 events. 3962/5903 cut-off events. For 8298/8298 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 29378 event pairs, 1152 based on Foata normal form. 5/5901 useless extension candidates. Maximal degree in co-relation 8083. Up to 2623 conditions per place. [2022-12-13 13:04:00,463 INFO L137 encePairwiseOnDemand]: 18/35 looper letters, 119 selfloop transitions, 41 changer transitions 45/205 dead transitions. [2022-12-13 13:04:00,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 205 transitions, 1367 flow [2022-12-13 13:04:00,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 13:04:00,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 13:04:00,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 175 transitions. [2022-12-13 13:04:00,466 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3125 [2022-12-13 13:04:00,466 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 318 flow. Second operand 16 states and 175 transitions. [2022-12-13 13:04:00,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 205 transitions, 1367 flow [2022-12-13 13:04:00,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 205 transitions, 1336 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-13 13:04:00,479 INFO L231 Difference]: Finished difference. Result has 80 places, 88 transitions, 756 flow [2022-12-13 13:04:00,479 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=756, PETRI_PLACES=80, PETRI_TRANSITIONS=88} [2022-12-13 13:04:00,479 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 42 predicate places. [2022-12-13 13:04:00,480 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:04:00,480 INFO L89 Accepts]: Start accepts. Operand has 80 places, 88 transitions, 756 flow [2022-12-13 13:04:00,481 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:04:00,481 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:04:00,481 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 88 transitions, 756 flow [2022-12-13 13:04:00,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 88 transitions, 756 flow [2022-12-13 13:04:00,529 INFO L130 PetriNetUnfolder]: 59/392 cut-off events. [2022-12-13 13:04:00,530 INFO L131 PetriNetUnfolder]: For 375/375 co-relation queries the response was YES. [2022-12-13 13:04:00,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 392 events. 59/392 cut-off events. For 375/375 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2440 event pairs, 1 based on Foata normal form. 0/380 useless extension candidates. Maximal degree in co-relation 830. Up to 63 conditions per place. [2022-12-13 13:04:00,533 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 88 transitions, 756 flow [2022-12-13 13:04:00,534 INFO L226 LiptonReduction]: Number of co-enabled transitions 624 [2022-12-13 13:04:13,259 WARN L322 ript$VariableManager]: TermVariable LBE776 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:04:13,259 WARN L322 ript$VariableManager]: TermVariable LBE754 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:04:13,259 WARN L322 ript$VariableManager]: TermVariable LBE773 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:04:13,260 WARN L322 ript$VariableManager]: TermVariable LBE154 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:04:13,260 WARN L322 ript$VariableManager]: TermVariable LBE131 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:04:13,260 WARN L322 ript$VariableManager]: TermVariable LBE815 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:04:13,260 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:04:13,260 WARN L322 ript$VariableManager]: TermVariable LBE44 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:04:13,260 WARN L322 ript$VariableManager]: TermVariable LBE21 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:04:13,260 WARN L322 ript$VariableManager]: TermVariable LBE841 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:04:13,260 WARN L322 ript$VariableManager]: TermVariable LBE166 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:04:13,260 WARN L322 ript$VariableManager]: TermVariable LBE56 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:04:13,260 WARN L322 ript$VariableManager]: TermVariable LBE108 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:04:13,260 WARN L322 ript$VariableManager]: TermVariable LBE746 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:04:13,261 WARN L322 ript$VariableManager]: TermVariable LBE843 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:04:13,261 WARN L322 ript$VariableManager]: TermVariable LBE76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:04:13,261 WARN L322 ript$VariableManager]: TermVariable LBE808 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:04:13,261 WARN L322 ript$VariableManager]: TermVariable LBE807 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:05:05,908 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 13:05:05,909 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65430 [2022-12-13 13:05:05,909 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 87 transitions, 809 flow [2022-12-13 13:05:05,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.45) internal successors, (69), 20 states have internal predecessors, (69), 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 13:05:05,909 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:05:05,909 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:05:05,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 13:05:06,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:05:06,112 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 2 more)] === [2022-12-13 13:05:06,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:05:06,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1085758908, now seen corresponding path program 1 times [2022-12-13 13:05:06,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:05:06,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834356995] [2022-12-13 13:05:06,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:05:06,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:05:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:05:06,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:05:06,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:05:06,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834356995] [2022-12-13 13:05:06,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834356995] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:05:06,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938420672] [2022-12-13 13:05:06,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:05:06,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:05:06,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:05:06,675 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:05:06,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 13:05:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:05:06,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:05:06,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:05:07,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:05:07,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:05:08,129 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:05:08,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 966 treesize of output 1045 [2022-12-13 13:05:09,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:05:09,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938420672] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:05:09,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:05:09,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2022-12-13 13:05:09,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288741567] [2022-12-13 13:05:09,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:05:09,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 13:05:09,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:05:09,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 13:05:09,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:05:09,479 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 13:05:09,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 87 transitions, 809 flow. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 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 13:05:09,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:05:09,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 13:05:09,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:05:10,916 INFO L130 PetriNetUnfolder]: 5309/7987 cut-off events. [2022-12-13 13:05:10,917 INFO L131 PetriNetUnfolder]: For 19763/19763 co-relation queries the response was YES. [2022-12-13 13:05:10,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25072 conditions, 7987 events. 5309/7987 cut-off events. For 19763/19763 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 42551 event pairs, 2361 based on Foata normal form. 364/8345 useless extension candidates. Maximal degree in co-relation 19856. Up to 1913 conditions per place. [2022-12-13 13:05:10,954 INFO L137 encePairwiseOnDemand]: 25/44 looper letters, 103 selfloop transitions, 33 changer transitions 19/155 dead transitions. [2022-12-13 13:05:10,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 155 transitions, 1402 flow [2022-12-13 13:05:10,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:05:10,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:05:10,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2022-12-13 13:05:10,956 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33238636363636365 [2022-12-13 13:05:10,956 INFO L175 Difference]: Start difference. First operand has 78 places, 87 transitions, 809 flow. Second operand 8 states and 117 transitions. [2022-12-13 13:05:10,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 155 transitions, 1402 flow [2022-12-13 13:05:10,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 155 transitions, 1330 flow, removed 36 selfloop flow, removed 0 redundant places. [2022-12-13 13:05:10,988 INFO L231 Difference]: Finished difference. Result has 87 places, 87 transitions, 839 flow [2022-12-13 13:05:10,989 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=839, PETRI_PLACES=87, PETRI_TRANSITIONS=87} [2022-12-13 13:05:10,989 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 49 predicate places. [2022-12-13 13:05:10,989 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:05:10,989 INFO L89 Accepts]: Start accepts. Operand has 87 places, 87 transitions, 839 flow [2022-12-13 13:05:10,991 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:05:10,991 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:05:10,991 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 87 transitions, 839 flow [2022-12-13 13:05:10,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 87 transitions, 839 flow [2022-12-13 13:05:11,105 INFO L130 PetriNetUnfolder]: 66/477 cut-off events. [2022-12-13 13:05:11,105 INFO L131 PetriNetUnfolder]: For 636/636 co-relation queries the response was YES. [2022-12-13 13:05:11,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 477 events. 66/477 cut-off events. For 636/636 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3298 event pairs, 0 based on Foata normal form. 0/455 useless extension candidates. Maximal degree in co-relation 1010. Up to 79 conditions per place. [2022-12-13 13:05:11,109 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 87 transitions, 839 flow [2022-12-13 13:05:11,109 INFO L226 LiptonReduction]: Number of co-enabled transitions 608 [2022-12-13 13:05:11,110 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:05:11,110 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 13:05:11,111 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 87 transitions, 839 flow [2022-12-13 13:05:11,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 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 13:05:11,111 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:05:11,112 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:05:11,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 13:05:11,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:05:11,321 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:05:11,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:05:11,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1533936542, now seen corresponding path program 1 times [2022-12-13 13:05:11,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:05:11,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358063914] [2022-12-13 13:05:11,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:05:11,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:05:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:05:11,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:05:11,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:05:11,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358063914] [2022-12-13 13:05:11,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358063914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:05:11,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:05:11,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:05:11,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637345209] [2022-12-13 13:05:11,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:05:11,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:05:11,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:05:11,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:05:11,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:05:11,819 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 13:05:11,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 87 transitions, 839 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 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 13:05:11,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:05:11,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 13:05:11,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:05:13,086 INFO L130 PetriNetUnfolder]: 5538/8365 cut-off events. [2022-12-13 13:05:13,087 INFO L131 PetriNetUnfolder]: For 19090/19090 co-relation queries the response was YES. [2022-12-13 13:05:13,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26540 conditions, 8365 events. 5538/8365 cut-off events. For 19090/19090 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 45685 event pairs, 3422 based on Foata normal form. 16/8374 useless extension candidates. Maximal degree in co-relation 23071. Up to 7597 conditions per place. [2022-12-13 13:05:13,195 INFO L137 encePairwiseOnDemand]: 32/41 looper letters, 92 selfloop transitions, 9 changer transitions 8/109 dead transitions. [2022-12-13 13:05:13,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 109 transitions, 1132 flow [2022-12-13 13:05:13,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:05:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:05:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-13 13:05:13,197 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5203252032520326 [2022-12-13 13:05:13,197 INFO L175 Difference]: Start difference. First operand has 84 places, 87 transitions, 839 flow. Second operand 3 states and 64 transitions. [2022-12-13 13:05:13,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 109 transitions, 1132 flow [2022-12-13 13:05:13,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 109 transitions, 1102 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-13 13:05:13,233 INFO L231 Difference]: Finished difference. Result has 83 places, 87 transitions, 840 flow [2022-12-13 13:05:13,233 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=840, PETRI_PLACES=83, PETRI_TRANSITIONS=87} [2022-12-13 13:05:13,234 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 45 predicate places. [2022-12-13 13:05:13,234 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:05:13,234 INFO L89 Accepts]: Start accepts. Operand has 83 places, 87 transitions, 840 flow [2022-12-13 13:05:13,235 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:05:13,236 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:05:13,236 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 87 transitions, 840 flow [2022-12-13 13:05:13,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 87 transitions, 840 flow [2022-12-13 13:05:13,288 INFO L130 PetriNetUnfolder]: 66/501 cut-off events. [2022-12-13 13:05:13,288 INFO L131 PetriNetUnfolder]: For 638/638 co-relation queries the response was YES. [2022-12-13 13:05:13,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1221 conditions, 501 events. 66/501 cut-off events. For 638/638 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3517 event pairs, 0 based on Foata normal form. 0/478 useless extension candidates. Maximal degree in co-relation 978. Up to 80 conditions per place. [2022-12-13 13:05:13,292 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 87 transitions, 840 flow [2022-12-13 13:05:13,292 INFO L226 LiptonReduction]: Number of co-enabled transitions 608 [2022-12-13 13:05:13,293 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:05:13,293 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-13 13:05:13,293 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 87 transitions, 840 flow [2022-12-13 13:05:13,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 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 13:05:13,294 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:05:13,294 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:05:13,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 13:05:13,294 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:05:13,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:05:13,295 INFO L85 PathProgramCache]: Analyzing trace with hash 848238877, now seen corresponding path program 1 times [2022-12-13 13:05:13,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:05:13,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221664193] [2022-12-13 13:05:13,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:05:13,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:05:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:05:13,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:05:13,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:05:13,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221664193] [2022-12-13 13:05:13,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221664193] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:05:13,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039071529] [2022-12-13 13:05:13,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:05:13,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:05:13,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:05:13,684 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:05:13,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 13:05:13,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:05:13,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 13:05:13,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:05:14,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:05:14,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:05:14,817 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:05:14,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 966 treesize of output 1045 [2022-12-13 13:05:16,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:05:16,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039071529] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:05:16,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:05:16,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 13:05:16,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279158085] [2022-12-13 13:05:16,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:05:16,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:05:16,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:05:16,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:05:16,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:05:16,496 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 13:05:16,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 87 transitions, 840 flow. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 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 13:05:16,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:05:16,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 13:05:16,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:05:17,908 INFO L130 PetriNetUnfolder]: 5272/8037 cut-off events. [2022-12-13 13:05:17,908 INFO L131 PetriNetUnfolder]: For 19024/19024 co-relation queries the response was YES. [2022-12-13 13:05:17,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25147 conditions, 8037 events. 5272/8037 cut-off events. For 19024/19024 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 43575 event pairs, 2606 based on Foata normal form. 144/8175 useless extension candidates. Maximal degree in co-relation 24553. Up to 3838 conditions per place. [2022-12-13 13:05:17,950 INFO L137 encePairwiseOnDemand]: 30/40 looper letters, 90 selfloop transitions, 20 changer transitions 14/124 dead transitions. [2022-12-13 13:05:17,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 124 transitions, 1190 flow [2022-12-13 13:05:17,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:05:17,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:05:17,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-12-13 13:05:17,951 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43 [2022-12-13 13:05:17,951 INFO L175 Difference]: Start difference. First operand has 83 places, 87 transitions, 840 flow. Second operand 5 states and 86 transitions. [2022-12-13 13:05:17,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 124 transitions, 1190 flow [2022-12-13 13:05:17,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 124 transitions, 1175 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-13 13:05:17,995 INFO L231 Difference]: Finished difference. Result has 88 places, 79 transitions, 807 flow [2022-12-13 13:05:17,996 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=807, PETRI_PLACES=88, PETRI_TRANSITIONS=79} [2022-12-13 13:05:17,996 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 50 predicate places. [2022-12-13 13:05:17,996 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:05:17,996 INFO L89 Accepts]: Start accepts. Operand has 88 places, 79 transitions, 807 flow [2022-12-13 13:05:17,997 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:05:17,997 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:05:17,998 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 79 transitions, 807 flow [2022-12-13 13:05:18,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 79 transitions, 807 flow [2022-12-13 13:05:18,066 INFO L130 PetriNetUnfolder]: 59/448 cut-off events. [2022-12-13 13:05:18,066 INFO L131 PetriNetUnfolder]: For 735/735 co-relation queries the response was YES. [2022-12-13 13:05:18,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 448 events. 59/448 cut-off events. For 735/735 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3011 event pairs, 0 based on Foata normal form. 0/426 useless extension candidates. Maximal degree in co-relation 1020. Up to 73 conditions per place. [2022-12-13 13:05:18,071 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 79 transitions, 807 flow [2022-12-13 13:05:18,071 INFO L226 LiptonReduction]: Number of co-enabled transitions 552 [2022-12-13 13:05:18,071 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:05:18,072 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-13 13:05:18,072 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 79 transitions, 807 flow [2022-12-13 13:05:18,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 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 13:05:18,073 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:05:18,073 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:05:18,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 13:05:18,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 13:05:18,280 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:05:18,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:05:18,280 INFO L85 PathProgramCache]: Analyzing trace with hash -487862351, now seen corresponding path program 1 times [2022-12-13 13:05:18,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:05:18,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47199952] [2022-12-13 13:05:18,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:05:18,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:05:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:05:19,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:05:19,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:05:19,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47199952] [2022-12-13 13:05:19,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47199952] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:05:19,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828814368] [2022-12-13 13:05:19,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:05:19,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:05:19,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:05:19,757 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:05:19,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 13:05:19,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:05:19,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 13:05:19,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:05:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:05:20,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:05:20,938 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:05:20,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 431 treesize of output 622 [2022-12-13 13:05:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:05:26,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828814368] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:05:26,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:05:26,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2022-12-13 13:05:26,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726660671] [2022-12-13 13:05:26,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:05:26,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 13:05:26,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:05:26,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 13:05:26,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:05:26,817 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 13:05:26,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 79 transitions, 807 flow. Second operand has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 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 13:05:26,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:05:26,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 13:05:26,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:05:28,716 INFO L130 PetriNetUnfolder]: 6429/9836 cut-off events. [2022-12-13 13:05:28,717 INFO L131 PetriNetUnfolder]: For 28007/28007 co-relation queries the response was YES. [2022-12-13 13:05:28,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31748 conditions, 9836 events. 6429/9836 cut-off events. For 28007/28007 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 56721 event pairs, 1773 based on Foata normal form. 6/9834 useless extension candidates. Maximal degree in co-relation 31628. Up to 3145 conditions per place. [2022-12-13 13:05:28,766 INFO L137 encePairwiseOnDemand]: 27/39 looper letters, 113 selfloop transitions, 47 changer transitions 37/197 dead transitions. [2022-12-13 13:05:28,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 197 transitions, 1727 flow [2022-12-13 13:05:28,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:05:28,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 13:05:28,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 150 transitions. [2022-12-13 13:05:28,769 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2022-12-13 13:05:28,769 INFO L175 Difference]: Start difference. First operand has 82 places, 79 transitions, 807 flow. Second operand 10 states and 150 transitions. [2022-12-13 13:05:28,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 197 transitions, 1727 flow [2022-12-13 13:05:28,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 197 transitions, 1647 flow, removed 17 selfloop flow, removed 7 redundant places. [2022-12-13 13:05:28,842 INFO L231 Difference]: Finished difference. Result has 87 places, 93 transitions, 1092 flow [2022-12-13 13:05:28,842 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1092, PETRI_PLACES=87, PETRI_TRANSITIONS=93} [2022-12-13 13:05:28,843 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 49 predicate places. [2022-12-13 13:05:28,843 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:05:28,843 INFO L89 Accepts]: Start accepts. Operand has 87 places, 93 transitions, 1092 flow [2022-12-13 13:05:28,846 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:05:28,846 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:05:28,846 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 93 transitions, 1092 flow [2022-12-13 13:05:28,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 93 transitions, 1092 flow [2022-12-13 13:05:28,925 INFO L130 PetriNetUnfolder]: 71/594 cut-off events. [2022-12-13 13:05:28,925 INFO L131 PetriNetUnfolder]: For 1211/1211 co-relation queries the response was YES. [2022-12-13 13:05:28,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1482 conditions, 594 events. 71/594 cut-off events. For 1211/1211 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4482 event pairs, 0 based on Foata normal form. 0/566 useless extension candidates. Maximal degree in co-relation 1333. Up to 77 conditions per place. [2022-12-13 13:05:28,931 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 93 transitions, 1092 flow [2022-12-13 13:05:28,931 INFO L226 LiptonReduction]: Number of co-enabled transitions 744 [2022-12-13 13:05:28,932 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:05:28,932 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-13 13:05:28,932 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 93 transitions, 1092 flow [2022-12-13 13:05:28,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 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 13:05:28,933 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:05:28,933 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:05:28,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 13:05:29,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:05:29,141 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:05:29,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:05:29,142 INFO L85 PathProgramCache]: Analyzing trace with hash 2044270265, now seen corresponding path program 2 times [2022-12-13 13:05:29,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:05:29,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491725365] [2022-12-13 13:05:29,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:05:29,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:05:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:05:30,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:05:30,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:05:30,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491725365] [2022-12-13 13:05:30,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491725365] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:05:30,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792375392] [2022-12-13 13:05:30,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:05:30,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:05:30,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:05:30,040 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:05:30,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 13:05:30,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:05:30,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:05:30,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 13:05:30,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:05:30,478 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:05:30,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:05:31,563 INFO L321 Elim1Store]: treesize reduction 114, result has 69.9 percent of original size [2022-12-13 13:05:31,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 1056 treesize of output 1200 [2022-12-13 13:05:35,611 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:05:35,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792375392] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:05:35,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:05:35,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2022-12-13 13:05:35,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321183789] [2022-12-13 13:05:35,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:05:35,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:05:35,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:05:35,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:05:35,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:05:35,613 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 13:05:35,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 93 transitions, 1092 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 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 13:05:35,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:05:35,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 13:05:35,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:05:37,084 INFO L130 PetriNetUnfolder]: 6512/9981 cut-off events. [2022-12-13 13:05:37,085 INFO L131 PetriNetUnfolder]: For 33765/33765 co-relation queries the response was YES. [2022-12-13 13:05:37,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33071 conditions, 9981 events. 6512/9981 cut-off events. For 33765/33765 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 58020 event pairs, 5193 based on Foata normal form. 16/9989 useless extension candidates. Maximal degree in co-relation 30496. Up to 9427 conditions per place. [2022-12-13 13:05:37,124 INFO L137 encePairwiseOnDemand]: 26/39 looper letters, 81 selfloop transitions, 14 changer transitions 48/143 dead transitions. [2022-12-13 13:05:37,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 143 transitions, 1526 flow [2022-12-13 13:05:37,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:05:37,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:05:37,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2022-12-13 13:05:37,126 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-13 13:05:37,126 INFO L175 Difference]: Start difference. First operand has 87 places, 93 transitions, 1092 flow. Second operand 7 states and 91 transitions. [2022-12-13 13:05:37,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 143 transitions, 1526 flow [2022-12-13 13:05:37,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 143 transitions, 1404 flow, removed 25 selfloop flow, removed 5 redundant places. [2022-12-13 13:05:37,230 INFO L231 Difference]: Finished difference. Result has 91 places, 94 transitions, 1009 flow [2022-12-13 13:05:37,231 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=971, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1009, PETRI_PLACES=91, PETRI_TRANSITIONS=94} [2022-12-13 13:05:37,232 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 53 predicate places. [2022-12-13 13:05:37,232 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:05:37,232 INFO L89 Accepts]: Start accepts. Operand has 91 places, 94 transitions, 1009 flow [2022-12-13 13:05:37,234 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:05:37,234 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:05:37,234 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 94 transitions, 1009 flow [2022-12-13 13:05:37,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 94 transitions, 1009 flow [2022-12-13 13:05:37,296 INFO L130 PetriNetUnfolder]: 70/570 cut-off events. [2022-12-13 13:05:37,296 INFO L131 PetriNetUnfolder]: For 1105/1105 co-relation queries the response was YES. [2022-12-13 13:05:37,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1400 conditions, 570 events. 70/570 cut-off events. For 1105/1105 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4177 event pairs, 0 based on Foata normal form. 0/545 useless extension candidates. Maximal degree in co-relation 1314. Up to 66 conditions per place. [2022-12-13 13:05:37,300 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 94 transitions, 1009 flow [2022-12-13 13:05:37,300 INFO L226 LiptonReduction]: Number of co-enabled transitions 736 [2022-12-13 13:05:37,300 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:05:37,301 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-13 13:05:37,301 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 94 transitions, 1009 flow [2022-12-13 13:05:37,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 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 13:05:37,301 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:05:37,301 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:05:37,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 13:05:37,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:05:37,502 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:05:37,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:05:37,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1014709298, now seen corresponding path program 1 times [2022-12-13 13:05:37,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:05:37,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345286742] [2022-12-13 13:05:37,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:05:37,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:05:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:05:38,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:05:38,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:05:38,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345286742] [2022-12-13 13:05:38,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345286742] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:05:38,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900253743] [2022-12-13 13:05:38,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:05:38,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:05:38,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:05:38,031 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:05:38,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 13:05:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:05:38,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 13:05:38,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:05:38,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:05:38,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:05:39,350 INFO L321 Elim1Store]: treesize reduction 114, result has 69.9 percent of original size [2022-12-13 13:05:39,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 1056 treesize of output 1200 [2022-12-13 13:05:44,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:05:44,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900253743] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:05:44,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:05:44,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 13:05:44,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914335352] [2022-12-13 13:05:44,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:05:44,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 13:05:44,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:05:44,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 13:05:44,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:05:44,175 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 13:05:44,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 94 transitions, 1009 flow. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 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 13:05:44,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:05:44,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 13:05:44,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:05:46,299 INFO L130 PetriNetUnfolder]: 9246/14389 cut-off events. [2022-12-13 13:05:46,299 INFO L131 PetriNetUnfolder]: For 42561/42561 co-relation queries the response was YES. [2022-12-13 13:05:46,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43885 conditions, 14389 events. 9246/14389 cut-off events. For 42561/42561 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 90960 event pairs, 2952 based on Foata normal form. 96/14474 useless extension candidates. Maximal degree in co-relation 40185. Up to 3517 conditions per place. [2022-12-13 13:05:46,421 INFO L137 encePairwiseOnDemand]: 26/38 looper letters, 129 selfloop transitions, 55 changer transitions 64/248 dead transitions. [2022-12-13 13:05:46,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 248 transitions, 2244 flow [2022-12-13 13:05:46,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 13:05:46,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 13:05:46,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 180 transitions. [2022-12-13 13:05:46,423 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39473684210526316 [2022-12-13 13:05:46,423 INFO L175 Difference]: Start difference. First operand has 89 places, 94 transitions, 1009 flow. Second operand 12 states and 180 transitions. [2022-12-13 13:05:46,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 248 transitions, 2244 flow [2022-12-13 13:05:46,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 248 transitions, 2204 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-12-13 13:05:46,711 INFO L231 Difference]: Finished difference. Result has 97 places, 110 transitions, 1339 flow [2022-12-13 13:05:46,711 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=969, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1339, PETRI_PLACES=97, PETRI_TRANSITIONS=110} [2022-12-13 13:05:46,712 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 59 predicate places. [2022-12-13 13:05:46,712 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:05:46,712 INFO L89 Accepts]: Start accepts. Operand has 97 places, 110 transitions, 1339 flow [2022-12-13 13:05:46,713 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:05:46,713 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:05:46,713 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 110 transitions, 1339 flow [2022-12-13 13:05:46,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 110 transitions, 1339 flow [2022-12-13 13:05:46,794 INFO L130 PetriNetUnfolder]: 74/793 cut-off events. [2022-12-13 13:05:46,794 INFO L131 PetriNetUnfolder]: For 1520/1520 co-relation queries the response was YES. [2022-12-13 13:05:46,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1849 conditions, 793 events. 74/793 cut-off events. For 1520/1520 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 6790 event pairs, 0 based on Foata normal form. 0/758 useless extension candidates. Maximal degree in co-relation 1646. Up to 74 conditions per place. [2022-12-13 13:05:46,799 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 110 transitions, 1339 flow [2022-12-13 13:05:46,799 INFO L226 LiptonReduction]: Number of co-enabled transitions 964 [2022-12-13 13:05:47,226 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:05:47,227 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 515 [2022-12-13 13:05:47,227 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 110 transitions, 1347 flow [2022-12-13 13:05:47,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 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 13:05:47,227 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:05:47,228 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:05:47,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 13:05:47,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 13:05:47,432 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:05:47,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:05:47,432 INFO L85 PathProgramCache]: Analyzing trace with hash -565184664, now seen corresponding path program 1 times [2022-12-13 13:05:47,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:05:47,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761357197] [2022-12-13 13:05:47,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:05:47,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:05:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:05:48,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:05:48,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:05:48,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761357197] [2022-12-13 13:05:48,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761357197] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:05:48,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541462404] [2022-12-13 13:05:48,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:05:48,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:05:48,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:05:48,548 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:05:48,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 13:05:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:05:48,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 13:05:48,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:05:49,035 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:05:49,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:05:50,670 INFO L321 Elim1Store]: treesize reduction 114, result has 69.9 percent of original size [2022-12-13 13:05:50,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 1138 treesize of output 1258 [2022-12-13 13:05:57,221 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:05:57,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541462404] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:05:57,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:05:57,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-13 13:05:57,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624971555] [2022-12-13 13:05:57,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:05:57,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 13:05:57,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:05:57,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 13:05:57,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-12-13 13:05:57,223 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 13:05:57,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 110 transitions, 1347 flow. Second operand has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 16 states have internal predecessors, (63), 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 13:05:57,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:05:57,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 13:05:57,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:06:00,754 INFO L130 PetriNetUnfolder]: 13620/20558 cut-off events. [2022-12-13 13:06:00,755 INFO L131 PetriNetUnfolder]: For 74261/74261 co-relation queries the response was YES. [2022-12-13 13:06:00,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68945 conditions, 20558 events. 13620/20558 cut-off events. For 74261/74261 co-relation queries the response was YES. Maximal size of possible extension queue 714. Compared 127389 event pairs, 3012 based on Foata normal form. 224/20773 useless extension candidates. Maximal degree in co-relation 61680. Up to 3517 conditions per place. [2022-12-13 13:06:00,840 INFO L137 encePairwiseOnDemand]: 22/39 looper letters, 205 selfloop transitions, 97 changer transitions 78/380 dead transitions. [2022-12-13 13:06:00,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 380 transitions, 3318 flow [2022-12-13 13:06:00,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 13:06:00,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-13 13:06:00,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 301 transitions. [2022-12-13 13:06:00,849 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3508158508158508 [2022-12-13 13:06:00,849 INFO L175 Difference]: Start difference. First operand has 97 places, 110 transitions, 1347 flow. Second operand 22 states and 301 transitions. [2022-12-13 13:06:00,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 380 transitions, 3318 flow [2022-12-13 13:06:01,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 380 transitions, 3285 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-13 13:06:01,131 INFO L231 Difference]: Finished difference. Result has 122 places, 148 transitions, 2113 flow [2022-12-13 13:06:01,131 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1328, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2113, PETRI_PLACES=122, PETRI_TRANSITIONS=148} [2022-12-13 13:06:01,131 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 84 predicate places. [2022-12-13 13:06:01,131 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:06:01,131 INFO L89 Accepts]: Start accepts. Operand has 122 places, 148 transitions, 2113 flow [2022-12-13 13:06:01,133 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:06:01,133 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:06:01,133 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 148 transitions, 2113 flow [2022-12-13 13:06:01,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 148 transitions, 2113 flow [2022-12-13 13:06:01,262 INFO L130 PetriNetUnfolder]: 123/1109 cut-off events. [2022-12-13 13:06:01,263 INFO L131 PetriNetUnfolder]: For 3162/3162 co-relation queries the response was YES. [2022-12-13 13:06:01,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3136 conditions, 1109 events. 123/1109 cut-off events. For 3162/3162 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 10052 event pairs, 0 based on Foata normal form. 0/1061 useless extension candidates. Maximal degree in co-relation 2851. Up to 168 conditions per place. [2022-12-13 13:06:01,271 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 148 transitions, 2113 flow [2022-12-13 13:06:01,271 INFO L226 LiptonReduction]: Number of co-enabled transitions 1464 [2022-12-13 13:06:01,271 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:06:01,272 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 13:06:01,272 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 148 transitions, 2113 flow [2022-12-13 13:06:01,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 16 states have internal predecessors, (63), 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 13:06:01,272 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:06:01,272 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:06:01,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 13:06:01,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 13:06:01,475 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:06:01,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:06:01,476 INFO L85 PathProgramCache]: Analyzing trace with hash -775750167, now seen corresponding path program 1 times [2022-12-13 13:06:01,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:06:01,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257774753] [2022-12-13 13:06:01,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:06:01,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:06:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:06:03,269 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:06:03,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:06:03,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257774753] [2022-12-13 13:06:03,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257774753] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:06:03,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376956022] [2022-12-13 13:06:03,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:06:03,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:06:03,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:06:03,271 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:06:03,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 13:06:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:06:03,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 13:06:03,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:06:03,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-12-13 13:06:03,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:06:03,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-13 13:06:03,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 13:06:03,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 13:06:03,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 13:06:03,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 13:06:03,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 13:06:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:06:04,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:06:16,424 WARN L233 SmtUtils]: Spent 8.51s on a formula simplification. DAG size of input: 154 DAG size of output: 138 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 13:06:19,209 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (= c_~node1_state~0 0))) (let ((.cse6 (= c_~node1_state~0 1)) (.cse15 (<= c_~node1_back~0 c_~node1_front~0)) (.cse16 (<= c_~node1_size~0 c_~node1_front~0)) (.cse17 (< c_~node1_front~0 0)) (.cse22 (not .cse4)) (.cse26 (+ c_~node1~0.offset (* c_~node1_back~0 4))) (.cse21 (+ c_~node1~0.offset (* c_~node1_front~0 4)))) (let ((.cse8 (= c_~manager_state~0 4)) (.cse11 (= 3 c_~manager_state~0)) (.cse18 (= 2 c_~manager_state~0)) (.cse14 (= c_~manager_state~0 0)) (.cse12 (= c_~manager_state~0 1)) (.cse30 (not (<= 0 c_~node1_back~0))) (.cse27 (<= (+ c_~node1_back~0 1) c_~node1_front~0)) (.cse29 (forall ((v_ArrVal_1216 (Array Int Int))) (let ((.cse33 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216) c_~node1~0.base))) (= (select .cse33 .cse26) (select .cse33 .cse21))))) (.cse31 (not (< c_~node1_back~0 c_~node1_size~0))) (.cse13 (= 5 c_~manager_state~0)) (.cse7 (or .cse15 .cse16 .cse17 .cse22)) (.cse3 (not .cse6)) (.cse10 (or .cse4 .cse6))) (and (or (and (or (forall ((v_~manager_front~0_201 Int) (v_~client_back~0_179 Int) (v_ArrVal_1216 (Array Int Int)) (~manager_back~0 Int) (~client~0.offset Int) (~manager~0.offset Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216))) (let ((.cse0 (select (select .cse2 c_~client~0.base) (+ ~client~0.offset (* v_~client_back~0_179 4)))) (.cse1 (select .cse2 c_~manager~0.base))) (or (not (= .cse0 (select .cse1 (+ ~manager~0.offset (* ~manager_back~0 4))))) (not (<= 0 v_~client_back~0_179)) (< v_~manager_front~0_201 1) (<= (+ ~manager_back~0 1) v_~manager_front~0_201) (= .cse0 (select .cse1 (+ ~manager~0.offset (- 4) (* v_~manager_front~0_201 4)))))))) .cse3) (or .cse4 (forall ((v_~manager_front~0_201 Int) (v_~client_back~0_179 Int) (v_ArrVal_1216 (Array Int Int)) (~client~0.offset Int) (~manager~0.offset Int)) (or (not (<= 0 v_~client_back~0_179)) (< v_~manager_front~0_201 1) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216))) (= (select (select .cse5 c_~client~0.base) (+ ~client~0.offset (* v_~client_back~0_179 4))) (select (select .cse5 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_201 4))))))) .cse6) .cse7) (not .cse8)) (or (and (or (forall ((v_~manager_front~0_201 Int) (v_ArrVal_1216 (Array Int Int)) (~manager_back~0 Int) (~manager~0.offset Int)) (or (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216) c_~manager~0.base))) (= (select .cse9 (+ ~manager~0.offset (* ~manager_back~0 4))) (select .cse9 (+ ~manager~0.offset (* v_~manager_front~0_201 4))))) (< v_~manager_front~0_201 1) (<= ~manager_back~0 v_~manager_front~0_201))) .cse3) .cse7 .cse10) (not .cse11)) (or .cse12 .cse13 .cse14 .cse8 (and (or .cse15 .cse16 .cse17) .cse4) .cse18 .cse11) (or (and (or (forall ((v_~manager_front~0_201 Int) (v_ArrVal_1216 (Array Int Int)) (~manager_back~0 Int) (~manager~0.offset Int)) (or (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216) c_~manager~0.base))) (= (select .cse19 (+ ~manager~0.offset (* ~manager_back~0 4))) (select .cse19 (+ ~manager~0.offset (* v_~manager_front~0_201 4))))) (< v_~manager_front~0_201 0) (<= ~manager_back~0 v_~manager_front~0_201))) .cse3) (or .cse15 .cse16 .cse17 (forall ((v_ArrVal_1216 (Array Int Int)) (~node2~0.base Int) (~node2~0.offset Int) (v_~node2_back~0_171 Int)) (or (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216))) (= (select (select .cse20 c_~node1~0.base) .cse21) (select (select .cse20 ~node2~0.base) (+ (* v_~node2_back~0_171 4) ~node2~0.offset (- 4))))) (not (<= 1 v_~node2_back~0_171)))) .cse22) .cse10) (not .cse18)) (or (not .cse14) (and (or (forall ((v_~manager_front~0_201 Int) (v_ArrVal_1216 (Array Int Int)) (~manager~0.offset Int)) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216))) (let ((.cse25 (select .cse24 c_~node1~0.base))) (let ((.cse23 (select .cse25 .cse26))) (or (< v_~manager_front~0_201 1) (= .cse23 (select (select .cse24 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_201 4)))) (= .cse23 (select .cse25 .cse21))))))) .cse17 .cse27) (or .cse4 (forall ((v_~manager_front~0_201 Int) (v_ArrVal_1216 (Array Int Int)) (~manager~0.offset Int)) (or (< v_~manager_front~0_201 1) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216))) (= (select (select .cse28 c_~node1~0.base) .cse26) (select (select .cse28 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_201 4)))))))) (or .cse17 .cse27 .cse22 .cse29)) .cse30 .cse31) (or (not .cse12) .cse30 (and .cse4 (or .cse17 .cse27 .cse29)) .cse31) (or (not .cse13) (and .cse7 (or (forall ((v_~client_back~0_179 Int) (v_ArrVal_1216 (Array Int Int)) (~manager_back~0 Int) (~client~0.offset Int) (~manager~0.offset Int)) (or (not (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216))) (= (select (select .cse32 c_~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) (select (select .cse32 c_~client~0.base) (+ (- 4) ~client~0.offset (* v_~client_back~0_179 4)))))) (not (<= 1 v_~client_back~0_179)) (< ~manager_back~0 1))) .cse3) .cse10)))))) is different from false [2022-12-13 13:06:19,776 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse13 (= c_~node1_state~0 0))) (let ((.cse10 (<= c_~node1_back~0 c_~node1_front~0)) (.cse11 (<= c_~node1_size~0 c_~node1_front~0)) (.cse12 (< c_~node1_front~0 0)) (.cse22 (not .cse13)) (.cse19 (+ c_~node1~0.offset (* c_~node1_back~0 4))) (.cse17 (+ c_~node1~0.offset (* c_~node1_front~0 4))) (.cse32 (= c_~node1_state~0 1))) (let ((.cse5 (= 5 c_~manager_state~0)) (.cse0 (= 3 c_~manager_state~0)) (.cse8 (= c_~manager_state~0 0)) (.cse14 (= 2 c_~manager_state~0)) (.cse4 (or .cse13 .cse32)) (.cse20 (<= (+ c_~node1_back~0 1) c_~node1_front~0)) (.cse23 (forall ((v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1215 (Array Int Int))) (let ((.cse33 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216) c_~node1~0.base))) (= (select .cse33 .cse19) (select .cse33 .cse17))))) (.cse7 (= c_~manager_state~0 1)) (.cse24 (not (<= 0 c_~node1_back~0))) (.cse25 (not (< c_~node1_back~0 c_~node1_size~0))) (.cse1 (not .cse32)) (.cse3 (or .cse10 .cse11 .cse12 .cse22)) (.cse9 (= c_~manager_state~0 4))) (and (or (not .cse0) (and (or .cse1 (forall ((v_~manager_front~0_201 Int) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (~manager_back~0 Int) (~manager~0.offset Int)) (or (< v_~manager_front~0_201 1) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216) c_~manager~0.base))) (= (select .cse2 (+ ~manager~0.offset (* v_~manager_front~0_201 4))) (select .cse2 (+ ~manager~0.offset (* ~manager_back~0 4))))) (<= ~manager_back~0 v_~manager_front~0_201)))) .cse3 .cse4)) (or (not .cse5) (and (or .cse1 (forall ((v_~client_back~0_179 Int) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (~manager_back~0 Int) (~client~0.offset Int) (~manager~0.offset Int)) (or (not (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216))) (= (select (select .cse6 c_~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) (select (select .cse6 c_~client~0.base) (+ (- 4) ~client~0.offset (* v_~client_back~0_179 4)))))) (not (<= 1 v_~client_back~0_179)) (< ~manager_back~0 1)))) .cse3 .cse4)) (or .cse7 .cse5 .cse8 .cse9 (and (or .cse10 .cse11 .cse12) .cse13) .cse14 .cse0) (or (not .cse8) (and (or .cse12 (forall ((v_~manager_front~0_201 Int) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (~manager~0.offset Int)) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216))) (let ((.cse16 (select .cse18 c_~node1~0.base))) (let ((.cse15 (select .cse16 .cse19))) (or (< v_~manager_front~0_201 1) (= .cse15 (select .cse16 .cse17)) (= (select (select .cse18 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_201 4))) .cse15)))))) .cse20) (or .cse13 (forall ((v_~manager_front~0_201 Int) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (~manager~0.offset Int)) (or (< v_~manager_front~0_201 1) (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216))) (= (select (select .cse21 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_201 4))) (select (select .cse21 c_~node1~0.base) .cse19)))))) (or .cse12 .cse20 .cse22 .cse23)) .cse24 .cse25) (or (not .cse14) (and (or .cse10 .cse11 .cse12 .cse22 (forall ((v_ArrVal_1216 (Array Int Int)) (~node2~0.base Int) (v_ArrVal_1215 (Array Int Int)) (~node2~0.offset Int) (v_~node2_back~0_171 Int)) (or (let ((.cse26 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216))) (= (select (select .cse26 ~node2~0.base) (+ (* v_~node2_back~0_171 4) ~node2~0.offset (- 4))) (select (select .cse26 c_~node1~0.base) .cse17))) (not (<= 1 v_~node2_back~0_171))))) (or (forall ((v_~manager_front~0_201 Int) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (~manager_back~0 Int) (~manager~0.offset Int)) (or (< v_~manager_front~0_201 0) (let ((.cse27 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216) c_~manager~0.base))) (= (select .cse27 (+ ~manager~0.offset (* v_~manager_front~0_201 4))) (select .cse27 (+ ~manager~0.offset (* ~manager_back~0 4))))) (<= ~manager_back~0 v_~manager_front~0_201))) .cse1) .cse4)) (or (and .cse13 (or .cse12 .cse20 .cse23)) (not .cse7) .cse24 .cse25) (or (and (or (forall ((v_~manager_front~0_201 Int) (v_ArrVal_1216 (Array Int Int)) (v_~client_back~0_179 Int) (v_ArrVal_1215 (Array Int Int)) (~manager_back~0 Int) (~client~0.offset Int) (~manager~0.offset Int)) (let ((.cse30 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216))) (let ((.cse28 (select .cse30 c_~manager~0.base)) (.cse29 (select (select .cse30 c_~client~0.base) (+ ~client~0.offset (* v_~client_back~0_179 4))))) (or (not (<= 0 v_~client_back~0_179)) (= (select .cse28 (+ ~manager~0.offset (- 4) (* v_~manager_front~0_201 4))) .cse29) (< v_~manager_front~0_201 1) (<= (+ ~manager_back~0 1) v_~manager_front~0_201) (not (= (select .cse28 (+ ~manager~0.offset (* ~manager_back~0 4))) .cse29)))))) .cse1) (or (forall ((v_~manager_front~0_201 Int) (v_~client_back~0_179 Int) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (~client~0.offset Int) (~manager~0.offset Int)) (or (not (<= 0 v_~client_back~0_179)) (let ((.cse31 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216))) (= (select (select .cse31 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_201 4))) (select (select .cse31 c_~client~0.base) (+ ~client~0.offset (* v_~client_back~0_179 4))))) (< v_~manager_front~0_201 1))) .cse13 .cse32) .cse3) (not .cse9)))))) is different from false [2022-12-13 13:06:20,391 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (= c_~node1_state~0 0))) (let ((.cse6 (= c_~node1_state~0 1)) (.cse20 (<= c_~node1_back~0 c_~node1_front~0)) (.cse21 (<= c_~node1_size~0 c_~node1_front~0)) (.cse10 (< c_~node1_front~0 0)) (.cse23 (not .cse4)) (.cse29 (+ c_~node1~0.offset (* c_~node1_front~0 4))) (.cse25 (+ c_~node1~0.offset (* c_~node1_back~0 4)))) (let ((.cse9 (= c_~manager_state~0 1)) (.cse8 (= c_~manager_state~0 4)) (.cse15 (= 3 c_~manager_state~0)) (.cse11 (forall ((v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int))) (let ((.cse33 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1214) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216) c_~node1~0.base))) (= (select .cse33 .cse29) (select .cse33 .cse25))))) (.cse12 (<= (+ c_~node1_back~0 1) c_~node1_front~0)) (.cse19 (= c_~manager_state~0 0)) (.cse13 (not (<= 0 c_~node1_back~0))) (.cse14 (not (< c_~node1_back~0 c_~node1_size~0))) (.cse18 (= 5 c_~manager_state~0)) (.cse7 (or .cse20 .cse21 .cse10 .cse23)) (.cse3 (not .cse6)) (.cse17 (or .cse4 .cse6)) (.cse22 (= 2 c_~manager_state~0))) (and (or (and (or (forall ((v_~manager_front~0_201 Int) (v_ArrVal_1216 (Array Int Int)) (v_~client_back~0_179 Int) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (~manager_back~0 Int) (~client~0.offset Int) (~manager~0.offset Int)) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1214) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216))) (let ((.cse1 (select (select .cse2 c_~client~0.base) (+ ~client~0.offset (* v_~client_back~0_179 4)))) (.cse0 (select .cse2 c_~manager~0.base))) (or (not (<= 0 v_~client_back~0_179)) (< v_~manager_front~0_201 1) (<= (+ ~manager_back~0 1) v_~manager_front~0_201) (= (select .cse0 (+ ~manager~0.offset (- 4) (* v_~manager_front~0_201 4))) .cse1) (not (= .cse1 (select .cse0 (+ ~manager~0.offset (* ~manager_back~0 4))))))))) .cse3) (or .cse4 (forall ((v_~manager_front~0_201 Int) (v_ArrVal_1216 (Array Int Int)) (v_~client_back~0_179 Int) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (~client~0.offset Int) (~manager~0.offset Int)) (or (not (<= 0 v_~client_back~0_179)) (< v_~manager_front~0_201 1) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1214) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216))) (= (select (select .cse5 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_201 4))) (select (select .cse5 c_~client~0.base) (+ ~client~0.offset (* v_~client_back~0_179 4))))))) .cse6) .cse7) (not .cse8)) (or (not .cse9) (and .cse4 (or .cse10 .cse11 .cse12)) .cse13 .cse14) (or (not .cse15) (and (or .cse3 (forall ((v_~manager_front~0_201 Int) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_1214 (Array Int Int)) (~manager~0.offset Int)) (or (< v_~manager_front~0_201 1) (let ((.cse16 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1214) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216) c_~manager~0.base))) (= (select .cse16 (+ ~manager~0.offset (* v_~manager_front~0_201 4))) (select .cse16 (+ ~manager~0.offset (* ~manager_back~0 4))))) (<= ~manager_back~0 v_~manager_front~0_201)))) .cse7 .cse17)) (or .cse9 .cse18 .cse19 .cse8 (and (or .cse20 .cse21 .cse10) .cse4) .cse22 .cse15) (or (and (or .cse10 .cse11 .cse12 .cse23) (or .cse4 (forall ((v_~manager_front~0_201 Int) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (~manager~0.offset Int)) (or (let ((.cse24 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1214) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216))) (= (select (select .cse24 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_201 4))) (select (select .cse24 c_~node1~0.base) .cse25))) (< v_~manager_front~0_201 1)))) (or .cse10 .cse12 (forall ((v_~manager_front~0_201 Int) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (~manager~0.offset Int)) (let ((.cse26 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1214) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216))) (let ((.cse28 (select .cse26 c_~node1~0.base))) (let ((.cse27 (select .cse28 .cse25))) (or (= (select (select .cse26 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_201 4))) .cse27) (< v_~manager_front~0_201 1) (= (select .cse28 .cse29) .cse27)))))))) (not .cse19) .cse13 .cse14) (or (not .cse18) (and (or (forall ((v_~client_back~0_179 Int) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (~manager_back~0 Int) (~client~0.offset Int) (~manager~0.offset Int)) (or (not (<= 1 v_~client_back~0_179)) (not (let ((.cse30 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1214) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216))) (= (select (select .cse30 c_~client~0.base) (+ (- 4) ~client~0.offset (* v_~client_back~0_179 4))) (select (select .cse30 c_~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4)))))) (< ~manager_back~0 1))) .cse3) .cse7 .cse17)) (or (and (or .cse20 .cse21 .cse10 .cse23 (forall ((v_ArrVal_1216 (Array Int Int)) (~node2~0.base Int) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (~node2~0.offset Int) (v_~node2_back~0_171 Int)) (or (let ((.cse31 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1214) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216))) (= (select (select .cse31 c_~node1~0.base) .cse29) (select (select .cse31 ~node2~0.base) (+ (* v_~node2_back~0_171 4) ~node2~0.offset (- 4))))) (not (<= 1 v_~node2_back~0_171))))) (or .cse3 (forall ((v_~manager_front~0_201 Int) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_1214 (Array Int Int)) (~manager~0.offset Int)) (or (< v_~manager_front~0_201 0) (let ((.cse32 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1214) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216) c_~manager~0.base))) (= (select .cse32 (+ ~manager~0.offset (* v_~manager_front~0_201 4))) (select .cse32 (+ ~manager~0.offset (* ~manager_back~0 4))))) (<= ~manager_back~0 v_~manager_front~0_201)))) .cse17) (not .cse22)))))) is different from false [2022-12-13 13:06:21,217 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~node1_state~0 0))) (let ((.cse2 (= c_~node1_state~0 1)) (.cse9 (<= c_~node1_back~0 c_~node1_front~0)) (.cse12 (<= c_~node1_size~0 c_~node1_front~0)) (.cse13 (< c_~node1_front~0 0)) (.cse14 (not .cse0)) (.cse11 (+ c_~node1~0.offset (* c_~node1_front~0 4))) (.cse27 (+ c_~node1~0.offset (* c_~node1_back~0 4)))) (let ((.cse8 (= c_~manager_state~0 4)) (.cse17 (= 2 c_~manager_state~0)) (.cse20 (= c_~manager_state~0 0)) (.cse18 (= c_~manager_state~0 1)) (.cse29 (not (<= 0 c_~node1_back~0))) (.cse30 (not (< c_~node1_back~0 c_~node1_size~0))) (.cse22 (<= (+ c_~node1_back~0 1) c_~node1_front~0)) (.cse23 (forall ((v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1213 (Array Int Int))) (let ((.cse33 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1213) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1214) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216) c_~node1~0.base))) (= (select .cse33 .cse11) (select .cse33 .cse27))))) (.cse21 (= 3 c_~manager_state~0)) (.cse19 (= 5 c_~manager_state~0)) (.cse7 (or .cse9 .cse12 .cse13 .cse14)) (.cse16 (or .cse0 .cse2)) (.cse3 (not .cse2))) (and (or (and (or .cse0 (forall ((v_~manager_front~0_201 Int) (v_ArrVal_1216 (Array Int Int)) (v_~client_back~0_179 Int) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1213 (Array Int Int)) (~client~0.offset Int) (~manager~0.offset Int)) (or (not (<= 0 v_~client_back~0_179)) (< v_~manager_front~0_201 1) (let ((.cse1 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1213) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1214) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216))) (= (select (select .cse1 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_201 4))) (select (select .cse1 c_~client~0.base) (+ ~client~0.offset (* v_~client_back~0_179 4))))))) .cse2) (or .cse3 (forall ((v_~manager_front~0_201 Int) (v_ArrVal_1216 (Array Int Int)) (v_~client_back~0_179 Int) (v_ArrVal_1215 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1213 (Array Int Int)) (~client~0.offset Int) (~manager~0.offset Int)) (let ((.cse6 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1213) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1214) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216))) (let ((.cse4 (select .cse6 c_~manager~0.base)) (.cse5 (select (select .cse6 c_~client~0.base) (+ ~client~0.offset (* v_~client_back~0_179 4))))) (or (not (<= 0 v_~client_back~0_179)) (< v_~manager_front~0_201 1) (<= (+ ~manager_back~0 1) v_~manager_front~0_201) (= (select .cse4 (+ ~manager~0.offset (- 4) (* v_~manager_front~0_201 4))) .cse5) (not (= (select .cse4 (+ ~manager~0.offset (* ~manager_back~0 4))) .cse5))))))) .cse7) (not .cse8)) (or (and (or .cse9 (forall ((v_ArrVal_1216 (Array Int Int)) (~node2~0.base Int) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1213 (Array Int Int)) (~node2~0.offset Int) (v_~node2_back~0_171 Int)) (or (not (<= 1 v_~node2_back~0_171)) (let ((.cse10 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1213) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1214) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216))) (= (select (select .cse10 ~node2~0.base) (+ (* v_~node2_back~0_171 4) ~node2~0.offset (- 4))) (select (select .cse10 c_~node1~0.base) .cse11))))) .cse12 .cse13 .cse14) (or (forall ((v_~manager_front~0_201 Int) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_1213 (Array Int Int)) (~manager~0.offset Int)) (or (< v_~manager_front~0_201 0) (let ((.cse15 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1213) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1214) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216) c_~manager~0.base))) (= (select .cse15 (+ ~manager~0.offset (* v_~manager_front~0_201 4))) (select .cse15 (+ ~manager~0.offset (* ~manager_back~0 4))))) (<= ~manager_back~0 v_~manager_front~0_201))) .cse3) .cse16) (not .cse17)) (or .cse18 .cse19 .cse20 .cse8 (and (or .cse9 .cse12 .cse13) .cse0) .cse17 .cse21) (or (and (or .cse13 .cse22 .cse14 .cse23) (or .cse13 (forall ((v_~manager_front~0_201 Int) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1213 (Array Int Int)) (~manager~0.offset Int)) (let ((.cse24 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1213) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1214) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216))) (let ((.cse26 (select .cse24 c_~node1~0.base))) (let ((.cse25 (select .cse26 .cse27))) (or (= (select (select .cse24 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_201 4))) .cse25) (< v_~manager_front~0_201 1) (= (select .cse26 .cse11) .cse25)))))) .cse22) (or .cse0 (forall ((v_~manager_front~0_201 Int) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1213 (Array Int Int)) (~manager~0.offset Int)) (or (let ((.cse28 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1213) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1214) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216))) (= (select (select .cse28 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_201 4))) (select (select .cse28 c_~node1~0.base) .cse27))) (< v_~manager_front~0_201 1))))) (not .cse20) .cse29 .cse30) (or (not .cse18) .cse29 .cse30 (and (or .cse13 .cse22 .cse23) .cse0)) (or (not .cse21) (and (or .cse3 (forall ((v_~manager_front~0_201 Int) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_1213 (Array Int Int)) (~manager~0.offset Int)) (or (< v_~manager_front~0_201 1) (let ((.cse31 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1213) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1214) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216) c_~manager~0.base))) (= (select .cse31 (+ ~manager~0.offset (* v_~manager_front~0_201 4))) (select .cse31 (+ ~manager~0.offset (* ~manager_back~0 4))))) (<= ~manager_back~0 v_~manager_front~0_201)))) .cse7 .cse16)) (or (not .cse19) (and .cse7 .cse16 (or (forall ((v_~client_back~0_179 Int) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_1213 (Array Int Int)) (~client~0.offset Int) (~manager~0.offset Int)) (or (not (<= 1 v_~client_back~0_179)) (< ~manager_back~0 1) (not (let ((.cse32 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1213) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1214) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216))) (= (select (select .cse32 c_~client~0.base) (+ (- 4) ~client~0.offset (* v_~client_back~0_179 4))) (select (select .cse32 c_~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4)))))))) .cse3))))))) is different from false [2022-12-13 13:06:22,237 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:06:22,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376956022] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:06:22,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:06:22,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 25 [2022-12-13 13:06:22,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743309691] [2022-12-13 13:06:22,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:06:22,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-13 13:06:22,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:06:22,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 13:06:22,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=411, Unknown=4, NotChecked=180, Total=702 [2022-12-13 13:06:22,239 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 13:06:22,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 148 transitions, 2113 flow. Second operand has 27 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 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 13:06:22,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:06:22,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 13:06:22,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:07:37,783 WARN L233 SmtUtils]: Spent 1.25m on a formula simplification. DAG size of input: 287 DAG size of output: 244 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 13:07:40,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:07:40,407 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~node1_state~0 0))) (let ((.cse2 (= c_~node1_state~0 1)) (.cse9 (<= c_~node1_back~0 c_~node1_front~0)) (.cse12 (<= c_~node1_size~0 c_~node1_front~0)) (.cse13 (< c_~node1_front~0 0)) (.cse14 (not .cse0)) (.cse11 (+ c_~node1~0.offset (* c_~node1_front~0 4))) (.cse27 (+ c_~node1~0.offset (* c_~node1_back~0 4)))) (let ((.cse8 (= c_~manager_state~0 4)) (.cse17 (= 2 c_~manager_state~0)) (.cse20 (= c_~manager_state~0 0)) (.cse18 (= c_~manager_state~0 1)) (.cse29 (not (<= 0 c_~node1_back~0))) (.cse30 (not (< c_~node1_back~0 c_~node1_size~0))) (.cse22 (<= (+ c_~node1_back~0 1) c_~node1_front~0)) (.cse23 (forall ((v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1213 (Array Int Int))) (let ((.cse33 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1213) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1214) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216) c_~node1~0.base))) (= (select .cse33 .cse11) (select .cse33 .cse27))))) (.cse21 (= 3 c_~manager_state~0)) (.cse19 (= 5 c_~manager_state~0)) (.cse7 (or .cse9 .cse12 .cse13 .cse14)) (.cse16 (or .cse0 .cse2)) (.cse3 (not .cse2))) (and (or (and (or .cse0 (forall ((v_~manager_front~0_201 Int) (v_ArrVal_1216 (Array Int Int)) (v_~client_back~0_179 Int) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1213 (Array Int Int)) (~client~0.offset Int) (~manager~0.offset Int)) (or (not (<= 0 v_~client_back~0_179)) (< v_~manager_front~0_201 1) (let ((.cse1 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1213) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1214) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216))) (= (select (select .cse1 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_201 4))) (select (select .cse1 c_~client~0.base) (+ ~client~0.offset (* v_~client_back~0_179 4))))))) .cse2) (or .cse3 (forall ((v_~manager_front~0_201 Int) (v_ArrVal_1216 (Array Int Int)) (v_~client_back~0_179 Int) (v_ArrVal_1215 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1213 (Array Int Int)) (~client~0.offset Int) (~manager~0.offset Int)) (let ((.cse6 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1213) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1214) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216))) (let ((.cse4 (select .cse6 c_~manager~0.base)) (.cse5 (select (select .cse6 c_~client~0.base) (+ ~client~0.offset (* v_~client_back~0_179 4))))) (or (not (<= 0 v_~client_back~0_179)) (< v_~manager_front~0_201 1) (<= (+ ~manager_back~0 1) v_~manager_front~0_201) (= (select .cse4 (+ ~manager~0.offset (- 4) (* v_~manager_front~0_201 4))) .cse5) (not (= (select .cse4 (+ ~manager~0.offset (* ~manager_back~0 4))) .cse5))))))) .cse7) (not .cse8)) (or (and (or .cse9 (forall ((v_ArrVal_1216 (Array Int Int)) (~node2~0.base Int) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1213 (Array Int Int)) (~node2~0.offset Int) (v_~node2_back~0_171 Int)) (or (not (<= 1 v_~node2_back~0_171)) (let ((.cse10 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1213) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1214) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216))) (= (select (select .cse10 ~node2~0.base) (+ (* v_~node2_back~0_171 4) ~node2~0.offset (- 4))) (select (select .cse10 c_~node1~0.base) .cse11))))) .cse12 .cse13 .cse14) (or (forall ((v_~manager_front~0_201 Int) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_1213 (Array Int Int)) (~manager~0.offset Int)) (or (< v_~manager_front~0_201 0) (let ((.cse15 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1213) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1214) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216) c_~manager~0.base))) (= (select .cse15 (+ ~manager~0.offset (* v_~manager_front~0_201 4))) (select .cse15 (+ ~manager~0.offset (* ~manager_back~0 4))))) (<= ~manager_back~0 v_~manager_front~0_201))) .cse3) .cse16) (not .cse17)) (or .cse18 .cse19 .cse20 .cse8 (and (or .cse9 .cse12 .cse13) .cse0) .cse17 .cse21) (or (and (or .cse13 .cse22 .cse14 .cse23) (or .cse13 (forall ((v_~manager_front~0_201 Int) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1213 (Array Int Int)) (~manager~0.offset Int)) (let ((.cse24 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1213) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1214) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216))) (let ((.cse26 (select .cse24 c_~node1~0.base))) (let ((.cse25 (select .cse26 .cse27))) (or (= (select (select .cse24 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_201 4))) .cse25) (< v_~manager_front~0_201 1) (= (select .cse26 .cse11) .cse25)))))) .cse22) (or .cse0 (forall ((v_~manager_front~0_201 Int) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1213 (Array Int Int)) (~manager~0.offset Int)) (or (let ((.cse28 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1213) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1214) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216))) (= (select (select .cse28 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_201 4))) (select (select .cse28 c_~node1~0.base) .cse27))) (< v_~manager_front~0_201 1))))) (not .cse20) .cse29 .cse30) (or (not .cse18) .cse29 .cse30 (and (or .cse13 .cse22 .cse23) .cse0)) (= c_~safe~0 1) (or (not .cse21) (and (or .cse3 (forall ((v_~manager_front~0_201 Int) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_1213 (Array Int Int)) (~manager~0.offset Int)) (or (< v_~manager_front~0_201 1) (let ((.cse31 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1213) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1214) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216) c_~manager~0.base))) (= (select .cse31 (+ ~manager~0.offset (* v_~manager_front~0_201 4))) (select .cse31 (+ ~manager~0.offset (* ~manager_back~0 4))))) (<= ~manager_back~0 v_~manager_front~0_201)))) .cse7 .cse16)) (or (not .cse19) (and .cse7 .cse16 (or (forall ((v_~client_back~0_179 Int) (v_ArrVal_1216 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_1213 (Array Int Int)) (~client~0.offset Int) (~manager~0.offset Int)) (or (not (<= 1 v_~client_back~0_179)) (< ~manager_back~0 1) (not (let ((.cse32 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1213) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1214) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1216))) (= (select (select .cse32 c_~client~0.base) (+ (- 4) ~client~0.offset (* v_~client_back~0_179 4))) (select (select .cse32 c_~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4)))))))) .cse3))))))) is different from false [2022-12-13 13:07:47,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:07:49,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:07:50,263 INFO L130 PetriNetUnfolder]: 17522/26690 cut-off events. [2022-12-13 13:07:50,263 INFO L131 PetriNetUnfolder]: For 133017/133017 co-relation queries the response was YES. [2022-12-13 13:07:50,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96497 conditions, 26690 events. 17522/26690 cut-off events. For 133017/133017 co-relation queries the response was YES. Maximal size of possible extension queue 998. Compared 177054 event pairs, 7707 based on Foata normal form. 6/26684 useless extension candidates. Maximal degree in co-relation 87795. Up to 17921 conditions per place. [2022-12-13 13:07:50,502 INFO L137 encePairwiseOnDemand]: 13/39 looper letters, 252 selfloop transitions, 85 changer transitions 89/426 dead transitions. [2022-12-13 13:07:50,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 426 transitions, 4406 flow [2022-12-13 13:07:50,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 13:07:50,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-13 13:07:50,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 305 transitions. [2022-12-13 13:07:50,504 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2793040293040293 [2022-12-13 13:07:50,504 INFO L175 Difference]: Start difference. First operand has 122 places, 148 transitions, 2113 flow. Second operand 28 states and 305 transitions. [2022-12-13 13:07:50,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 426 transitions, 4406 flow [2022-12-13 13:07:51,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 426 transitions, 4066 flow, removed 57 selfloop flow, removed 11 redundant places. [2022-12-13 13:07:51,284 INFO L231 Difference]: Finished difference. Result has 154 places, 208 transitions, 2980 flow [2022-12-13 13:07:51,284 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1874, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=2980, PETRI_PLACES=154, PETRI_TRANSITIONS=208} [2022-12-13 13:07:51,285 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 116 predicate places. [2022-12-13 13:07:51,285 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:07:51,285 INFO L89 Accepts]: Start accepts. Operand has 154 places, 208 transitions, 2980 flow [2022-12-13 13:07:51,287 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:07:51,287 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:07:51,287 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 208 transitions, 2980 flow [2022-12-13 13:07:51,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 208 transitions, 2980 flow [2022-12-13 13:07:51,628 INFO L130 PetriNetUnfolder]: 1009/3520 cut-off events. [2022-12-13 13:07:51,629 INFO L131 PetriNetUnfolder]: For 9350/9481 co-relation queries the response was YES. [2022-12-13 13:07:51,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10701 conditions, 3520 events. 1009/3520 cut-off events. For 9350/9481 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 34854 event pairs, 751 based on Foata normal form. 0/3222 useless extension candidates. Maximal degree in co-relation 10040. Up to 1473 conditions per place. [2022-12-13 13:07:51,663 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 208 transitions, 2980 flow [2022-12-13 13:07:51,663 INFO L226 LiptonReduction]: Number of co-enabled transitions 1920 [2022-12-13 13:07:52,608 WARN L322 ript$VariableManager]: TermVariable LBE776 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:52,609 WARN L322 ript$VariableManager]: TermVariable LBE754 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:52,609 WARN L322 ript$VariableManager]: TermVariable LBE773 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:52,609 WARN L322 ript$VariableManager]: TermVariable LBE154 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:52,609 WARN L322 ript$VariableManager]: TermVariable LBE131 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:52,609 WARN L322 ript$VariableManager]: TermVariable LBE815 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:52,609 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:52,609 WARN L322 ript$VariableManager]: TermVariable LBE44 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:52,609 WARN L322 ript$VariableManager]: TermVariable LBE21 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:52,609 WARN L322 ript$VariableManager]: TermVariable LBE841 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:52,610 WARN L322 ript$VariableManager]: TermVariable LBE166 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:52,610 WARN L322 ript$VariableManager]: TermVariable LBE56 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:52,610 WARN L322 ript$VariableManager]: TermVariable LBE108 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:52,610 WARN L322 ript$VariableManager]: TermVariable LBE746 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:52,610 WARN L322 ript$VariableManager]: TermVariable LBE843 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:52,610 WARN L322 ript$VariableManager]: TermVariable LBE76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:52,610 WARN L322 ript$VariableManager]: TermVariable LBE808 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:52,610 WARN L322 ript$VariableManager]: TermVariable LBE807 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:57,267 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1546] L197-4-->L198-3: Formula: (and (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= |v_#memory_int_233| (store |v_#memory_int_234| |v_ULTIMATE.start_main_~#t3~0#1.base_21| (store (select |v_#memory_int_234| |v_ULTIMATE.start_main_~#t3~0#1.base_21|) |v_ULTIMATE.start_main_~#t3~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre47#1_25|))) (= |v_#pthreadsForks_40| |v_ULTIMATE.start_main_#t~pre47#1_25|)) InVars {#pthreadsForks=|v_#pthreadsForks_40|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_234|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~nondet46#1=|v_ULTIMATE.start_main_#t~nondet46#1_17|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_21|, #memory_int=|v_#memory_int_233|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_21|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_25|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre47#1, ULTIMATE.start_main_#t~pre45#1] and [1659] L110-1-->thread2EXIT: Formula: (and (= (mod |v_thread2Thread1of1ForFork3_#t~nondet14#1_In_1| 256) 0) (= |v_thread2Thread1of1ForFork3_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork3_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork3_#t~nondet14#1=|v_thread2Thread1of1ForFork3_#t~nondet14#1_In_1|} OutVars{thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_Out_2|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_#res#1.base, thread2Thread1of1ForFork3_#t~nondet14#1] [2022-12-13 13:07:57,397 WARN L322 ript$VariableManager]: TermVariable LBE776 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:57,398 WARN L322 ript$VariableManager]: TermVariable LBE754 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:57,398 WARN L322 ript$VariableManager]: TermVariable LBE773 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:57,398 WARN L322 ript$VariableManager]: TermVariable LBE154 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:57,398 WARN L322 ript$VariableManager]: TermVariable LBE131 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:57,398 WARN L322 ript$VariableManager]: TermVariable LBE815 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:57,398 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:57,398 WARN L322 ript$VariableManager]: TermVariable LBE44 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:57,398 WARN L322 ript$VariableManager]: TermVariable LBE21 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:57,398 WARN L322 ript$VariableManager]: TermVariable LBE841 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:57,398 WARN L322 ript$VariableManager]: TermVariable LBE166 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:57,399 WARN L322 ript$VariableManager]: TermVariable LBE56 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:57,399 WARN L322 ript$VariableManager]: TermVariable LBE108 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:57,399 WARN L322 ript$VariableManager]: TermVariable LBE746 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:57,399 WARN L322 ript$VariableManager]: TermVariable LBE843 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:57,399 WARN L322 ript$VariableManager]: TermVariable LBE76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:57,399 WARN L322 ript$VariableManager]: TermVariable LBE808 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:07:57,399 WARN L322 ript$VariableManager]: TermVariable LBE807 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:37,320 WARN L322 ript$VariableManager]: TermVariable LBE776 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:37,320 WARN L322 ript$VariableManager]: TermVariable LBE754 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:37,320 WARN L322 ript$VariableManager]: TermVariable LBE773 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:37,320 WARN L322 ript$VariableManager]: TermVariable LBE154 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:37,320 WARN L322 ript$VariableManager]: TermVariable LBE131 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:37,320 WARN L322 ript$VariableManager]: TermVariable LBE815 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:37,320 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:37,320 WARN L322 ript$VariableManager]: TermVariable LBE44 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:37,321 WARN L322 ript$VariableManager]: TermVariable LBE21 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:37,321 WARN L322 ript$VariableManager]: TermVariable LBE841 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:37,321 WARN L322 ript$VariableManager]: TermVariable LBE166 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:37,321 WARN L322 ript$VariableManager]: TermVariable LBE56 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:37,321 WARN L322 ript$VariableManager]: TermVariable LBE108 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:37,321 WARN L322 ript$VariableManager]: TermVariable LBE746 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:37,321 WARN L322 ript$VariableManager]: TermVariable LBE843 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:37,321 WARN L322 ript$VariableManager]: TermVariable LBE76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:37,321 WARN L322 ript$VariableManager]: TermVariable LBE808 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:37,322 WARN L322 ript$VariableManager]: TermVariable LBE807 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:43,963 WARN L322 ript$VariableManager]: TermVariable LBE776 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:43,963 WARN L322 ript$VariableManager]: TermVariable LBE754 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:43,963 WARN L322 ript$VariableManager]: TermVariable LBE773 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:43,963 WARN L322 ript$VariableManager]: TermVariable LBE154 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:43,963 WARN L322 ript$VariableManager]: TermVariable LBE131 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:43,963 WARN L322 ript$VariableManager]: TermVariable LBE815 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:43,964 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:43,964 WARN L322 ript$VariableManager]: TermVariable LBE44 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:43,964 WARN L322 ript$VariableManager]: TermVariable LBE21 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:43,964 WARN L322 ript$VariableManager]: TermVariable LBE841 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:43,964 WARN L322 ript$VariableManager]: TermVariable LBE166 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:43,964 WARN L322 ript$VariableManager]: TermVariable LBE56 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:43,964 WARN L322 ript$VariableManager]: TermVariable LBE108 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:43,964 WARN L322 ript$VariableManager]: TermVariable LBE746 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:43,964 WARN L322 ript$VariableManager]: TermVariable LBE843 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:43,965 WARN L322 ript$VariableManager]: TermVariable LBE76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:43,965 WARN L322 ript$VariableManager]: TermVariable LBE808 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:43,965 WARN L322 ript$VariableManager]: TermVariable LBE807 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:08:47,639 INFO L241 LiptonReduction]: Total number of compositions: 8 [2022-12-13 13:08:47,640 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56355 [2022-12-13 13:08:47,640 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 205 transitions, 3028 flow [2022-12-13 13:08:47,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 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 13:08:47,640 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:08:47,640 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:08:47,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 13:08:47,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 13:08:47,841 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:08:47,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:08:47,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1180232627, now seen corresponding path program 1 times [2022-12-13 13:08:47,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:08:47,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936534489] [2022-12-13 13:08:47,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:08:47,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:08:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:08:48,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:08:48,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:08:48,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936534489] [2022-12-13 13:08:48,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936534489] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:08:48,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254970815] [2022-12-13 13:08:48,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:08:48,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:08:48,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:08:48,452 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:08:48,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 13:08:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:08:48,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 13:08:48,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:08:49,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:08:49,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:08:50,284 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:08:50,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 685 treesize of output 850 [2022-12-13 13:08:53,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:08:53,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254970815] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:08:53,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:08:53,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-13 13:08:53,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272499360] [2022-12-13 13:08:53,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:08:53,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 13:08:53,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:08:53,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 13:08:53,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:08:53,408 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 13:08:53,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 205 transitions, 3028 flow. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 11 states have internal predecessors, (73), 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 13:08:53,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:08:53,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 13:08:53,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:08:57,862 INFO L130 PetriNetUnfolder]: 16055/24818 cut-off events. [2022-12-13 13:08:57,862 INFO L131 PetriNetUnfolder]: For 144176/144176 co-relation queries the response was YES. [2022-12-13 13:08:57,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106357 conditions, 24818 events. 16055/24818 cut-off events. For 144176/144176 co-relation queries the response was YES. Maximal size of possible extension queue 1035. Compared 168276 event pairs, 3471 based on Foata normal form. 766/25571 useless extension candidates. Maximal degree in co-relation 101224. Up to 9720 conditions per place. [2022-12-13 13:08:57,994 INFO L137 encePairwiseOnDemand]: 26/48 looper letters, 168 selfloop transitions, 83 changer transitions 43/294 dead transitions. [2022-12-13 13:08:57,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 294 transitions, 4060 flow [2022-12-13 13:08:57,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:08:57,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 13:08:57,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2022-12-13 13:08:57,995 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34375 [2022-12-13 13:08:57,995 INFO L175 Difference]: Start difference. First operand has 151 places, 205 transitions, 3028 flow. Second operand 10 states and 165 transitions. [2022-12-13 13:08:57,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 294 transitions, 4060 flow [2022-12-13 13:08:59,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 294 transitions, 3723 flow, removed 150 selfloop flow, removed 7 redundant places. [2022-12-13 13:08:59,260 INFO L231 Difference]: Finished difference. Result has 151 places, 163 transitions, 2336 flow [2022-12-13 13:08:59,260 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2307, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2336, PETRI_PLACES=151, PETRI_TRANSITIONS=163} [2022-12-13 13:08:59,261 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 113 predicate places. [2022-12-13 13:08:59,261 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:08:59,261 INFO L89 Accepts]: Start accepts. Operand has 151 places, 163 transitions, 2336 flow [2022-12-13 13:08:59,262 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:08:59,262 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:08:59,263 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 163 transitions, 2336 flow [2022-12-13 13:08:59,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 163 transitions, 2336 flow [2022-12-13 13:08:59,457 INFO L130 PetriNetUnfolder]: 774/2417 cut-off events. [2022-12-13 13:08:59,457 INFO L131 PetriNetUnfolder]: For 6010/6258 co-relation queries the response was YES. [2022-12-13 13:08:59,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7204 conditions, 2417 events. 774/2417 cut-off events. For 6010/6258 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 21838 event pairs, 627 based on Foata normal form. 0/2091 useless extension candidates. Maximal degree in co-relation 6763. Up to 1182 conditions per place. [2022-12-13 13:08:59,477 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 163 transitions, 2336 flow [2022-12-13 13:08:59,477 INFO L226 LiptonReduction]: Number of co-enabled transitions 1246 [2022-12-13 13:09:02,345 WARN L322 ript$VariableManager]: TermVariable LBE356 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:09:02,345 WARN L322 ript$VariableManager]: TermVariable LBE774 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:09:02,346 WARN L322 ript$VariableManager]: TermVariable LBE344 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:09:02,346 WARN L322 ript$VariableManager]: TermVariable LBE376 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:09:02,346 WARN L322 ript$VariableManager]: TermVariable LBE839 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:09:02,346 WARN L322 ript$VariableManager]: TermVariable LBE799 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:09:03,126 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 13:09:03,127 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3866 [2022-12-13 13:09:03,127 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 163 transitions, 2365 flow [2022-12-13 13:09:03,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 11 states have internal predecessors, (73), 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 13:09:03,127 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:09:03,127 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:09:03,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 13:09:03,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 13:09:03,334 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:09:03,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:09:03,334 INFO L85 PathProgramCache]: Analyzing trace with hash -145379398, now seen corresponding path program 1 times [2022-12-13 13:09:03,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:09:03,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797388298] [2022-12-13 13:09:03,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:09:03,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:09:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:04,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:09:04,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:09:04,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797388298] [2022-12-13 13:09:04,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797388298] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:09:04,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625180457] [2022-12-13 13:09:04,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:09:04,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:09:04,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:09:04,691 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:09:04,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 13:09:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:04,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 13:09:04,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:09:05,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:09:05,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:09:12,977 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:09:12,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 576 treesize of output 1101 [2022-12-13 13:09:45,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:09:45,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625180457] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:09:45,935 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:09:45,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2022-12-13 13:09:45,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744055773] [2022-12-13 13:09:45,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:09:45,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 13:09:45,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:09:45,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 13:09:45,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:09:45,936 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 13:09:45,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 163 transitions, 2365 flow. Second operand has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 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 13:09:45,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:09:45,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 13:09:45,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:09:49,823 INFO L130 PetriNetUnfolder]: 13587/20638 cut-off events. [2022-12-13 13:09:49,823 INFO L131 PetriNetUnfolder]: For 107776/107776 co-relation queries the response was YES. [2022-12-13 13:09:49,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89376 conditions, 20638 events. 13587/20638 cut-off events. For 107776/107776 co-relation queries the response was YES. Maximal size of possible extension queue 867. Compared 132558 event pairs, 3596 based on Foata normal form. 1/20509 useless extension candidates. Maximal degree in co-relation 84653. Up to 11504 conditions per place. [2022-12-13 13:09:49,924 INFO L137 encePairwiseOnDemand]: 33/51 looper letters, 155 selfloop transitions, 63 changer transitions 39/257 dead transitions. [2022-12-13 13:09:49,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 257 transitions, 3299 flow [2022-12-13 13:09:49,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:09:49,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:09:49,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2022-12-13 13:09:49,926 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3289760348583878 [2022-12-13 13:09:49,926 INFO L175 Difference]: Start difference. First operand has 145 places, 163 transitions, 2365 flow. Second operand 9 states and 151 transitions. [2022-12-13 13:09:49,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 257 transitions, 3299 flow [2022-12-13 13:09:50,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 257 transitions, 3099 flow, removed 47 selfloop flow, removed 6 redundant places. [2022-12-13 13:09:50,469 INFO L231 Difference]: Finished difference. Result has 149 places, 163 transitions, 2353 flow [2022-12-13 13:09:50,469 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2177, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2353, PETRI_PLACES=149, PETRI_TRANSITIONS=163} [2022-12-13 13:09:50,469 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 111 predicate places. [2022-12-13 13:09:50,469 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:09:50,469 INFO L89 Accepts]: Start accepts. Operand has 149 places, 163 transitions, 2353 flow [2022-12-13 13:09:50,470 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:09:50,470 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:09:50,471 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 163 transitions, 2353 flow [2022-12-13 13:09:50,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 163 transitions, 2353 flow [2022-12-13 13:09:50,657 INFO L130 PetriNetUnfolder]: 765/2379 cut-off events. [2022-12-13 13:09:50,658 INFO L131 PetriNetUnfolder]: For 6440/6702 co-relation queries the response was YES. [2022-12-13 13:09:50,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7127 conditions, 2379 events. 765/2379 cut-off events. For 6440/6702 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 21453 event pairs, 617 based on Foata normal form. 0/2053 useless extension candidates. Maximal degree in co-relation 6689. Up to 1159 conditions per place. [2022-12-13 13:09:50,789 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 163 transitions, 2353 flow [2022-12-13 13:09:50,789 INFO L226 LiptonReduction]: Number of co-enabled transitions 1274 [2022-12-13 13:10:01,827 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:10:01,828 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11359 [2022-12-13 13:10:01,828 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 163 transitions, 2379 flow [2022-12-13 13:10:01,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 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 13:10:01,829 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:10:01,829 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:10:01,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 13:10:02,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 13:10:02,036 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:10:02,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:10:02,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1770665506, now seen corresponding path program 1 times [2022-12-13 13:10:02,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:10:02,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972902839] [2022-12-13 13:10:02,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:10:02,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:10:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:10:03,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:10:03,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:10:03,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972902839] [2022-12-13 13:10:03,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972902839] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:10:03,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476103105] [2022-12-13 13:10:03,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:10:03,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:10:03,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:10:03,827 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:10:03,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 13:10:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:10:04,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-13 13:10:04,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:10:04,171 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-12-13 13:10:04,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-12-13 13:10:04,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 13:10:04,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-13 13:10:04,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-13 13:10:04,324 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:10:04,326 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 234 [2022-12-13 13:10:04,381 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:10:04,382 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 221 [2022-12-13 13:10:04,504 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:10:04,505 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 317 [2022-12-13 13:10:04,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 166 [2022-12-13 13:10:04,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-13 13:10:04,662 INFO L321 Elim1Store]: treesize reduction 33, result has 19.5 percent of original size [2022-12-13 13:10:04,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 221 treesize of output 184 [2022-12-13 13:10:04,682 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-12-13 13:10:04,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 18 [2022-12-13 13:10:04,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-13 13:10:04,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-13 13:10:04,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-13 13:10:04,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:10:05,024 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-12-13 13:10:05,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 387 treesize of output 395 [2022-12-13 13:10:05,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-13 13:10:05,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-13 13:10:05,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-13 13:10:05,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 13:10:05,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 13:10:05,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 13:10:05,823 INFO L321 Elim1Store]: treesize reduction 49, result has 53.3 percent of original size [2022-12-13 13:10:05,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 125 treesize of output 108 [2022-12-13 13:10:05,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:10:05,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:10:38,277 WARN L233 SmtUtils]: Spent 21.05s on a formula simplification. DAG size of input: 184 DAG size of output: 165 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 13:10:50,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:10:50,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476103105] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:10:50,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:10:50,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 19 [2022-12-13 13:10:50,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909365213] [2022-12-13 13:10:50,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:10:50,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 13:10:50,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:10:50,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 13:10:50,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=301, Unknown=23, NotChecked=0, Total=420 [2022-12-13 13:10:50,580 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 13:10:50,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 163 transitions, 2379 flow. Second operand has 21 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 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 13:10:50,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:10:50,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 13:10:50,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:11:05,705 WARN L233 SmtUtils]: Spent 14.02s on a formula simplification. DAG size of input: 529 DAG size of output: 507 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 13:11:11,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:11:31,577 WARN L233 SmtUtils]: Spent 13.04s on a formula simplification that was a NOOP. DAG size: 167 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 13:11:55,500 WARN L233 SmtUtils]: Spent 19.89s on a formula simplification. DAG size of input: 528 DAG size of output: 516 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 13:11:58,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:12:24,588 WARN L233 SmtUtils]: Spent 23.55s on a formula simplification. DAG size of input: 508 DAG size of output: 502 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 13:12:27,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:12:30,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:12:32,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:12:34,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:12:36,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:12:38,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:12:48,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:12:50,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:12:54,160 INFO L130 PetriNetUnfolder]: 21421/32075 cut-off events. [2022-12-13 13:12:54,161 INFO L131 PetriNetUnfolder]: For 184216/184216 co-relation queries the response was YES. [2022-12-13 13:12:54,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139679 conditions, 32075 events. 21421/32075 cut-off events. For 184216/184216 co-relation queries the response was YES. Maximal size of possible extension queue 1288. Compared 213177 event pairs, 4642 based on Foata normal form. 19/31864 useless extension candidates. Maximal degree in co-relation 134595. Up to 14641 conditions per place. [2022-12-13 13:12:54,365 INFO L137 encePairwiseOnDemand]: 17/54 looper letters, 261 selfloop transitions, 134 changer transitions 92/487 dead transitions. [2022-12-13 13:12:54,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 487 transitions, 5647 flow [2022-12-13 13:12:54,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 13:12:54,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-13 13:12:54,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 338 transitions. [2022-12-13 13:12:54,368 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24074074074074073 [2022-12-13 13:12:54,368 INFO L175 Difference]: Start difference. First operand has 147 places, 163 transitions, 2379 flow. Second operand 26 states and 338 transitions. [2022-12-13 13:12:54,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 487 transitions, 5647 flow [2022-12-13 13:12:55,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 487 transitions, 5463 flow, removed 18 selfloop flow, removed 6 redundant places. [2022-12-13 13:12:55,387 INFO L231 Difference]: Finished difference. Result has 178 places, 238 transitions, 3855 flow [2022-12-13 13:12:55,387 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2254, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=3855, PETRI_PLACES=178, PETRI_TRANSITIONS=238} [2022-12-13 13:12:55,388 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 140 predicate places. [2022-12-13 13:12:55,388 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:12:55,388 INFO L89 Accepts]: Start accepts. Operand has 178 places, 238 transitions, 3855 flow [2022-12-13 13:12:55,390 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:12:55,390 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:12:55,390 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 238 transitions, 3855 flow [2022-12-13 13:12:55,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 238 transitions, 3855 flow [2022-12-13 13:12:55,880 INFO L130 PetriNetUnfolder]: 1213/3636 cut-off events. [2022-12-13 13:12:55,881 INFO L131 PetriNetUnfolder]: For 12222/12557 co-relation queries the response was YES. [2022-12-13 13:12:55,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11845 conditions, 3636 events. 1213/3636 cut-off events. For 12222/12557 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 35001 event pairs, 972 based on Foata normal form. 0/3136 useless extension candidates. Maximal degree in co-relation 11677. Up to 1800 conditions per place. [2022-12-13 13:12:55,921 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 238 transitions, 3855 flow [2022-12-13 13:12:55,921 INFO L226 LiptonReduction]: Number of co-enabled transitions 2066 [2022-12-13 13:13:01,000 WARN L322 ript$VariableManager]: TermVariable LBE776 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:01,000 WARN L322 ript$VariableManager]: TermVariable LBE773 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:01,001 WARN L322 ript$VariableManager]: TermVariable LBE131 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:01,001 WARN L322 ript$VariableManager]: TermVariable LBE815 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:01,001 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:01,001 WARN L322 ript$VariableManager]: TermVariable LBE44 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:01,001 WARN L322 ript$VariableManager]: TermVariable LBE841 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:01,001 WARN L322 ript$VariableManager]: TermVariable LBE166 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:01,001 WARN L322 ript$VariableManager]: TermVariable LBE56 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:01,001 WARN L322 ript$VariableManager]: TermVariable LBE843 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:01,001 WARN L322 ript$VariableManager]: TermVariable LBE808 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:01,001 WARN L322 ript$VariableManager]: TermVariable LBE807 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:01,001 WARN L322 ript$VariableManager]: TermVariable LBE754 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:01,001 WARN L322 ript$VariableManager]: TermVariable LBE154 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:01,001 WARN L322 ript$VariableManager]: TermVariable LBE21 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:01,002 WARN L322 ript$VariableManager]: TermVariable LBE108 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:01,002 WARN L322 ript$VariableManager]: TermVariable LBE746 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:01,002 WARN L322 ript$VariableManager]: TermVariable LBE76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:06,031 WARN L233 SmtUtils]: Spent 5.02s on a formula simplification. DAG size of input: 574 DAG size of output: 574 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:13:15,669 WARN L233 SmtUtils]: Spent 6.98s on a formula simplification. DAG size of input: 738 DAG size of output: 738 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:13:19,191 WARN L322 ript$VariableManager]: TermVariable LBE820 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:19,191 WARN L322 ript$VariableManager]: TermVariable LBE296 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:19,191 WARN L322 ript$VariableManager]: TermVariable LBE273 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:19,191 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:19,192 WARN L322 ript$VariableManager]: TermVariable LBE789 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:19,192 WARN L322 ript$VariableManager]: TermVariable LBE865 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:35,078 WARN L322 ript$VariableManager]: TermVariable LBE776 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:35,078 WARN L322 ript$VariableManager]: TermVariable LBE773 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:35,079 WARN L322 ript$VariableManager]: TermVariable LBE131 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:35,079 WARN L322 ript$VariableManager]: TermVariable LBE815 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:35,079 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:35,079 WARN L322 ript$VariableManager]: TermVariable LBE44 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:35,079 WARN L322 ript$VariableManager]: TermVariable LBE841 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:35,079 WARN L322 ript$VariableManager]: TermVariable LBE166 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:35,079 WARN L322 ript$VariableManager]: TermVariable LBE56 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:35,079 WARN L322 ript$VariableManager]: TermVariable LBE843 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:35,079 WARN L322 ript$VariableManager]: TermVariable LBE808 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:35,079 WARN L322 ript$VariableManager]: TermVariable LBE807 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:35,079 WARN L322 ript$VariableManager]: TermVariable LBE754 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:35,079 WARN L322 ript$VariableManager]: TermVariable LBE154 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:35,080 WARN L322 ript$VariableManager]: TermVariable LBE21 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:35,080 WARN L322 ript$VariableManager]: TermVariable LBE108 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:35,080 WARN L322 ript$VariableManager]: TermVariable LBE746 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:35,080 WARN L322 ript$VariableManager]: TermVariable LBE76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:13:40,147 WARN L233 SmtUtils]: Spent 5.06s on a formula simplification. DAG size of input: 574 DAG size of output: 574 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:13:49,662 WARN L233 SmtUtils]: Spent 6.98s on a formula simplification. DAG size of input: 738 DAG size of output: 738 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:13:53,198 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 13:13:53,199 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57811 [2022-12-13 13:13:53,199 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 238 transitions, 3931 flow [2022-12-13 13:13:53,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 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 13:13:53,199 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:13:53,199 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:13:53,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 13:13:53,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:13:53,403 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:13:53,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:13:53,404 INFO L85 PathProgramCache]: Analyzing trace with hash 427963879, now seen corresponding path program 1 times [2022-12-13 13:13:53,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:13:53,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963040152] [2022-12-13 13:13:53,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:13:53,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:13:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:13:54,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:13:54,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:13:54,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963040152] [2022-12-13 13:13:54,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963040152] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:13:54,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141337101] [2022-12-13 13:13:54,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:13:54,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:13:54,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:13:54,488 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:13:54,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 13:13:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:13:54,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 13:13:54,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:13:54,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:13:54,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:14:03,540 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:14:03,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 534 treesize of output 965 [2022-12-13 13:14:22,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:14:22,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141337101] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:14:22,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:14:22,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 13:14:22,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663186126] [2022-12-13 13:14:22,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:14:22,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:14:22,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:14:22,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:14:22,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:14:22,088 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-13 13:14:22,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 238 transitions, 3931 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 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 13:14:22,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:14:22,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-13 13:14:22,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:14:28,235 INFO L130 PetriNetUnfolder]: 19438/29293 cut-off events. [2022-12-13 13:14:28,236 INFO L131 PetriNetUnfolder]: For 194451/194451 co-relation queries the response was YES. [2022-12-13 13:14:28,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134117 conditions, 29293 events. 19438/29293 cut-off events. For 194451/194451 co-relation queries the response was YES. Maximal size of possible extension queue 1192. Compared 195507 event pairs, 5224 based on Foata normal form. 32/29105 useless extension candidates. Maximal degree in co-relation 133924. Up to 12761 conditions per place. [2022-12-13 13:14:28,433 INFO L137 encePairwiseOnDemand]: 32/59 looper letters, 199 selfloop transitions, 95 changer transitions 27/321 dead transitions. [2022-12-13 13:14:28,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 321 transitions, 5025 flow [2022-12-13 13:14:28,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:14:28,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:14:28,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions. [2022-12-13 13:14:28,434 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35108958837772397 [2022-12-13 13:14:28,435 INFO L175 Difference]: Start difference. First operand has 177 places, 238 transitions, 3931 flow. Second operand 7 states and 145 transitions. [2022-12-13 13:14:28,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 321 transitions, 5025 flow [2022-12-13 13:14:29,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 321 transitions, 4707 flow, removed 116 selfloop flow, removed 5 redundant places. [2022-12-13 13:14:29,879 INFO L231 Difference]: Finished difference. Result has 180 places, 234 transitions, 3813 flow [2022-12-13 13:14:29,879 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=3459, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3813, PETRI_PLACES=180, PETRI_TRANSITIONS=234} [2022-12-13 13:14:29,880 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 142 predicate places. [2022-12-13 13:14:29,880 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:14:29,880 INFO L89 Accepts]: Start accepts. Operand has 180 places, 234 transitions, 3813 flow [2022-12-13 13:14:29,882 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:14:29,882 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:14:29,882 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 234 transitions, 3813 flow [2022-12-13 13:14:29,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 234 transitions, 3813 flow [2022-12-13 13:14:30,411 INFO L130 PetriNetUnfolder]: 1226/4248 cut-off events. [2022-12-13 13:14:30,412 INFO L131 PetriNetUnfolder]: For 16357/16559 co-relation queries the response was YES. [2022-12-13 13:14:30,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14105 conditions, 4248 events. 1226/4248 cut-off events. For 16357/16559 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 44100 event pairs, 920 based on Foata normal form. 0/3927 useless extension candidates. Maximal degree in co-relation 13932. Up to 1704 conditions per place. [2022-12-13 13:14:30,462 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 234 transitions, 3813 flow [2022-12-13 13:14:30,462 INFO L226 LiptonReduction]: Number of co-enabled transitions 2054 [2022-12-13 13:14:30,464 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:14:30,465 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 585 [2022-12-13 13:14:30,465 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 234 transitions, 3813 flow [2022-12-13 13:14:30,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 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 13:14:30,465 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:14:30,465 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:14:30,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 13:14:30,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:14:30,675 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 13:14:30,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:14:30,675 INFO L85 PathProgramCache]: Analyzing trace with hash 149650825, now seen corresponding path program 1 times [2022-12-13 13:14:30,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:14:30,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441058414] [2022-12-13 13:14:30,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:30,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:14:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:32,199 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:14:32,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:14:32,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441058414] [2022-12-13 13:14:32,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441058414] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:14:32,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451917475] [2022-12-13 13:14:32,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:14:32,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:14:32,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:14:32,201 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:14:32,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 13:14:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:14:32,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 13:14:32,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:14:32,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:14:32,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:15:14,340 WARN L233 SmtUtils]: Spent 31.52s on a formula simplification. DAG size of input: 144 DAG size of output: 142 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 13:15:16,108 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:15:16,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 793 treesize of output 1865 Received shutdown request... [2022-12-13 13:16:01,027 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 13:16:01,030 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 13:16:01,047 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-13 13:16:01,049 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 13:16:01,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 13:16:01,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:16:01,250 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 26 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 32ms.. [2022-12-13 13:16:01,251 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-13 13:16:01,251 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 13:16:01,251 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 13:16:01,251 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-13 13:16:01,251 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:16:01,253 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 13:16:01,253 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 13:16:01,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:16:01 BasicIcfg [2022-12-13 13:16:01,256 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 13:16:01,257 INFO L158 Benchmark]: Toolchain (without parser) took 792188.97ms. Allocated memory was 192.9MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 153.2MB in the beginning and 525.7MB in the end (delta: -372.5MB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-12-13 13:16:01,257 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 192.9MB. Free memory was 169.5MB in the beginning and 169.5MB in the end (delta: 63.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 13:16:01,257 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.66ms. Allocated memory is still 192.9MB. Free memory was 153.2MB in the beginning and 136.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-13 13:16:01,258 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.97ms. Allocated memory is still 192.9MB. Free memory was 136.4MB in the beginning and 132.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-12-13 13:16:01,258 INFO L158 Benchmark]: Boogie Preprocessor took 70.51ms. Allocated memory is still 192.9MB. Free memory was 132.7MB in the beginning and 130.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 13:16:01,258 INFO L158 Benchmark]: RCFGBuilder took 978.77ms. Allocated memory is still 192.9MB. Free memory was 130.1MB in the beginning and 66.1MB in the end (delta: 64.0MB). Peak memory consumption was 64.0MB. Max. memory is 8.0GB. [2022-12-13 13:16:01,258 INFO L158 Benchmark]: TraceAbstraction took 790773.36ms. Allocated memory was 192.9MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 65.1MB in the beginning and 525.7MB in the end (delta: -460.6MB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-12-13 13:16:01,260 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.12ms. Allocated memory is still 192.9MB. Free memory was 169.5MB in the beginning and 169.5MB in the end (delta: 63.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 283.66ms. Allocated memory is still 192.9MB. Free memory was 153.2MB in the beginning and 136.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 74.97ms. Allocated memory is still 192.9MB. Free memory was 136.4MB in the beginning and 132.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 70.51ms. Allocated memory is still 192.9MB. Free memory was 132.7MB in the beginning and 130.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 978.77ms. Allocated memory is still 192.9MB. Free memory was 130.1MB in the beginning and 66.1MB in the end (delta: 64.0MB). Peak memory consumption was 64.0MB. Max. memory is 8.0GB. * TraceAbstraction took 790773.36ms. Allocated memory was 192.9MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 65.1MB in the beginning and 525.7MB in the end (delta: -460.6MB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.9s, 291 PlacesBefore, 38 PlacesAfterwards, 315 TransitionsBefore, 33 TransitionsAfterwards, 5184 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 196 TrivialYvCompositions, 57 ConcurrentYvCompositions, 21 ChoiceCompositions, 274 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3610, independent: 3610, independent conditional: 3610, 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: 3610, independent: 3610, independent conditional: 0, independent unconditional: 3610, 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: 3610, independent: 3610, independent conditional: 0, independent unconditional: 3610, 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: 3610, independent: 3610, independent conditional: 0, independent unconditional: 3610, 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: 2419, independent: 2419, independent conditional: 0, independent unconditional: 2419, 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: 2419, independent: 2419, independent conditional: 0, independent unconditional: 2419, 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: 3610, independent: 1191, independent conditional: 0, independent unconditional: 1191, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2419, unknown conditional: 0, unknown unconditional: 2419] , Statistics on independence cache: Total cache size (in pairs): 4536, Positive cache size: 4536, Positive conditional cache size: 0, Positive unconditional cache size: 4536, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 44 PlacesBefore, 44 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 58 PlacesBefore, 58 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 284 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 65.4s, 79 PlacesBefore, 78 PlacesAfterwards, 88 TransitionsBefore, 87 TransitionsAfterwards, 624 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 8, Positive conditional cache size: 8, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 84 PlacesBefore, 84 PlacesAfterwards, 87 TransitionsBefore, 87 TransitionsAfterwards, 608 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): 8, Positive cache size: 8, Positive conditional cache size: 8, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 83 PlacesBefore, 83 PlacesAfterwards, 87 TransitionsBefore, 87 TransitionsAfterwards, 608 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): 8, Positive cache size: 8, Positive conditional cache size: 8, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 82 PlacesBefore, 82 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 552 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): 8, Positive cache size: 8, Positive conditional cache size: 8, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 87 PlacesBefore, 87 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 744 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): 8, Positive cache size: 8, Positive conditional cache size: 8, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 89 PlacesBefore, 89 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 736 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): 8, Positive cache size: 8, Positive conditional cache size: 8, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 97 PlacesBefore, 97 PlacesAfterwards, 110 TransitionsBefore, 110 TransitionsAfterwards, 964 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 8, Positive cache size: 8, Positive conditional cache size: 8, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 122 PlacesBefore, 122 PlacesAfterwards, 148 TransitionsBefore, 148 TransitionsAfterwards, 1464 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): 8, Positive cache size: 8, Positive conditional cache size: 8, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 56.0s, 154 PlacesBefore, 151 PlacesAfterwards, 208 TransitionsBefore, 205 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, 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: 17, independent: 17, independent conditional: 17, 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: 17, independent: 17, independent conditional: 16, independent unconditional: 1, 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: 17, independent: 17, independent conditional: 16, independent unconditional: 1, 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: 13, independent: 13, independent conditional: 12, 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: 13, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 17, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 13, unknown conditional: 12, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 65, Positive conditional cache size: 64, Positive unconditional cache size: 1, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 145 PlacesBefore, 145 PlacesAfterwards, 163 TransitionsBefore, 163 TransitionsAfterwards, 1246 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 85, Positive conditional cache size: 84, Positive unconditional cache size: 1, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.0s, 147 PlacesBefore, 147 PlacesAfterwards, 163 TransitionsBefore, 163 TransitionsAfterwards, 1274 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 85, Positive conditional cache size: 84, Positive unconditional cache size: 1, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 57.3s, 177 PlacesBefore, 177 PlacesAfterwards, 238 TransitionsBefore, 238 TransitionsAfterwards, 2066 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 16, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 129, Positive cache size: 129, Positive conditional cache size: 128, Positive unconditional cache size: 1, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 179 PlacesBefore, 179 PlacesAfterwards, 234 TransitionsBefore, 234 TransitionsAfterwards, 2054 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): 129, Positive cache size: 129, Positive conditional cache size: 128, Positive unconditional cache size: 1, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 206]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 26 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 32ms.. - TimeoutResultAtElement [Line: 196]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 26 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 32ms.. - TimeoutResultAtElement [Line: 197]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 26 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 32ms.. - TimeoutResultAtElement [Line: 198]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 26 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 32ms.. - TimeoutResultAtElement [Line: 199]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 26 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 32ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 347 locations, 5 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: 790.6s, OverallIterations: 21, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 283.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.1s, HoareTripleCheckerStatistics: 230 mSolverCounterUnknown, 4201 SdHoareTripleChecker+Valid, 79.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4201 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 78.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 584 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 689 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6354 IncrementalHoareTripleChecker+Invalid, 7857 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 689 mSolverCounterUnsat, 0 mSDtfsCounter, 6354 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 862 GetRequests, 591 SyntacticMatches, 9 SemanticMatches, 262 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 213.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3931occurred in iteration=19, InterpolantAutomatonStates: 198, 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.4s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 193.2s InterpolantComputationTime, 868 NumberOfCodeBlocks, 868 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1179 ConstructedInterpolants, 63 QuantifiedInterpolants, 47936 SizeOfPredicates, 746 NumberOfNonLiveVariables, 5511 ConjunctsInSsa, 229 ConjunctsInUnsatCore, 48 InterpolantComputations, 6 PerfectInterpolantSequences, 75/150 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown