/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe019_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:30:54,374 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:30:54,375 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:30:54,405 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:30:54,405 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:30:54,407 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:30:54,410 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:30:54,413 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:30:54,416 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:30:54,420 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:30:54,420 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:30:54,422 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:30:54,422 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:30:54,424 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:30:54,425 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:30:54,428 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:30:54,429 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:30:54,429 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:30:54,431 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:30:54,447 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:30:54,448 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:30:54,449 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:30:54,450 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:30:54,450 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:30:54,452 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:30:54,452 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:30:54,452 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:30:54,453 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:30:54,453 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:30:54,454 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:30:54,454 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:30:54,454 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:30:54,455 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:30:54,455 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:30:54,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:30:54,456 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:30:54,456 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:30:54,456 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:30:54,457 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:30:54,457 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:30:54,458 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:30:54,463 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:30:54,477 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:30:54,477 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:30:54,479 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:30:54,479 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:30:54,479 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:30:54,480 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:30:54,480 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:30:54,480 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:30:54,480 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:30:54,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:30:54,481 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:30:54,481 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:30:54,481 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:30:54,481 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:30:54,481 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:30:54,481 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:30:54,481 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:30:54,482 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:30:54,482 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:30:54,482 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:30:54,482 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:30:54,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:30:54,482 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:30:54,482 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:30:54,482 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:30:54,482 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:30:54,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:30:54,483 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:30:54,483 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-06 04:30:54,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:30:54,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:30:54,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:30:54,780 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:30:54,781 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:30:54,782 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_rmo.opt.i [2022-12-06 04:30:55,952 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:30:56,214 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:30:56,214 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_rmo.opt.i [2022-12-06 04:30:56,235 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7aaedd413/5cf6b15b99854c8abe87c02a6e935e86/FLAGb6b7182d4 [2022-12-06 04:30:56,246 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7aaedd413/5cf6b15b99854c8abe87c02a6e935e86 [2022-12-06 04:30:56,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:30:56,249 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:30:56,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:30:56,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:30:56,252 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:30:56,252 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:30:56" (1/1) ... [2022-12-06 04:30:56,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4994dc82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:56, skipping insertion in model container [2022-12-06 04:30:56,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:30:56" (1/1) ... [2022-12-06 04:30:56,258 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:30:56,291 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:30:56,391 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/safe019_rmo.opt.i[992,1005] [2022-12-06 04:30:56,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,562 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:30:56,576 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:30:56,587 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/safe019_rmo.opt.i[992,1005] [2022-12-06 04:30:56,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:56,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:56,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:30:56,678 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:30:56,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:56 WrapperNode [2022-12-06 04:30:56,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:30:56,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:30:56,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:30:56,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:30:56,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:56" (1/1) ... [2022-12-06 04:30:56,715 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:56" (1/1) ... [2022-12-06 04:30:56,740 INFO L138 Inliner]: procedures = 177, calls = 86, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 151 [2022-12-06 04:30:56,740 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:30:56,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:30:56,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:30:56,741 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:30:56,747 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:56" (1/1) ... [2022-12-06 04:30:56,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:56" (1/1) ... [2022-12-06 04:30:56,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:56" (1/1) ... [2022-12-06 04:30:56,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:56" (1/1) ... [2022-12-06 04:30:56,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:56" (1/1) ... [2022-12-06 04:30:56,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:56" (1/1) ... [2022-12-06 04:30:56,773 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:56" (1/1) ... [2022-12-06 04:30:56,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:56" (1/1) ... [2022-12-06 04:30:56,791 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:30:56,792 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:30:56,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:30:56,792 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:30:56,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:56" (1/1) ... [2022-12-06 04:30:56,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:30:56,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:30:56,849 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:30:56,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:30:56,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:30:56,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:30:56,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:30:56,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:30:56,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:30:56,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:30:56,906 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:30:56,906 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:30:56,906 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:30:56,906 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:30:56,906 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:30:56,906 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:30:56,906 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 04:30:56,906 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 04:30:56,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:30:56,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:30:56,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:30:56,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:30:56,908 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:30:57,015 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:30:57,017 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:30:57,405 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:30:57,680 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:30:57,680 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:30:57,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:30:57 BoogieIcfgContainer [2022-12-06 04:30:57,684 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:30:57,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:30:57,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:30:57,689 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:30:57,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:30:56" (1/3) ... [2022-12-06 04:30:57,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5062cfc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:30:57, skipping insertion in model container [2022-12-06 04:30:57,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:56" (2/3) ... [2022-12-06 04:30:57,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5062cfc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:30:57, skipping insertion in model container [2022-12-06 04:30:57,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:30:57" (3/3) ... [2022-12-06 04:30:57,693 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_rmo.opt.i [2022-12-06 04:30:57,707 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:30:57,708 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 04:30:57,709 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:30:57,781 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:30:57,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 144 transitions, 308 flow [2022-12-06 04:30:57,884 INFO L130 PetriNetUnfolder]: 2/140 cut-off events. [2022-12-06 04:30:57,885 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:30:57,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 2/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2022-12-06 04:30:57,891 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 144 transitions, 308 flow [2022-12-06 04:30:57,894 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 126 transitions, 264 flow [2022-12-06 04:30:57,895 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:30:57,912 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 126 transitions, 264 flow [2022-12-06 04:30:57,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 126 transitions, 264 flow [2022-12-06 04:30:57,945 INFO L130 PetriNetUnfolder]: 1/126 cut-off events. [2022-12-06 04:30:57,945 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:30:57,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 1/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 04:30:57,948 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 126 transitions, 264 flow [2022-12-06 04:30:57,948 INFO L188 LiptonReduction]: Number of co-enabled transitions 1836 [2022-12-06 04:31:03,984 INFO L203 LiptonReduction]: Total number of compositions: 103 [2022-12-06 04:31:03,995 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:31:04,000 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;@3c132f47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:31:04,000 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 04:31:04,006 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 04:31:04,006 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:31:04,007 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:04,008 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:04,010 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:31:04,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:04,017 INFO L85 PathProgramCache]: Analyzing trace with hash -344888659, now seen corresponding path program 1 times [2022-12-06 04:31:04,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:04,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243531088] [2022-12-06 04:31:04,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:04,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:04,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:31:04,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:04,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243531088] [2022-12-06 04:31:04,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243531088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:04,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:04,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:31:04,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35797694] [2022-12-06 04:31:04,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:04,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 04:31:04,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:04,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 04:31:04,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 04:31:04,199 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 04:31:04,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 62 flow. Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:04,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:04,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 04:31:04,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:04,848 INFO L130 PetriNetUnfolder]: 3159/4376 cut-off events. [2022-12-06 04:31:04,849 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-12-06 04:31:04,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8904 conditions, 4376 events. 3159/4376 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 19131 event pairs, 3159 based on Foata normal form. 0/4356 useless extension candidates. Maximal degree in co-relation 8892. Up to 4353 conditions per place. [2022-12-06 04:31:04,871 INFO L137 encePairwiseOnDemand]: 24/25 looper letters, 23 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2022-12-06 04:31:04,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 24 transitions, 106 flow [2022-12-06 04:31:04,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 04:31:04,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 04:31:04,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 26 transitions. [2022-12-06 04:31:04,879 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.52 [2022-12-06 04:31:04,880 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 62 flow. Second operand 2 states and 26 transitions. [2022-12-06 04:31:04,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 24 transitions, 106 flow [2022-12-06 04:31:04,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 24 transitions, 102 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:31:04,883 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 56 flow [2022-12-06 04:31:04,885 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2022-12-06 04:31:04,887 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2022-12-06 04:31:04,887 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:04,887 INFO L89 Accepts]: Start accepts. Operand has 34 places, 24 transitions, 56 flow [2022-12-06 04:31:04,889 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:04,889 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:04,889 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 24 transitions, 56 flow [2022-12-06 04:31:04,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 24 transitions, 56 flow [2022-12-06 04:31:04,894 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-06 04:31:04,894 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:31:04,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 33 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-06 04:31:04,895 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 24 transitions, 56 flow [2022-12-06 04:31:04,895 INFO L188 LiptonReduction]: Number of co-enabled transitions 280 [2022-12-06 04:31:05,036 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:05,038 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 151 [2022-12-06 04:31:05,039 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 56 flow [2022-12-06 04:31:05,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:05,039 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:05,039 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:05,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:31:05,039 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:31:05,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:05,040 INFO L85 PathProgramCache]: Analyzing trace with hash -725517514, now seen corresponding path program 1 times [2022-12-06 04:31:05,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:05,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697839908] [2022-12-06 04:31:05,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:05,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:05,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:31:05,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:05,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697839908] [2022-12-06 04:31:05,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697839908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:05,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:05,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:31:05,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962719524] [2022-12-06 04:31:05,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:05,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:31:05,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:05,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:31:05,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:31:05,386 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 04:31:05,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 56 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:05,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:05,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 04:31:05,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:05,975 INFO L130 PetriNetUnfolder]: 3895/5344 cut-off events. [2022-12-06 04:31:05,976 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:31:05,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10892 conditions, 5344 events. 3895/5344 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 22696 event pairs, 967 based on Foata normal form. 32/5376 useless extension candidates. Maximal degree in co-relation 10884. Up to 4801 conditions per place. [2022-12-06 04:31:05,997 INFO L137 encePairwiseOnDemand]: 20/24 looper letters, 34 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2022-12-06 04:31:05,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 158 flow [2022-12-06 04:31:05,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:31:05,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:31:05,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-06 04:31:05,998 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2022-12-06 04:31:05,998 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 56 flow. Second operand 3 states and 38 transitions. [2022-12-06 04:31:05,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 158 flow [2022-12-06 04:31:05,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 158 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:31:06,000 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 75 flow [2022-12-06 04:31:06,000 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2022-12-06 04:31:06,001 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places. [2022-12-06 04:31:06,001 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:06,001 INFO L89 Accepts]: Start accepts. Operand has 36 places, 26 transitions, 75 flow [2022-12-06 04:31:06,001 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:06,001 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:06,002 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 26 transitions, 75 flow [2022-12-06 04:31:06,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 26 transitions, 75 flow [2022-12-06 04:31:06,007 INFO L130 PetriNetUnfolder]: 3/34 cut-off events. [2022-12-06 04:31:06,007 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:31:06,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 34 events. 3/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 1 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 49. Up to 10 conditions per place. [2022-12-06 04:31:06,007 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 26 transitions, 75 flow [2022-12-06 04:31:06,007 INFO L188 LiptonReduction]: Number of co-enabled transitions 306 [2022-12-06 04:31:06,010 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:06,011 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 04:31:06,011 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 75 flow [2022-12-06 04:31:06,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:06,011 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:06,011 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:06,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:31:06,011 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:31:06,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:06,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1016208026, now seen corresponding path program 1 times [2022-12-06 04:31:06,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:06,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566067775] [2022-12-06 04:31:06,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:06,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:06,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:31:06,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:06,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566067775] [2022-12-06 04:31:06,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566067775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:06,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:06,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:31:06,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711037769] [2022-12-06 04:31:06,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:06,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:31:06,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:06,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:31:06,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:31:06,177 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 04:31:06,177 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:06,177 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:06,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 04:31:06,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:06,694 INFO L130 PetriNetUnfolder]: 3337/4640 cut-off events. [2022-12-06 04:31:06,695 INFO L131 PetriNetUnfolder]: For 475/482 co-relation queries the response was YES. [2022-12-06 04:31:06,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10049 conditions, 4640 events. 3337/4640 cut-off events. For 475/482 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 21335 event pairs, 938 based on Foata normal form. 75/4710 useless extension candidates. Maximal degree in co-relation 10038. Up to 3850 conditions per place. [2022-12-06 04:31:06,720 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 40 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2022-12-06 04:31:06,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 44 transitions, 206 flow [2022-12-06 04:31:06,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:31:06,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:31:06,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-06 04:31:06,722 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2022-12-06 04:31:06,722 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 75 flow. Second operand 3 states and 44 transitions. [2022-12-06 04:31:06,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 44 transitions, 206 flow [2022-12-06 04:31:06,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 44 transitions, 202 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:31:06,724 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 80 flow [2022-12-06 04:31:06,724 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2022-12-06 04:31:06,725 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2022-12-06 04:31:06,725 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:06,725 INFO L89 Accepts]: Start accepts. Operand has 38 places, 26 transitions, 80 flow [2022-12-06 04:31:06,726 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:06,726 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:06,726 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 26 transitions, 80 flow [2022-12-06 04:31:06,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 26 transitions, 80 flow [2022-12-06 04:31:06,732 INFO L130 PetriNetUnfolder]: 3/34 cut-off events. [2022-12-06 04:31:06,732 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 04:31:06,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 34 events. 3/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 1 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 52. Up to 10 conditions per place. [2022-12-06 04:31:06,733 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 26 transitions, 80 flow [2022-12-06 04:31:06,733 INFO L188 LiptonReduction]: Number of co-enabled transitions 304 [2022-12-06 04:31:06,734 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:06,735 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 04:31:06,735 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 80 flow [2022-12-06 04:31:06,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:06,735 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:06,736 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:06,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:31:06,736 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:31:06,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:06,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1509550946, now seen corresponding path program 1 times [2022-12-06 04:31:06,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:06,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364714525] [2022-12-06 04:31:06,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:06,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:06,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:31:06,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:06,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364714525] [2022-12-06 04:31:06,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364714525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:06,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:06,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:31:06,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051052021] [2022-12-06 04:31:06,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:06,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:31:06,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:06,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:31:06,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:31:06,944 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 04:31:06,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:06,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:06,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 04:31:06,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:07,471 INFO L130 PetriNetUnfolder]: 3366/4707 cut-off events. [2022-12-06 04:31:07,471 INFO L131 PetriNetUnfolder]: For 1021/1021 co-relation queries the response was YES. [2022-12-06 04:31:07,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10767 conditions, 4707 events. 3366/4707 cut-off events. For 1021/1021 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 20465 event pairs, 963 based on Foata normal form. 36/4743 useless extension candidates. Maximal degree in co-relation 10754. Up to 3712 conditions per place. [2022-12-06 04:31:07,495 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 35 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2022-12-06 04:31:07,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 39 transitions, 187 flow [2022-12-06 04:31:07,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:31:07,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:31:07,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-06 04:31:07,497 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 04:31:07,497 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 80 flow. Second operand 3 states and 40 transitions. [2022-12-06 04:31:07,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 39 transitions, 187 flow [2022-12-06 04:31:07,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 181 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:31:07,498 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 84 flow [2022-12-06 04:31:07,499 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2022-12-06 04:31:07,499 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2022-12-06 04:31:07,499 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:07,500 INFO L89 Accepts]: Start accepts. Operand has 39 places, 26 transitions, 84 flow [2022-12-06 04:31:07,500 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:07,500 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:07,500 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 26 transitions, 84 flow [2022-12-06 04:31:07,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 26 transitions, 84 flow [2022-12-06 04:31:07,507 INFO L130 PetriNetUnfolder]: 3/34 cut-off events. [2022-12-06 04:31:07,507 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 04:31:07,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 34 events. 3/34 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 1 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 56. Up to 10 conditions per place. [2022-12-06 04:31:07,508 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 26 transitions, 84 flow [2022-12-06 04:31:07,508 INFO L188 LiptonReduction]: Number of co-enabled transitions 302 [2022-12-06 04:31:07,509 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:07,510 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 04:31:07,510 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 84 flow [2022-12-06 04:31:07,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:07,510 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:07,510 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:07,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:31:07,510 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:31:07,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:07,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1387460272, now seen corresponding path program 1 times [2022-12-06 04:31:07,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:07,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090352922] [2022-12-06 04:31:07,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:07,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:07,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:31:07,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:07,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090352922] [2022-12-06 04:31:07,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090352922] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:07,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:07,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:31:07,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569061036] [2022-12-06 04:31:07,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:07,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:31:07,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:07,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:31:07,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:31:07,643 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 04:31:07,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 84 flow. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:07,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:07,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 04:31:07,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:08,465 INFO L130 PetriNetUnfolder]: 5374/7435 cut-off events. [2022-12-06 04:31:08,465 INFO L131 PetriNetUnfolder]: For 2652/2652 co-relation queries the response was YES. [2022-12-06 04:31:08,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17398 conditions, 7435 events. 5374/7435 cut-off events. For 2652/2652 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 34778 event pairs, 751 based on Foata normal form. 180/7615 useless extension candidates. Maximal degree in co-relation 17384. Up to 3484 conditions per place. [2022-12-06 04:31:08,485 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 44 selfloop transitions, 4 changer transitions 5/53 dead transitions. [2022-12-06 04:31:08,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 259 flow [2022-12-06 04:31:08,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:31:08,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:31:08,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-06 04:31:08,487 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-06 04:31:08,487 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 84 flow. Second operand 4 states and 54 transitions. [2022-12-06 04:31:08,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 259 flow [2022-12-06 04:31:08,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 251 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:31:08,489 INFO L231 Difference]: Finished difference. Result has 41 places, 26 transitions, 93 flow [2022-12-06 04:31:08,490 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=93, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2022-12-06 04:31:08,490 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2022-12-06 04:31:08,490 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:08,490 INFO L89 Accepts]: Start accepts. Operand has 41 places, 26 transitions, 93 flow [2022-12-06 04:31:08,491 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:08,491 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:08,491 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 26 transitions, 93 flow [2022-12-06 04:31:08,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 26 transitions, 93 flow [2022-12-06 04:31:08,496 INFO L130 PetriNetUnfolder]: 3/37 cut-off events. [2022-12-06 04:31:08,496 INFO L131 PetriNetUnfolder]: For 30/36 co-relation queries the response was YES. [2022-12-06 04:31:08,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 37 events. 3/37 cut-off events. For 30/36 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 91 event pairs, 1 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 68. Up to 10 conditions per place. [2022-12-06 04:31:08,497 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 26 transitions, 93 flow [2022-12-06 04:31:08,497 INFO L188 LiptonReduction]: Number of co-enabled transitions 266 [2022-12-06 04:31:08,504 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:08,505 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 04:31:08,505 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 93 flow [2022-12-06 04:31:08,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:08,505 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:08,505 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:08,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:31:08,506 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:31:08,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:08,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1067629410, now seen corresponding path program 2 times [2022-12-06 04:31:08,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:08,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640675149] [2022-12-06 04:31:08,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:08,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:08,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:31:08,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:08,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640675149] [2022-12-06 04:31:08,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640675149] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:08,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:08,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:31:08,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399677685] [2022-12-06 04:31:08,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:08,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:31:08,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:08,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:31:08,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:31:08,645 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 04:31:08,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 26 transitions, 93 flow. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:08,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:08,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 04:31:08,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:09,337 INFO L130 PetriNetUnfolder]: 4282/5977 cut-off events. [2022-12-06 04:31:09,338 INFO L131 PetriNetUnfolder]: For 3258/3258 co-relation queries the response was YES. [2022-12-06 04:31:09,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14283 conditions, 5977 events. 4282/5977 cut-off events. For 3258/3258 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 27932 event pairs, 1969 based on Foata normal form. 144/6121 useless extension candidates. Maximal degree in co-relation 14268. Up to 3257 conditions per place. [2022-12-06 04:31:09,355 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 37 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2022-12-06 04:31:09,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 207 flow [2022-12-06 04:31:09,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:31:09,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:31:09,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-06 04:31:09,357 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 04:31:09,357 INFO L175 Difference]: Start difference. First operand has 41 places, 26 transitions, 93 flow. Second operand 3 states and 40 transitions. [2022-12-06 04:31:09,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 207 flow [2022-12-06 04:31:09,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 192 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-12-06 04:31:09,362 INFO L231 Difference]: Finished difference. Result has 40 places, 26 transitions, 92 flow [2022-12-06 04:31:09,362 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2022-12-06 04:31:09,363 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2022-12-06 04:31:09,363 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:09,363 INFO L89 Accepts]: Start accepts. Operand has 40 places, 26 transitions, 92 flow [2022-12-06 04:31:09,363 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:09,363 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:09,363 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 26 transitions, 92 flow [2022-12-06 04:31:09,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 26 transitions, 92 flow [2022-12-06 04:31:09,369 INFO L130 PetriNetUnfolder]: 0/37 cut-off events. [2022-12-06 04:31:09,369 INFO L131 PetriNetUnfolder]: For 18/19 co-relation queries the response was YES. [2022-12-06 04:31:09,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 37 events. 0/37 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 93 event pairs, 0 based on Foata normal form. 1/38 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2022-12-06 04:31:09,370 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 26 transitions, 92 flow [2022-12-06 04:31:09,370 INFO L188 LiptonReduction]: Number of co-enabled transitions 266 [2022-12-06 04:31:09,442 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:09,443 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 04:31:09,443 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 26 transitions, 92 flow [2022-12-06 04:31:09,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:09,443 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:09,443 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:09,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:31:09,443 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:31:09,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:09,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1071744412, now seen corresponding path program 1 times [2022-12-06 04:31:09,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:09,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302737713] [2022-12-06 04:31:09,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:09,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:10,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:31:10,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:10,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302737713] [2022-12-06 04:31:10,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302737713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:10,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:10,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:31:10,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226661773] [2022-12-06 04:31:10,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:10,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:31:10,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:10,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:31:10,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:31:10,361 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 04:31:10,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 26 transitions, 92 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:10,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:10,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 04:31:10,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:10,966 INFO L130 PetriNetUnfolder]: 3624/5148 cut-off events. [2022-12-06 04:31:10,966 INFO L131 PetriNetUnfolder]: For 1898/1922 co-relation queries the response was YES. [2022-12-06 04:31:10,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11910 conditions, 5148 events. 3624/5148 cut-off events. For 1898/1922 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 24704 event pairs, 2001 based on Foata normal form. 36/5148 useless extension candidates. Maximal degree in co-relation 11897. Up to 4171 conditions per place. [2022-12-06 04:31:10,981 INFO L137 encePairwiseOnDemand]: 20/24 looper letters, 47 selfloop transitions, 4 changer transitions 0/53 dead transitions. [2022-12-06 04:31:10,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 268 flow [2022-12-06 04:31:10,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:31:10,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:31:10,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-06 04:31:10,982 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-06 04:31:10,982 INFO L175 Difference]: Start difference. First operand has 40 places, 26 transitions, 92 flow. Second operand 4 states and 54 transitions. [2022-12-06 04:31:10,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 268 flow [2022-12-06 04:31:10,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 260 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 04:31:10,985 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 109 flow [2022-12-06 04:31:10,985 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2022-12-06 04:31:10,986 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 7 predicate places. [2022-12-06 04:31:10,986 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:10,986 INFO L89 Accepts]: Start accepts. Operand has 44 places, 28 transitions, 109 flow [2022-12-06 04:31:10,986 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:10,986 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:10,986 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 28 transitions, 109 flow [2022-12-06 04:31:10,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 28 transitions, 109 flow [2022-12-06 04:31:10,993 INFO L130 PetriNetUnfolder]: 1/51 cut-off events. [2022-12-06 04:31:10,993 INFO L131 PetriNetUnfolder]: For 37/46 co-relation queries the response was YES. [2022-12-06 04:31:10,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 51 events. 1/51 cut-off events. For 37/46 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 182 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 93. Up to 9 conditions per place. [2022-12-06 04:31:10,993 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 28 transitions, 109 flow [2022-12-06 04:31:10,994 INFO L188 LiptonReduction]: Number of co-enabled transitions 302 [2022-12-06 04:31:11,076 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:11,077 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 04:31:11,077 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 109 flow [2022-12-06 04:31:11,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:11,078 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:11,078 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:11,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:31:11,078 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:31:11,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:11,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1019295559, now seen corresponding path program 1 times [2022-12-06 04:31:11,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:11,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424261249] [2022-12-06 04:31:11,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:11,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:11,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:31:11,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:11,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424261249] [2022-12-06 04:31:11,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424261249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:11,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:11,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:31:11,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808409554] [2022-12-06 04:31:11,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:11,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:31:11,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:11,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:31:11,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:31:11,195 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 04:31:11,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:11,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:11,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 04:31:11,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:11,592 INFO L130 PetriNetUnfolder]: 2600/3807 cut-off events. [2022-12-06 04:31:11,592 INFO L131 PetriNetUnfolder]: For 1609/1632 co-relation queries the response was YES. [2022-12-06 04:31:11,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9327 conditions, 3807 events. 2600/3807 cut-off events. For 1609/1632 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 18185 event pairs, 584 based on Foata normal form. 112/3907 useless extension candidates. Maximal degree in co-relation 9311. Up to 3367 conditions per place. [2022-12-06 04:31:11,603 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 40 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2022-12-06 04:31:11,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 47 transitions, 261 flow [2022-12-06 04:31:11,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:31:11,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:31:11,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 04:31:11,604 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5972222222222222 [2022-12-06 04:31:11,605 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 109 flow. Second operand 3 states and 43 transitions. [2022-12-06 04:31:11,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 47 transitions, 261 flow [2022-12-06 04:31:11,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 256 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:31:11,606 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 139 flow [2022-12-06 04:31:11,607 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2022-12-06 04:31:11,607 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 9 predicate places. [2022-12-06 04:31:11,607 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:11,607 INFO L89 Accepts]: Start accepts. Operand has 46 places, 32 transitions, 139 flow [2022-12-06 04:31:11,608 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:11,608 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:11,608 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 32 transitions, 139 flow [2022-12-06 04:31:11,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 32 transitions, 139 flow [2022-12-06 04:31:11,632 INFO L130 PetriNetUnfolder]: 125/320 cut-off events. [2022-12-06 04:31:11,632 INFO L131 PetriNetUnfolder]: For 268/292 co-relation queries the response was YES. [2022-12-06 04:31:11,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 320 events. 125/320 cut-off events. For 268/292 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1881 event pairs, 62 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 694. Up to 212 conditions per place. [2022-12-06 04:31:11,634 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 32 transitions, 139 flow [2022-12-06 04:31:11,634 INFO L188 LiptonReduction]: Number of co-enabled transitions 356 [2022-12-06 04:31:11,662 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:11,663 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-06 04:31:11,663 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 139 flow [2022-12-06 04:31:11,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:11,664 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:11,664 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:11,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:31:11,664 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:31:11,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:11,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1726912842, now seen corresponding path program 1 times [2022-12-06 04:31:11,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:11,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991462589] [2022-12-06 04:31:11,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:11,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:11,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:31:11,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:11,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991462589] [2022-12-06 04:31:11,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991462589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:11,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:11,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:31:11,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126172174] [2022-12-06 04:31:11,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:11,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:31:11,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:11,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:31:11,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:31:11,812 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 04:31:11,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:11,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:11,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 04:31:11,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:12,067 INFO L130 PetriNetUnfolder]: 1454/2255 cut-off events. [2022-12-06 04:31:12,067 INFO L131 PetriNetUnfolder]: For 1012/1023 co-relation queries the response was YES. [2022-12-06 04:31:12,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6448 conditions, 2255 events. 1454/2255 cut-off events. For 1012/1023 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10565 event pairs, 276 based on Foata normal form. 164/2407 useless extension candidates. Maximal degree in co-relation 6430. Up to 1209 conditions per place. [2022-12-06 04:31:12,076 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 52 selfloop transitions, 9 changer transitions 0/63 dead transitions. [2022-12-06 04:31:12,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 63 transitions, 370 flow [2022-12-06 04:31:12,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:31:12,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:31:12,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-06 04:31:12,077 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2022-12-06 04:31:12,077 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 139 flow. Second operand 4 states and 58 transitions. [2022-12-06 04:31:12,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 63 transitions, 370 flow [2022-12-06 04:31:12,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 63 transitions, 365 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:31:12,079 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 186 flow [2022-12-06 04:31:12,079 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2022-12-06 04:31:12,080 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 12 predicate places. [2022-12-06 04:31:12,080 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:12,080 INFO L89 Accepts]: Start accepts. Operand has 49 places, 36 transitions, 186 flow [2022-12-06 04:31:12,081 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:12,081 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:12,081 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 36 transitions, 186 flow [2022-12-06 04:31:12,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 36 transitions, 186 flow [2022-12-06 04:31:12,112 INFO L130 PetriNetUnfolder]: 85/242 cut-off events. [2022-12-06 04:31:12,112 INFO L131 PetriNetUnfolder]: For 222/266 co-relation queries the response was YES. [2022-12-06 04:31:12,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718 conditions, 242 events. 85/242 cut-off events. For 222/266 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1272 event pairs, 17 based on Foata normal form. 8/242 useless extension candidates. Maximal degree in co-relation 701. Up to 158 conditions per place. [2022-12-06 04:31:12,114 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 36 transitions, 186 flow [2022-12-06 04:31:12,115 INFO L188 LiptonReduction]: Number of co-enabled transitions 414 [2022-12-06 04:31:12,185 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:12,185 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-06 04:31:12,185 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 186 flow [2022-12-06 04:31:12,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:12,186 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:12,186 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:12,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:31:12,186 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:31:12,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:12,187 INFO L85 PathProgramCache]: Analyzing trace with hash -763096822, now seen corresponding path program 1 times [2022-12-06 04:31:12,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:12,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619210966] [2022-12-06 04:31:12,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:12,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:12,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:31:12,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:12,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619210966] [2022-12-06 04:31:12,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619210966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:12,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:12,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:31:12,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902642965] [2022-12-06 04:31:12,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:12,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:31:12,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:12,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:31:12,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:31:12,348 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 04:31:12,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:12,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:12,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 04:31:12,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:12,611 INFO L130 PetriNetUnfolder]: 1028/1601 cut-off events. [2022-12-06 04:31:12,611 INFO L131 PetriNetUnfolder]: For 1373/1378 co-relation queries the response was YES. [2022-12-06 04:31:12,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5160 conditions, 1601 events. 1028/1601 cut-off events. For 1373/1378 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7063 event pairs, 214 based on Foata normal form. 91/1680 useless extension candidates. Maximal degree in co-relation 5140. Up to 618 conditions per place. [2022-12-06 04:31:12,619 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 62 selfloop transitions, 13 changer transitions 0/77 dead transitions. [2022-12-06 04:31:12,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 77 transitions, 483 flow [2022-12-06 04:31:12,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:31:12,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:31:12,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-12-06 04:31:12,620 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2022-12-06 04:31:12,620 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 186 flow. Second operand 5 states and 73 transitions. [2022-12-06 04:31:12,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 77 transitions, 483 flow [2022-12-06 04:31:12,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 77 transitions, 465 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 04:31:12,623 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 236 flow [2022-12-06 04:31:12,623 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=236, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2022-12-06 04:31:12,624 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 15 predicate places. [2022-12-06 04:31:12,624 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:12,624 INFO L89 Accepts]: Start accepts. Operand has 52 places, 40 transitions, 236 flow [2022-12-06 04:31:12,625 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:12,625 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:12,625 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 40 transitions, 236 flow [2022-12-06 04:31:12,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 40 transitions, 236 flow [2022-12-06 04:31:12,641 INFO L130 PetriNetUnfolder]: 52/157 cut-off events. [2022-12-06 04:31:12,641 INFO L131 PetriNetUnfolder]: For 232/266 co-relation queries the response was YES. [2022-12-06 04:31:12,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 157 events. 52/157 cut-off events. For 232/266 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 668 event pairs, 2 based on Foata normal form. 9/159 useless extension candidates. Maximal degree in co-relation 525. Up to 94 conditions per place. [2022-12-06 04:31:12,642 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 40 transitions, 236 flow [2022-12-06 04:31:12,642 INFO L188 LiptonReduction]: Number of co-enabled transitions 406 [2022-12-06 04:31:12,644 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:12,645 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 04:31:12,645 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 236 flow [2022-12-06 04:31:12,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:12,645 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:12,645 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:12,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:31:12,645 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:31:12,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:12,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1632939351, now seen corresponding path program 1 times [2022-12-06 04:31:12,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:12,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96387621] [2022-12-06 04:31:12,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:12,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:13,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:31:13,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:13,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96387621] [2022-12-06 04:31:13,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96387621] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:13,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:13,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:31:13,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269950483] [2022-12-06 04:31:13,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:13,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:31:13,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:13,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:31:13,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:31:13,804 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 04:31:13,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:13,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:13,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 04:31:13,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:14,155 INFO L130 PetriNetUnfolder]: 1402/2192 cut-off events. [2022-12-06 04:31:14,156 INFO L131 PetriNetUnfolder]: For 2629/2631 co-relation queries the response was YES. [2022-12-06 04:31:14,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7078 conditions, 2192 events. 1402/2192 cut-off events. For 2629/2631 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 10547 event pairs, 484 based on Foata normal form. 2/2174 useless extension candidates. Maximal degree in co-relation 7057. Up to 1789 conditions per place. [2022-12-06 04:31:14,163 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 66 selfloop transitions, 12 changer transitions 0/80 dead transitions. [2022-12-06 04:31:14,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 80 transitions, 618 flow [2022-12-06 04:31:14,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:31:14,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:31:14,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-12-06 04:31:14,164 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-06 04:31:14,165 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 236 flow. Second operand 5 states and 56 transitions. [2022-12-06 04:31:14,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 80 transitions, 618 flow [2022-12-06 04:31:14,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 80 transitions, 536 flow, removed 20 selfloop flow, removed 3 redundant places. [2022-12-06 04:31:14,176 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 272 flow [2022-12-06 04:31:14,176 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=272, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2022-12-06 04:31:14,176 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 18 predicate places. [2022-12-06 04:31:14,176 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:14,176 INFO L89 Accepts]: Start accepts. Operand has 55 places, 49 transitions, 272 flow [2022-12-06 04:31:14,177 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:14,177 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:14,177 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 49 transitions, 272 flow [2022-12-06 04:31:14,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 49 transitions, 272 flow [2022-12-06 04:31:14,212 INFO L130 PetriNetUnfolder]: 171/445 cut-off events. [2022-12-06 04:31:14,212 INFO L131 PetriNetUnfolder]: For 492/537 co-relation queries the response was YES. [2022-12-06 04:31:14,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1258 conditions, 445 events. 171/445 cut-off events. For 492/537 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2686 event pairs, 7 based on Foata normal form. 26/446 useless extension candidates. Maximal degree in co-relation 1238. Up to 143 conditions per place. [2022-12-06 04:31:14,215 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 49 transitions, 272 flow [2022-12-06 04:31:14,215 INFO L188 LiptonReduction]: Number of co-enabled transitions 550 [2022-12-06 04:31:14,280 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [760] $Ultimate##0-->L827: Formula: (let ((.cse3 (= (mod v_~x$r_buff1_thd3~0_99 256) 0)) (.cse4 (= (mod v_~x$w_buff1_used~0_265 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_267 256) 0)) (.cse14 (= (mod v_~x$r_buff0_thd3~0_108 256) 0))) (let ((.cse13 (= (mod v_~weak$$choice2~0_90 256) 0)) (.cse15 (select |v_#memory_int_342| |v_~#x~0.base_187|)) (.cse2 (not .cse14)) (.cse1 (not .cse16)) (.cse11 (and .cse4 .cse14)) (.cse12 (and .cse3 .cse14))) (let ((.cse6 (or .cse16 .cse11 .cse12)) (.cse0 (and .cse2 .cse1)) (.cse5 (select .cse15 |v_~#x~0.offset_187|)) (.cse7 (not .cse13)) (.cse9 (= (mod v_~x$w_buff1_used~0_264 256) 0)) (.cse10 (= (mod v_~x$w_buff0_used~0_266 256) 0))) (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~x$w_buff1~0_119 v_~x$w_buff1~0_118) (or (and (= (ite .cse0 v_~x$w_buff0~0_113 v_~x$w_buff1~0_119) v_~__unbuffered_p2_EAX~0_69) (= |v_P2Thread1of1ForFork0_#t~mem17_6| |v_P2_#t~mem17_37|) .cse1 (or .cse2 (not .cse3)) (or .cse2 (not .cse4))) (and (= |v_P2_#t~mem17_37| v_~__unbuffered_p2_EAX~0_69) (= .cse5 |v_P2_#t~mem17_37|) .cse6)) (= (ite .cse7 v_~x$w_buff0_used~0_267 (ite .cse6 v_~x$w_buff0_used~0_267 (ite .cse0 0 v_~x$w_buff0_used~0_267))) v_~x$w_buff0_used~0_266) (= v_~x$r_buff1_thd3~0_98 (ite .cse7 v_~x$r_buff1_thd3~0_99 (ite (let ((.cse8 (= 0 (mod v_~x$r_buff0_thd3~0_107 256)))) (or (and .cse8 .cse9) (and .cse8 .cse3) .cse10)) v_~x$r_buff1_thd3~0_99 0))) (= v_~x$flush_delayed~0_78 0) (= v_~weak$$choice2~0_90 |v_P2Thread1of1ForFork0_#t~nondet15_6|) (= .cse5 v_~x$mem_tmp~0_48) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= (ite .cse7 v_~x$w_buff1_used~0_265 (ite (or .cse11 .cse12 .cse10) v_~x$w_buff1_used~0_265 0)) v_~x$w_buff1_used~0_264) (= |v_~#x~0.offset_187| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_52) (= v_~x$w_buff0~0_113 v_~x$w_buff0~0_112) (or (and (= |v_P2_#t~ite21_36| v_~x$mem_tmp~0_48) .cse7 (= |v_P2Thread1of1ForFork0_#t~mem20_6| |v_P2_#t~mem20_35|)) (and (= |v_P2_#t~mem20_35| v_~__unbuffered_p2_EAX~0_69) .cse13 (= |v_P2_#t~ite21_36| |v_P2_#t~mem20_35|))) (= v_~weak$$choice0~0_34 |v_P2Thread1of1ForFork0_#t~nondet14_6|) (= v_~__unbuffered_p2_EAX$read_delayed~0_57 1) (= (ite .cse7 v_~x$r_buff0_thd3~0_108 (ite (or .cse12 (and .cse9 .cse14) .cse10) v_~x$r_buff0_thd3~0_108 (ite (and .cse2 (not .cse10)) 0 v_~x$r_buff0_thd3~0_108))) v_~x$r_buff0_thd3~0_107) (= |v_~#x~0.base_187| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_52) (= (store |v_#memory_int_342| |v_~#x~0.base_187| (store .cse15 |v_~#x~0.offset_187| |v_P2_#t~ite21_36|)) |v_#memory_int_341|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_113, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~#x~0.offset=|v_~#x~0.offset_187|, ~x$w_buff1~0=v_~x$w_buff1~0_119, P2Thread1of1ForFork0_#t~mem17=|v_P2Thread1of1ForFork0_#t~mem17_6|, P2Thread1of1ForFork0_#t~nondet15=|v_P2Thread1of1ForFork0_#t~nondet15_6|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_99, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_265, P2Thread1of1ForFork0_#t~nondet14=|v_P2Thread1of1ForFork0_#t~nondet14_6|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_267, #memory_int=|v_#memory_int_342|, ~#x~0.base=|v_~#x~0.base_187|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_6|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_112, P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_5|, P2Thread1of1ForFork0_#t~mem16=|v_P2Thread1of1ForFork0_#t~mem16_5|, ~x$flush_delayed~0=v_~x$flush_delayed~0_78, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_52, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_52, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_98, ~x$mem_tmp~0=v_~x$mem_tmp~0_48, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_107, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_5|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_69, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~#x~0.offset=|v_~#x~0.offset_187|, ~x$w_buff1~0=v_~x$w_buff1~0_118, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_264, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_57, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_266, ~weak$$choice0~0=v_~weak$$choice0~0_34, #memory_int=|v_#memory_int_341|, ~#x~0.base=|v_~#x~0.base_187|, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_5|, ~weak$$choice2~0=v_~weak$$choice2~0_90, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[|v_P2_#t~mem17_37|, |v_P2_#t~ite21_36|, |v_P2_#t~mem20_35|] AssignedVars[~x$w_buff0~0, P2Thread1of1ForFork0_#t~mem19, P2Thread1of1ForFork0_#t~mem16, ~x$flush_delayed~0, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, ~__unbuffered_p2_EAX$read_delayed_var~0.base, P2Thread1of1ForFork0_#t~mem17, ~x$r_buff1_thd3~0, ~x$mem_tmp~0, ~x$r_buff0_thd3~0, P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_#t~ite21, ~__unbuffered_p2_EAX~0, ~x$w_buff1~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~nondet15, ~x$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet14, ~__unbuffered_p2_EAX$read_delayed~0, ~x$w_buff0_used~0, ~weak$$choice0~0, #memory_int, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~mem20] and [687] $Ultimate##0-->L794: Formula: (and (= v_P1Thread1of1ForFork3_~arg.offset_5 |v_P1Thread1of1ForFork3_#in~arg.offset_5|) (= v_P1Thread1of1ForFork3_~arg.base_5 |v_P1Thread1of1ForFork3_#in~arg.base_5|) (= (store |v_#memory_int_274| |v_~#x~0.base_171| (store (select |v_#memory_int_274| |v_~#x~0.base_171|) |v_~#x~0.offset_171| 1)) |v_#memory_int_273|)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, ~#x~0.offset=|v_~#x~0.offset_171|, #memory_int=|v_#memory_int_274|, ~#x~0.base=|v_~#x~0.base_171|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_5, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_5, ~#x~0.offset=|v_~#x~0.offset_171|, #memory_int=|v_#memory_int_273|, ~#x~0.base=|v_~#x~0.base_171|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, #memory_int] [2022-12-06 04:31:14,827 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:31:14,828 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 652 [2022-12-06 04:31:14,828 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 278 flow [2022-12-06 04:31:14,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:14,828 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:14,828 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:14,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:31:14,828 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:31:14,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:14,829 INFO L85 PathProgramCache]: Analyzing trace with hash 2118174319, now seen corresponding path program 2 times [2022-12-06 04:31:14,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:14,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760628994] [2022-12-06 04:31:14,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:14,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:15,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:31:15,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:15,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760628994] [2022-12-06 04:31:15,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760628994] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:15,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:15,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:31:15,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577751667] [2022-12-06 04:31:15,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:15,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:31:15,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:15,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:31:15,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:31:15,671 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 04:31:15,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 278 flow. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:15,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:15,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 04:31:15,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:16,235 INFO L130 PetriNetUnfolder]: 2400/3866 cut-off events. [2022-12-06 04:31:16,235 INFO L131 PetriNetUnfolder]: For 5706/5725 co-relation queries the response was YES. [2022-12-06 04:31:16,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13896 conditions, 3866 events. 2400/3866 cut-off events. For 5706/5725 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 22169 event pairs, 585 based on Foata normal form. 2/3838 useless extension candidates. Maximal degree in co-relation 13873. Up to 1827 conditions per place. [2022-12-06 04:31:16,248 INFO L137 encePairwiseOnDemand]: 14/25 looper letters, 86 selfloop transitions, 20 changer transitions 51/159 dead transitions. [2022-12-06 04:31:16,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 159 transitions, 1235 flow [2022-12-06 04:31:16,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:31:16,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:31:16,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2022-12-06 04:31:16,250 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48 [2022-12-06 04:31:16,250 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 278 flow. Second operand 7 states and 84 transitions. [2022-12-06 04:31:16,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 159 transitions, 1235 flow [2022-12-06 04:31:16,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 159 transitions, 1228 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 04:31:16,272 INFO L231 Difference]: Finished difference. Result has 64 places, 63 transitions, 460 flow [2022-12-06 04:31:16,272 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=460, PETRI_PLACES=64, PETRI_TRANSITIONS=63} [2022-12-06 04:31:16,274 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 27 predicate places. [2022-12-06 04:31:16,274 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:16,274 INFO L89 Accepts]: Start accepts. Operand has 64 places, 63 transitions, 460 flow [2022-12-06 04:31:16,277 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:16,277 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:16,277 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 63 transitions, 460 flow [2022-12-06 04:31:16,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 63 transitions, 460 flow [2022-12-06 04:31:16,371 INFO L130 PetriNetUnfolder]: 516/1192 cut-off events. [2022-12-06 04:31:16,371 INFO L131 PetriNetUnfolder]: For 2119/2368 co-relation queries the response was YES. [2022-12-06 04:31:16,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3832 conditions, 1192 events. 516/1192 cut-off events. For 2119/2368 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 8627 event pairs, 49 based on Foata normal form. 94/1204 useless extension candidates. Maximal degree in co-relation 3807. Up to 434 conditions per place. [2022-12-06 04:31:16,380 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 63 transitions, 460 flow [2022-12-06 04:31:16,380 INFO L188 LiptonReduction]: Number of co-enabled transitions 706 [2022-12-06 04:31:16,384 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:16,384 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110 [2022-12-06 04:31:16,384 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 460 flow [2022-12-06 04:31:16,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:16,385 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:16,385 INFO L213 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-06 04:31:16,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:31:16,385 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:31:16,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:16,385 INFO L85 PathProgramCache]: Analyzing trace with hash 500714304, now seen corresponding path program 1 times [2022-12-06 04:31:16,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:16,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340798135] [2022-12-06 04:31:16,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:16,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:17,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:31:17,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:17,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340798135] [2022-12-06 04:31:17,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340798135] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:17,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:17,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 04:31:17,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318404576] [2022-12-06 04:31:17,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:17,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 04:31:17,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:17,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 04:31:17,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-06 04:31:17,934 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 04:31:17,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 460 flow. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:17,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:17,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 04:31:17,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:18,553 INFO L130 PetriNetUnfolder]: 2166/3477 cut-off events. [2022-12-06 04:31:18,554 INFO L131 PetriNetUnfolder]: For 8048/8073 co-relation queries the response was YES. [2022-12-06 04:31:18,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14353 conditions, 3477 events. 2166/3477 cut-off events. For 8048/8073 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 19331 event pairs, 520 based on Foata normal form. 3/3453 useless extension candidates. Maximal degree in co-relation 14325. Up to 2309 conditions per place. [2022-12-06 04:31:18,565 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 89 selfloop transitions, 17 changer transitions 0/108 dead transitions. [2022-12-06 04:31:18,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 108 transitions, 951 flow [2022-12-06 04:31:18,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:31:18,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:31:18,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-12-06 04:31:18,566 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.448 [2022-12-06 04:31:18,566 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 460 flow. Second operand 5 states and 56 transitions. [2022-12-06 04:31:18,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 108 transitions, 951 flow [2022-12-06 04:31:18,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 108 transitions, 940 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 04:31:18,588 INFO L231 Difference]: Finished difference. Result has 66 places, 68 transitions, 557 flow [2022-12-06 04:31:18,588 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=557, PETRI_PLACES=66, PETRI_TRANSITIONS=68} [2022-12-06 04:31:18,588 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 29 predicate places. [2022-12-06 04:31:18,588 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:18,589 INFO L89 Accepts]: Start accepts. Operand has 66 places, 68 transitions, 557 flow [2022-12-06 04:31:18,589 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:18,589 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:18,590 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 68 transitions, 557 flow [2022-12-06 04:31:18,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 68 transitions, 557 flow [2022-12-06 04:31:18,686 INFO L130 PetriNetUnfolder]: 486/1164 cut-off events. [2022-12-06 04:31:18,687 INFO L131 PetriNetUnfolder]: For 2754/3098 co-relation queries the response was YES. [2022-12-06 04:31:18,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4015 conditions, 1164 events. 486/1164 cut-off events. For 2754/3098 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 8567 event pairs, 57 based on Foata normal form. 103/1189 useless extension candidates. Maximal degree in co-relation 3988. Up to 413 conditions per place. [2022-12-06 04:31:18,696 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 68 transitions, 557 flow [2022-12-06 04:31:18,696 INFO L188 LiptonReduction]: Number of co-enabled transitions 776 [2022-12-06 04:31:18,699 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:18,699 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-06 04:31:18,700 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 68 transitions, 557 flow [2022-12-06 04:31:18,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:18,700 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:18,700 INFO L213 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-06 04:31:18,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:31:18,700 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:31:18,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:18,700 INFO L85 PathProgramCache]: Analyzing trace with hash -148944460, now seen corresponding path program 2 times [2022-12-06 04:31:18,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:18,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340080927] [2022-12-06 04:31:18,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:18,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:18,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:31:18,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:18,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340080927] [2022-12-06 04:31:18,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340080927] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:18,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:18,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:31:18,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84387274] [2022-12-06 04:31:18,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:18,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:31:18,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:18,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:31:18,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:31:18,874 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 04:31:18,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 68 transitions, 557 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:18,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:18,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 04:31:18,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:19,368 INFO L130 PetriNetUnfolder]: 2029/3170 cut-off events. [2022-12-06 04:31:19,368 INFO L131 PetriNetUnfolder]: For 10975/10985 co-relation queries the response was YES. [2022-12-06 04:31:19,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14419 conditions, 3170 events. 2029/3170 cut-off events. For 10975/10985 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 17363 event pairs, 198 based on Foata normal form. 63/3214 useless extension candidates. Maximal degree in co-relation 14389. Up to 1270 conditions per place. [2022-12-06 04:31:19,388 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 122 selfloop transitions, 17 changer transitions 22/162 dead transitions. [2022-12-06 04:31:19,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 162 transitions, 1697 flow [2022-12-06 04:31:19,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:31:19,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:31:19,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-12-06 04:31:19,390 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5133333333333333 [2022-12-06 04:31:19,390 INFO L175 Difference]: Start difference. First operand has 66 places, 68 transitions, 557 flow. Second operand 6 states and 77 transitions. [2022-12-06 04:31:19,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 162 transitions, 1697 flow [2022-12-06 04:31:19,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 162 transitions, 1558 flow, removed 18 selfloop flow, removed 6 redundant places. [2022-12-06 04:31:19,439 INFO L231 Difference]: Finished difference. Result has 66 places, 62 transitions, 487 flow [2022-12-06 04:31:19,439 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=487, PETRI_PLACES=66, PETRI_TRANSITIONS=62} [2022-12-06 04:31:19,440 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 29 predicate places. [2022-12-06 04:31:19,440 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:19,440 INFO L89 Accepts]: Start accepts. Operand has 66 places, 62 transitions, 487 flow [2022-12-06 04:31:19,441 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:19,441 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:19,441 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 62 transitions, 487 flow [2022-12-06 04:31:19,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 62 transitions, 487 flow [2022-12-06 04:31:19,515 INFO L130 PetriNetUnfolder]: 224/536 cut-off events. [2022-12-06 04:31:19,515 INFO L131 PetriNetUnfolder]: For 1258/1395 co-relation queries the response was YES. [2022-12-06 04:31:19,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2009 conditions, 536 events. 224/536 cut-off events. For 1258/1395 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3294 event pairs, 22 based on Foata normal form. 8/508 useless extension candidates. Maximal degree in co-relation 1985. Up to 164 conditions per place. [2022-12-06 04:31:19,520 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 62 transitions, 487 flow [2022-12-06 04:31:19,520 INFO L188 LiptonReduction]: Number of co-enabled transitions 532 [2022-12-06 04:31:19,534 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [644] L767-->L783: Formula: (let ((.cse6 (= (mod v_~x$r_buff1_thd1~0_54 256) 0)) (.cse12 (= (mod v_~x$w_buff1_used~0_217 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_217 256) 0)) (.cse13 (= (mod v_~x$r_buff0_thd1~0_55 256) 0))) (let ((.cse4 (= 0 (mod v_~weak$$choice2~0_78 256))) (.cse10 (not .cse13)) (.cse11 (not .cse16)) (.cse15 (and .cse12 .cse13)) (.cse14 (and .cse13 .cse6)) (.cse3 (select |v_#memory_int_236| |v_~#x~0.base_159|))) (let ((.cse5 (select .cse3 |v_~#x~0.offset_159|)) (.cse1 (or .cse15 .cse14 .cse16)) (.cse2 (and .cse10 .cse11)) (.cse9 (= (mod v_~x$w_buff1_used~0_216 256) 0)) (.cse0 (not .cse4)) (.cse8 (= (mod v_~x$w_buff0_used~0_216 256) 0))) (and (= v_~x$w_buff1~0_90 v_~x$w_buff1~0_91) (= v_~x$w_buff0~0_87 v_~x$w_buff0~0_86) (= (ite .cse0 v_~x$w_buff0_used~0_217 (ite .cse1 v_~x$w_buff0_used~0_217 (ite .cse2 0 v_~x$w_buff0_used~0_217))) v_~x$w_buff0_used~0_216) (= v_~x$flush_delayed~0_68 0) (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_20) (= |v_#memory_int_235| (store |v_#memory_int_236| |v_~#x~0.base_159| (store .cse3 |v_~#x~0.offset_159| |v_P0_#t~ite10_29|))) (or (and (= v_~__unbuffered_p0_EBX~0_22 |v_P0_#t~mem9_32|) (= |v_P0_#t~ite10_29| |v_P0_#t~mem9_32|) .cse4) (and .cse0 (= |v_P0_#t~ite10_29| v_~x$mem_tmp~0_40) (= |v_P0_#t~mem9_32| |v_P0Thread1of1ForFork1_#t~mem9_1|))) (= .cse5 v_~x$mem_tmp~0_40) (= v_~x$r_buff1_thd1~0_53 (ite .cse0 v_~x$r_buff1_thd1~0_54 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd1~0_54 256) 0))) (or (and .cse6 .cse7) .cse8 (and .cse7 .cse9))) v_~x$r_buff1_thd1~0_54 0))) (or (and (= .cse5 |v_P0_#t~mem6_34|) (= v_~__unbuffered_p0_EBX~0_22 |v_P0_#t~mem6_34|) .cse1) (and (= (ite .cse2 v_~x$w_buff0~0_87 v_~x$w_buff1~0_91) v_~__unbuffered_p0_EBX~0_22) (or (not .cse6) .cse10) .cse11 (or (not .cse12) .cse10) (= |v_P0_#t~mem6_34| |v_P0Thread1of1ForFork1_#t~mem6_1|))) (= (ite .cse0 v_~x$r_buff0_thd1~0_55 (ite (or (and .cse13 .cse9) .cse14 .cse8) v_~x$r_buff0_thd1~0_55 (ite (and .cse10 (not .cse8)) 0 v_~x$r_buff0_thd1~0_55))) v_~x$r_buff0_thd1~0_54) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_78) (= (ite .cse0 v_~x$w_buff1_used~0_217 (ite (or .cse15 .cse14 .cse8) v_~x$w_buff1_used~0_217 0)) v_~x$w_buff1_used~0_216))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_87, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_55, ~#x~0.offset=|v_~#x~0.offset_159|, ~x$w_buff1~0=v_~x$w_buff1~0_91, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_217, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_54, P0Thread1of1ForFork1_#t~mem9=|v_P0Thread1of1ForFork1_#t~mem9_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_217, P0Thread1of1ForFork1_#t~mem6=|v_P0Thread1of1ForFork1_#t~mem6_1|, #memory_int=|v_#memory_int_236|, ~#x~0.base=|v_~#x~0.base_159|, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_86, P0Thread1of1ForFork1_#t~ite10=|v_P0Thread1of1ForFork1_#t~ite10_1|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_54, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_22, ~x$flush_delayed~0=v_~x$flush_delayed~0_68, ~#x~0.offset=|v_~#x~0.offset_159|, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_216, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_53, ~x$mem_tmp~0=v_~x$mem_tmp~0_40, P0Thread1of1ForFork1_#t~mem8=|v_P0Thread1of1ForFork1_#t~mem8_1|, P0Thread1of1ForFork1_#t~mem5=|v_P0Thread1of1ForFork1_#t~mem5_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_216, ~weak$$choice0~0=v_~weak$$choice0~0_20, P0Thread1of1ForFork1_#t~ite7=|v_P0Thread1of1ForFork1_#t~ite7_1|, #memory_int=|v_#memory_int_235|, ~#x~0.base=|v_~#x~0.base_159|, ~weak$$choice2~0=v_~weak$$choice2~0_78} AuxVars[|v_P0_#t~mem9_32|, |v_P0_#t~ite10_29|, |v_P0_#t~mem6_34|] AssignedVars[~x$w_buff0~0, P0Thread1of1ForFork1_#t~ite10, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~mem9, ~x$mem_tmp~0, P0Thread1of1ForFork1_#t~mem8, P0Thread1of1ForFork1_#t~mem5, ~x$w_buff0_used~0, P0Thread1of1ForFork1_#t~mem6, ~weak$$choice0~0, P0Thread1of1ForFork1_#t~ite7, #memory_int, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4] and [657] L830-->L837: Formula: (let ((.cse8 (= (mod v_~x$r_buff0_thd3~0_80 256) 0))) (let ((.cse7 (= (mod v_~x$w_buff0_used~0_221 256) 0)) (.cse10 (= (mod v_~x$w_buff1_used~0_221 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd3~0_79 256) 0)) (.cse5 (not (= (mod v_~x$w_buff0_used~0_220 256) 0))) (.cse4 (not .cse8))) (let ((.cse0 (and .cse5 .cse4)) (.cse1 (not .cse11)) (.cse2 (not .cse10)) (.cse6 (select |v_#memory_int_240| |v_~#x~0.base_161|)) (.cse3 (not .cse7))) (and (= v_~x$w_buff1_used~0_220 (ite (or .cse0 (and .cse1 .cse2)) 0 v_~x$w_buff1_used~0_221)) (= v_~x$r_buff0_thd3~0_79 (ite .cse0 0 v_~x$r_buff0_thd3~0_80)) (= (ite (and .cse3 .cse4) 0 v_~x$w_buff0_used~0_221) v_~x$w_buff0_used~0_220) (= (ite (or (and .cse5 (not (= (mod v_~x$r_buff0_thd3~0_79 256) 0))) (and .cse1 (not (= 0 (mod v_~x$w_buff1_used~0_220 256))))) 0 v_~x$r_buff1_thd3~0_79) v_~x$r_buff1_thd3~0_78) (= (store |v_#memory_int_240| |v_~#x~0.base_161| (store .cse6 |v_~#x~0.offset_161| |v_P2_#t~ite24_27|)) |v_#memory_int_239|) (let ((.cse9 (= |v_P2Thread1of1ForFork0_#t~mem22_1| |v_P2_#t~mem22_28|))) (or (and (or .cse7 .cse8) (= |v_P2_#t~ite24_27| |v_P2_#t~ite23_29|) (or (and .cse1 .cse9 (= |v_P2_#t~ite23_29| v_~x$w_buff1~0_94) .cse2) (and (or .cse10 .cse11) (= (select .cse6 |v_~#x~0.offset_161|) |v_P2_#t~mem22_28|) (= |v_P2_#t~ite23_29| |v_P2_#t~mem22_28|)))) (and .cse3 (= |v_P2_#t~ite23_29| |v_P2Thread1of1ForFork0_#t~ite23_1|) (= |v_P2_#t~ite24_27| v_~x$w_buff0~0_90) .cse4 .cse9))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_90, ~#x~0.offset=|v_~#x~0.offset_161|, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_1|, ~x$w_buff1~0=v_~x$w_buff1~0_94, #memory_int=|v_#memory_int_240|, ~#x~0.base=|v_~#x~0.base_161|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_79, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_221, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_1|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_80, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_221} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_90, ~#x~0.offset=|v_~#x~0.offset_161|, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_1|, ~x$w_buff1~0=v_~x$w_buff1~0_94, #memory_int=|v_#memory_int_239|, ~#x~0.base=|v_~#x~0.base_161|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_78, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_220, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_79, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_220} AuxVars[|v_P2_#t~mem22_28|, |v_P2_#t~ite24_27|, |v_P2_#t~ite23_29|] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem22, ~x$r_buff0_thd3~0, ~x$w_buff0_used~0] [2022-12-06 04:31:21,449 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:31:21,450 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2010 [2022-12-06 04:31:21,450 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 501 flow [2022-12-06 04:31:21,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:21,450 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:21,450 INFO L213 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-06 04:31:21,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 04:31:21,450 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:31:21,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:21,451 INFO L85 PathProgramCache]: Analyzing trace with hash -267582186, now seen corresponding path program 1 times [2022-12-06 04:31:21,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:21,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387412094] [2022-12-06 04:31:21,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:21,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:21,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:31:21,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:21,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387412094] [2022-12-06 04:31:21,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387412094] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:21,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:21,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:31:21,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286547932] [2022-12-06 04:31:21,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:21,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:31:21,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:21,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:31:21,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:31:21,610 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 04:31:21,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 501 flow. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:21,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:21,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 04:31:21,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:21,965 INFO L130 PetriNetUnfolder]: 1699/2685 cut-off events. [2022-12-06 04:31:21,966 INFO L131 PetriNetUnfolder]: For 9980/9980 co-relation queries the response was YES. [2022-12-06 04:31:21,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12486 conditions, 2685 events. 1699/2685 cut-off events. For 9980/9980 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 13811 event pairs, 258 based on Foata normal form. 2/2687 useless extension candidates. Maximal degree in co-relation 12459. Up to 954 conditions per place. [2022-12-06 04:31:21,981 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 67 selfloop transitions, 2 changer transitions 73/142 dead transitions. [2022-12-06 04:31:21,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 142 transitions, 1458 flow [2022-12-06 04:31:21,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:31:21,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:31:21,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-06 04:31:21,982 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4461538461538462 [2022-12-06 04:31:21,982 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 501 flow. Second operand 5 states and 58 transitions. [2022-12-06 04:31:21,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 142 transitions, 1458 flow [2022-12-06 04:31:22,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 142 transitions, 1316 flow, removed 31 selfloop flow, removed 7 redundant places. [2022-12-06 04:31:22,012 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 415 flow [2022-12-06 04:31:22,012 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=415, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2022-12-06 04:31:22,013 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 27 predicate places. [2022-12-06 04:31:22,013 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:22,013 INFO L89 Accepts]: Start accepts. Operand has 64 places, 57 transitions, 415 flow [2022-12-06 04:31:22,015 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:22,015 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:22,016 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 57 transitions, 415 flow [2022-12-06 04:31:22,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 57 transitions, 415 flow [2022-12-06 04:31:22,052 INFO L130 PetriNetUnfolder]: 177/428 cut-off events. [2022-12-06 04:31:22,052 INFO L131 PetriNetUnfolder]: For 972/1046 co-relation queries the response was YES. [2022-12-06 04:31:22,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1420 conditions, 428 events. 177/428 cut-off events. For 972/1046 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 2447 event pairs, 17 based on Foata normal form. 42/450 useless extension candidates. Maximal degree in co-relation 1398. Up to 128 conditions per place. [2022-12-06 04:31:22,056 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 57 transitions, 415 flow [2022-12-06 04:31:22,056 INFO L188 LiptonReduction]: Number of co-enabled transitions 374 [2022-12-06 04:33:09,645 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [780] $Ultimate##0-->L794: Formula: (let ((.cse9 (= (mod v_~x$r_buff1_thd3~0_213 256) 0)) (.cse10 (= (mod v_~x$w_buff1_used~0_616 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd3~0_244 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_637 256) 0))) (let ((.cse8 (not .cse16)) (.cse6 (not .cse3)) (.cse14 (and .cse10 .cse3)) (.cse5 (and .cse9 .cse3)) (.cse1 (= (mod v_~weak$$choice2~0_149 256) 0)) (.cse15 (select |v_#memory_int_810| |v_~#x~0.base_364|))) (let ((.cse11 (select .cse15 |v_~#x~0.offset_364|)) (.cse2 (= (mod v_~x$w_buff1_used~0_615 256) 0)) (.cse4 (= (mod v_~x$w_buff0_used~0_636 256) 0)) (.cse0 (not .cse1)) (.cse12 (or .cse16 .cse14 .cse5)) (.cse7 (and .cse8 .cse6))) (and (= |v_P1Thread1of1ForFork3_#in~arg.base_88| v_P1Thread1of1ForFork3_~arg.base_88) (= v_~__unbuffered_p2_EAX$read_delayed~0_102 1) (or (and (= |v_P2_#t~ite21_58| v_~x$mem_tmp~0_109) (= |v_P2Thread1of1ForFork0_#t~mem20_36| |v_P2_#t~mem20_57|) .cse0) (and (= |v_P2_#t~ite21_58| |v_P2_#t~mem20_57|) .cse1 (= |v_P2_#t~mem20_57| v_~__unbuffered_p2_EAX~0_128))) (= v_~x$r_buff0_thd3~0_243 (ite .cse0 v_~x$r_buff0_thd3~0_244 (ite (or (and .cse2 .cse3) .cse4 .cse5) v_~x$r_buff0_thd3~0_244 (ite (and (not .cse4) .cse6) 0 v_~x$r_buff0_thd3~0_244)))) (= v_~weak$$choice2~0_149 |v_P2Thread1of1ForFork0_#t~nondet15_36|) (or (and (= (ite .cse7 v_~x$w_buff0~0_317 v_~x$w_buff1~0_338) v_~__unbuffered_p2_EAX~0_128) (= |v_P2Thread1of1ForFork0_#t~mem17_36| |v_P2_#t~mem17_59|) .cse8 (or (not .cse9) .cse6) (or .cse6 (not .cse10))) (and (= .cse11 |v_P2_#t~mem17_59|) .cse12 (= |v_P2_#t~mem17_59| v_~__unbuffered_p2_EAX~0_128))) (= v_~x$flush_delayed~0_139 0) (= .cse11 v_~x$mem_tmp~0_109) (= (ite .cse0 v_~x$r_buff1_thd3~0_213 (ite (let ((.cse13 (= (mod v_~x$r_buff0_thd3~0_243 256) 0))) (or (and .cse9 .cse13) (and .cse2 .cse13) .cse4)) v_~x$r_buff1_thd3~0_213 0)) v_~x$r_buff1_thd3~0_212) (= v_~x$w_buff0~0_317 v_~x$w_buff0~0_316) (= v_~x$w_buff1_used~0_615 (ite .cse0 v_~x$w_buff1_used~0_616 (ite (or .cse4 .cse14 .cse5) v_~x$w_buff1_used~0_616 0))) (= v_~x$w_buff1~0_338 v_~x$w_buff1~0_337) (= (store |v_#memory_int_810| |v_~#x~0.base_364| (store .cse15 |v_~#x~0.offset_364| 1)) |v_#memory_int_808|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_20| v_P2Thread1of1ForFork0_~arg.offset_20) (= |v_P2Thread1of1ForFork0_#t~nondet14_36| v_~weak$$choice0~0_93) (= |v_P2Thread1of1ForFork0_#in~arg.base_20| v_P2Thread1of1ForFork0_~arg.base_20) (= v_~x$w_buff0_used~0_636 (ite .cse0 v_~x$w_buff0_used~0_637 (ite .cse12 v_~x$w_buff0_used~0_637 (ite .cse7 0 v_~x$w_buff0_used~0_637)))) (= |v_~#x~0.offset_364| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_103) (= |v_P1Thread1of1ForFork3_#in~arg.offset_88| v_P1Thread1of1ForFork3_~arg.offset_88) (= v_~__unbuffered_p2_EAX$read_delayed_var~0.base_103 |v_~#x~0.base_364|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_317, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_20|, ~#x~0.offset=|v_~#x~0.offset_364|, ~x$w_buff1~0=v_~x$w_buff1~0_338, P2Thread1of1ForFork0_#t~mem17=|v_P2Thread1of1ForFork0_#t~mem17_36|, P2Thread1of1ForFork0_#t~nondet15=|v_P2Thread1of1ForFork0_#t~nondet15_36|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_213, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_616, P2Thread1of1ForFork0_#t~nondet14=|v_P2Thread1of1ForFork0_#t~nondet14_36|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_244, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_637, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_88|, #memory_int=|v_#memory_int_810|, ~#x~0.base=|v_~#x~0.base_364|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_88|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_20|, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_36|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_316, P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_20|, P2Thread1of1ForFork0_#t~mem16=|v_P2Thread1of1ForFork0_#t~mem16_20|, ~x$flush_delayed~0=v_~x$flush_delayed~0_139, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_103, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_103, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_212, ~x$mem_tmp~0=v_~x$mem_tmp~0_109, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_243, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_88|, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_20, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_20|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_128, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_88, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_20|, ~#x~0.offset=|v_~#x~0.offset_364|, ~x$w_buff1~0=v_~x$w_buff1~0_337, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_615, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_102, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_636, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_88, ~weak$$choice0~0=v_~weak$$choice0~0_93, #memory_int=|v_#memory_int_808|, ~#x~0.base=|v_~#x~0.base_364|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_88|, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_20|, ~weak$$choice2~0=v_~weak$$choice2~0_149, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_20|} AuxVars[|v_P2_#t~mem17_59|, |v_P2_#t~ite21_58|, |v_P2_#t~mem20_57|] AssignedVars[~x$w_buff0~0, P2Thread1of1ForFork0_#t~mem19, P2Thread1of1ForFork0_#t~mem16, ~x$flush_delayed~0, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, ~__unbuffered_p2_EAX$read_delayed_var~0.base, P2Thread1of1ForFork0_#t~mem17, ~x$r_buff1_thd3~0, ~x$mem_tmp~0, ~x$r_buff0_thd3~0, P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_#t~ite21, ~__unbuffered_p2_EAX~0, P1Thread1of1ForFork3_~arg.base, ~x$w_buff1~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~nondet15, ~x$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet14, ~__unbuffered_p2_EAX$read_delayed~0, ~x$w_buff0_used~0, P1Thread1of1ForFork3_~arg.offset, ~weak$$choice0~0, #memory_int, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~mem20] and [656] L827-->L830: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0] [2022-12-06 04:33:10,981 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:33:10,981 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108968 [2022-12-06 04:33:10,981 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 427 flow [2022-12-06 04:33:10,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:33:10,982 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:33:10,982 INFO L213 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-06 04:33:10,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 04:33:10,982 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:33:10,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:33:10,982 INFO L85 PathProgramCache]: Analyzing trace with hash -2081272608, now seen corresponding path program 1 times [2022-12-06 04:33:10,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:33:10,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565175227] [2022-12-06 04:33:10,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:33:10,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:33:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:33:12,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:33:12,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:33:12,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565175227] [2022-12-06 04:33:12,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565175227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:33:12,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:33:12,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:33:12,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328393410] [2022-12-06 04:33:12,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:33:12,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 04:33:12,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:33:12,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 04:33:12,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 04:33:12,378 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 04:33:12,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 427 flow. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:33:12,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:33:12,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 04:33:12,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:33:12,719 INFO L130 PetriNetUnfolder]: 666/1115 cut-off events. [2022-12-06 04:33:12,719 INFO L131 PetriNetUnfolder]: For 3713/3713 co-relation queries the response was YES. [2022-12-06 04:33:12,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4988 conditions, 1115 events. 666/1115 cut-off events. For 3713/3713 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5286 event pairs, 154 based on Foata normal form. 1/1116 useless extension candidates. Maximal degree in co-relation 4963. Up to 771 conditions per place. [2022-12-06 04:33:12,725 INFO L137 encePairwiseOnDemand]: 17/27 looper letters, 65 selfloop transitions, 12 changer transitions 20/97 dead transitions. [2022-12-06 04:33:12,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 97 transitions, 889 flow [2022-12-06 04:33:12,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:33:12,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:33:12,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2022-12-06 04:33:12,726 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32098765432098764 [2022-12-06 04:33:12,726 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 427 flow. Second operand 6 states and 52 transitions. [2022-12-06 04:33:12,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 97 transitions, 889 flow [2022-12-06 04:33:12,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 97 transitions, 865 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-06 04:33:12,736 INFO L231 Difference]: Finished difference. Result has 62 places, 55 transitions, 445 flow [2022-12-06 04:33:12,737 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=445, PETRI_PLACES=62, PETRI_TRANSITIONS=55} [2022-12-06 04:33:12,737 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 25 predicate places. [2022-12-06 04:33:12,737 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:33:12,737 INFO L89 Accepts]: Start accepts. Operand has 62 places, 55 transitions, 445 flow [2022-12-06 04:33:12,738 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:33:12,738 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:33:12,738 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 55 transitions, 445 flow [2022-12-06 04:33:12,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 55 transitions, 445 flow [2022-12-06 04:33:12,787 INFO L130 PetriNetUnfolder]: 227/513 cut-off events. [2022-12-06 04:33:12,787 INFO L131 PetriNetUnfolder]: For 1348/1428 co-relation queries the response was YES. [2022-12-06 04:33:12,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1747 conditions, 513 events. 227/513 cut-off events. For 1348/1428 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 3130 event pairs, 19 based on Foata normal form. 43/527 useless extension candidates. Maximal degree in co-relation 1724. Up to 168 conditions per place. [2022-12-06 04:33:12,790 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 55 transitions, 445 flow [2022-12-06 04:33:12,790 INFO L188 LiptonReduction]: Number of co-enabled transitions 350 [2022-12-06 04:33:12,791 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:33:12,792 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-06 04:33:12,792 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 55 transitions, 445 flow [2022-12-06 04:33:12,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:33:12,792 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:33:12,792 INFO L213 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-06 04:33:12,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 04:33:12,792 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:33:12,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:33:12,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1179985954, now seen corresponding path program 1 times [2022-12-06 04:33:12,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:33:12,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120791075] [2022-12-06 04:33:12,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:33:12,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:33:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:33:12,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:33:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:33:12,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:33:12,988 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:33:12,989 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 04:33:12,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-06 04:33:12,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 04:33:12,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 04:33:12,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-06 04:33:12,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 04:33:12,994 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:33:12,998 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:33:12,998 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:33:13,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:33:13 BasicIcfg [2022-12-06 04:33:13,088 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:33:13,088 INFO L158 Benchmark]: Toolchain (without parser) took 136838.92ms. Allocated memory was 185.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 160.3MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 105.9MB. Max. memory is 8.0GB. [2022-12-06 04:33:13,088 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 185.6MB. Free memory was 162.1MB in the beginning and 162.0MB in the end (delta: 87.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:33:13,088 INFO L158 Benchmark]: CACSL2BoogieTranslator took 428.84ms. Allocated memory is still 185.6MB. Free memory was 159.8MB in the beginning and 131.4MB in the end (delta: 28.4MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 04:33:13,088 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.88ms. Allocated memory is still 185.6MB. Free memory was 131.4MB in the beginning and 128.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:33:13,089 INFO L158 Benchmark]: Boogie Preprocessor took 50.02ms. Allocated memory is still 185.6MB. Free memory was 128.9MB in the beginning and 126.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:33:13,089 INFO L158 Benchmark]: RCFGBuilder took 892.79ms. Allocated memory was 185.6MB in the beginning and 229.6MB in the end (delta: 44.0MB). Free memory was 126.2MB in the beginning and 200.0MB in the end (delta: -73.7MB). Peak memory consumption was 74.1MB. Max. memory is 8.0GB. [2022-12-06 04:33:13,089 INFO L158 Benchmark]: TraceAbstraction took 135400.67ms. Allocated memory was 229.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 199.4MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 100.0MB. Max. memory is 8.0GB. [2022-12-06 04:33:13,090 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 185.6MB. Free memory was 162.1MB in the beginning and 162.0MB in the end (delta: 87.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 428.84ms. Allocated memory is still 185.6MB. Free memory was 159.8MB in the beginning and 131.4MB in the end (delta: 28.4MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.88ms. Allocated memory is still 185.6MB. Free memory was 131.4MB in the beginning and 128.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.02ms. Allocated memory is still 185.6MB. Free memory was 128.9MB in the beginning and 126.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 892.79ms. Allocated memory was 185.6MB in the beginning and 229.6MB in the end (delta: 44.0MB). Free memory was 126.2MB in the beginning and 200.0MB in the end (delta: -73.7MB). Peak memory consumption was 74.1MB. Max. memory is 8.0GB. * TraceAbstraction took 135400.67ms. Allocated memory was 229.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 199.4MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 100.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.0s, 138 PlacesBefore, 37 PlacesAfterwards, 126 TransitionsBefore, 25 TransitionsAfterwards, 1836 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 61 TrivialYvCompositions, 40 ConcurrentYvCompositions, 0 ChoiceCompositions, 103 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1207, independent: 1127, independent conditional: 1127, independent unconditional: 0, dependent: 80, dependent conditional: 80, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1207, independent: 1127, independent conditional: 0, independent unconditional: 1127, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1207, independent: 1127, independent conditional: 0, independent unconditional: 1127, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1207, independent: 1127, independent conditional: 0, independent unconditional: 1127, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1039, independent: 998, independent conditional: 0, independent unconditional: 998, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1039, independent: 971, independent conditional: 0, independent unconditional: 971, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 68, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 245, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 220, dependent conditional: 0, dependent unconditional: 220, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1207, independent: 129, independent conditional: 0, independent unconditional: 129, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 1039, unknown conditional: 0, unknown unconditional: 1039] , Statistics on independence cache: Total cache size (in pairs): 1456, Positive cache size: 1415, Positive conditional cache size: 0, Positive unconditional cache size: 1415, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, 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, 33 PlacesBefore, 33 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 83, independent: 61, independent conditional: 61, 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: 83, independent: 61, independent conditional: 0, independent unconditional: 61, 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: 83, independent: 61, independent conditional: 0, independent unconditional: 61, 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: 83, independent: 61, independent conditional: 0, independent unconditional: 61, 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: 79, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 79, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 139, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 83, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 79, unknown conditional: 0, unknown unconditional: 79] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 59, Positive conditional cache size: 0, Positive unconditional cache size: 59, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 306 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 85, independent: 66, independent conditional: 66, 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: 85, independent: 66, independent conditional: 4, independent unconditional: 62, dependent: 19, dependent conditional: 1, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 85, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 19, dependent conditional: 1, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 85, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 19, dependent conditional: 1, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 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] ], Cache Queries: [ total: 85, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 59, Positive conditional cache size: 0, Positive unconditional cache size: 59, Negative cache size: 21, Negative conditional cache size: 1, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 304 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68, independent: 50, independent conditional: 50, 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: 68, independent: 50, independent conditional: 19, independent unconditional: 31, 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: 68, independent: 50, independent conditional: 0, independent unconditional: 50, 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: 68, independent: 50, independent conditional: 0, independent unconditional: 50, 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: 68, independent: 50, independent conditional: 0, independent unconditional: 50, 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): 80, Positive cache size: 59, Positive conditional cache size: 0, Positive unconditional cache size: 59, Negative cache size: 21, Negative conditional cache size: 1, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 49, independent conditional: 49, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 66, independent: 49, independent conditional: 8, independent unconditional: 41, dependent: 17, dependent conditional: 1, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, independent: 49, independent conditional: 0, independent unconditional: 49, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, independent: 49, independent conditional: 0, independent unconditional: 49, dependent: 17, dependent conditional: 0, dependent unconditional: 17, 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: 66, independent: 49, independent conditional: 0, independent unconditional: 49, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 59, Positive conditional cache size: 0, Positive unconditional cache size: 59, Negative cache size: 21, Negative conditional cache size: 1, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, independent: 65, independent conditional: 65, 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: 84, independent: 65, independent conditional: 38, independent unconditional: 27, dependent: 19, dependent conditional: 2, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 84, independent: 65, independent conditional: 0, independent unconditional: 65, 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: 84, independent: 65, independent conditional: 0, independent unconditional: 65, 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: 5, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 5, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 84, independent: 61, independent conditional: 0, independent unconditional: 61, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 63, Positive conditional cache size: 0, Positive unconditional cache size: 63, Negative cache size: 22, Negative conditional cache size: 1, Negative unconditional cache size: 21, 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.1s, 40 PlacesBefore, 40 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 67, independent: 46, independent conditional: 23, independent unconditional: 23, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 69, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 23, dependent conditional: 2, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 69, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 23, dependent conditional: 2, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 11, dependent conditional: 1, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 1, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 71, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 71, dependent conditional: 1, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 69, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 12, dependent conditional: 1, dependent unconditional: 11, unknown: 14, unknown conditional: 1, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 66, Positive conditional cache size: 0, Positive unconditional cache size: 66, 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: 25, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 44 PlacesBefore, 44 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88, independent: 67, independent conditional: 67, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 88, independent: 67, independent conditional: 48, independent unconditional: 19, dependent: 21, dependent conditional: 11, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 90, independent: 67, independent conditional: 23, independent unconditional: 44, dependent: 23, dependent conditional: 11, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90, independent: 67, independent conditional: 23, independent unconditional: 44, dependent: 23, dependent conditional: 11, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 8, independent conditional: 6, independent unconditional: 2, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 81, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 63, dependent conditional: 32, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 90, independent: 59, independent conditional: 17, independent unconditional: 42, dependent: 15, dependent conditional: 5, dependent unconditional: 10, unknown: 16, unknown conditional: 12, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 115, Positive cache size: 74, Positive conditional cache size: 6, Positive unconditional cache size: 68, Negative cache size: 41, Negative conditional cache size: 8, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 27, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 356 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, independent: 26, independent conditional: 26, 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: 45, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 19, dependent conditional: 10, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, independent: 26, independent conditional: 11, independent unconditional: 15, dependent: 21, dependent conditional: 10, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 26, independent conditional: 11, independent unconditional: 15, dependent: 21, dependent conditional: 10, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, independent: 26, independent conditional: 11, independent unconditional: 15, dependent: 19, dependent conditional: 10, dependent unconditional: 9, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 74, Positive conditional cache size: 6, Positive unconditional cache size: 68, Negative cache size: 43, Negative conditional cache size: 8, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 49 PlacesBefore, 49 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, independent: 57, independent conditional: 57, 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: 80, independent: 57, independent conditional: 33, independent unconditional: 24, dependent: 23, dependent conditional: 3, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 82, independent: 57, independent conditional: 14, independent unconditional: 43, dependent: 25, dependent conditional: 3, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 82, independent: 57, independent conditional: 14, independent unconditional: 43, dependent: 25, dependent conditional: 3, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 11, independent conditional: 1, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 68, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 82, independent: 46, independent conditional: 13, independent unconditional: 33, dependent: 21, dependent conditional: 3, dependent unconditional: 18, unknown: 15, unknown conditional: 1, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 85, Positive conditional cache size: 7, Positive unconditional cache size: 78, Negative cache size: 47, Negative conditional cache size: 8, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 406 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 98, independent: 71, independent conditional: 71, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 98, independent: 71, independent conditional: 62, independent unconditional: 9, dependent: 27, dependent conditional: 14, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 100, independent: 71, independent conditional: 41, independent unconditional: 30, dependent: 29, dependent conditional: 14, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 100, independent: 71, independent conditional: 41, independent unconditional: 30, dependent: 29, dependent conditional: 14, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 5, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 100, independent: 64, independent conditional: 36, independent unconditional: 28, dependent: 29, dependent conditional: 14, dependent unconditional: 15, unknown: 7, unknown conditional: 5, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 92, Positive conditional cache size: 12, Positive unconditional cache size: 80, Negative cache size: 47, Negative conditional cache size: 8, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 55 PlacesBefore, 55 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 550 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 157, independent: 135, independent conditional: 135, 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: 157, independent: 135, independent conditional: 119, independent unconditional: 16, dependent: 22, dependent conditional: 18, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 164, independent: 135, independent conditional: 49, independent unconditional: 86, dependent: 29, dependent conditional: 19, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 164, independent: 135, independent conditional: 49, independent unconditional: 86, dependent: 29, dependent conditional: 19, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 19, independent conditional: 14, independent unconditional: 5, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 122, independent: 114, independent conditional: 114, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 164, independent: 116, independent conditional: 35, independent unconditional: 81, dependent: 26, dependent conditional: 17, dependent unconditional: 9, unknown: 22, unknown conditional: 16, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 116, Positive conditional cache size: 26, Positive unconditional cache size: 90, Negative cache size: 50, Negative conditional cache size: 10, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 76, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 706 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 42, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 45, independent: 39, independent conditional: 11, independent unconditional: 28, dependent: 6, dependent conditional: 3, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 45, independent: 39, independent conditional: 11, independent unconditional: 28, dependent: 6, dependent conditional: 3, dependent unconditional: 3, 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: 45, independent: 39, independent conditional: 11, independent unconditional: 28, dependent: 6, dependent conditional: 3, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 116, Positive conditional cache size: 26, Positive unconditional cache size: 90, Negative cache size: 50, Negative conditional cache size: 10, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 31, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 66 PlacesBefore, 66 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 776 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 56, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, independent: 52, independent conditional: 22, independent unconditional: 30, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60, independent: 52, independent conditional: 22, independent unconditional: 30, dependent: 8, dependent conditional: 4, dependent unconditional: 4, 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: 60, independent: 52, independent conditional: 22, independent unconditional: 30, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 116, Positive conditional cache size: 26, Positive unconditional cache size: 90, Negative cache size: 50, Negative conditional cache size: 10, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 66 PlacesBefore, 65 PlacesAfterwards, 62 TransitionsBefore, 61 TransitionsAfterwards, 532 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 200, independent: 186, independent conditional: 186, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 200, independent: 186, independent conditional: 186, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 214, independent: 186, independent conditional: 47, independent unconditional: 139, dependent: 28, dependent conditional: 14, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 214, independent: 186, independent conditional: 47, independent unconditional: 139, dependent: 28, dependent conditional: 14, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 8, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 214, independent: 176, independent conditional: 39, independent unconditional: 137, dependent: 28, dependent conditional: 14, dependent unconditional: 14, unknown: 10, unknown conditional: 8, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 183, Positive cache size: 133, Positive conditional cache size: 35, Positive unconditional cache size: 98, Negative cache size: 50, Negative conditional cache size: 10, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 153, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 108.9s, 62 PlacesBefore, 60 PlacesAfterwards, 57 TransitionsBefore, 55 TransitionsAfterwards, 374 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 81, independent: 81, independent conditional: 81, 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: 81, independent: 81, independent conditional: 78, independent unconditional: 3, 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: 81, independent: 81, independent conditional: 15, independent unconditional: 66, 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: 81, independent: 81, independent conditional: 15, independent unconditional: 66, 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: 6, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 81, independent: 75, independent conditional: 11, independent unconditional: 64, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 165, Positive conditional cache size: 39, Positive unconditional cache size: 126, Negative cache size: 50, Negative conditional cache size: 10, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 63, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 350 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): 215, Positive cache size: 165, Positive conditional cache size: 39, Positive unconditional cache size: 126, Negative cache size: 50, Negative conditional cache size: 10, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p0_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L718] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L719] 0 int __unbuffered_p2_EAX$mem_tmp; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L727] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L728] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L729] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L730] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L731] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L732] 0 int __unbuffered_p2_EAX$w_buff0; [L733] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L734] 0 int __unbuffered_p2_EAX$w_buff1; [L735] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L740] 0 _Bool x$flush_delayed; [L741] 0 int x$mem_tmp; [L742] 0 _Bool x$r_buff0_thd0; [L743] 0 _Bool x$r_buff0_thd1; [L744] 0 _Bool x$r_buff0_thd2; [L745] 0 _Bool x$r_buff0_thd3; [L746] 0 _Bool x$r_buff0_thd4; [L747] 0 _Bool x$r_buff1_thd0; [L748] 0 _Bool x$r_buff1_thd1; [L749] 0 _Bool x$r_buff1_thd2; [L750] 0 _Bool x$r_buff1_thd3; [L751] 0 _Bool x$r_buff1_thd4; [L752] 0 _Bool x$read_delayed; [L753] 0 int *x$read_delayed_var; [L754] 0 int x$w_buff0; [L755] 0 _Bool x$w_buff0_used; [L756] 0 int x$w_buff1; [L757] 0 _Bool x$w_buff1_used; [L759] 0 int y = 0; [L760] 0 _Bool weak$$choice0; [L761] 0 _Bool weak$$choice1; [L762] 0 _Bool weak$$choice2; [L871] 0 pthread_t t2245; [L872] FCALL, FORK 0 pthread_create(&t2245, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2245, ((void *)0), P0, ((void *)0))=-1, t2245={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L873] 0 pthread_t t2246; [L874] FCALL, FORK 0 pthread_create(&t2246, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2246, ((void *)0), P1, ((void *)0))=0, t2245={7:0}, t2246={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L875] 0 pthread_t t2247; [L876] FCALL, FORK 0 pthread_create(&t2247, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2247, ((void *)0), P2, ((void *)0))=1, t2245={7:0}, t2246={5:0}, t2247={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L877] 0 pthread_t t2248; [L878] FCALL, FORK 0 pthread_create(&t2248, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2248, ((void *)0), P3, ((void *)0))=2, t2245={7:0}, t2246={5:0}, t2247={8:0}, t2248={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 x$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(x) [L814] 3 x$mem_tmp = x [L815] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L815] EXPR 3 \read(x) [L815] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L815] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L816] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L817] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L818] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L819] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L821] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L823] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L824] EXPR 3 \read(x) [L824] 3 __unbuffered_p2_EAX = x [L825] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L825] EXPR 3 \read(x) [L825] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L825] 3 x = x$flush_delayed ? x$mem_tmp : x [L826] 3 x$flush_delayed = (_Bool)0 [L829] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L846] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L849] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L849] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L849] EXPR 4 \read(x) [L849] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L849] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L849] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L850] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L851] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L852] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L853] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 1 __unbuffered_p0_EAX = y [L769] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 1 x$flush_delayed = weak$$choice2 [L772] EXPR 1 \read(x) [L772] 1 x$mem_tmp = x [L773] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L773] EXPR 1 \read(x) [L773] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L773] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L774] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L775] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L776] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L777] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L778] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L779] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 1 \read(x) [L780] 1 __unbuffered_p0_EBX = x [L781] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L781] 1 x = x$flush_delayed ? x$mem_tmp : x [L782] 1 x$flush_delayed = (_Bool)0 [L832] EXPR 1 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] EXPR 1 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L832] EXPR 1 \read(x) [L832] EXPR 1 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L832] EXPR 1 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 1 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L833] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L834] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L835] 1 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L836] 1 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=2, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L794] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, 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=2, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L797] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L797] EXPR 2 \read(x) [L797] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L797] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, 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=2, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 3 return 0; [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L884] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L884] EXPR 0 \read(x) [L884] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L884] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L884] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L885] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L886] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L887] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L888] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, 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=1, main$tmp_guard1=0, t2245={7:0}, t2246={5:0}, t2247={8:0}, t2248={9:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L891] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L892] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L892] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L892] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L892] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L892] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L892] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L893] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L895] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 874]: 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: 878]: 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: 872]: 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: 876]: 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, 176 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 135.2s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 448 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 448 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 178 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1281 IncrementalHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 178 mSolverCounterUnsat, 4 mSDtfsCounter, 1281 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=557occurred in iteration=13, InterpolantAutomatonStates: 68, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 282 NumberOfCodeBlocks, 282 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 246 ConstructedInterpolants, 0 QuantifiedInterpolants, 2868 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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-06 04:33:13,142 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...