/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix020.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:48:04,385 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:48:04,386 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:48:04,417 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:48:04,418 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:48:04,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:48:04,422 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:48:04,425 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:48:04,428 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:48:04,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:48:04,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:48:04,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:48:04,434 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:48:04,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:48:04,436 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:48:04,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:48:04,438 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:48:04,439 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:48:04,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:48:04,444 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:48:04,444 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:48:04,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:48:04,446 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:48:04,446 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:48:04,451 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:48:04,451 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:48:04,451 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:48:04,452 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:48:04,452 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:48:04,453 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:48:04,453 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:48:04,454 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:48:04,455 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:48:04,455 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:48:04,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:48:04,456 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:48:04,456 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:48:04,456 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:48:04,456 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:48:04,457 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:48:04,457 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:48:04,460 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 11:48:04,481 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:48:04,481 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:48:04,483 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:48:04,483 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:48:04,483 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:48:04,484 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:48:04,484 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:48:04,484 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:48:04,484 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:48:04,484 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:48:04,484 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:48:04,485 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:48:04,485 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:48:04,485 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:48:04,485 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:48:04,485 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:48:04,485 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:48:04,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:48:04,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:48:04,485 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:48:04,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:48:04,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:48:04,485 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:48:04,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:48:04,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:48:04,486 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:48:04,486 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:48:04,486 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:48:04,486 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 11:48:04,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:48:04,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:48:04,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:48:04,737 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:48:04,737 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:48:04,738 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix020.opt.i [2022-12-13 11:48:05,697 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:48:05,926 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:48:05,926 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix020.opt.i [2022-12-13 11:48:05,936 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd5c2ebca/67091b882d164dc8ba075c2a961e5973/FLAG4c6098214 [2022-12-13 11:48:05,949 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd5c2ebca/67091b882d164dc8ba075c2a961e5973 [2022-12-13 11:48:05,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:48:05,951 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:48:05,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:48:05,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:48:05,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:48:05,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:48:05" (1/1) ... [2022-12-13 11:48:05,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dff45cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:05, skipping insertion in model container [2022-12-13 11:48:05,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:48:05" (1/1) ... [2022-12-13 11:48:05,960 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:48:06,004 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:48:06,112 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix020.opt.i[944,957] [2022-12-13 11:48:06,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:48:06,331 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:48:06,338 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix020.opt.i[944,957] [2022-12-13 11:48:06,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:06,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:06,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:48:06,416 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:48:06,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:06 WrapperNode [2022-12-13 11:48:06,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:48:06,417 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:48:06,418 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:48:06,418 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:48:06,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:06" (1/1) ... [2022-12-13 11:48:06,453 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:06" (1/1) ... [2022-12-13 11:48:06,483 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 163 [2022-12-13 11:48:06,483 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:48:06,484 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:48:06,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:48:06,485 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:48:06,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:06" (1/1) ... [2022-12-13 11:48:06,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:06" (1/1) ... [2022-12-13 11:48:06,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:06" (1/1) ... [2022-12-13 11:48:06,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:06" (1/1) ... [2022-12-13 11:48:06,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:06" (1/1) ... [2022-12-13 11:48:06,514 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:06" (1/1) ... [2022-12-13 11:48:06,515 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:06" (1/1) ... [2022-12-13 11:48:06,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:06" (1/1) ... [2022-12-13 11:48:06,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:48:06,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:48:06,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:48:06,529 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:48:06,530 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:06" (1/1) ... [2022-12-13 11:48:06,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:48:06,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:48:06,551 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 11:48:06,584 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 11:48:06,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:48:06,597 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:48:06,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:48:06,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:48:06,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:48:06,597 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:48:06,597 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:48:06,598 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:48:06,598 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:48:06,598 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 11:48:06,598 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 11:48:06,598 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 11:48:06,598 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 11:48:06,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:48:06,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:48:06,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:48:06,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:48:06,600 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 11:48:06,760 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:48:06,762 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:48:06,994 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:48:07,151 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:48:07,151 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:48:07,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:48:07 BoogieIcfgContainer [2022-12-13 11:48:07,153 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:48:07,154 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:48:07,154 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:48:07,156 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:48:07,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:48:05" (1/3) ... [2022-12-13 11:48:07,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55137c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:48:07, skipping insertion in model container [2022-12-13 11:48:07,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:06" (2/3) ... [2022-12-13 11:48:07,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55137c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:48:07, skipping insertion in model container [2022-12-13 11:48:07,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:48:07" (3/3) ... [2022-12-13 11:48:07,158 INFO L112 eAbstractionObserver]: Analyzing ICFG mix020.opt.i [2022-12-13 11:48:07,177 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:48:07,177 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:48:07,178 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:48:07,220 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:48:07,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 276 flow [2022-12-13 11:48:07,309 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-13 11:48:07,310 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:48:07,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-13 11:48:07,315 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 128 transitions, 276 flow [2022-12-13 11:48:07,318 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 124 transitions, 260 flow [2022-12-13 11:48:07,320 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:07,339 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 124 transitions, 260 flow [2022-12-13 11:48:07,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 124 transitions, 260 flow [2022-12-13 11:48:07,375 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-13 11:48:07,375 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:48:07,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-13 11:48:07,378 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 124 transitions, 260 flow [2022-12-13 11:48:07,378 INFO L226 LiptonReduction]: Number of co-enabled transitions 2718 [2022-12-13 11:48:11,838 INFO L241 LiptonReduction]: Total number of compositions: 100 [2022-12-13 11:48:11,849 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:48:11,853 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;@68d4f9c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:48:11,853 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 11:48:11,857 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-12-13 11:48:11,857 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:48:11,858 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:11,858 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:48:11,858 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:48:11,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:11,862 INFO L85 PathProgramCache]: Analyzing trace with hash -31270810, now seen corresponding path program 1 times [2022-12-13 11:48:11,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:11,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298530136] [2022-12-13 11:48:11,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:11,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:12,172 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 11:48:12,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:12,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298530136] [2022-12-13 11:48:12,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298530136] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:12,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:12,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:48:12,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661047281] [2022-12-13 11:48:12,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:12,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:48:12,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:12,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:48:12,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:48:12,239 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 64 [2022-12-13 11:48:12,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 64 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 11:48:12,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:12,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 64 [2022-12-13 11:48:12,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:48:15,833 INFO L130 PetriNetUnfolder]: 40551/58279 cut-off events. [2022-12-13 11:48:15,834 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-13 11:48:15,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112199 conditions, 58279 events. 40551/58279 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 3498. Compared 446478 event pairs, 5311 based on Foata normal form. 0/35872 useless extension candidates. Maximal degree in co-relation 112187. Up to 46041 conditions per place. [2022-12-13 11:48:16,016 INFO L137 encePairwiseOnDemand]: 60/64 looper letters, 37 selfloop transitions, 2 changer transitions 46/98 dead transitions. [2022-12-13 11:48:16,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 98 transitions, 378 flow [2022-12-13 11:48:16,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:48:16,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:48:16,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2022-12-13 11:48:16,027 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6614583333333334 [2022-12-13 11:48:16,028 INFO L175 Difference]: Start difference. First operand has 77 places, 64 transitions, 140 flow. Second operand 3 states and 127 transitions. [2022-12-13 11:48:16,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 98 transitions, 378 flow [2022-12-13 11:48:16,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 98 transitions, 374 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 11:48:16,036 INFO L231 Difference]: Finished difference. Result has 73 places, 39 transitions, 90 flow [2022-12-13 11:48:16,037 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=73, PETRI_TRANSITIONS=39} [2022-12-13 11:48:16,041 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -4 predicate places. [2022-12-13 11:48:16,041 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:48:16,042 INFO L89 Accepts]: Start accepts. Operand has 73 places, 39 transitions, 90 flow [2022-12-13 11:48:16,045 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:48:16,045 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:16,046 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 39 transitions, 90 flow [2022-12-13 11:48:16,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 39 transitions, 90 flow [2022-12-13 11:48:16,053 INFO L130 PetriNetUnfolder]: 0/39 cut-off events. [2022-12-13 11:48:16,053 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:48:16,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 82 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 11:48:16,057 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 39 transitions, 90 flow [2022-12-13 11:48:16,057 INFO L226 LiptonReduction]: Number of co-enabled transitions 908 [2022-12-13 11:48:16,186 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:48:16,188 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 147 [2022-12-13 11:48:16,189 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 90 flow [2022-12-13 11:48:16,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 11:48:16,190 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:16,190 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:48:16,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:48:16,199 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:48:16,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:16,200 INFO L85 PathProgramCache]: Analyzing trace with hash 13624052, now seen corresponding path program 1 times [2022-12-13 11:48:16,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:16,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440145179] [2022-12-13 11:48:16,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:16,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:16,389 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 11:48:16,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:16,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440145179] [2022-12-13 11:48:16,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440145179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:16,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:16,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:48:16,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448268023] [2022-12-13 11:48:16,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:16,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:48:16,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:16,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:48:16,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:48:16,391 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2022-12-13 11:48:16,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 11:48:16,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:16,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2022-12-13 11:48:16,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:48:18,190 INFO L130 PetriNetUnfolder]: 21274/30229 cut-off events. [2022-12-13 11:48:18,191 INFO L131 PetriNetUnfolder]: For 881/881 co-relation queries the response was YES. [2022-12-13 11:48:18,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60322 conditions, 30229 events. 21274/30229 cut-off events. For 881/881 co-relation queries the response was YES. Maximal size of possible extension queue 1147. Compared 186699 event pairs, 7533 based on Foata normal form. 0/23558 useless extension candidates. Maximal degree in co-relation 60312. Up to 19721 conditions per place. [2022-12-13 11:48:18,350 INFO L137 encePairwiseOnDemand]: 31/39 looper letters, 48 selfloop transitions, 7 changer transitions 2/66 dead transitions. [2022-12-13 11:48:18,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 66 transitions, 266 flow [2022-12-13 11:48:18,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:48:18,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:48:18,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2022-12-13 11:48:18,351 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7264957264957265 [2022-12-13 11:48:18,352 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 90 flow. Second operand 3 states and 85 transitions. [2022-12-13 11:48:18,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 66 transitions, 266 flow [2022-12-13 11:48:18,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 66 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:48:18,374 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 138 flow [2022-12-13 11:48:18,374 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2022-12-13 11:48:18,375 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -25 predicate places. [2022-12-13 11:48:18,375 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:48:18,375 INFO L89 Accepts]: Start accepts. Operand has 52 places, 44 transitions, 138 flow [2022-12-13 11:48:18,376 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:48:18,377 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:18,377 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 44 transitions, 138 flow [2022-12-13 11:48:18,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 44 transitions, 138 flow [2022-12-13 11:48:18,401 INFO L130 PetriNetUnfolder]: 152/512 cut-off events. [2022-12-13 11:48:18,401 INFO L131 PetriNetUnfolder]: For 40/48 co-relation queries the response was YES. [2022-12-13 11:48:18,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 512 events. 152/512 cut-off events. For 40/48 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3644 event pairs, 72 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 871. Up to 221 conditions per place. [2022-12-13 11:48:18,406 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 44 transitions, 138 flow [2022-12-13 11:48:18,406 INFO L226 LiptonReduction]: Number of co-enabled transitions 1026 [2022-12-13 11:48:18,420 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:48:18,421 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-13 11:48:18,422 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 138 flow [2022-12-13 11:48:18,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 11:48:18,422 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:18,422 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:48:18,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:48:18,423 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:48:18,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:18,429 INFO L85 PathProgramCache]: Analyzing trace with hash 422346190, now seen corresponding path program 1 times [2022-12-13 11:48:18,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:18,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601028373] [2022-12-13 11:48:18,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:18,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:18,590 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 11:48:18,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:18,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601028373] [2022-12-13 11:48:18,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601028373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:18,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:18,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:48:18,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715582438] [2022-12-13 11:48:18,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:18,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:48:18,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:18,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:48:18,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:48:18,592 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2022-12-13 11:48:18,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 11:48:18,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:18,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2022-12-13 11:48:18,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:48:19,941 INFO L130 PetriNetUnfolder]: 15746/22492 cut-off events. [2022-12-13 11:48:19,941 INFO L131 PetriNetUnfolder]: For 7614/7614 co-relation queries the response was YES. [2022-12-13 11:48:19,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52907 conditions, 22492 events. 15746/22492 cut-off events. For 7614/7614 co-relation queries the response was YES. Maximal size of possible extension queue 846. Compared 131491 event pairs, 3991 based on Foata normal form. 230/18264 useless extension candidates. Maximal degree in co-relation 52895. Up to 11158 conditions per place. [2022-12-13 11:48:20,053 INFO L137 encePairwiseOnDemand]: 30/38 looper letters, 56 selfloop transitions, 8 changer transitions 0/73 dead transitions. [2022-12-13 11:48:20,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 73 transitions, 346 flow [2022-12-13 11:48:20,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:48:20,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:48:20,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2022-12-13 11:48:20,054 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.631578947368421 [2022-12-13 11:48:20,054 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 138 flow. Second operand 4 states and 96 transitions. [2022-12-13 11:48:20,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 73 transitions, 346 flow [2022-12-13 11:48:20,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 73 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:48:20,083 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 182 flow [2022-12-13 11:48:20,083 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2022-12-13 11:48:20,084 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -22 predicate places. [2022-12-13 11:48:20,084 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:48:20,084 INFO L89 Accepts]: Start accepts. Operand has 55 places, 48 transitions, 182 flow [2022-12-13 11:48:20,085 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:48:20,085 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:20,085 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 48 transitions, 182 flow [2022-12-13 11:48:20,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 48 transitions, 182 flow [2022-12-13 11:48:20,103 INFO L130 PetriNetUnfolder]: 122/402 cut-off events. [2022-12-13 11:48:20,103 INFO L131 PetriNetUnfolder]: For 145/174 co-relation queries the response was YES. [2022-12-13 11:48:20,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 402 events. 122/402 cut-off events. For 145/174 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2576 event pairs, 41 based on Foata normal form. 0/282 useless extension candidates. Maximal degree in co-relation 816. Up to 181 conditions per place. [2022-12-13 11:48:20,107 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 48 transitions, 182 flow [2022-12-13 11:48:20,107 INFO L226 LiptonReduction]: Number of co-enabled transitions 1110 [2022-12-13 11:48:20,109 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:48:20,109 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 11:48:20,109 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 182 flow [2022-12-13 11:48:20,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 11:48:20,110 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:20,110 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:48:20,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:48:20,110 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:48:20,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:20,110 INFO L85 PathProgramCache]: Analyzing trace with hash 127816821, now seen corresponding path program 1 times [2022-12-13 11:48:20,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:20,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298278969] [2022-12-13 11:48:20,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:20,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:20,213 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 11:48:20,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:20,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298278969] [2022-12-13 11:48:20,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298278969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:20,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:20,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:48:20,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014245095] [2022-12-13 11:48:20,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:20,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:48:20,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:20,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:48:20,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:48:20,217 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2022-12-13 11:48:20,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 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 11:48:20,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:20,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2022-12-13 11:48:20,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:48:21,416 INFO L130 PetriNetUnfolder]: 15396/22228 cut-off events. [2022-12-13 11:48:21,416 INFO L131 PetriNetUnfolder]: For 12737/12737 co-relation queries the response was YES. [2022-12-13 11:48:21,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54863 conditions, 22228 events. 15396/22228 cut-off events. For 12737/12737 co-relation queries the response was YES. Maximal size of possible extension queue 841. Compared 135644 event pairs, 2374 based on Foata normal form. 50/17895 useless extension candidates. Maximal degree in co-relation 54848. Up to 13760 conditions per place. [2022-12-13 11:48:21,539 INFO L137 encePairwiseOnDemand]: 30/38 looper letters, 63 selfloop transitions, 16 changer transitions 0/88 dead transitions. [2022-12-13 11:48:21,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 88 transitions, 464 flow [2022-12-13 11:48:21,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:48:21,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:48:21,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-12-13 11:48:21,541 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7039473684210527 [2022-12-13 11:48:21,541 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 182 flow. Second operand 4 states and 107 transitions. [2022-12-13 11:48:21,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 88 transitions, 464 flow [2022-12-13 11:48:21,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 88 transitions, 459 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:48:21,586 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 275 flow [2022-12-13 11:48:21,586 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=275, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2022-12-13 11:48:21,587 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -18 predicate places. [2022-12-13 11:48:21,587 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:48:21,587 INFO L89 Accepts]: Start accepts. Operand has 59 places, 54 transitions, 275 flow [2022-12-13 11:48:21,591 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:48:21,591 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:21,591 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 54 transitions, 275 flow [2022-12-13 11:48:21,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 54 transitions, 275 flow [2022-12-13 11:48:21,611 INFO L130 PetriNetUnfolder]: 106/360 cut-off events. [2022-12-13 11:48:21,611 INFO L131 PetriNetUnfolder]: For 305/364 co-relation queries the response was YES. [2022-12-13 11:48:21,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 902 conditions, 360 events. 106/360 cut-off events. For 305/364 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2234 event pairs, 32 based on Foata normal form. 1/254 useless extension candidates. Maximal degree in co-relation 887. Up to 161 conditions per place. [2022-12-13 11:48:21,615 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 54 transitions, 275 flow [2022-12-13 11:48:21,615 INFO L226 LiptonReduction]: Number of co-enabled transitions 1236 [2022-12-13 11:48:21,616 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:48:21,617 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-13 11:48:21,617 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 275 flow [2022-12-13 11:48:21,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 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 11:48:21,617 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:21,617 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:48:21,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:48:21,618 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:48:21,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:21,618 INFO L85 PathProgramCache]: Analyzing trace with hash -332560637, now seen corresponding path program 1 times [2022-12-13 11:48:21,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:21,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676313601] [2022-12-13 11:48:21,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:21,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:21,728 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 11:48:21,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:21,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676313601] [2022-12-13 11:48:21,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676313601] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:21,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:21,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:48:21,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617473360] [2022-12-13 11:48:21,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:21,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:48:21,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:21,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:48:21,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:48:21,729 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2022-12-13 11:48:21,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 11:48:21,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:21,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2022-12-13 11:48:21,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:48:24,103 INFO L130 PetriNetUnfolder]: 25644/35525 cut-off events. [2022-12-13 11:48:24,103 INFO L131 PetriNetUnfolder]: For 26455/27275 co-relation queries the response was YES. [2022-12-13 11:48:24,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89707 conditions, 35525 events. 25644/35525 cut-off events. For 26455/27275 co-relation queries the response was YES. Maximal size of possible extension queue 1835. Compared 223593 event pairs, 8864 based on Foata normal form. 557/22984 useless extension candidates. Maximal degree in co-relation 89689. Up to 34372 conditions per place. [2022-12-13 11:48:24,372 INFO L137 encePairwiseOnDemand]: 24/38 looper letters, 56 selfloop transitions, 13 changer transitions 0/85 dead transitions. [2022-12-13 11:48:24,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 85 transitions, 537 flow [2022-12-13 11:48:24,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:48:24,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:48:24,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2022-12-13 11:48:24,374 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7017543859649122 [2022-12-13 11:48:24,374 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 275 flow. Second operand 3 states and 80 transitions. [2022-12-13 11:48:24,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 85 transitions, 537 flow [2022-12-13 11:48:24,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 85 transitions, 537 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 11:48:24,422 INFO L231 Difference]: Finished difference. Result has 62 places, 66 transitions, 364 flow [2022-12-13 11:48:24,423 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=364, PETRI_PLACES=62, PETRI_TRANSITIONS=66} [2022-12-13 11:48:24,423 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -15 predicate places. [2022-12-13 11:48:24,423 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:48:24,423 INFO L89 Accepts]: Start accepts. Operand has 62 places, 66 transitions, 364 flow [2022-12-13 11:48:24,424 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:48:24,424 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:24,424 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 66 transitions, 364 flow [2022-12-13 11:48:24,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 66 transitions, 364 flow [2022-12-13 11:48:25,092 INFO L130 PetriNetUnfolder]: 6224/10639 cut-off events. [2022-12-13 11:48:25,092 INFO L131 PetriNetUnfolder]: For 2818/2916 co-relation queries the response was YES. [2022-12-13 11:48:25,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22474 conditions, 10639 events. 6224/10639 cut-off events. For 2818/2916 co-relation queries the response was YES. Maximal size of possible extension queue 1296. Compared 91529 event pairs, 3448 based on Foata normal form. 18/5359 useless extension candidates. Maximal degree in co-relation 22456. Up to 8395 conditions per place. [2022-12-13 11:48:25,162 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 66 transitions, 364 flow [2022-12-13 11:48:25,162 INFO L226 LiptonReduction]: Number of co-enabled transitions 1586 [2022-12-13 11:48:25,247 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:48:25,249 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 826 [2022-12-13 11:48:25,249 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 66 transitions, 364 flow [2022-12-13 11:48:25,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 11:48:25,249 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:25,249 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:48:25,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:48:25,249 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:48:25,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:25,250 INFO L85 PathProgramCache]: Analyzing trace with hash -2021197630, now seen corresponding path program 1 times [2022-12-13 11:48:25,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:25,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131353388] [2022-12-13 11:48:25,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:25,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:25,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:48:25,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:25,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131353388] [2022-12-13 11:48:25,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131353388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:25,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:25,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:48:25,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057033851] [2022-12-13 11:48:25,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:25,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:48:25,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:25,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:48:25,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:48:25,385 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2022-12-13 11:48:25,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 66 transitions, 364 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 11:48:25,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:25,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2022-12-13 11:48:25,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:48:28,431 INFO L130 PetriNetUnfolder]: 34230/48130 cut-off events. [2022-12-13 11:48:28,432 INFO L131 PetriNetUnfolder]: For 45394/46690 co-relation queries the response was YES. [2022-12-13 11:48:28,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146337 conditions, 48130 events. 34230/48130 cut-off events. For 45394/46690 co-relation queries the response was YES. Maximal size of possible extension queue 2167. Compared 316511 event pairs, 10178 based on Foata normal form. 867/37699 useless extension candidates. Maximal degree in co-relation 146316. Up to 29993 conditions per place. [2022-12-13 11:48:28,679 INFO L137 encePairwiseOnDemand]: 32/38 looper letters, 79 selfloop transitions, 12 changer transitions 0/104 dead transitions. [2022-12-13 11:48:28,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 104 transitions, 685 flow [2022-12-13 11:48:28,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:48:28,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:48:28,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2022-12-13 11:48:28,680 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6644736842105263 [2022-12-13 11:48:28,680 INFO L175 Difference]: Start difference. First operand has 62 places, 66 transitions, 364 flow. Second operand 4 states and 101 transitions. [2022-12-13 11:48:28,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 104 transitions, 685 flow [2022-12-13 11:48:28,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 104 transitions, 664 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:48:28,770 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 385 flow [2022-12-13 11:48:28,770 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=385, PETRI_PLACES=65, PETRI_TRANSITIONS=66} [2022-12-13 11:48:28,770 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -12 predicate places. [2022-12-13 11:48:28,770 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:48:28,771 INFO L89 Accepts]: Start accepts. Operand has 65 places, 66 transitions, 385 flow [2022-12-13 11:48:28,771 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:48:28,771 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:28,771 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 66 transitions, 385 flow [2022-12-13 11:48:28,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 66 transitions, 385 flow [2022-12-13 11:48:29,450 INFO L130 PetriNetUnfolder]: 8384/14197 cut-off events. [2022-12-13 11:48:29,451 INFO L131 PetriNetUnfolder]: For 4955/5053 co-relation queries the response was YES. [2022-12-13 11:48:29,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29535 conditions, 14197 events. 8384/14197 cut-off events. For 4955/5053 co-relation queries the response was YES. Maximal size of possible extension queue 1887. Compared 125967 event pairs, 4769 based on Foata normal form. 24/6666 useless extension candidates. Maximal degree in co-relation 29515. Up to 11704 conditions per place. [2022-12-13 11:48:29,540 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 66 transitions, 385 flow [2022-12-13 11:48:29,540 INFO L226 LiptonReduction]: Number of co-enabled transitions 1584 [2022-12-13 11:48:29,739 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:48:29,740 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 970 [2022-12-13 11:48:29,740 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 385 flow [2022-12-13 11:48:29,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 11:48:29,740 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:29,740 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:48:29,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:48:29,740 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:48:29,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:29,741 INFO L85 PathProgramCache]: Analyzing trace with hash -2013818106, now seen corresponding path program 1 times [2022-12-13 11:48:29,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:29,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262289497] [2022-12-13 11:48:29,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:29,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:29,871 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 11:48:29,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:29,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262289497] [2022-12-13 11:48:29,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262289497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:29,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:29,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:48:29,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213598911] [2022-12-13 11:48:29,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:29,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:48:29,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:29,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:48:29,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:48:29,874 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2022-12-13 11:48:29,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 385 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 11:48:29,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:29,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2022-12-13 11:48:29,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:48:31,997 INFO L130 PetriNetUnfolder]: 23816/34755 cut-off events. [2022-12-13 11:48:31,998 INFO L131 PetriNetUnfolder]: For 29207/30258 co-relation queries the response was YES. [2022-12-13 11:48:32,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108500 conditions, 34755 events. 23816/34755 cut-off events. For 29207/30258 co-relation queries the response was YES. Maximal size of possible extension queue 1944. Compared 240378 event pairs, 4126 based on Foata normal form. 892/22676 useless extension candidates. Maximal degree in co-relation 108477. Up to 31159 conditions per place. [2022-12-13 11:48:32,146 INFO L137 encePairwiseOnDemand]: 24/38 looper letters, 68 selfloop transitions, 25 changer transitions 5/114 dead transitions. [2022-12-13 11:48:32,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 114 transitions, 841 flow [2022-12-13 11:48:32,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:48:32,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:48:32,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-12-13 11:48:32,147 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7302631578947368 [2022-12-13 11:48:32,147 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 385 flow. Second operand 4 states and 111 transitions. [2022-12-13 11:48:32,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 114 transitions, 841 flow [2022-12-13 11:48:32,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 114 transitions, 776 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-13 11:48:32,175 INFO L231 Difference]: Finished difference. Result has 67 places, 77 transitions, 485 flow [2022-12-13 11:48:32,175 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=485, PETRI_PLACES=67, PETRI_TRANSITIONS=77} [2022-12-13 11:48:32,176 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -10 predicate places. [2022-12-13 11:48:32,176 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:48:32,176 INFO L89 Accepts]: Start accepts. Operand has 67 places, 77 transitions, 485 flow [2022-12-13 11:48:32,177 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:48:32,177 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:32,177 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 77 transitions, 485 flow [2022-12-13 11:48:32,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 77 transitions, 485 flow [2022-12-13 11:48:32,776 INFO L130 PetriNetUnfolder]: 6491/11655 cut-off events. [2022-12-13 11:48:32,776 INFO L131 PetriNetUnfolder]: For 4754/26011 co-relation queries the response was YES. [2022-12-13 11:48:32,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34535 conditions, 11655 events. 6491/11655 cut-off events. For 4754/26011 co-relation queries the response was YES. Maximal size of possible extension queue 1683. Compared 105992 event pairs, 1878 based on Foata normal form. 32/5723 useless extension candidates. Maximal degree in co-relation 34514. Up to 9454 conditions per place. [2022-12-13 11:48:32,853 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 77 transitions, 485 flow [2022-12-13 11:48:32,853 INFO L226 LiptonReduction]: Number of co-enabled transitions 1940 [2022-12-13 11:48:32,928 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:48:32,929 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 753 [2022-12-13 11:48:32,929 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 77 transitions, 485 flow [2022-12-13 11:48:32,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 11:48:32,929 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:32,930 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:48:32,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:48:32,930 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:48:32,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:32,930 INFO L85 PathProgramCache]: Analyzing trace with hash -635999058, now seen corresponding path program 1 times [2022-12-13 11:48:32,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:32,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618181077] [2022-12-13 11:48:32,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:32,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:33,060 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 11:48:33,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:33,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618181077] [2022-12-13 11:48:33,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618181077] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:33,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:33,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:48:33,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029249412] [2022-12-13 11:48:33,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:33,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:48:33,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:33,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:48:33,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:48:33,062 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2022-12-13 11:48:33,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 77 transitions, 485 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 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 11:48:33,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:33,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2022-12-13 11:48:33,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:48:34,380 INFO L130 PetriNetUnfolder]: 12777/19982 cut-off events. [2022-12-13 11:48:34,381 INFO L131 PetriNetUnfolder]: For 14082/16027 co-relation queries the response was YES. [2022-12-13 11:48:34,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76978 conditions, 19982 events. 12777/19982 cut-off events. For 14082/16027 co-relation queries the response was YES. Maximal size of possible extension queue 1116. Compared 145221 event pairs, 807 based on Foata normal form. 1482/13782 useless extension candidates. Maximal degree in co-relation 76954. Up to 12283 conditions per place. [2022-12-13 11:48:34,474 INFO L137 encePairwiseOnDemand]: 24/38 looper letters, 77 selfloop transitions, 37 changer transitions 5/135 dead transitions. [2022-12-13 11:48:34,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 135 transitions, 1030 flow [2022-12-13 11:48:34,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:48:34,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:48:34,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2022-12-13 11:48:34,476 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7368421052631579 [2022-12-13 11:48:34,476 INFO L175 Difference]: Start difference. First operand has 67 places, 77 transitions, 485 flow. Second operand 5 states and 140 transitions. [2022-12-13 11:48:34,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 135 transitions, 1030 flow [2022-12-13 11:48:34,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 135 transitions, 970 flow, removed 13 selfloop flow, removed 3 redundant places. [2022-12-13 11:48:34,505 INFO L231 Difference]: Finished difference. Result has 69 places, 88 transitions, 614 flow [2022-12-13 11:48:34,505 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=614, PETRI_PLACES=69, PETRI_TRANSITIONS=88} [2022-12-13 11:48:34,505 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -8 predicate places. [2022-12-13 11:48:34,505 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:48:34,505 INFO L89 Accepts]: Start accepts. Operand has 69 places, 88 transitions, 614 flow [2022-12-13 11:48:34,506 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:48:34,506 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:34,506 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 88 transitions, 614 flow [2022-12-13 11:48:34,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 88 transitions, 614 flow [2022-12-13 11:48:34,928 INFO L130 PetriNetUnfolder]: 3679/7367 cut-off events. [2022-12-13 11:48:34,928 INFO L131 PetriNetUnfolder]: For 3746/20782 co-relation queries the response was YES. [2022-12-13 11:48:34,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27603 conditions, 7367 events. 3679/7367 cut-off events. For 3746/20782 co-relation queries the response was YES. Maximal size of possible extension queue 1071. Compared 68409 event pairs, 393 based on Foata normal form. 35/3632 useless extension candidates. Maximal degree in co-relation 27582. Up to 5860 conditions per place. [2022-12-13 11:48:34,999 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 88 transitions, 614 flow [2022-12-13 11:48:35,000 INFO L226 LiptonReduction]: Number of co-enabled transitions 1878 [2022-12-13 11:48:35,054 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:48:35,055 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 550 [2022-12-13 11:48:35,055 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 88 transitions, 614 flow [2022-12-13 11:48:35,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 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 11:48:35,055 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:35,055 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] [2022-12-13 11:48:35,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:48:35,056 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:48:35,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:35,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1606613065, now seen corresponding path program 1 times [2022-12-13 11:48:35,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:35,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803031940] [2022-12-13 11:48:35,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:35,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:35,494 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 11:48:35,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:35,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803031940] [2022-12-13 11:48:35,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803031940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:35,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:35,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:48:35,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373750238] [2022-12-13 11:48:35,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:35,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:48:35,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:35,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:48:35,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:48:35,496 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2022-12-13 11:48:35,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 88 transitions, 614 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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 11:48:35,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:35,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2022-12-13 11:48:35,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:48:37,180 INFO L130 PetriNetUnfolder]: 15153/24148 cut-off events. [2022-12-13 11:48:37,180 INFO L131 PetriNetUnfolder]: For 45135/51257 co-relation queries the response was YES. [2022-12-13 11:48:37,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102480 conditions, 24148 events. 15153/24148 cut-off events. For 45135/51257 co-relation queries the response was YES. Maximal size of possible extension queue 1260. Compared 180606 event pairs, 1009 based on Foata normal form. 1613/20743 useless extension candidates. Maximal degree in co-relation 102456. Up to 13238 conditions per place. [2022-12-13 11:48:37,306 INFO L137 encePairwiseOnDemand]: 27/38 looper letters, 202 selfloop transitions, 39 changer transitions 16/278 dead transitions. [2022-12-13 11:48:37,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 278 transitions, 2417 flow [2022-12-13 11:48:37,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 11:48:37,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 11:48:37,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 213 transitions. [2022-12-13 11:48:37,307 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6228070175438597 [2022-12-13 11:48:37,307 INFO L175 Difference]: Start difference. First operand has 69 places, 88 transitions, 614 flow. Second operand 9 states and 213 transitions. [2022-12-13 11:48:37,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 278 transitions, 2417 flow [2022-12-13 11:48:37,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 278 transitions, 2051 flow, removed 88 selfloop flow, removed 3 redundant places. [2022-12-13 11:48:37,588 INFO L231 Difference]: Finished difference. Result has 81 places, 117 transitions, 886 flow [2022-12-13 11:48:37,588 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=886, PETRI_PLACES=81, PETRI_TRANSITIONS=117} [2022-12-13 11:48:37,588 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, 4 predicate places. [2022-12-13 11:48:37,588 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:48:37,588 INFO L89 Accepts]: Start accepts. Operand has 81 places, 117 transitions, 886 flow [2022-12-13 11:48:37,589 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:48:37,589 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:37,590 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 117 transitions, 886 flow [2022-12-13 11:48:37,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 117 transitions, 886 flow [2022-12-13 11:48:38,162 INFO L130 PetriNetUnfolder]: 4774/9705 cut-off events. [2022-12-13 11:48:38,163 INFO L131 PetriNetUnfolder]: For 8657/12904 co-relation queries the response was YES. [2022-12-13 11:48:38,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30327 conditions, 9705 events. 4774/9705 cut-off events. For 8657/12904 co-relation queries the response was YES. Maximal size of possible extension queue 1308. Compared 93474 event pairs, 419 based on Foata normal form. 57/4968 useless extension candidates. Maximal degree in co-relation 30299. Up to 5752 conditions per place. [2022-12-13 11:48:38,255 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 117 transitions, 886 flow [2022-12-13 11:48:38,256 INFO L226 LiptonReduction]: Number of co-enabled transitions 2714 [2022-12-13 11:48:38,577 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [450] $Ultimate##0-->L821: Formula: (and (= v_~z$r_buff0_thd4~0_99 v_~z$r_buff1_thd4~0_85) (= v_~z$w_buff0_used~0_178 v_~z$w_buff1_used~0_162) (= v_~z$r_buff0_thd0~0_37 v_~z$r_buff1_thd0~0_35) (= v_~z$r_buff0_thd3~0_55 v_~z$r_buff1_thd3~0_53) (= v_~z$r_buff0_thd4~0_98 1) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~z$w_buff1_used~0_162 256) 0)) (not (= (mod v_~z$w_buff0_used~0_177 256) 0)))) 1 0)) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_17) (= v_~z$w_buff0_used~0_177 1) (= |v_P3Thread1of1ForFork1_~arg#1.offset_7| |v_P3Thread1of1ForFork1_#in~arg#1.offset_7|) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|) (= v_~z$r_buff0_thd1~0_13 v_~z$r_buff1_thd1~0_15) (= v_~z$w_buff0~0_107 v_~z$w_buff1~0_111) (= |v_P3Thread1of1ForFork1_~arg#1.base_7| |v_P3Thread1of1ForFork1_#in~arg#1.base_7|) (not (= |v_P3Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| 0)) (= v_~z$w_buff0~0_106 1)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_37, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_178, ~z$w_buff0~0=v_~z$w_buff0~0_107, P3Thread1of1ForFork1_#in~arg#1.offset=|v_P3Thread1of1ForFork1_#in~arg#1.offset_7|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_99, P3Thread1of1ForFork1_#in~arg#1.base=|v_P3Thread1of1ForFork1_#in~arg#1.base_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_55, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_13, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_85, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_177, ~z$w_buff0~0=v_~z$w_buff0~0_106, P3Thread1of1ForFork1_#in~arg#1.offset=|v_P3Thread1of1ForFork1_#in~arg#1.offset_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_53, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_162, ~z$w_buff1~0=v_~z$w_buff1~0_111, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|, P3Thread1of1ForFork1_~arg#1.base=|v_P3Thread1of1ForFork1_~arg#1.base_7|, P3Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|, P3Thread1of1ForFork1_~arg#1.offset=|v_P3Thread1of1ForFork1_~arg#1.offset_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_35, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_98, P3Thread1of1ForFork1_#in~arg#1.base=|v_P3Thread1of1ForFork1_#in~arg#1.base_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_55, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_13, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, P3Thread1of1ForFork1_~arg#1.base, P3Thread1of1ForFork1___VERIFIER_assert_~expression#1, P3Thread1of1ForFork1_~arg#1.offset, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0] and [390] L783-->L799: Formula: (let ((.cse8 (= (mod v_~z$r_buff1_thd3~0_40 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_42 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and .cse8 .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_112 256) 0)) (.cse4 (and (= (mod v_~z$w_buff1_used~0_105 256) 0) .cse9))) (let ((.cse0 (or .cse3 .cse11 .cse4)) (.cse1 (and (not .cse11) .cse10)) (.cse2 (not (= (mod v_~weak$$choice2~0_58 256) 0))) (.cse6 (= 0 (mod v_~z$w_buff1_used~0_104 256))) (.cse5 (= (mod v_~z$w_buff0_used~0_111 256) 0))) (and (= (ite .cse0 v_~z~0_75 (ite .cse1 v_~z$w_buff0~0_45 v_~z$w_buff1~0_58)) v_~__unbuffered_p2_EAX~0_10) (= v_~z$w_buff1~0_58 v_~z$w_buff1~0_57) (= v_~z$w_buff0_used~0_111 (ite .cse2 v_~z$w_buff0_used~0_112 (ite .cse0 v_~z$w_buff0_used~0_112 (ite .cse1 0 v_~z$w_buff0_used~0_112)))) (= v_~z~0_74 (ite .cse2 v_~z$mem_tmp~0_26 v_~__unbuffered_p2_EAX~0_10)) (= v_~z$w_buff1_used~0_104 (ite .cse2 v_~z$w_buff1_used~0_105 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff1_used~0_105 0))) (= v_~z$w_buff0~0_45 v_~z$w_buff0~0_44) (= v_~z$flush_delayed~0_36 0) (= (ite .cse2 v_~z$r_buff1_thd3~0_40 (ite (let ((.cse7 (= (mod v_~z$r_buff0_thd3~0_41 256) 0))) (or (and .cse6 .cse7) (and .cse8 .cse7) .cse5)) v_~z$r_buff1_thd3~0_40 0)) v_~z$r_buff1_thd3~0_39) (= v_~z$r_buff0_thd3~0_41 (ite .cse2 v_~z$r_buff0_thd3~0_42 (ite (or .cse3 (and .cse6 .cse9) .cse5) v_~z$r_buff0_thd3~0_42 (ite (and .cse10 (not .cse5)) 0 v_~z$r_buff0_thd3~0_42)))) (= |v_P2Thread1of1ForFork3_#t~nondet4_1| v_~weak$$choice2~0_58) (= v_~z$mem_tmp~0_26 v_~z~0_75) (= |v_P2Thread1of1ForFork3_#t~nondet3_1| v_~weak$$choice0~0_8))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_112, ~z$w_buff0~0=v_~z$w_buff0~0_45, P2Thread1of1ForFork3_#t~nondet4=|v_P2Thread1of1ForFork3_#t~nondet4_1|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_40, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_105, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$w_buff1~0=v_~z$w_buff1~0_58, P2Thread1of1ForFork3_#t~nondet3=|v_P2Thread1of1ForFork3_#t~nondet3_1|, ~z~0=v_~z~0_75} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_26, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_111, ~z$w_buff0~0=v_~z$w_buff0~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_104, ~z$w_buff1~0=v_~z$w_buff1~0_57, ~z$flush_delayed~0=v_~z$flush_delayed~0_36, ~weak$$choice0~0=v_~weak$$choice0~0_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_41, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_74, ~weak$$choice2~0=v_~weak$$choice2~0_58} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork3_#t~nondet4, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork3_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0] [2022-12-13 11:48:39,332 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:48:39,333 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1745 [2022-12-13 11:48:39,333 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 115 transitions, 880 flow [2022-12-13 11:48:39,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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 11:48:39,333 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:39,334 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] [2022-12-13 11:48:39,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:48:39,334 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:48:39,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:39,334 INFO L85 PathProgramCache]: Analyzing trace with hash -445102687, now seen corresponding path program 2 times [2022-12-13 11:48:39,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:39,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379083591] [2022-12-13 11:48:39,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:39,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:39,471 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 11:48:39,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:39,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379083591] [2022-12-13 11:48:39,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379083591] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:39,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:39,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:48:39,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022568162] [2022-12-13 11:48:39,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:39,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:48:39,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:39,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:48:39,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:48:39,472 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2022-12-13 11:48:39,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 115 transitions, 880 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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 11:48:39,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:39,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2022-12-13 11:48:39,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:48:40,835 INFO L130 PetriNetUnfolder]: 11105/16937 cut-off events. [2022-12-13 11:48:40,835 INFO L131 PetriNetUnfolder]: For 31802/33941 co-relation queries the response was YES. [2022-12-13 11:48:40,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66335 conditions, 16937 events. 11105/16937 cut-off events. For 31802/33941 co-relation queries the response was YES. Maximal size of possible extension queue 1073. Compared 117082 event pairs, 182 based on Foata normal form. 1507/11079 useless extension candidates. Maximal degree in co-relation 66304. Up to 6516 conditions per place. [2022-12-13 11:48:40,935 INFO L137 encePairwiseOnDemand]: 27/41 looper letters, 95 selfloop transitions, 49 changer transitions 19/185 dead transitions. [2022-12-13 11:48:40,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 185 transitions, 1762 flow [2022-12-13 11:48:40,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:48:40,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:48:40,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2022-12-13 11:48:40,936 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6463414634146342 [2022-12-13 11:48:40,936 INFO L175 Difference]: Start difference. First operand has 80 places, 115 transitions, 880 flow. Second operand 6 states and 159 transitions. [2022-12-13 11:48:40,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 185 transitions, 1762 flow [2022-12-13 11:48:41,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 185 transitions, 1724 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-13 11:48:41,647 INFO L231 Difference]: Finished difference. Result has 85 places, 105 transitions, 864 flow [2022-12-13 11:48:41,647 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=864, PETRI_PLACES=85, PETRI_TRANSITIONS=105} [2022-12-13 11:48:41,648 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, 8 predicate places. [2022-12-13 11:48:41,648 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:48:41,648 INFO L89 Accepts]: Start accepts. Operand has 85 places, 105 transitions, 864 flow [2022-12-13 11:48:41,649 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:48:41,649 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:41,649 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 105 transitions, 864 flow [2022-12-13 11:48:41,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 105 transitions, 864 flow [2022-12-13 11:48:41,740 INFO L130 PetriNetUnfolder]: 1165/2220 cut-off events. [2022-12-13 11:48:41,740 INFO L131 PetriNetUnfolder]: For 1758/2742 co-relation queries the response was YES. [2022-12-13 11:48:41,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8509 conditions, 2220 events. 1165/2220 cut-off events. For 1758/2742 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 15205 event pairs, 4 based on Foata normal form. 2/852 useless extension candidates. Maximal degree in co-relation 8479. Up to 1297 conditions per place. [2022-12-13 11:48:41,758 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 105 transitions, 864 flow [2022-12-13 11:48:41,759 INFO L226 LiptonReduction]: Number of co-enabled transitions 1916 [2022-12-13 11:48:42,109 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:48:42,110 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 462 [2022-12-13 11:48:42,110 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 103 transitions, 860 flow [2022-12-13 11:48:42,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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 11:48:42,110 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:42,110 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] [2022-12-13 11:48:42,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:48:42,110 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:48:42,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:42,111 INFO L85 PathProgramCache]: Analyzing trace with hash 696329687, now seen corresponding path program 1 times [2022-12-13 11:48:42,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:42,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768650389] [2022-12-13 11:48:42,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:42,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:42,237 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 11:48:42,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:42,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768650389] [2022-12-13 11:48:42,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768650389] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:42,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:42,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:48:42,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231834066] [2022-12-13 11:48:42,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:42,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:48:42,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:42,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:48:42,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:48:42,239 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2022-12-13 11:48:42,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 103 transitions, 860 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 11:48:42,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:42,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2022-12-13 11:48:42,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:48:42,972 INFO L130 PetriNetUnfolder]: 5445/8363 cut-off events. [2022-12-13 11:48:42,972 INFO L131 PetriNetUnfolder]: For 25925/27257 co-relation queries the response was YES. [2022-12-13 11:48:42,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38669 conditions, 8363 events. 5445/8363 cut-off events. For 25925/27257 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 51611 event pairs, 471 based on Foata normal form. 523/6708 useless extension candidates. Maximal degree in co-relation 38636. Up to 4360 conditions per place. [2022-12-13 11:48:43,011 INFO L137 encePairwiseOnDemand]: 36/39 looper letters, 103 selfloop transitions, 3 changer transitions 43/180 dead transitions. [2022-12-13 11:48:43,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 180 transitions, 1759 flow [2022-12-13 11:48:43,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:48:43,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:48:43,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2022-12-13 11:48:43,013 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 11:48:43,013 INFO L175 Difference]: Start difference. First operand has 83 places, 103 transitions, 860 flow. Second operand 4 states and 104 transitions. [2022-12-13 11:48:43,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 180 transitions, 1759 flow [2022-12-13 11:48:43,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 180 transitions, 1449 flow, removed 67 selfloop flow, removed 7 redundant places. [2022-12-13 11:48:43,332 INFO L231 Difference]: Finished difference. Result has 81 places, 92 transitions, 598 flow [2022-12-13 11:48:43,332 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=598, PETRI_PLACES=81, PETRI_TRANSITIONS=92} [2022-12-13 11:48:43,332 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, 4 predicate places. [2022-12-13 11:48:43,332 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:48:43,332 INFO L89 Accepts]: Start accepts. Operand has 81 places, 92 transitions, 598 flow [2022-12-13 11:48:43,333 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:48:43,333 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:43,333 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 92 transitions, 598 flow [2022-12-13 11:48:43,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 92 transitions, 598 flow [2022-12-13 11:48:43,454 INFO L130 PetriNetUnfolder]: 1857/3184 cut-off events. [2022-12-13 11:48:43,454 INFO L131 PetriNetUnfolder]: For 4500/4795 co-relation queries the response was YES. [2022-12-13 11:48:43,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9524 conditions, 3184 events. 1857/3184 cut-off events. For 4500/4795 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 21830 event pairs, 14 based on Foata normal form. 16/1093 useless extension candidates. Maximal degree in co-relation 9496. Up to 1459 conditions per place. [2022-12-13 11:48:43,480 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 92 transitions, 598 flow [2022-12-13 11:48:43,480 INFO L226 LiptonReduction]: Number of co-enabled transitions 1490 [2022-12-13 11:48:43,569 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:48:43,570 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 238 [2022-12-13 11:48:43,570 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 92 transitions, 613 flow [2022-12-13 11:48:43,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 11:48:43,571 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:43,571 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 11:48:43,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:48:43,571 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:48:43,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:43,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1846572249, now seen corresponding path program 1 times [2022-12-13 11:48:43,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:43,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657907655] [2022-12-13 11:48:43,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:43,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:43,700 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 11:48:43,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:43,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657907655] [2022-12-13 11:48:43,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657907655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:43,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:43,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:48:43,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156212786] [2022-12-13 11:48:43,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:43,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:48:43,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:43,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:48:43,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:48:43,703 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2022-12-13 11:48:43,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 92 transitions, 613 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 11:48:43,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:43,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2022-12-13 11:48:43,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:48:44,422 INFO L130 PetriNetUnfolder]: 7302/11082 cut-off events. [2022-12-13 11:48:44,422 INFO L131 PetriNetUnfolder]: For 25628/26271 co-relation queries the response was YES. [2022-12-13 11:48:44,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42462 conditions, 11082 events. 7302/11082 cut-off events. For 25628/26271 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 69749 event pairs, 449 based on Foata normal form. 444/8511 useless extension candidates. Maximal degree in co-relation 42431. Up to 4852 conditions per place. [2022-12-13 11:48:44,471 INFO L137 encePairwiseOnDemand]: 29/41 looper letters, 90 selfloop transitions, 15 changer transitions 35/161 dead transitions. [2022-12-13 11:48:44,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 161 transitions, 1281 flow [2022-12-13 11:48:44,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:48:44,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:48:44,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2022-12-13 11:48:44,472 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5902439024390244 [2022-12-13 11:48:44,472 INFO L175 Difference]: Start difference. First operand has 81 places, 92 transitions, 613 flow. Second operand 5 states and 121 transitions. [2022-12-13 11:48:44,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 161 transitions, 1281 flow [2022-12-13 11:48:45,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 161 transitions, 1236 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-13 11:48:45,051 INFO L231 Difference]: Finished difference. Result has 85 places, 89 transitions, 603 flow [2022-12-13 11:48:45,051 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=603, PETRI_PLACES=85, PETRI_TRANSITIONS=89} [2022-12-13 11:48:45,051 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, 8 predicate places. [2022-12-13 11:48:45,051 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:48:45,051 INFO L89 Accepts]: Start accepts. Operand has 85 places, 89 transitions, 603 flow [2022-12-13 11:48:45,052 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:48:45,052 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:45,052 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 89 transitions, 603 flow [2022-12-13 11:48:45,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 89 transitions, 603 flow [2022-12-13 11:48:45,149 INFO L130 PetriNetUnfolder]: 1558/2621 cut-off events. [2022-12-13 11:48:45,149 INFO L131 PetriNetUnfolder]: For 3835/3923 co-relation queries the response was YES. [2022-12-13 11:48:45,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7831 conditions, 2621 events. 1558/2621 cut-off events. For 3835/3923 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 17415 event pairs, 3 based on Foata normal form. 11/905 useless extension candidates. Maximal degree in co-relation 7801. Up to 1216 conditions per place. [2022-12-13 11:48:45,165 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 89 transitions, 603 flow [2022-12-13 11:48:45,165 INFO L226 LiptonReduction]: Number of co-enabled transitions 1244 [2022-12-13 11:48:45,210 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:48:45,210 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-13 11:48:45,210 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 88 transitions, 605 flow [2022-12-13 11:48:45,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 11:48:45,211 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:45,211 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] [2022-12-13 11:48:45,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 11:48:45,211 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:48:45,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:45,211 INFO L85 PathProgramCache]: Analyzing trace with hash -774349709, now seen corresponding path program 1 times [2022-12-13 11:48:45,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:45,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927907999] [2022-12-13 11:48:45,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:45,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:45,335 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 11:48:45,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:45,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927907999] [2022-12-13 11:48:45,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927907999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:45,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:45,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:48:45,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640025972] [2022-12-13 11:48:45,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:45,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:48:45,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:45,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:48:45,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:48:45,337 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2022-12-13 11:48:45,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 88 transitions, 605 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 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 11:48:45,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:45,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2022-12-13 11:48:45,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:48:45,778 INFO L130 PetriNetUnfolder]: 4043/6246 cut-off events. [2022-12-13 11:48:45,778 INFO L131 PetriNetUnfolder]: For 18508/18889 co-relation queries the response was YES. [2022-12-13 11:48:45,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24906 conditions, 6246 events. 4043/6246 cut-off events. For 18508/18889 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 38561 event pairs, 224 based on Foata normal form. 257/4634 useless extension candidates. Maximal degree in co-relation 24873. Up to 2939 conditions per place. [2022-12-13 11:48:45,805 INFO L137 encePairwiseOnDemand]: 28/37 looper letters, 73 selfloop transitions, 5 changer transitions 62/159 dead transitions. [2022-12-13 11:48:45,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 159 transitions, 1276 flow [2022-12-13 11:48:45,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:48:45,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:48:45,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2022-12-13 11:48:45,807 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5540540540540541 [2022-12-13 11:48:45,807 INFO L175 Difference]: Start difference. First operand has 81 places, 88 transitions, 605 flow. Second operand 6 states and 123 transitions. [2022-12-13 11:48:45,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 159 transitions, 1276 flow [2022-12-13 11:48:46,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 159 transitions, 1239 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-12-13 11:48:46,058 INFO L231 Difference]: Finished difference. Result has 82 places, 69 transitions, 407 flow [2022-12-13 11:48:46,058 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=407, PETRI_PLACES=82, PETRI_TRANSITIONS=69} [2022-12-13 11:48:46,059 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, 5 predicate places. [2022-12-13 11:48:46,059 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:48:46,059 INFO L89 Accepts]: Start accepts. Operand has 82 places, 69 transitions, 407 flow [2022-12-13 11:48:46,059 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:48:46,059 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:46,059 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 69 transitions, 407 flow [2022-12-13 11:48:46,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions, 407 flow [2022-12-13 11:48:46,109 INFO L130 PetriNetUnfolder]: 695/1215 cut-off events. [2022-12-13 11:48:46,109 INFO L131 PetriNetUnfolder]: For 2993/3290 co-relation queries the response was YES. [2022-12-13 11:48:46,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3864 conditions, 1215 events. 695/1215 cut-off events. For 2993/3290 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 7612 event pairs, 2 based on Foata normal form. 8/429 useless extension candidates. Maximal degree in co-relation 3837. Up to 568 conditions per place. [2022-12-13 11:48:46,116 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 69 transitions, 407 flow [2022-12-13 11:48:46,116 INFO L226 LiptonReduction]: Number of co-enabled transitions 486 [2022-12-13 11:48:46,415 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:48:46,416 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 357 [2022-12-13 11:48:46,416 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 397 flow [2022-12-13 11:48:46,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 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 11:48:46,416 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:46,416 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] [2022-12-13 11:48:46,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 11:48:46,416 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:48:46,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:46,417 INFO L85 PathProgramCache]: Analyzing trace with hash 512507242, now seen corresponding path program 1 times [2022-12-13 11:48:46,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:46,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111890853] [2022-12-13 11:48:46,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:46,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:46,891 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 11:48:46,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:46,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111890853] [2022-12-13 11:48:46,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111890853] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:46,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:46,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:48:46,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744467027] [2022-12-13 11:48:46,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:46,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:48:46,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:46,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:48:46,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:48:46,893 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2022-12-13 11:48:46,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 397 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 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 11:48:46,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:46,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2022-12-13 11:48:46,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:48:47,201 INFO L130 PetriNetUnfolder]: 1894/3009 cut-off events. [2022-12-13 11:48:47,201 INFO L131 PetriNetUnfolder]: For 10780/10925 co-relation queries the response was YES. [2022-12-13 11:48:47,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11594 conditions, 3009 events. 1894/3009 cut-off events. For 10780/10925 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 18015 event pairs, 56 based on Foata normal form. 162/2214 useless extension candidates. Maximal degree in co-relation 11564. Up to 1266 conditions per place. [2022-12-13 11:48:47,216 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 66 selfloop transitions, 5 changer transitions 30/121 dead transitions. [2022-12-13 11:48:47,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 121 transitions, 934 flow [2022-12-13 11:48:47,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:48:47,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:48:47,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2022-12-13 11:48:47,217 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4838709677419355 [2022-12-13 11:48:47,217 INFO L175 Difference]: Start difference. First operand has 74 places, 67 transitions, 397 flow. Second operand 6 states and 90 transitions. [2022-12-13 11:48:47,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 121 transitions, 934 flow [2022-12-13 11:48:47,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 121 transitions, 860 flow, removed 5 selfloop flow, removed 18 redundant places. [2022-12-13 11:48:47,275 INFO L231 Difference]: Finished difference. Result has 62 places, 68 transitions, 367 flow [2022-12-13 11:48:47,275 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=367, PETRI_PLACES=62, PETRI_TRANSITIONS=68} [2022-12-13 11:48:47,275 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -15 predicate places. [2022-12-13 11:48:47,275 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:48:47,275 INFO L89 Accepts]: Start accepts. Operand has 62 places, 68 transitions, 367 flow [2022-12-13 11:48:47,276 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:48:47,276 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:47,276 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 68 transitions, 367 flow [2022-12-13 11:48:47,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 68 transitions, 367 flow [2022-12-13 11:48:47,343 INFO L130 PetriNetUnfolder]: 1271/2077 cut-off events. [2022-12-13 11:48:47,344 INFO L131 PetriNetUnfolder]: For 1833/1929 co-relation queries the response was YES. [2022-12-13 11:48:47,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5993 conditions, 2077 events. 1271/2077 cut-off events. For 1833/1929 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 13474 event pairs, 2 based on Foata normal form. 3/710 useless extension candidates. Maximal degree in co-relation 5976. Up to 973 conditions per place. [2022-12-13 11:48:47,353 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 68 transitions, 367 flow [2022-12-13 11:48:47,353 INFO L226 LiptonReduction]: Number of co-enabled transitions 472 [2022-12-13 11:48:47,355 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:48:47,356 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-13 11:48:47,356 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 68 transitions, 367 flow [2022-12-13 11:48:47,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 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 11:48:47,356 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:47,356 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] [2022-12-13 11:48:47,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 11:48:47,356 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:48:47,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:47,356 INFO L85 PathProgramCache]: Analyzing trace with hash 353820202, now seen corresponding path program 2 times [2022-12-13 11:48:47,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:47,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634208166] [2022-12-13 11:48:47,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:47,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:48:47,379 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:48:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:48:47,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:48:47,418 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:48:47,419 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 11:48:47,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 11:48:47,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 11:48:47,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 11:48:47,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 11:48:47,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 11:48:47,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 11:48:47,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 11:48:47,421 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:48:47,425 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:48:47,425 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:48:47,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:48:47 BasicIcfg [2022-12-13 11:48:47,485 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:48:47,485 INFO L158 Benchmark]: Toolchain (without parser) took 41534.37ms. Allocated memory was 233.8MB in the beginning and 6.1GB in the end (delta: 5.8GB). Free memory was 208.4MB in the beginning and 3.7GB in the end (delta: -3.5GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2022-12-13 11:48:47,485 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 233.8MB. Free memory is still 210.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:48:47,486 INFO L158 Benchmark]: CACSL2BoogieTranslator took 463.52ms. Allocated memory is still 233.8MB. Free memory was 208.2MB in the beginning and 179.9MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-13 11:48:47,486 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.20ms. Allocated memory is still 233.8MB. Free memory was 179.9MB in the beginning and 177.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 11:48:47,486 INFO L158 Benchmark]: Boogie Preprocessor took 34.33ms. Allocated memory is still 233.8MB. Free memory was 177.2MB in the beginning and 175.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:48:47,486 INFO L158 Benchmark]: RCFGBuilder took 623.46ms. Allocated memory is still 233.8MB. Free memory was 175.1MB in the beginning and 137.4MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-13 11:48:47,486 INFO L158 Benchmark]: TraceAbstraction took 40330.81ms. Allocated memory was 233.8MB in the beginning and 6.1GB in the end (delta: 5.8GB). Free memory was 136.3MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2022-12-13 11:48:47,487 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 233.8MB. Free memory is still 210.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 463.52ms. Allocated memory is still 233.8MB. Free memory was 208.2MB in the beginning and 179.9MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.20ms. Allocated memory is still 233.8MB. Free memory was 179.9MB in the beginning and 177.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.33ms. Allocated memory is still 233.8MB. Free memory was 177.2MB in the beginning and 175.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 623.46ms. Allocated memory is still 233.8MB. Free memory was 175.1MB in the beginning and 137.4MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 40330.81ms. Allocated memory was 233.8MB in the beginning and 6.1GB in the end (delta: 5.8GB). Free memory was 136.3MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 135 PlacesBefore, 77 PlacesAfterwards, 124 TransitionsBefore, 64 TransitionsAfterwards, 2718 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 52 ConcurrentYvCompositions, 3 ChoiceCompositions, 100 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4407, independent: 4196, independent conditional: 4196, independent unconditional: 0, dependent: 211, dependent conditional: 211, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4407, independent: 4196, independent conditional: 0, independent unconditional: 4196, dependent: 211, dependent conditional: 0, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4407, independent: 4196, independent conditional: 0, independent unconditional: 4196, dependent: 211, dependent conditional: 0, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4407, independent: 4196, independent conditional: 0, independent unconditional: 4196, dependent: 211, dependent conditional: 0, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2392, independent: 2330, independent conditional: 0, independent unconditional: 2330, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2392, independent: 2295, independent conditional: 0, independent unconditional: 2295, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 97, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 257, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 220, dependent conditional: 0, dependent unconditional: 220, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4407, independent: 1866, independent conditional: 0, independent unconditional: 1866, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 2392, unknown conditional: 0, unknown unconditional: 2392] , Statistics on independence cache: Total cache size (in pairs): 4451, Positive cache size: 4389, Positive conditional cache size: 0, Positive unconditional cache size: 4389, Negative cache size: 62, Negative conditional cache size: 0, Negative unconditional cache size: 62, 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.1s, 50 PlacesBefore, 50 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 908 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 551, independent: 509, independent conditional: 509, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 551, independent: 509, independent conditional: 26, independent unconditional: 483, dependent: 42, dependent conditional: 5, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 551, independent: 509, independent conditional: 26, independent unconditional: 483, dependent: 42, dependent conditional: 5, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 551, independent: 509, independent conditional: 26, independent unconditional: 483, dependent: 42, dependent conditional: 5, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 409, independent: 380, independent conditional: 20, independent unconditional: 360, dependent: 29, dependent conditional: 2, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 409, independent: 299, independent conditional: 0, independent unconditional: 299, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 110, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 29, dependent conditional: 2, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 122, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 70, dependent conditional: 12, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 551, independent: 129, independent conditional: 6, independent unconditional: 123, dependent: 13, dependent conditional: 3, dependent unconditional: 10, unknown: 409, unknown conditional: 22, unknown unconditional: 387] , Statistics on independence cache: Total cache size (in pairs): 409, Positive cache size: 380, Positive conditional cache size: 20, Positive unconditional cache size: 360, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, 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, 51 PlacesBefore, 51 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 1026 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 261, independent: 246, independent conditional: 246, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 261, independent: 246, independent conditional: 30, independent unconditional: 216, dependent: 15, dependent conditional: 11, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 261, independent: 246, independent conditional: 0, independent unconditional: 246, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 261, independent: 246, independent conditional: 0, independent unconditional: 246, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 261, independent: 231, independent conditional: 0, independent unconditional: 231, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 425, Positive cache size: 395, Positive conditional cache size: 20, Positive unconditional cache size: 375, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 41, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 1110 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 297, independent: 279, independent conditional: 279, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 297, independent: 279, independent conditional: 31, independent unconditional: 248, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 297, independent: 279, independent conditional: 0, independent unconditional: 279, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 297, independent: 279, independent conditional: 0, independent unconditional: 279, dependent: 18, dependent conditional: 0, dependent unconditional: 18, 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: 297, independent: 279, independent conditional: 0, independent unconditional: 279, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 425, Positive cache size: 395, Positive conditional cache size: 20, Positive unconditional cache size: 375, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 31, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 1236 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 342, independent: 320, independent conditional: 320, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 342, independent: 320, independent conditional: 53, independent unconditional: 267, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 342, independent: 320, independent conditional: 0, independent unconditional: 320, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 342, independent: 320, independent conditional: 0, independent unconditional: 320, dependent: 22, dependent conditional: 0, dependent unconditional: 22, 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: 342, independent: 320, independent conditional: 0, independent unconditional: 320, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 425, Positive cache size: 395, Positive conditional cache size: 20, Positive unconditional cache size: 375, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 53, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 62 PlacesBefore, 62 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 1586 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 247, independent: 227, independent conditional: 227, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 247, independent: 227, independent conditional: 84, independent unconditional: 143, dependent: 20, dependent conditional: 8, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 255, independent: 227, independent conditional: 42, independent unconditional: 185, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 255, independent: 227, independent conditional: 42, independent unconditional: 185, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 255, independent: 226, independent conditional: 42, independent unconditional: 184, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 426, Positive cache size: 396, Positive conditional cache size: 20, Positive unconditional cache size: 376, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 58, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 65 PlacesBefore, 65 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 1584 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 303, independent: 284, independent conditional: 284, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 303, independent: 284, independent conditional: 123, independent unconditional: 161, dependent: 19, dependent conditional: 5, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 303, independent: 284, independent conditional: 78, independent unconditional: 206, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 303, independent: 284, independent conditional: 78, independent unconditional: 206, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 303, independent: 283, independent conditional: 78, independent unconditional: 205, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 427, Positive cache size: 397, Positive conditional cache size: 20, Positive unconditional cache size: 377, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 50, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 67 PlacesBefore, 67 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 1940 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 214, independent: 191, independent conditional: 191, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 214, independent: 191, independent conditional: 78, independent unconditional: 113, dependent: 23, dependent conditional: 16, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 225, independent: 191, independent conditional: 36, independent unconditional: 155, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 225, independent: 191, independent conditional: 36, independent unconditional: 155, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 225, independent: 190, independent conditional: 36, independent unconditional: 154, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 429, Positive cache size: 398, Positive conditional cache size: 20, Positive unconditional cache size: 378, Negative cache size: 31, Negative conditional cache size: 2, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 69, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 69 PlacesBefore, 69 PlacesAfterwards, 88 TransitionsBefore, 88 TransitionsAfterwards, 1878 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 453, independent: 425, independent conditional: 425, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 453, independent: 425, independent conditional: 235, independent unconditional: 190, dependent: 28, dependent conditional: 5, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 453, independent: 425, independent conditional: 198, independent unconditional: 227, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 453, independent: 425, independent conditional: 198, independent unconditional: 227, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 12, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 453, independent: 405, independent conditional: 186, independent unconditional: 219, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 22, unknown conditional: 12, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 451, Positive cache size: 418, Positive conditional cache size: 32, Positive unconditional cache size: 386, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 42, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 81 PlacesBefore, 80 PlacesAfterwards, 117 TransitionsBefore, 115 TransitionsAfterwards, 2714 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1482, independent: 1442, independent conditional: 1442, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1482, independent: 1442, independent conditional: 1057, independent unconditional: 385, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1482, independent: 1442, independent conditional: 757, independent unconditional: 685, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1482, independent: 1442, independent conditional: 757, independent unconditional: 685, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 9, independent unconditional: 13, 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: 22, independent: 22, independent conditional: 0, independent unconditional: 22, 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: 1482, independent: 1420, independent conditional: 748, independent unconditional: 672, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 22, unknown conditional: 9, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 488, Positive cache size: 455, Positive conditional cache size: 41, Positive unconditional cache size: 414, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 300, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 85 PlacesBefore, 83 PlacesAfterwards, 105 TransitionsBefore, 103 TransitionsAfterwards, 1916 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1144, independent: 1100, independent conditional: 1100, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1144, independent: 1100, independent conditional: 780, independent unconditional: 320, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1144, independent: 1100, independent conditional: 612, independent unconditional: 488, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1144, independent: 1100, independent conditional: 612, independent unconditional: 488, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 1144, independent: 1094, independent conditional: 606, independent unconditional: 488, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 508, Positive cache size: 475, Positive conditional cache size: 47, Positive unconditional cache size: 428, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 168, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 81 PlacesBefore, 81 PlacesAfterwards, 92 TransitionsBefore, 92 TransitionsAfterwards, 1490 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1209, independent: 1173, independent conditional: 1173, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1209, independent: 1173, independent conditional: 910, independent unconditional: 263, dependent: 36, dependent conditional: 8, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1209, independent: 1173, independent conditional: 870, independent unconditional: 303, dependent: 36, dependent conditional: 8, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1209, independent: 1173, independent conditional: 870, independent unconditional: 303, dependent: 36, dependent conditional: 8, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 12, independent conditional: 9, independent unconditional: 3, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1209, independent: 1161, independent conditional: 861, independent unconditional: 300, dependent: 35, dependent conditional: 7, dependent unconditional: 28, unknown: 13, unknown conditional: 10, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 651, Positive cache size: 617, Positive conditional cache size: 61, Positive unconditional cache size: 556, Negative cache size: 34, Negative conditional cache size: 3, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 40, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 82 PlacesBefore, 81 PlacesAfterwards, 89 TransitionsBefore, 88 TransitionsAfterwards, 1244 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 815, independent: 789, independent conditional: 789, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 815, independent: 789, independent conditional: 617, independent unconditional: 172, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 815, independent: 789, independent conditional: 506, independent unconditional: 283, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 815, independent: 789, independent conditional: 506, independent unconditional: 283, dependent: 26, dependent conditional: 0, dependent unconditional: 26, 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: 815, independent: 789, independent conditional: 506, independent unconditional: 283, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 729, Positive cache size: 695, Positive conditional cache size: 64, Positive unconditional cache size: 631, Negative cache size: 34, Negative conditional cache size: 3, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 137, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 76 PlacesBefore, 74 PlacesAfterwards, 69 TransitionsBefore, 67 TransitionsAfterwards, 486 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 259, independent: 229, independent conditional: 229, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 259, independent: 229, independent conditional: 123, independent unconditional: 106, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 259, independent: 229, independent conditional: 123, independent unconditional: 106, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 259, independent: 229, independent conditional: 123, independent unconditional: 106, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 259, independent: 224, independent conditional: 122, independent unconditional: 102, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 5, unknown conditional: 1, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 757, Positive cache size: 723, Positive conditional cache size: 66, Positive unconditional cache size: 657, Negative cache size: 34, Negative conditional cache size: 3, Negative unconditional cache size: 31, 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, 62 PlacesBefore, 62 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 472 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): 757, Positive cache size: 723, Positive conditional cache size: 66, Positive unconditional cache size: 657, Negative cache size: 34, Negative conditional cache size: 3, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L864] 0 pthread_t t525; [L865] FCALL, FORK 0 pthread_create(&t525, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t525, ((void *)0), P0, ((void *)0))=-4, t525={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 pthread_t t526; [L867] FCALL, FORK 0 pthread_create(&t526, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t526, ((void *)0), P1, ((void *)0))=-3, t525={5:0}, t526={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 pthread_t t527; [L869] FCALL, FORK 0 pthread_create(&t527, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t527, ((void *)0), P2, ((void *)0))=-2, t525={5:0}, t526={6:0}, t527={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L870] 0 pthread_t t528; [L871] FCALL, FORK 0 pthread_create(&t528, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t528, ((void *)0), P3, ((void *)0))=-1, t525={5:0}, t526={6:0}, t527={7:0}, t528={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L814] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L814] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 z$flush_delayed = weak$$choice2 [L826] 4 z$mem_tmp = z [L827] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L828] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L829] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L830] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L831] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L833] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = z [L835] 4 z = z$flush_delayed ? z$mem_tmp : z [L836] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L839] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 a = 1 [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 1 [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L790] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L791] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L792] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 __unbuffered_p2_EAX = z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L842] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L843] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L844] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L845] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L846] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L878] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L879] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L880] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L881] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L884] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 162 locations, 7 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: 40.2s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 26.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 551 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 551 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 122 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1576 IncrementalHoareTripleChecker+Invalid, 1698 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 122 mSolverCounterUnsat, 33 mSDtfsCounter, 1576 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=886occurred in iteration=9, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 227 ConstructedInterpolants, 0 QuantifiedInterpolants, 1463 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 11:48:47,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...