/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix026_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:49:28,188 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:49:28,189 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:49:28,211 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:49:28,211 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:49:28,212 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:49:28,213 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:49:28,214 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:49:28,216 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:49:28,216 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:49:28,217 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:49:28,218 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:49:28,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:49:28,219 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:49:28,219 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:49:28,220 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:49:28,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:49:28,221 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:49:28,223 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:49:28,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:49:28,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:49:28,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:49:28,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:49:28,227 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:49:28,230 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:49:28,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:49:28,231 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:49:28,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:49:28,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:49:28,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:49:28,232 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:49:28,233 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:49:28,233 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:49:28,234 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:49:28,235 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:49:28,235 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:49:28,236 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:49:28,236 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:49:28,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:49:28,237 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:49:28,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:49:28,238 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 11:49:28,258 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:49:28,258 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:49:28,261 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:49:28,261 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:49:28,261 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:49:28,261 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:49:28,261 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:49:28,262 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:49:28,262 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:49:28,262 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:49:28,262 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:49:28,262 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:49:28,262 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:49:28,262 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:49:28,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:49:28,263 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:49:28,263 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:49:28,263 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:49:28,263 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:49:28,263 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:49:28,263 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:49:28,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:49:28,264 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:49:28,264 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:49:28,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:49:28,264 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:49:28,264 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:49:28,264 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:49:28,264 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 11:49:28,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:49:28,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:49:28,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:49:28,540 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:49:28,541 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:49:28,542 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix026_pso.opt_rmo.opt.i [2022-12-13 11:49:29,493 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:49:29,714 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:49:29,714 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_pso.opt_rmo.opt.i [2022-12-13 11:49:29,724 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54226ac91/0d674976c8134724b9879464d97be0e5/FLAG7668a9379 [2022-12-13 11:49:29,735 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54226ac91/0d674976c8134724b9879464d97be0e5 [2022-12-13 11:49:29,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:49:29,738 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:49:29,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:49:29,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:49:29,741 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:49:29,741 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:49:29" (1/1) ... [2022-12-13 11:49:29,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aa339f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:29, skipping insertion in model container [2022-12-13 11:49:29,742 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:49:29" (1/1) ... [2022-12-13 11:49:29,746 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:49:29,781 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:49:29,873 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/mix026_pso.opt_rmo.opt.i[956,969] [2022-12-13 11:49:29,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:29,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:29,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:29,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:29,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:29,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:29,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:29,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:29,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:29,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:29,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:29,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:29,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:29,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:29,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:29,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:29,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:29,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:29,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:29,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:29,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:29,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:29,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:29,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:29,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:29,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:29,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:29,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:29,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:29,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:29,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:29,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:29,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:29,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:29,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:29,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:29,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:29,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:29,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:29,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:29,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:49:29,988 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:49:29,996 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/mix026_pso.opt_rmo.opt.i[956,969] [2022-12-13 11:49:30,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:30,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:30,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:30,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:30,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:30,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:30,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:30,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:30,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:30,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:30,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:30,020 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:30,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:30,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:30,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:30,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:30,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:30,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:30,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:30,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:30,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:30,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:30,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:30,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:30,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:30,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:30,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:30,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:30,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:30,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:30,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:30,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:30,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:30,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:30,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:30,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:30,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:30,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:30,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:49:30,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:49:30,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:49:30,075 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:49:30,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:30 WrapperNode [2022-12-13 11:49:30,075 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:49:30,077 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:49:30,078 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:49:30,078 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:49:30,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:30" (1/1) ... [2022-12-13 11:49:30,105 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:30" (1/1) ... [2022-12-13 11:49:30,136 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-12-13 11:49:30,137 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:49:30,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:49:30,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:49:30,138 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:49:30,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:30" (1/1) ... [2022-12-13 11:49:30,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:30" (1/1) ... [2022-12-13 11:49:30,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:30" (1/1) ... [2022-12-13 11:49:30,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:30" (1/1) ... [2022-12-13 11:49:30,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:30" (1/1) ... [2022-12-13 11:49:30,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:30" (1/1) ... [2022-12-13 11:49:30,154 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:30" (1/1) ... [2022-12-13 11:49:30,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:30" (1/1) ... [2022-12-13 11:49:30,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:49:30,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:49:30,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:49:30,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:49:30,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:30" (1/1) ... [2022-12-13 11:49:30,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:49:30,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:49:30,195 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 11:49:30,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 11:49:30,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:49:30,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:49:30,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:49:30,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:49:30,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:49:30,234 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:49:30,234 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:49:30,234 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:49:30,234 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:49:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 11:49:30,235 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 11:49:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 11:49:30,235 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 11:49:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:49:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:49:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:49:30,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:49:30,236 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 11:49:30,338 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:49:30,340 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:49:30,691 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:49:30,817 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:49:30,818 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:49:30,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:49:30 BoogieIcfgContainer [2022-12-13 11:49:30,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:49:30,821 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:49:30,821 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:49:30,823 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:49:30,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:49:29" (1/3) ... [2022-12-13 11:49:30,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9c7534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:49:30, skipping insertion in model container [2022-12-13 11:49:30,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:30" (2/3) ... [2022-12-13 11:49:30,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9c7534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:49:30, skipping insertion in model container [2022-12-13 11:49:30,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:49:30" (3/3) ... [2022-12-13 11:49:30,825 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026_pso.opt_rmo.opt.i [2022-12-13 11:49:30,838 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:49:30,838 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:49:30,838 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:49:30,872 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:49:30,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2022-12-13 11:49:30,934 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-13 11:49:30,935 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:49:30,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-13 11:49:30,942 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2022-12-13 11:49:30,945 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2022-12-13 11:49:30,946 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:49:30,959 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-13 11:49:30,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2022-12-13 11:49:30,983 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-13 11:49:30,983 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:49:30,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-13 11:49:30,986 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-13 11:49:30,987 INFO L226 LiptonReduction]: Number of co-enabled transitions 2852 [2022-12-13 11:49:35,620 INFO L241 LiptonReduction]: Total number of compositions: 99 [2022-12-13 11:49:35,641 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:49:35,647 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;@3e3b859a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:49:35,647 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 11:49:35,660 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-13 11:49:35,661 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:49:35,661 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:49:35,661 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:35,662 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:49:35,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:35,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1675373841, now seen corresponding path program 1 times [2022-12-13 11:49:35,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:35,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757516957] [2022-12-13 11:49:35,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:35,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:36,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:36,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:36,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757516957] [2022-12-13 11:49:36,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757516957] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:36,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:36,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:49:36,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113846309] [2022-12-13 11:49:36,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:36,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:49:36,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:36,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:49:36,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:49:36,030 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 71 [2022-12-13 11:49:36,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 71 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:49:36,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:49:36,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 71 [2022-12-13 11:49:36,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:49:40,244 INFO L130 PetriNetUnfolder]: 43504/62410 cut-off events. [2022-12-13 11:49:40,245 INFO L131 PetriNetUnfolder]: For 107/107 co-relation queries the response was YES. [2022-12-13 11:49:40,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120319 conditions, 62410 events. 43504/62410 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 3580. Compared 465974 event pairs, 11360 based on Foata normal form. 0/38284 useless extension candidates. Maximal degree in co-relation 120307. Up to 48285 conditions per place. [2022-12-13 11:49:40,424 INFO L137 encePairwiseOnDemand]: 66/71 looper letters, 40 selfloop transitions, 2 changer transitions 54/111 dead transitions. [2022-12-13 11:49:40,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 111 transitions, 429 flow [2022-12-13 11:49:40,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:49:40,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:49:40,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2022-12-13 11:49:40,436 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6854460093896714 [2022-12-13 11:49:40,438 INFO L175 Difference]: Start difference. First operand has 83 places, 71 transitions, 154 flow. Second operand 3 states and 146 transitions. [2022-12-13 11:49:40,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 111 transitions, 429 flow [2022-12-13 11:49:40,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 111 transitions, 424 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 11:49:40,445 INFO L231 Difference]: Finished difference. Result has 79 places, 41 transitions, 94 flow [2022-12-13 11:49:40,446 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=79, PETRI_TRANSITIONS=41} [2022-12-13 11:49:40,449 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -4 predicate places. [2022-12-13 11:49:40,449 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:49:40,450 INFO L89 Accepts]: Start accepts. Operand has 79 places, 41 transitions, 94 flow [2022-12-13 11:49:40,454 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:49:40,454 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:49:40,454 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 41 transitions, 94 flow [2022-12-13 11:49:40,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 41 transitions, 94 flow [2022-12-13 11:49:40,460 INFO L130 PetriNetUnfolder]: 0/41 cut-off events. [2022-12-13 11:49:40,461 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:49:40,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 101 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 11:49:40,464 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 41 transitions, 94 flow [2022-12-13 11:49:40,464 INFO L226 LiptonReduction]: Number of co-enabled transitions 1000 [2022-12-13 11:49:40,616 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:49:40,617 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-13 11:49:40,618 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 94 flow [2022-12-13 11:49:40,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:49:40,618 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:49:40,618 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:40,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:49:40,618 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:49:40,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:40,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1820014942, now seen corresponding path program 1 times [2022-12-13 11:49:40,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:40,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287923353] [2022-12-13 11:49:40,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:40,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:40,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:40,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:40,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287923353] [2022-12-13 11:49:40,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287923353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:40,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:40,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:49:40,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873660217] [2022-12-13 11:49:40,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:40,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:49:40,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:40,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:49:40,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:49:40,841 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2022-12-13 11:49:40,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:49:40,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:49:40,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2022-12-13 11:49:40,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:49:43,038 INFO L130 PetriNetUnfolder]: 26891/37724 cut-off events. [2022-12-13 11:49:43,038 INFO L131 PetriNetUnfolder]: For 917/917 co-relation queries the response was YES. [2022-12-13 11:49:43,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75245 conditions, 37724 events. 26891/37724 cut-off events. For 917/917 co-relation queries the response was YES. Maximal size of possible extension queue 1354. Compared 230778 event pairs, 9665 based on Foata normal form. 0/29908 useless extension candidates. Maximal degree in co-relation 75235. Up to 24023 conditions per place. [2022-12-13 11:49:43,261 INFO L137 encePairwiseOnDemand]: 33/41 looper letters, 50 selfloop transitions, 7 changer transitions 2/69 dead transitions. [2022-12-13 11:49:43,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 69 transitions, 276 flow [2022-12-13 11:49:43,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:49:43,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:49:43,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2022-12-13 11:49:43,264 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7317073170731707 [2022-12-13 11:49:43,264 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 94 flow. Second operand 3 states and 90 transitions. [2022-12-13 11:49:43,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 69 transitions, 276 flow [2022-12-13 11:49:43,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 69 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:49:43,267 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 142 flow [2022-12-13 11:49:43,267 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2022-12-13 11:49:43,268 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -29 predicate places. [2022-12-13 11:49:43,268 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:49:43,268 INFO L89 Accepts]: Start accepts. Operand has 54 places, 46 transitions, 142 flow [2022-12-13 11:49:43,269 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:49:43,270 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:49:43,270 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 46 transitions, 142 flow [2022-12-13 11:49:43,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 46 transitions, 142 flow [2022-12-13 11:49:43,302 INFO L130 PetriNetUnfolder]: 126/466 cut-off events. [2022-12-13 11:49:43,303 INFO L131 PetriNetUnfolder]: For 35/37 co-relation queries the response was YES. [2022-12-13 11:49:43,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 782 conditions, 466 events. 126/466 cut-off events. For 35/37 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3347 event pairs, 56 based on Foata normal form. 0/331 useless extension candidates. Maximal degree in co-relation 773. Up to 187 conditions per place. [2022-12-13 11:49:43,308 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 46 transitions, 142 flow [2022-12-13 11:49:43,308 INFO L226 LiptonReduction]: Number of co-enabled transitions 1134 [2022-12-13 11:49:43,367 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:49:43,368 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 11:49:43,368 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 142 flow [2022-12-13 11:49:43,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:49:43,369 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:49:43,369 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:43,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:49:43,370 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:49:43,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:43,377 INFO L85 PathProgramCache]: Analyzing trace with hash -585889162, now seen corresponding path program 1 times [2022-12-13 11:49:43,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:43,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326255470] [2022-12-13 11:49:43,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:43,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:43,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:43,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:43,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326255470] [2022-12-13 11:49:43,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326255470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:43,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:43,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:49:43,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804371834] [2022-12-13 11:49:43,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:43,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:49:43,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:43,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:49:43,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:49:43,514 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2022-12-13 11:49:43,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:49:43,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:49:43,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2022-12-13 11:49:43,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:49:45,085 INFO L130 PetriNetUnfolder]: 19887/28259 cut-off events. [2022-12-13 11:49:45,085 INFO L131 PetriNetUnfolder]: For 8260/8260 co-relation queries the response was YES. [2022-12-13 11:49:45,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65181 conditions, 28259 events. 19887/28259 cut-off events. For 8260/8260 co-relation queries the response was YES. Maximal size of possible extension queue 1004. Compared 167714 event pairs, 4869 based on Foata normal form. 276/23333 useless extension candidates. Maximal degree in co-relation 65169. Up to 13401 conditions per place. [2022-12-13 11:49:45,201 INFO L137 encePairwiseOnDemand]: 33/40 looper letters, 60 selfloop transitions, 7 changer transitions 0/77 dead transitions. [2022-12-13 11:49:45,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 77 transitions, 354 flow [2022-12-13 11:49:45,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:49:45,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:49:45,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-12-13 11:49:45,202 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.64375 [2022-12-13 11:49:45,202 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 142 flow. Second operand 4 states and 103 transitions. [2022-12-13 11:49:45,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 77 transitions, 354 flow [2022-12-13 11:49:45,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 77 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:49:45,234 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 176 flow [2022-12-13 11:49:45,234 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2022-12-13 11:49:45,235 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -26 predicate places. [2022-12-13 11:49:45,235 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:49:45,235 INFO L89 Accepts]: Start accepts. Operand has 57 places, 49 transitions, 176 flow [2022-12-13 11:49:45,236 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:49:45,236 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:49:45,236 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 49 transitions, 176 flow [2022-12-13 11:49:45,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 49 transitions, 176 flow [2022-12-13 11:49:45,252 INFO L130 PetriNetUnfolder]: 87/337 cut-off events. [2022-12-13 11:49:45,252 INFO L131 PetriNetUnfolder]: For 84/85 co-relation queries the response was YES. [2022-12-13 11:49:45,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 337 events. 87/337 cut-off events. For 84/85 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2129 event pairs, 25 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 635. Up to 134 conditions per place. [2022-12-13 11:49:45,255 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 49 transitions, 176 flow [2022-12-13 11:49:45,255 INFO L226 LiptonReduction]: Number of co-enabled transitions 1206 [2022-12-13 11:49:45,257 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:49:45,258 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-13 11:49:45,258 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 176 flow [2022-12-13 11:49:45,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:49:45,258 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:49:45,258 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:45,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:49:45,259 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:49:45,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:45,259 INFO L85 PathProgramCache]: Analyzing trace with hash -983043900, now seen corresponding path program 1 times [2022-12-13 11:49:45,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:45,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944908537] [2022-12-13 11:49:45,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:45,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:45,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:45,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:45,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944908537] [2022-12-13 11:49:45,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944908537] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:45,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:45,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:49:45,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21505175] [2022-12-13 11:49:45,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:45,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:49:45,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:45,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:49:45,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:49:45,408 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2022-12-13 11:49:45,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:49:45,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:49:45,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2022-12-13 11:49:45,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:49:47,235 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][95], [193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), 110#L867true, P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 171#true, 40#L784true, 200#true, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:47,236 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 11:49:47,236 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:49:47,236 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:49:47,236 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:49:47,237 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][95], [193#true, 110#L867true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 40#L784true, 200#true, 181#true, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:47,238 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 11:49:47,238 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:49:47,238 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:49:47,238 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:49:47,239 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][95], [193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), 110#L867true, P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 40#L784true, 200#true, 61#P2EXITtrue, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:47,239 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 11:49:47,239 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:49:47,239 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:49:47,239 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:49:47,669 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][95], [193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), 110#L867true, P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 171#true, 182#true, 200#true, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:47,669 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,669 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,669 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,669 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,670 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][95], [193#true, 110#L867true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 182#true, 200#true, 181#true, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:47,670 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,670 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,670 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,670 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,672 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][95], [193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), 110#L867true, P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 182#true, 200#true, 61#P2EXITtrue, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:47,672 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,672 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,672 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,672 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,673 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][95], [193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), 110#L867true, P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, 166#true, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 171#true, 200#true, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:47,673 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,673 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,673 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,673 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,674 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][95], [193#true, 110#L867true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, 166#true, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 200#true, 181#true, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:47,674 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,674 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,674 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,674 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,675 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][95], [193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), 110#L867true, P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, 166#true, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 200#true, 61#P2EXITtrue, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:47,675 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,675 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,675 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,676 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,676 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][95], [193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), 110#L867true, P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 107#P1EXITtrue, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 171#true, 200#true, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:47,677 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,677 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,677 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,677 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,678 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][95], [193#true, 110#L867true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 107#P1EXITtrue, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 200#true, 181#true, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:47,678 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,678 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,678 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,678 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,679 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][95], [193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), 110#L867true, P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 107#P1EXITtrue, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 200#true, 61#P2EXITtrue, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:47,679 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,679 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,679 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,679 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,680 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([494] L874-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31| 0) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_59) (= v_~__unbuffered_p0_EAX~0_58 0) (= 0 v_~__unbuffered_p3_EBX~0_54) (= v_~z~0_59 2) (= v_~__unbuffered_p1_EAX~0_66 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_54) (= (mod v_~main$tmp_guard1~0_54 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_59, ~z~0=v_~z~0_59, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_54} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_59, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_54, ~z~0=v_~z~0_59, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_54} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][110], [120#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 119#L832true, 171#true, 40#L784true, 200#true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:47,680 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,680 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,680 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,681 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,681 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][95], [193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 171#true, 40#L784true, 200#true, 78#L874true, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:47,681 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,681 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,681 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,681 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,682 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([494] L874-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31| 0) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_59) (= v_~__unbuffered_p0_EAX~0_58 0) (= 0 v_~__unbuffered_p3_EBX~0_54) (= v_~z~0_59 2) (= v_~__unbuffered_p1_EAX~0_66 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_54) (= (mod v_~main$tmp_guard1~0_54 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_59, ~z~0=v_~z~0_59, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_54} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_59, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_54, ~z~0=v_~z~0_59, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_54} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][110], [120#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 119#L832true, 40#L784true, 200#true, 181#true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:47,682 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,682 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,682 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,682 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,682 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][95], [193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 40#L784true, 200#true, 181#true, 78#L874true, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:47,682 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,682 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,682 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,682 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,683 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([494] L874-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31| 0) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_59) (= v_~__unbuffered_p0_EAX~0_58 0) (= 0 v_~__unbuffered_p3_EBX~0_54) (= v_~z~0_59 2) (= v_~__unbuffered_p1_EAX~0_66 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_54) (= (mod v_~main$tmp_guard1~0_54 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_59, ~z~0=v_~z~0_59, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_54} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_59, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_54, ~z~0=v_~z~0_59, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_54} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][110], [120#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 119#L832true, 40#L784true, 200#true, 61#P2EXITtrue, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:47,683 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,683 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,683 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,683 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,684 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][95], [193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 40#L784true, 200#true, 61#P2EXITtrue, 78#L874true, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:47,684 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,684 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,684 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:47,684 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:48,210 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([494] L874-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31| 0) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_59) (= v_~__unbuffered_p0_EAX~0_58 0) (= 0 v_~__unbuffered_p3_EBX~0_54) (= v_~z~0_59 2) (= v_~__unbuffered_p1_EAX~0_66 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_54) (= (mod v_~main$tmp_guard1~0_54 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_59, ~z~0=v_~z~0_59, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_54} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_59, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_54, ~z~0=v_~z~0_59, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_54} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][110], [120#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 119#L832true, 171#true, 182#true, 200#true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:48,211 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,211 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,211 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,211 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,211 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][95], [193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 171#true, 182#true, 200#true, 78#L874true, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:48,211 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,211 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,211 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,211 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,212 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([494] L874-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31| 0) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_59) (= v_~__unbuffered_p0_EAX~0_58 0) (= 0 v_~__unbuffered_p3_EBX~0_54) (= v_~z~0_59 2) (= v_~__unbuffered_p1_EAX~0_66 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_54) (= (mod v_~main$tmp_guard1~0_54 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_59, ~z~0=v_~z~0_59, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_54} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_59, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_54, ~z~0=v_~z~0_59, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_54} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][110], [120#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 119#L832true, 182#true, 200#true, 181#true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:48,212 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,212 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,212 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,212 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,212 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][95], [193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 182#true, 200#true, 181#true, 78#L874true, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:48,212 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,212 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,212 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,212 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,213 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([494] L874-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31| 0) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_59) (= v_~__unbuffered_p0_EAX~0_58 0) (= 0 v_~__unbuffered_p3_EBX~0_54) (= v_~z~0_59 2) (= v_~__unbuffered_p1_EAX~0_66 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_54) (= (mod v_~main$tmp_guard1~0_54 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_59, ~z~0=v_~z~0_59, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_54} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_59, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_54, ~z~0=v_~z~0_59, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_54} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][110], [120#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 119#L832true, 182#true, 200#true, 61#P2EXITtrue, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:48,213 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,213 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,213 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,213 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,213 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][95], [193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 182#true, 200#true, 61#P2EXITtrue, 78#L874true, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:48,213 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,213 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,213 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,213 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,214 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([494] L874-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31| 0) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_59) (= v_~__unbuffered_p0_EAX~0_58 0) (= 0 v_~__unbuffered_p3_EBX~0_54) (= v_~z~0_59 2) (= v_~__unbuffered_p1_EAX~0_66 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_54) (= (mod v_~main$tmp_guard1~0_54 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_59, ~z~0=v_~z~0_59, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_54} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_59, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_54, ~z~0=v_~z~0_59, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_54} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][110], [120#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, 166#true, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 119#L832true, 171#true, 200#true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:48,214 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,214 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,214 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,214 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,214 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][95], [193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, 166#true, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 171#true, 200#true, 78#L874true, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:48,214 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,214 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,214 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,214 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,215 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([494] L874-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31| 0) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_59) (= v_~__unbuffered_p0_EAX~0_58 0) (= 0 v_~__unbuffered_p3_EBX~0_54) (= v_~z~0_59 2) (= v_~__unbuffered_p1_EAX~0_66 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_54) (= (mod v_~main$tmp_guard1~0_54 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_59, ~z~0=v_~z~0_59, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_54} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_59, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_54, ~z~0=v_~z~0_59, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_54} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][110], [120#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, 166#true, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 119#L832true, 200#true, 181#true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:48,215 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,215 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,215 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,215 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,215 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][95], [193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, 166#true, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 200#true, 181#true, 78#L874true, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:48,215 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,215 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,215 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,215 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,216 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([494] L874-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31| 0) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_59) (= v_~__unbuffered_p0_EAX~0_58 0) (= 0 v_~__unbuffered_p3_EBX~0_54) (= v_~z~0_59 2) (= v_~__unbuffered_p1_EAX~0_66 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_54) (= (mod v_~main$tmp_guard1~0_54 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_59, ~z~0=v_~z~0_59, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_54} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_59, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_54, ~z~0=v_~z~0_59, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_54} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][110], [120#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, 166#true, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 119#L832true, 200#true, 61#P2EXITtrue, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:48,216 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,216 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,216 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,216 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,216 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][95], [193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, 166#true, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 200#true, 61#P2EXITtrue, 78#L874true, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:48,216 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,216 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,216 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,216 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,217 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([494] L874-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31| 0) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_59) (= v_~__unbuffered_p0_EAX~0_58 0) (= 0 v_~__unbuffered_p3_EBX~0_54) (= v_~z~0_59 2) (= v_~__unbuffered_p1_EAX~0_66 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_54) (= (mod v_~main$tmp_guard1~0_54 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_59, ~z~0=v_~z~0_59, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_54} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_59, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_54, ~z~0=v_~z~0_59, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_54} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][110], [120#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 107#P1EXITtrue, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 119#L832true, 171#true, 200#true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:48,217 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,217 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,217 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,217 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,217 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][95], [193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 107#P1EXITtrue, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 171#true, 200#true, 78#L874true, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:48,217 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,217 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,217 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,217 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,218 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([494] L874-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31| 0) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_59) (= v_~__unbuffered_p0_EAX~0_58 0) (= 0 v_~__unbuffered_p3_EBX~0_54) (= v_~z~0_59 2) (= v_~__unbuffered_p1_EAX~0_66 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_54) (= (mod v_~main$tmp_guard1~0_54 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_59, ~z~0=v_~z~0_59, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_54} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_59, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_54, ~z~0=v_~z~0_59, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_54} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][110], [120#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 107#P1EXITtrue, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 119#L832true, 200#true, 181#true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:48,218 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,218 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,218 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,218 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,218 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][95], [193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 107#P1EXITtrue, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 200#true, 181#true, 78#L874true, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:48,218 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,218 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,218 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,218 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,219 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([494] L874-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31| 0) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_59) (= v_~__unbuffered_p0_EAX~0_58 0) (= 0 v_~__unbuffered_p3_EBX~0_54) (= v_~z~0_59 2) (= v_~__unbuffered_p1_EAX~0_66 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_54) (= (mod v_~main$tmp_guard1~0_54 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_59, ~z~0=v_~z~0_59, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_54} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_27|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_59, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_54, ~z~0=v_~z~0_59, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_54} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][110], [120#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 107#P1EXITtrue, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 119#L832true, 200#true, 61#P2EXITtrue, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:48,219 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,219 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,219 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,219 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,219 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][95], [193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 107#P1EXITtrue, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 200#true, 61#P2EXITtrue, 78#L874true, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:48,219 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,219 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,219 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,219 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:49:48,536 INFO L130 PetriNetUnfolder]: 36361/50857 cut-off events. [2022-12-13 11:49:48,536 INFO L131 PetriNetUnfolder]: For 12193/12724 co-relation queries the response was YES. [2022-12-13 11:49:48,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112751 conditions, 50857 events. 36361/50857 cut-off events. For 12193/12724 co-relation queries the response was YES. Maximal size of possible extension queue 2564. Compared 336488 event pairs, 11005 based on Foata normal form. 3048/34496 useless extension candidates. Maximal degree in co-relation 112736. Up to 40015 conditions per place. [2022-12-13 11:49:48,755 INFO L137 encePairwiseOnDemand]: 25/40 looper letters, 80 selfloop transitions, 26 changer transitions 0/122 dead transitions. [2022-12-13 11:49:48,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 122 transitions, 588 flow [2022-12-13 11:49:48,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:49:48,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:49:48,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2022-12-13 11:49:48,757 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.73 [2022-12-13 11:49:48,757 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 176 flow. Second operand 5 states and 146 transitions. [2022-12-13 11:49:48,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 122 transitions, 588 flow [2022-12-13 11:49:48,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 122 transitions, 585 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:49:48,763 INFO L231 Difference]: Finished difference. Result has 63 places, 74 transitions, 368 flow [2022-12-13 11:49:48,763 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=368, PETRI_PLACES=63, PETRI_TRANSITIONS=74} [2022-12-13 11:49:48,764 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -20 predicate places. [2022-12-13 11:49:48,764 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:49:48,764 INFO L89 Accepts]: Start accepts. Operand has 63 places, 74 transitions, 368 flow [2022-12-13 11:49:48,764 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:49:48,764 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:49:48,765 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 74 transitions, 368 flow [2022-12-13 11:49:48,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 74 transitions, 368 flow [2022-12-13 11:49:49,545 INFO L130 PetriNetUnfolder]: 10374/15943 cut-off events. [2022-12-13 11:49:49,545 INFO L131 PetriNetUnfolder]: For 4406/20152 co-relation queries the response was YES. [2022-12-13 11:49:49,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46113 conditions, 15943 events. 10374/15943 cut-off events. For 4406/20152 co-relation queries the response was YES. Maximal size of possible extension queue 2391. Compared 131908 event pairs, 5928 based on Foata normal form. 5/6958 useless extension candidates. Maximal degree in co-relation 46097. Up to 13334 conditions per place. [2022-12-13 11:49:49,674 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 74 transitions, 368 flow [2022-12-13 11:49:49,674 INFO L226 LiptonReduction]: Number of co-enabled transitions 1988 [2022-12-13 11:49:49,840 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] L863-3-->L867: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_111 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34) (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_21|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [481] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_82 1) v_~__unbuffered_cnt~0_81)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-13 11:49:49,865 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] L863-3-->L867: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_111 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34) (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_21|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [526] L784-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork3_#res.base_9| 0) (= |v_P1Thread1of1ForFork3_#res.offset_9| 0) (= v_~__unbuffered_cnt~0_173 (+ v_~__unbuffered_cnt~0_174 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_174} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_9|, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_173} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0] [2022-12-13 11:49:49,891 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] L863-3-->L867: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_111 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34) (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_21|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [475] L816-->P2FINAL: Formula: (and (= 0 |v_P2Thread1of1ForFork0_#res#1.offset_5|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1)) (= |v_P2Thread1of1ForFork0_#res#1.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P2Thread1of1ForFork0_#res#1.offset=|v_P2Thread1of1ForFork0_#res#1.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P2Thread1of1ForFork0_#res#1.base=|v_P2Thread1of1ForFork0_#res#1.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res#1.offset, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res#1.base] [2022-12-13 11:49:49,915 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] L863-3-->L867: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_111 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34) (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_21|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [381] L839-->L842: Formula: (= (+ v_~__unbuffered_cnt~0_8 1) v_~__unbuffered_cnt~0_7) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 11:49:49,931 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] L863-3-->L867: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_111 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34) (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_21|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [521] L816-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res#1.offset_15| 0) (= |v_P2Thread1of1ForFork0_#res#1.base_15| 0) (= v_~__unbuffered_cnt~0_157 (+ v_~__unbuffered_cnt~0_158 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_158} OutVars{P2Thread1of1ForFork0_#res#1.offset=|v_P2Thread1of1ForFork0_#res#1.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_157, P2Thread1of1ForFork0_#res#1.base=|v_P2Thread1of1ForFork0_#res#1.base_15|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res#1.offset, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res#1.base] [2022-12-13 11:49:49,955 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] L863-3-->L867: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_111 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34) (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_21|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [495] L839-->P3FINAL: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.base_7|) (= |v_P3Thread1of1ForFork2_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_101 (+ v_~__unbuffered_cnt~0_102 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_7|, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] [2022-12-13 11:49:49,979 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] L863-3-->L867: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_111 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34) (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_21|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [359] L756-->L761: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 11:49:49,995 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] L863-3-->L867: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_111 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34) (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_21|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [365] L784-->L789: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 11:49:50,011 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] L863-3-->L867: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_111 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34) (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_21|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [482] L756-->P0FINAL: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_9| 0) (= v_~__unbuffered_cnt~0_85 (+ v_~__unbuffered_cnt~0_86 1)) (= |v_P0Thread1of1ForFork1_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-13 11:49:50,035 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] L863-3-->L867: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_111 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34) (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_21|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [525] L784-->P1FINAL: Formula: (and (= v_~__unbuffered_cnt~0_169 (+ v_~__unbuffered_cnt~0_170 1)) (= |v_P1Thread1of1ForFork3_#res.offset_7| 0) (= |v_P1Thread1of1ForFork3_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_170} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_7|, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0] [2022-12-13 11:49:50,059 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] L863-3-->L867: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_111 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34) (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_21|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [373] L816-->L819: Formula: (= (+ v_~__unbuffered_cnt~0_6 1) v_~__unbuffered_cnt~0_5) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_6} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_5} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 11:49:50,075 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] L863-3-->L867: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_111 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34) (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_21|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [496] L839-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#res.offset_9| 0) (= v_~__unbuffered_cnt~0_105 (+ v_~__unbuffered_cnt~0_106 1)) (= 0 |v_P3Thread1of1ForFork2_#res.base_9|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_9|, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] [2022-12-13 11:49:50,430 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:49:50,431 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1667 [2022-12-13 11:49:50,431 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 73 transitions, 410 flow [2022-12-13 11:49:50,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:49:50,431 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:49:50,431 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:50,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:49:50,431 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:49:50,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:50,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1578080789, now seen corresponding path program 1 times [2022-12-13 11:49:50,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:50,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934876012] [2022-12-13 11:49:50,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:50,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:50,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:50,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:50,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934876012] [2022-12-13 11:49:50,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934876012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:50,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:50,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:49:50,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473060576] [2022-12-13 11:49:50,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:50,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:49:50,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:50,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:49:50,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:49:50,518 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52 [2022-12-13 11:49:50,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 73 transitions, 410 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:49:50,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:49:50,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52 [2022-12-13 11:49:50,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:49:52,262 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][101], [193#true, 110#L867true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 215#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), P1Thread1of1ForFork3InUse, Black: 205#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 202#(= ~__unbuffered_cnt~0 0), Black: 203#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 40#L784true, 200#true, 181#true, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:52,262 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 11:49:52,262 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:49:52,262 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:49:52,262 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:49:52,264 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][101], [193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), 110#L867true, P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 215#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), P1Thread1of1ForFork3InUse, Black: 205#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 202#(= ~__unbuffered_cnt~0 0), Black: 203#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 40#L784true, 200#true, 61#P2EXITtrue, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:52,264 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 11:49:52,264 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:49:52,264 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:49:52,264 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:49:52,266 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][101], [193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), 110#L867true, P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 215#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), P1Thread1of1ForFork3InUse, Black: 205#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 202#(= ~__unbuffered_cnt~0 0), Black: 203#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 40#L784true, 171#true, 200#true, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:52,266 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 11:49:52,266 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:49:52,266 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:49:52,266 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:49:52,579 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][128], [193#true, 110#L867true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 107#P1EXITtrue, 213#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, Black: 205#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 202#(= ~__unbuffered_cnt~0 0), Black: 203#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 200#true, 181#true, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:52,579 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,579 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,579 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,579 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,580 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][128], [193#true, 110#L867true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, 213#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, Black: 205#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 202#(= ~__unbuffered_cnt~0 0), Black: 203#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 182#true, 200#true, 181#true, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:52,580 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,580 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,580 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,580 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,580 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][128], [193#true, 110#L867true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, 213#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 166#true, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, Black: 205#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 202#(= ~__unbuffered_cnt~0 0), Black: 203#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 200#true, 181#true, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:52,580 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,580 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,580 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,580 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,582 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][128], [193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), 110#L867true, P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 107#P1EXITtrue, P3Thread1of1ForFork2InUse, 213#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, Black: 205#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 202#(= ~__unbuffered_cnt~0 0), Black: 203#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 200#true, 61#P2EXITtrue, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:52,582 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,582 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,582 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,583 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,583 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][128], [193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), 110#L867true, P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, 213#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, Black: 205#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 202#(= ~__unbuffered_cnt~0 0), Black: 203#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 182#true, 200#true, 61#P2EXITtrue, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:52,583 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,583 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,583 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,583 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,583 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][128], [193#true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), 110#L867true, P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, 213#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 166#true, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, Black: 205#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 202#(= ~__unbuffered_cnt~0 0), Black: 203#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 200#true, 61#P2EXITtrue, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:52,583 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,583 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,584 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,584 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,585 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][128], [193#true, 110#L867true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 107#P1EXITtrue, P3Thread1of1ForFork2InUse, 213#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, Black: 205#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 202#(= ~__unbuffered_cnt~0 0), Black: 203#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 171#true, 200#true, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:52,585 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,585 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,585 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,586 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,586 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][128], [193#true, 110#L867true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, 213#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, Black: 205#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 202#(= ~__unbuffered_cnt~0 0), Black: 203#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 182#true, 171#true, 200#true, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:52,586 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,586 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,586 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,586 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,586 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][128], [193#true, 110#L867true, Black: 195#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 122#L756true, Black: 196#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 213#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), P3Thread1of1ForFork2InUse, 166#true, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, Black: 205#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 202#(= ~__unbuffered_cnt~0 0), Black: 203#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 171#true, 200#true, 58#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 11:49:52,586 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,586 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,587 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:52,587 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:49:53,496 INFO L130 PetriNetUnfolder]: 31940/46707 cut-off events. [2022-12-13 11:49:53,497 INFO L131 PetriNetUnfolder]: For 21649/21992 co-relation queries the response was YES. [2022-12-13 11:49:53,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161869 conditions, 46707 events. 31940/46707 cut-off events. For 21649/21992 co-relation queries the response was YES. Maximal size of possible extension queue 2553. Compared 336088 event pairs, 3746 based on Foata normal form. 2824/31363 useless extension candidates. Maximal degree in co-relation 161850. Up to 28207 conditions per place. [2022-12-13 11:49:53,738 INFO L137 encePairwiseOnDemand]: 25/52 looper letters, 93 selfloop transitions, 50 changer transitions 1/160 dead transitions. [2022-12-13 11:49:53,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 160 transitions, 1092 flow [2022-12-13 11:49:53,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:49:53,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:49:53,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 191 transitions. [2022-12-13 11:49:53,740 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6121794871794872 [2022-12-13 11:49:53,740 INFO L175 Difference]: Start difference. First operand has 62 places, 73 transitions, 410 flow. Second operand 6 states and 191 transitions. [2022-12-13 11:49:53,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 160 transitions, 1092 flow [2022-12-13 11:49:53,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 160 transitions, 1055 flow, removed 12 selfloop flow, removed 1 redundant places. [2022-12-13 11:49:53,820 INFO L231 Difference]: Finished difference. Result has 69 places, 98 transitions, 737 flow [2022-12-13 11:49:53,820 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=737, PETRI_PLACES=69, PETRI_TRANSITIONS=98} [2022-12-13 11:49:53,820 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -14 predicate places. [2022-12-13 11:49:53,820 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:49:53,820 INFO L89 Accepts]: Start accepts. Operand has 69 places, 98 transitions, 737 flow [2022-12-13 11:49:53,821 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:49:53,821 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:49:53,822 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 98 transitions, 737 flow [2022-12-13 11:49:53,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 98 transitions, 737 flow [2022-12-13 11:49:54,861 INFO L130 PetriNetUnfolder]: 9987/16131 cut-off events. [2022-12-13 11:49:54,861 INFO L131 PetriNetUnfolder]: For 16944/98899 co-relation queries the response was YES. [2022-12-13 11:49:54,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75598 conditions, 16131 events. 9987/16131 cut-off events. For 16944/98899 co-relation queries the response was YES. Maximal size of possible extension queue 2643. Compared 140439 event pairs, 2499 based on Foata normal form. 16/6828 useless extension candidates. Maximal degree in co-relation 75578. Up to 14014 conditions per place. [2022-12-13 11:49:54,972 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 98 transitions, 737 flow [2022-12-13 11:49:54,973 INFO L226 LiptonReduction]: Number of co-enabled transitions 2820 [2022-12-13 11:50:17,960 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:50:17,962 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24142 [2022-12-13 11:50:17,962 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 97 transitions, 729 flow [2022-12-13 11:50:17,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:50:17,962 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:50:17,962 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:50:17,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:50:17,962 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:50:17,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:17,963 INFO L85 PathProgramCache]: Analyzing trace with hash -891738821, now seen corresponding path program 1 times [2022-12-13 11:50:17,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:17,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403561481] [2022-12-13 11:50:17,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:17,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:18,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:50:18,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:18,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403561481] [2022-12-13 11:50:18,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403561481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:18,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:18,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:50:18,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301524183] [2022-12-13 11:50:18,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:18,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:50:18,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:18,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:50:18,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:50:18,129 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52 [2022-12-13 11:50:18,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 97 transitions, 729 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:50:18,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:50:18,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52 [2022-12-13 11:50:18,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:50:21,693 INFO L130 PetriNetUnfolder]: 36784/53918 cut-off events. [2022-12-13 11:50:21,694 INFO L131 PetriNetUnfolder]: For 112185/123536 co-relation queries the response was YES. [2022-12-13 11:50:21,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249631 conditions, 53918 events. 36784/53918 cut-off events. For 112185/123536 co-relation queries the response was YES. Maximal size of possible extension queue 2867. Compared 390456 event pairs, 5187 based on Foata normal form. 1710/44486 useless extension candidates. Maximal degree in co-relation 249608. Up to 31816 conditions per place. [2022-12-13 11:50:22,003 INFO L137 encePairwiseOnDemand]: 43/52 looper letters, 145 selfloop transitions, 21 changer transitions 74/258 dead transitions. [2022-12-13 11:50:22,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 258 transitions, 2465 flow [2022-12-13 11:50:22,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:50:22,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:50:22,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 195 transitions. [2022-12-13 11:50:22,004 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.75 [2022-12-13 11:50:22,004 INFO L175 Difference]: Start difference. First operand has 69 places, 97 transitions, 729 flow. Second operand 5 states and 195 transitions. [2022-12-13 11:50:22,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 258 transitions, 2465 flow [2022-12-13 11:50:23,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 258 transitions, 2061 flow, removed 132 selfloop flow, removed 3 redundant places. [2022-12-13 11:50:23,258 INFO L231 Difference]: Finished difference. Result has 73 places, 85 transitions, 557 flow [2022-12-13 11:50:23,258 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=557, PETRI_PLACES=73, PETRI_TRANSITIONS=85} [2022-12-13 11:50:23,258 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -10 predicate places. [2022-12-13 11:50:23,259 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:50:23,259 INFO L89 Accepts]: Start accepts. Operand has 73 places, 85 transitions, 557 flow [2022-12-13 11:50:23,259 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:50:23,260 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:50:23,260 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 85 transitions, 557 flow [2022-12-13 11:50:23,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 85 transitions, 557 flow [2022-12-13 11:50:23,952 INFO L130 PetriNetUnfolder]: 9226/15077 cut-off events. [2022-12-13 11:50:23,952 INFO L131 PetriNetUnfolder]: For 16508/21566 co-relation queries the response was YES. [2022-12-13 11:50:23,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65803 conditions, 15077 events. 9226/15077 cut-off events. For 16508/21566 co-relation queries the response was YES. Maximal size of possible extension queue 2250. Compared 129188 event pairs, 2723 based on Foata normal form. 28/7284 useless extension candidates. Maximal degree in co-relation 65781. Up to 12421 conditions per place. [2022-12-13 11:50:24,085 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 85 transitions, 557 flow [2022-12-13 11:50:24,085 INFO L226 LiptonReduction]: Number of co-enabled transitions 2524 [2022-12-13 11:50:24,193 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:50:24,194 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 935 [2022-12-13 11:50:24,194 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 85 transitions, 557 flow [2022-12-13 11:50:24,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:50:24,194 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:50:24,194 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:50:24,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:50:24,194 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:50:24,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:24,195 INFO L85 PathProgramCache]: Analyzing trace with hash -2143660025, now seen corresponding path program 1 times [2022-12-13 11:50:24,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:24,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879206474] [2022-12-13 11:50:24,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:24,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:24,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:50:24,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:24,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879206474] [2022-12-13 11:50:24,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879206474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:24,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:24,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:50:24,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709766817] [2022-12-13 11:50:24,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:24,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:50:24,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:24,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:50:24,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:50:24,299 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2022-12-13 11:50:24,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 85 transitions, 557 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:50:24,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:50:24,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2022-12-13 11:50:24,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:50:29,314 INFO L130 PetriNetUnfolder]: 44394/65249 cut-off events. [2022-12-13 11:50:29,314 INFO L131 PetriNetUnfolder]: For 166726/172940 co-relation queries the response was YES. [2022-12-13 11:50:29,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301094 conditions, 65249 events. 44394/65249 cut-off events. For 166726/172940 co-relation queries the response was YES. Maximal size of possible extension queue 3257. Compared 486608 event pairs, 9817 based on Foata normal form. 1900/54150 useless extension candidates. Maximal degree in co-relation 301069. Up to 38220 conditions per place. [2022-12-13 11:50:29,669 INFO L137 encePairwiseOnDemand]: 31/40 looper letters, 179 selfloop transitions, 35 changer transitions 12/244 dead transitions. [2022-12-13 11:50:29,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 244 transitions, 2014 flow [2022-12-13 11:50:29,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:50:29,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:50:29,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2022-12-13 11:50:29,670 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7625 [2022-12-13 11:50:29,670 INFO L175 Difference]: Start difference. First operand has 70 places, 85 transitions, 557 flow. Second operand 6 states and 183 transitions. [2022-12-13 11:50:29,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 244 transitions, 2014 flow [2022-12-13 11:50:31,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 244 transitions, 1914 flow, removed 50 selfloop flow, removed 2 redundant places. [2022-12-13 11:50:31,674 INFO L231 Difference]: Finished difference. Result has 76 places, 109 transitions, 891 flow [2022-12-13 11:50:31,674 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=891, PETRI_PLACES=76, PETRI_TRANSITIONS=109} [2022-12-13 11:50:31,674 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -7 predicate places. [2022-12-13 11:50:31,675 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:50:31,675 INFO L89 Accepts]: Start accepts. Operand has 76 places, 109 transitions, 891 flow [2022-12-13 11:50:31,675 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:50:31,676 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:50:31,676 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 109 transitions, 891 flow [2022-12-13 11:50:31,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 109 transitions, 891 flow [2022-12-13 11:50:33,188 INFO L130 PetriNetUnfolder]: 16858/26711 cut-off events. [2022-12-13 11:50:33,188 INFO L131 PetriNetUnfolder]: For 17849/27928 co-relation queries the response was YES. [2022-12-13 11:50:33,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95815 conditions, 26711 events. 16858/26711 cut-off events. For 17849/27928 co-relation queries the response was YES. Maximal size of possible extension queue 3663. Compared 233164 event pairs, 5208 based on Foata normal form. 48/12456 useless extension candidates. Maximal degree in co-relation 95790. Up to 22654 conditions per place. [2022-12-13 11:50:33,396 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 109 transitions, 891 flow [2022-12-13 11:50:33,396 INFO L226 LiptonReduction]: Number of co-enabled transitions 3400 [2022-12-13 11:50:33,601 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:50:33,602 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1927 [2022-12-13 11:50:33,602 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 109 transitions, 891 flow [2022-12-13 11:50:33,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:50:33,602 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:50:33,602 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:50:33,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:50:33,602 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:50:33,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:33,603 INFO L85 PathProgramCache]: Analyzing trace with hash 589353717, now seen corresponding path program 2 times [2022-12-13 11:50:33,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:33,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283063187] [2022-12-13 11:50:33,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:33,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:50:33,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:33,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283063187] [2022-12-13 11:50:33,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283063187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:33,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:33,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:50:33,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278612661] [2022-12-13 11:50:33,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:33,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:50:33,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:33,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:50:33,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:50:33,711 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2022-12-13 11:50:33,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 109 transitions, 891 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:50:33,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:50:33,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2022-12-13 11:50:33,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:50:37,300 INFO L130 PetriNetUnfolder]: 32223/49823 cut-off events. [2022-12-13 11:50:37,300 INFO L131 PetriNetUnfolder]: For 61634/64212 co-relation queries the response was YES. [2022-12-13 11:50:37,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202104 conditions, 49823 events. 32223/49823 cut-off events. For 61634/64212 co-relation queries the response was YES. Maximal size of possible extension queue 2847. Compared 401074 event pairs, 1381 based on Foata normal form. 4808/34975 useless extension candidates. Maximal degree in co-relation 202076. Up to 31114 conditions per place. [2022-12-13 11:50:37,514 INFO L137 encePairwiseOnDemand]: 25/40 looper letters, 105 selfloop transitions, 47 changer transitions 57/245 dead transitions. [2022-12-13 11:50:37,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 245 transitions, 2322 flow [2022-12-13 11:50:37,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:50:37,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:50:37,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 210 transitions. [2022-12-13 11:50:37,516 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.75 [2022-12-13 11:50:37,516 INFO L175 Difference]: Start difference. First operand has 76 places, 109 transitions, 891 flow. Second operand 7 states and 210 transitions. [2022-12-13 11:50:37,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 245 transitions, 2322 flow [2022-12-13 11:50:37,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 245 transitions, 2320 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-13 11:50:37,587 INFO L231 Difference]: Finished difference. Result has 85 places, 123 transitions, 1140 flow [2022-12-13 11:50:37,587 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1140, PETRI_PLACES=85, PETRI_TRANSITIONS=123} [2022-12-13 11:50:37,588 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, 2 predicate places. [2022-12-13 11:50:37,588 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:50:37,588 INFO L89 Accepts]: Start accepts. Operand has 85 places, 123 transitions, 1140 flow [2022-12-13 11:50:37,589 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:50:37,589 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:50:37,589 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 123 transitions, 1140 flow [2022-12-13 11:50:37,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 123 transitions, 1140 flow [2022-12-13 11:50:38,688 INFO L130 PetriNetUnfolder]: 8551/16654 cut-off events. [2022-12-13 11:50:38,688 INFO L131 PetriNetUnfolder]: For 24829/41101 co-relation queries the response was YES. [2022-12-13 11:50:38,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83667 conditions, 16654 events. 8551/16654 cut-off events. For 24829/41101 co-relation queries the response was YES. Maximal size of possible extension queue 2475. Compared 171808 event pairs, 816 based on Foata normal form. 46/8068 useless extension candidates. Maximal degree in co-relation 83637. Up to 14284 conditions per place. [2022-12-13 11:50:38,829 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 123 transitions, 1140 flow [2022-12-13 11:50:38,829 INFO L226 LiptonReduction]: Number of co-enabled transitions 3336 [2022-12-13 11:50:38,954 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] L863-3-->L867: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_111 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34) (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_21|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [359] L756-->L761: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 11:50:38,969 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] L863-3-->L867: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_111 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34) (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_21|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [475] L816-->P2FINAL: Formula: (and (= 0 |v_P2Thread1of1ForFork0_#res#1.offset_5|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1)) (= |v_P2Thread1of1ForFork0_#res#1.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P2Thread1of1ForFork0_#res#1.offset=|v_P2Thread1of1ForFork0_#res#1.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P2Thread1of1ForFork0_#res#1.base=|v_P2Thread1of1ForFork0_#res#1.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res#1.offset, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res#1.base] [2022-12-13 11:50:38,992 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] L863-3-->L867: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_111 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34) (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_21|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [482] L756-->P0FINAL: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_9| 0) (= v_~__unbuffered_cnt~0_85 (+ v_~__unbuffered_cnt~0_86 1)) (= |v_P0Thread1of1ForFork1_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-13 11:50:39,015 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] L863-3-->L867: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_111 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34) (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_21|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [521] L816-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res#1.offset_15| 0) (= |v_P2Thread1of1ForFork0_#res#1.base_15| 0) (= v_~__unbuffered_cnt~0_157 (+ v_~__unbuffered_cnt~0_158 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_158} OutVars{P2Thread1of1ForFork0_#res#1.offset=|v_P2Thread1of1ForFork0_#res#1.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_157, P2Thread1of1ForFork0_#res#1.base=|v_P2Thread1of1ForFork0_#res#1.base_15|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res#1.offset, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res#1.base] [2022-12-13 11:50:39,038 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] L863-3-->L867: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_111 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34) (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_21|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [481] L756-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_82 1) v_~__unbuffered_cnt~0_81)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-13 11:50:39,069 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] L863-3-->L867: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_111 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34) (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_21|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [526] L784-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork3_#res.base_9| 0) (= |v_P1Thread1of1ForFork3_#res.offset_9| 0) (= v_~__unbuffered_cnt~0_173 (+ v_~__unbuffered_cnt~0_174 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_174} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_9|, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_173} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0] [2022-12-13 11:50:39,093 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] L863-3-->L867: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_111 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34) (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_21|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [525] L784-->P1FINAL: Formula: (and (= v_~__unbuffered_cnt~0_169 (+ v_~__unbuffered_cnt~0_170 1)) (= |v_P1Thread1of1ForFork3_#res.offset_7| 0) (= |v_P1Thread1of1ForFork3_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_170} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_7|, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0] [2022-12-13 11:50:39,117 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] L863-3-->L867: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_111 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34) (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_21|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [365] L784-->L789: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 11:50:39,132 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] L863-3-->L867: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_111 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34) (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_21|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [373] L816-->L819: Formula: (= (+ v_~__unbuffered_cnt~0_6 1) v_~__unbuffered_cnt~0_5) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_6} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_5} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 11:50:41,225 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:50:41,226 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3638 [2022-12-13 11:50:41,226 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 122 transitions, 1166 flow [2022-12-13 11:50:41,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:50:41,226 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:50:41,226 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:50:41,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:50:41,227 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:50:41,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:41,227 INFO L85 PathProgramCache]: Analyzing trace with hash 281262184, now seen corresponding path program 1 times [2022-12-13 11:50:41,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:41,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038999273] [2022-12-13 11:50:41,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:41,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:41,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:50:41,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:41,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038999273] [2022-12-13 11:50:41,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038999273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:41,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:41,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:50:41,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208486739] [2022-12-13 11:50:41,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:41,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:50:41,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:41,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:50:41,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:50:41,377 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2022-12-13 11:50:41,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 122 transitions, 1166 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:50:41,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:50:41,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2022-12-13 11:50:41,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:50:45,795 INFO L130 PetriNetUnfolder]: 34751/55148 cut-off events. [2022-12-13 11:50:45,795 INFO L131 PetriNetUnfolder]: For 181029/188396 co-relation queries the response was YES. [2022-12-13 11:50:45,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299613 conditions, 55148 events. 34751/55148 cut-off events. For 181029/188396 co-relation queries the response was YES. Maximal size of possible extension queue 3924. Compared 472121 event pairs, 6542 based on Foata normal form. 1879/42071 useless extension candidates. Maximal degree in co-relation 299580. Up to 36293 conditions per place. [2022-12-13 11:50:46,066 INFO L137 encePairwiseOnDemand]: 46/49 looper letters, 100 selfloop transitions, 15 changer transitions 34/183 dead transitions. [2022-12-13 11:50:46,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 183 transitions, 2037 flow [2022-12-13 11:50:46,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:50:46,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:50:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2022-12-13 11:50:46,067 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6938775510204082 [2022-12-13 11:50:46,067 INFO L175 Difference]: Start difference. First operand has 84 places, 122 transitions, 1166 flow. Second operand 3 states and 102 transitions. [2022-12-13 11:50:46,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 183 transitions, 2037 flow [2022-12-13 11:51:22,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 183 transitions, 1675 flow, removed 139 selfloop flow, removed 4 redundant places. [2022-12-13 11:51:22,531 INFO L231 Difference]: Finished difference. Result has 83 places, 111 transitions, 893 flow [2022-12-13 11:51:22,531 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=893, PETRI_PLACES=83, PETRI_TRANSITIONS=111} [2022-12-13 11:51:22,532 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, 0 predicate places. [2022-12-13 11:51:22,532 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:51:22,532 INFO L89 Accepts]: Start accepts. Operand has 83 places, 111 transitions, 893 flow [2022-12-13 11:51:22,533 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:51:22,533 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:51:22,533 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 111 transitions, 893 flow [2022-12-13 11:51:22,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 111 transitions, 893 flow [2022-12-13 11:51:23,541 INFO L130 PetriNetUnfolder]: 12262/21146 cut-off events. [2022-12-13 11:51:23,542 INFO L131 PetriNetUnfolder]: For 27931/32626 co-relation queries the response was YES. [2022-12-13 11:51:23,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84871 conditions, 21146 events. 12262/21146 cut-off events. For 27931/32626 co-relation queries the response was YES. Maximal size of possible extension queue 3051. Compared 195552 event pairs, 1462 based on Foata normal form. 55/10006 useless extension candidates. Maximal degree in co-relation 84842. Up to 13375 conditions per place. [2022-12-13 11:51:23,781 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 111 transitions, 893 flow [2022-12-13 11:51:23,782 INFO L226 LiptonReduction]: Number of co-enabled transitions 2732 [2022-12-13 11:51:23,885 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:51:23,885 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1353 [2022-12-13 11:51:23,886 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 111 transitions, 893 flow [2022-12-13 11:51:23,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:51:23,886 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:51:23,886 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:51:23,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:51:23,886 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:51:23,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:51:23,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1513318707, now seen corresponding path program 1 times [2022-12-13 11:51:23,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:51:23,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809263142] [2022-12-13 11:51:23,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:51:23,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:51:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:24,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:51:24,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:51:24,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809263142] [2022-12-13 11:51:24,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809263142] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:51:24,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:51:24,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:51:24,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115279551] [2022-12-13 11:51:24,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:51:24,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:51:24,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:51:24,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:51:24,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:51:24,029 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2022-12-13 11:51:24,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 111 transitions, 893 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:51:24,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:51:24,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2022-12-13 11:51:24,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:51:29,385 INFO L130 PetriNetUnfolder]: 41631/65594 cut-off events. [2022-12-13 11:51:29,385 INFO L131 PetriNetUnfolder]: For 170848/175762 co-relation queries the response was YES. [2022-12-13 11:51:29,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283856 conditions, 65594 events. 41631/65594 cut-off events. For 170848/175762 co-relation queries the response was YES. Maximal size of possible extension queue 4128. Compared 560506 event pairs, 5752 based on Foata normal form. 2427/53670 useless extension candidates. Maximal degree in co-relation 283824. Up to 28707 conditions per place. [2022-12-13 11:51:29,702 INFO L137 encePairwiseOnDemand]: 31/40 looper letters, 171 selfloop transitions, 22 changer transitions 40/255 dead transitions. [2022-12-13 11:51:29,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 255 transitions, 2222 flow [2022-12-13 11:51:29,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:51:29,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:51:29,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 178 transitions. [2022-12-13 11:51:29,703 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7416666666666667 [2022-12-13 11:51:29,703 INFO L175 Difference]: Start difference. First operand has 82 places, 111 transitions, 893 flow. Second operand 6 states and 178 transitions. [2022-12-13 11:51:29,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 255 transitions, 2222 flow [2022-12-13 11:51:33,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 255 transitions, 2195 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 11:51:33,721 INFO L231 Difference]: Finished difference. Result has 88 places, 107 transitions, 914 flow [2022-12-13 11:51:33,722 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=914, PETRI_PLACES=88, PETRI_TRANSITIONS=107} [2022-12-13 11:51:33,722 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, 5 predicate places. [2022-12-13 11:51:33,722 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:51:33,722 INFO L89 Accepts]: Start accepts. Operand has 88 places, 107 transitions, 914 flow [2022-12-13 11:51:33,723 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:51:33,723 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:51:33,724 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 107 transitions, 914 flow [2022-12-13 11:51:33,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 107 transitions, 914 flow [2022-12-13 11:51:35,447 INFO L130 PetriNetUnfolder]: 18072/30206 cut-off events. [2022-12-13 11:51:35,448 INFO L131 PetriNetUnfolder]: For 37015/41820 co-relation queries the response was YES. [2022-12-13 11:51:35,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120086 conditions, 30206 events. 18072/30206 cut-off events. For 37015/41820 co-relation queries the response was YES. Maximal size of possible extension queue 4671. Compared 284320 event pairs, 2299 based on Foata normal form. 25/14126 useless extension candidates. Maximal degree in co-relation 120054. Up to 19774 conditions per place. [2022-12-13 11:51:35,694 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 107 transitions, 914 flow [2022-12-13 11:51:35,695 INFO L226 LiptonReduction]: Number of co-enabled transitions 2734 [2022-12-13 11:51:35,905 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:51:35,906 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2184 [2022-12-13 11:51:35,906 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 107 transitions, 914 flow [2022-12-13 11:51:35,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:51:35,906 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:51:35,906 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:51:35,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:51:35,906 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:51:35,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:51:35,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1866116563, now seen corresponding path program 2 times [2022-12-13 11:51:35,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:51:35,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119661762] [2022-12-13 11:51:35,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:51:35,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:51:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:36,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:51:36,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:51:36,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119661762] [2022-12-13 11:51:36,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119661762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:51:36,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:51:36,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:51:36,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369245205] [2022-12-13 11:51:36,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:51:36,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:51:36,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:51:36,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:51:36,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:51:36,173 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2022-12-13 11:51:36,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 107 transitions, 914 flow. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:51:36,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:51:36,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2022-12-13 11:51:36,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:51:39,992 INFO L130 PetriNetUnfolder]: 31955/51075 cut-off events. [2022-12-13 11:51:39,992 INFO L131 PetriNetUnfolder]: For 74653/75954 co-relation queries the response was YES. [2022-12-13 11:51:40,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216621 conditions, 51075 events. 31955/51075 cut-off events. For 74653/75954 co-relation queries the response was YES. Maximal size of possible extension queue 3171. Compared 439859 event pairs, 355 based on Foata normal form. 4710/33257 useless extension candidates. Maximal degree in co-relation 216586. Up to 23167 conditions per place. [2022-12-13 11:51:40,188 INFO L137 encePairwiseOnDemand]: 25/40 looper letters, 34 selfloop transitions, 49 changer transitions 101/192 dead transitions. [2022-12-13 11:51:40,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 192 transitions, 1943 flow [2022-12-13 11:51:40,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 11:51:40,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 11:51:40,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions. [2022-12-13 11:51:40,189 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.628125 [2022-12-13 11:51:40,189 INFO L175 Difference]: Start difference. First operand has 88 places, 107 transitions, 914 flow. Second operand 8 states and 201 transitions. [2022-12-13 11:51:40,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 192 transitions, 1943 flow [2022-12-13 11:51:43,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 192 transitions, 1843 flow, removed 28 selfloop flow, removed 4 redundant places. [2022-12-13 11:51:43,060 INFO L231 Difference]: Finished difference. Result has 94 places, 74 transitions, 555 flow [2022-12-13 11:51:43,060 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=555, PETRI_PLACES=94, PETRI_TRANSITIONS=74} [2022-12-13 11:51:43,060 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, 11 predicate places. [2022-12-13 11:51:43,060 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:51:43,060 INFO L89 Accepts]: Start accepts. Operand has 94 places, 74 transitions, 555 flow [2022-12-13 11:51:43,061 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:51:43,061 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:51:43,061 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 74 transitions, 555 flow [2022-12-13 11:51:43,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 74 transitions, 555 flow [2022-12-13 11:51:43,117 INFO L130 PetriNetUnfolder]: 679/1332 cut-off events. [2022-12-13 11:51:43,118 INFO L131 PetriNetUnfolder]: For 1756/1994 co-relation queries the response was YES. [2022-12-13 11:51:43,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6185 conditions, 1332 events. 679/1332 cut-off events. For 1756/1994 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 9144 event pairs, 4 based on Foata normal form. 0/598 useless extension candidates. Maximal degree in co-relation 6154. Up to 730 conditions per place. [2022-12-13 11:51:43,125 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 74 transitions, 555 flow [2022-12-13 11:51:43,125 INFO L226 LiptonReduction]: Number of co-enabled transitions 742 [2022-12-13 11:51:43,793 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 11:51:43,793 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 733 [2022-12-13 11:51:43,794 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 69 transitions, 545 flow [2022-12-13 11:51:43,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:51:43,794 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:51:43,794 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:51:43,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:51:43,794 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:51:43,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:51:43,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1147438989, now seen corresponding path program 1 times [2022-12-13 11:51:43,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:51:43,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612303549] [2022-12-13 11:51:43,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:51:43,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:51:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:44,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:51:44,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:51:44,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612303549] [2022-12-13 11:51:44,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612303549] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:51:44,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:51:44,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:51:44,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494226362] [2022-12-13 11:51:44,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:51:44,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:51:44,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:51:44,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:51:44,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:51:44,182 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2022-12-13 11:51:44,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 69 transitions, 545 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:51:44,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:51:44,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2022-12-13 11:51:44,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:51:44,533 INFO L130 PetriNetUnfolder]: 2209/3535 cut-off events. [2022-12-13 11:51:44,534 INFO L131 PetriNetUnfolder]: For 14318/14668 co-relation queries the response was YES. [2022-12-13 11:51:44,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18134 conditions, 3535 events. 2209/3535 cut-off events. For 14318/14668 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 21359 event pairs, 27 based on Foata normal form. 202/2615 useless extension candidates. Maximal degree in co-relation 18100. Up to 1869 conditions per place. [2022-12-13 11:51:44,550 INFO L137 encePairwiseOnDemand]: 27/33 looper letters, 82 selfloop transitions, 7 changer transitions 47/157 dead transitions. [2022-12-13 11:51:44,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 157 transitions, 1519 flow [2022-12-13 11:51:44,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:51:44,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:51:44,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2022-12-13 11:51:44,551 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5627705627705628 [2022-12-13 11:51:44,551 INFO L175 Difference]: Start difference. First operand has 77 places, 69 transitions, 545 flow. Second operand 7 states and 130 transitions. [2022-12-13 11:51:44,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 157 transitions, 1519 flow [2022-12-13 11:51:44,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 157 transitions, 1121 flow, removed 74 selfloop flow, removed 18 redundant places. [2022-12-13 11:51:44,631 INFO L231 Difference]: Finished difference. Result has 68 places, 72 transitions, 391 flow [2022-12-13 11:51:44,631 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=391, PETRI_PLACES=68, PETRI_TRANSITIONS=72} [2022-12-13 11:51:44,632 INFO L295 CegarLoopForPetriNet]: 83 programPoint places, -15 predicate places. [2022-12-13 11:51:44,632 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:51:44,632 INFO L89 Accepts]: Start accepts. Operand has 68 places, 72 transitions, 391 flow [2022-12-13 11:51:44,632 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:51:44,632 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:51:44,633 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 72 transitions, 391 flow [2022-12-13 11:51:44,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 72 transitions, 391 flow [2022-12-13 11:51:44,715 INFO L130 PetriNetUnfolder]: 1514/2494 cut-off events. [2022-12-13 11:51:44,715 INFO L131 PetriNetUnfolder]: For 1945/2139 co-relation queries the response was YES. [2022-12-13 11:51:44,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7177 conditions, 2494 events. 1514/2494 cut-off events. For 1945/2139 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 15841 event pairs, 9 based on Foata normal form. 14/847 useless extension candidates. Maximal degree in co-relation 7157. Up to 1216 conditions per place. [2022-12-13 11:51:44,728 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 72 transitions, 391 flow [2022-12-13 11:51:44,728 INFO L226 LiptonReduction]: Number of co-enabled transitions 728 [2022-12-13 11:51:44,730 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:51:44,730 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 11:51:44,730 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 72 transitions, 391 flow [2022-12-13 11:51:44,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:51:44,731 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:51:44,731 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:51:44,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 11:51:44,731 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:51:44,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:51:44,731 INFO L85 PathProgramCache]: Analyzing trace with hash -720440528, now seen corresponding path program 1 times [2022-12-13 11:51:44,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:51:44,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341796919] [2022-12-13 11:51:44,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:51:44,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:51:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:51:44,757 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:51:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:51:44,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:51:44,796 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:51:44,797 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 11:51:44,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 11:51:44,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 11:51:44,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 11:51:44,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 11:51:44,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 11:51:44,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 11:51:44,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 11:51:44,799 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:51:44,802 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:51:44,802 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:51:44,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:51:44 BasicIcfg [2022-12-13 11:51:44,849 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:51:44,850 INFO L158 Benchmark]: Toolchain (without parser) took 135111.69ms. Allocated memory was 183.5MB in the beginning and 7.1GB in the end (delta: 6.9GB). Free memory was 157.4MB in the beginning and 5.6GB in the end (delta: -5.5GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-12-13 11:51:44,850 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 183.5MB. Free memory is still 160.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:51:44,850 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.42ms. Allocated memory is still 183.5MB. Free memory was 157.4MB in the beginning and 130.2MB in the end (delta: 27.1MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 11:51:44,850 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.70ms. Allocated memory is still 183.5MB. Free memory was 130.0MB in the beginning and 127.5MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 11:51:44,850 INFO L158 Benchmark]: Boogie Preprocessor took 19.34ms. Allocated memory is still 183.5MB. Free memory was 127.5MB in the beginning and 125.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:51:44,850 INFO L158 Benchmark]: RCFGBuilder took 661.86ms. Allocated memory is still 183.5MB. Free memory was 125.4MB in the beginning and 139.4MB in the end (delta: -14.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-13 11:51:44,850 INFO L158 Benchmark]: TraceAbstraction took 134028.45ms. Allocated memory was 183.5MB in the beginning and 7.1GB in the end (delta: 6.9GB). Free memory was 138.4MB in the beginning and 5.6GB in the end (delta: -5.5GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-12-13 11:51:44,851 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 183.5MB. Free memory is still 160.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 336.42ms. Allocated memory is still 183.5MB. Free memory was 157.4MB in the beginning and 130.2MB in the end (delta: 27.1MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.70ms. Allocated memory is still 183.5MB. Free memory was 130.0MB in the beginning and 127.5MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.34ms. Allocated memory is still 183.5MB. Free memory was 127.5MB in the beginning and 125.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 661.86ms. Allocated memory is still 183.5MB. Free memory was 125.4MB in the beginning and 139.4MB in the end (delta: -14.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 134028.45ms. Allocated memory was 183.5MB in the beginning and 7.1GB in the end (delta: 6.9GB). Free memory was 138.4MB in the beginning and 5.6GB in the end (delta: -5.5GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 136 PlacesBefore, 83 PlacesAfterwards, 125 TransitionsBefore, 71 TransitionsAfterwards, 2852 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 52 ConcurrentYvCompositions, 3 ChoiceCompositions, 99 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4883, independent: 4737, independent conditional: 4737, independent unconditional: 0, dependent: 146, dependent conditional: 146, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4883, independent: 4737, independent conditional: 0, independent unconditional: 4737, dependent: 146, dependent conditional: 0, dependent unconditional: 146, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4883, independent: 4737, independent conditional: 0, independent unconditional: 4737, dependent: 146, dependent conditional: 0, dependent unconditional: 146, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4883, independent: 4737, independent conditional: 0, independent unconditional: 4737, dependent: 146, dependent conditional: 0, dependent unconditional: 146, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2666, independent: 2602, independent conditional: 0, independent unconditional: 2602, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2666, independent: 2563, independent conditional: 0, independent unconditional: 2563, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 103, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 262, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 232, dependent conditional: 0, dependent unconditional: 232, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4883, independent: 2135, independent conditional: 0, independent unconditional: 2135, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 2666, unknown conditional: 0, unknown unconditional: 2666] , Statistics on independence cache: Total cache size (in pairs): 5227, Positive cache size: 5163, Positive conditional cache size: 0, Positive unconditional cache size: 5163, Negative cache size: 64, Negative conditional cache size: 0, Negative unconditional cache size: 64, 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.2s, 52 PlacesBefore, 52 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 1000 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 415, independent: 371, independent conditional: 371, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 415, independent: 371, independent conditional: 7, independent unconditional: 364, dependent: 44, dependent conditional: 1, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 415, independent: 371, independent conditional: 7, independent unconditional: 364, dependent: 44, dependent conditional: 1, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 415, independent: 371, independent conditional: 7, independent unconditional: 364, dependent: 44, dependent conditional: 1, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 358, independent: 327, independent conditional: 7, independent unconditional: 320, dependent: 31, dependent conditional: 1, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 358, independent: 264, independent conditional: 0, independent unconditional: 264, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 94, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 31, dependent conditional: 1, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 145, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 94, dependent conditional: 5, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 415, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 358, unknown conditional: 8, unknown unconditional: 350] , Statistics on independence cache: Total cache size (in pairs): 358, Positive cache size: 327, Positive conditional cache size: 7, Positive unconditional cache size: 320, Negative cache size: 31, Negative conditional cache size: 1, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 53 PlacesBefore, 53 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 1134 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 319, independent: 295, independent conditional: 295, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 319, independent: 295, independent conditional: 32, independent unconditional: 263, dependent: 24, dependent conditional: 17, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 319, independent: 295, independent conditional: 2, independent unconditional: 293, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 319, independent: 295, independent conditional: 2, independent unconditional: 293, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 91, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 91, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 54, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 319, independent: 209, independent conditional: 2, independent unconditional: 207, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 91, unknown conditional: 0, unknown unconditional: 91] , Statistics on independence cache: Total cache size (in pairs): 449, Positive cache size: 413, Positive conditional cache size: 7, Positive unconditional cache size: 406, Negative cache size: 36, Negative conditional cache size: 1, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 47, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 1206 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 375, independent: 347, independent conditional: 347, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 375, independent: 347, independent conditional: 31, independent unconditional: 316, dependent: 28, dependent conditional: 15, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 375, independent: 347, independent conditional: 0, independent unconditional: 347, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 375, independent: 347, independent conditional: 0, independent unconditional: 347, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 375, independent: 344, independent conditional: 0, independent unconditional: 344, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 452, Positive cache size: 416, Positive conditional cache size: 7, Positive unconditional cache size: 409, Negative cache size: 36, Negative conditional cache size: 1, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 46, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 63 PlacesBefore, 62 PlacesAfterwards, 74 TransitionsBefore, 73 TransitionsAfterwards, 1988 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1246, independent: 1160, independent conditional: 1160, independent unconditional: 0, dependent: 86, dependent conditional: 86, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1246, independent: 1160, independent conditional: 520, independent unconditional: 640, dependent: 86, dependent conditional: 10, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1246, independent: 1160, independent conditional: 474, independent unconditional: 686, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1246, independent: 1160, independent conditional: 474, independent unconditional: 686, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 6, independent unconditional: 2, 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: 9, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1246, independent: 1152, independent conditional: 468, independent unconditional: 684, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 9, unknown conditional: 6, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 509, Positive cache size: 472, Positive conditional cache size: 13, Positive unconditional cache size: 459, Negative cache size: 37, Negative conditional cache size: 1, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 56, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23.0s, 69 PlacesBefore, 69 PlacesAfterwards, 98 TransitionsBefore, 97 TransitionsAfterwards, 2820 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1035, independent: 925, independent conditional: 925, independent unconditional: 0, dependent: 110, dependent conditional: 110, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1035, independent: 925, independent conditional: 335, independent unconditional: 590, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1035, independent: 925, independent conditional: 332, independent unconditional: 593, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1035, independent: 925, independent conditional: 332, independent unconditional: 593, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1035, independent: 919, independent conditional: 326, independent unconditional: 593, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 515, Positive cache size: 478, Positive conditional cache size: 19, Positive unconditional cache size: 459, Negative cache size: 37, Negative conditional cache size: 1, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 70 PlacesBefore, 70 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 2524 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 334, independent: 297, independent conditional: 297, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 334, independent: 297, independent conditional: 149, independent unconditional: 148, dependent: 37, dependent conditional: 25, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 334, independent: 297, independent conditional: 93, independent unconditional: 204, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 334, independent: 297, independent conditional: 93, independent unconditional: 204, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 4, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 334, independent: 295, independent conditional: 93, independent unconditional: 202, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 519, Positive cache size: 480, Positive conditional cache size: 19, Positive unconditional cache size: 461, Negative cache size: 39, Negative conditional cache size: 1, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 81, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 76 PlacesBefore, 76 PlacesAfterwards, 109 TransitionsBefore, 109 TransitionsAfterwards, 3400 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 535, independent: 485, independent conditional: 485, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 535, independent: 485, independent conditional: 320, independent unconditional: 165, dependent: 50, dependent conditional: 35, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 570, independent: 485, independent conditional: 185, independent unconditional: 300, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 570, independent: 485, independent conditional: 185, independent unconditional: 300, dependent: 85, dependent conditional: 0, dependent unconditional: 85, 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: 570, independent: 485, independent conditional: 185, independent unconditional: 300, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 519, Positive cache size: 480, Positive conditional cache size: 19, Positive unconditional cache size: 461, Negative cache size: 39, Negative conditional cache size: 1, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 205, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 85 PlacesBefore, 84 PlacesAfterwards, 123 TransitionsBefore, 122 TransitionsAfterwards, 3336 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1888, independent: 1767, independent conditional: 1767, independent unconditional: 0, dependent: 121, dependent conditional: 121, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1888, independent: 1767, independent conditional: 1354, independent unconditional: 413, dependent: 121, dependent conditional: 87, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1957, independent: 1767, independent conditional: 962, independent unconditional: 805, dependent: 190, dependent conditional: 0, dependent unconditional: 190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1957, independent: 1767, independent conditional: 962, independent unconditional: 805, dependent: 190, dependent conditional: 0, dependent unconditional: 190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 21, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1957, independent: 1745, independent conditional: 941, independent unconditional: 804, dependent: 190, dependent conditional: 0, dependent unconditional: 190, unknown: 22, unknown conditional: 21, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 583, Positive cache size: 544, Positive conditional cache size: 40, Positive unconditional cache size: 504, Negative cache size: 39, Negative conditional cache size: 1, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 548, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 82 PlacesBefore, 82 PlacesAfterwards, 111 TransitionsBefore, 111 TransitionsAfterwards, 2732 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 520, independent: 474, independent conditional: 474, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 520, independent: 474, independent conditional: 306, independent unconditional: 168, dependent: 46, dependent conditional: 31, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 551, independent: 474, independent conditional: 183, independent unconditional: 291, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 551, independent: 474, independent conditional: 183, independent unconditional: 291, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 551, independent: 471, independent conditional: 180, independent unconditional: 291, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 586, Positive cache size: 547, Positive conditional cache size: 43, Positive unconditional cache size: 504, Negative cache size: 39, Negative conditional cache size: 1, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 185, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 88 PlacesBefore, 88 PlacesAfterwards, 107 TransitionsBefore, 107 TransitionsAfterwards, 2734 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 470, independent: 424, independent conditional: 424, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 470, independent: 424, independent conditional: 290, independent unconditional: 134, dependent: 46, dependent conditional: 32, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 534, independent: 424, independent conditional: 180, independent unconditional: 244, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 534, independent: 424, independent conditional: 180, independent unconditional: 244, dependent: 110, dependent conditional: 0, dependent unconditional: 110, 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: 534, independent: 424, independent conditional: 180, independent unconditional: 244, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 586, Positive cache size: 547, Positive conditional cache size: 43, Positive unconditional cache size: 504, Negative cache size: 39, Negative conditional cache size: 1, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 206, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 82 PlacesBefore, 77 PlacesAfterwards, 74 TransitionsBefore, 69 TransitionsAfterwards, 742 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 453, independent: 397, independent conditional: 397, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 453, independent: 397, independent conditional: 222, independent unconditional: 175, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 453, independent: 397, independent conditional: 222, independent unconditional: 175, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 453, independent: 397, independent conditional: 222, independent unconditional: 175, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 33, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 453, independent: 389, independent conditional: 222, independent unconditional: 167, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 665, Positive cache size: 623, Positive conditional cache size: 46, Positive unconditional cache size: 577, Negative cache size: 42, Negative conditional cache size: 1, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 72 TransitionsBefore, 72 TransitionsAfterwards, 728 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): 665, Positive cache size: 623, Positive conditional cache size: 46, Positive unconditional cache size: 577, Negative cache size: 42, Negative conditional cache size: 1, 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 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t693; [L857] FCALL, FORK 0 pthread_create(&t693, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t693, ((void *)0), P0, ((void *)0))=-2, t693={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L858] 0 pthread_t t694; [L859] FCALL, FORK 0 pthread_create(&t694, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t694, ((void *)0), P1, ((void *)0))=-1, t693={5:0}, t694={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L860] 0 pthread_t t695; [L861] FCALL, FORK 0 pthread_create(&t695, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t695, ((void *)0), P2, ((void *)0))=0, t693={5:0}, t694={6:0}, t695={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L862] 0 pthread_t t696; [L863] FCALL, FORK 0 pthread_create(&t696, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t696, ((void *)0), P3, ((void *)0))=1, t693={5:0}, t694={6:0}, t695={7:0}, t696={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] 3 y$w_buff1 = y$w_buff0 [L796] 3 y$w_buff0 = 1 [L797] 3 y$w_buff1_used = y$w_buff0_used [L798] 3 y$w_buff0_used = (_Bool)1 [L799] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L799] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L800] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L801] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L802] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L803] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L804] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L805] 3 y$r_buff0_thd3 = (_Bool)1 [L808] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L825] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L831] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] 1 a = 1 [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L767] 2 x = 1 [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 y$flush_delayed = weak$$choice2 [L773] 2 y$mem_tmp = y [L774] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L775] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L776] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L777] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L778] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L780] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EAX = y [L782] 2 y = y$flush_delayed ? y$mem_tmp : y [L783] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L834] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L835] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L836] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L837] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L838] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L870] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L871] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L872] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L873] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L876] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 857]: 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: 863]: 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: 861]: 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: 859]: 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, 164 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 133.9s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 89.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 685 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 685 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 143 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1746 IncrementalHoareTripleChecker+Invalid, 1889 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 143 mSolverCounterUnsat, 39 mSDtfsCounter, 1746 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1166occurred in iteration=8, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 193 ConstructedInterpolants, 0 QuantifiedInterpolants, 1268 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 11:51:44,891 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...