/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-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix018.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 20:54:09,323 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 20:54:09,325 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 20:54:09,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 20:54:09,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 20:54:09,359 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 20:54:09,361 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 20:54:09,364 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 20:54:09,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 20:54:09,373 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 20:54:09,374 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 20:54:09,375 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 20:54:09,376 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 20:54:09,378 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 20:54:09,378 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 20:54:09,381 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 20:54:09,381 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 20:54:09,382 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 20:54:09,384 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 20:54:09,387 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 20:54:09,388 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 20:54:09,389 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 20:54:09,390 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 20:54:09,390 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 20:54:09,396 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 20:54:09,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 20:54:09,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 20:54:09,397 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 20:54:09,398 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 20:54:09,398 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 20:54:09,399 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 20:54:09,399 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 20:54:09,400 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 20:54:09,401 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 20:54:09,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 20:54:09,402 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 20:54:09,402 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 20:54:09,402 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 20:54:09,402 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 20:54:09,403 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 20:54:09,403 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 20:54:09,404 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-NoLbe.epf [2022-12-11 20:54:09,428 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 20:54:09,428 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 20:54:09,430 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 20:54:09,430 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 20:54:09,430 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 20:54:09,431 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 20:54:09,431 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 20:54:09,431 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 20:54:09,431 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 20:54:09,431 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 20:54:09,432 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 20:54:09,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 20:54:09,432 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 20:54:09,432 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 20:54:09,432 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 20:54:09,433 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 20:54:09,433 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 20:54:09,433 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 20:54:09,433 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 20:54:09,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 20:54:09,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 20:54:09,433 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 20:54:09,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 20:54:09,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 20:54:09,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 20:54:09,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 20:54:09,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 20:54:09,434 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 20:54:09,434 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 20:54:09,434 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 20:54:09,434 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 20:54:09,434 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-11 20:54:09,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 20:54:09,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 20:54:09,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 20:54:09,682 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 20:54:09,683 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 20:54:09,684 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix018.opt.i [2022-12-11 20:54:10,658 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 20:54:10,923 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 20:54:10,924 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018.opt.i [2022-12-11 20:54:10,939 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f56c233f/01e4b641ca104c19bbc7c7da099fb6be/FLAG1e5f63b7b [2022-12-11 20:54:10,956 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f56c233f/01e4b641ca104c19bbc7c7da099fb6be [2022-12-11 20:54:10,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 20:54:10,959 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 20:54:10,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 20:54:10,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 20:54:10,963 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 20:54:10,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 08:54:10" (1/1) ... [2022-12-11 20:54:10,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e0eaf43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:54:10, skipping insertion in model container [2022-12-11 20:54:10,964 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 08:54:10" (1/1) ... [2022-12-11 20:54:10,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 20:54:11,012 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 20:54:11,128 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/mix018.opt.i[944,957] [2022-12-11 20:54:11,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 20:54:11,281 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 20:54:11,294 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/mix018.opt.i[944,957] [2022-12-11 20:54:11,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:11,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:11,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 20:54:11,377 INFO L208 MainTranslator]: Completed translation [2022-12-11 20:54:11,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:54:11 WrapperNode [2022-12-11 20:54:11,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 20:54:11,378 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 20:54:11,378 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 20:54:11,378 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 20:54:11,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:54:11" (1/1) ... [2022-12-11 20:54:11,406 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:54:11" (1/1) ... [2022-12-11 20:54:11,425 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 163 [2022-12-11 20:54:11,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 20:54:11,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 20:54:11,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 20:54:11,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 20:54:11,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:54:11" (1/1) ... [2022-12-11 20:54:11,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:54:11" (1/1) ... [2022-12-11 20:54:11,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:54:11" (1/1) ... [2022-12-11 20:54:11,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:54:11" (1/1) ... [2022-12-11 20:54:11,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:54:11" (1/1) ... [2022-12-11 20:54:11,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:54:11" (1/1) ... [2022-12-11 20:54:11,446 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:54:11" (1/1) ... [2022-12-11 20:54:11,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:54:11" (1/1) ... [2022-12-11 20:54:11,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 20:54:11,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 20:54:11,451 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 20:54:11,451 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 20:54:11,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:54:11" (1/1) ... [2022-12-11 20:54:11,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 20:54:11,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 20:54:11,474 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-11 20:54:11,477 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-11 20:54:11,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 20:54:11,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 20:54:11,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 20:54:11,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 20:54:11,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 20:54:11,513 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 20:54:11,513 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 20:54:11,513 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 20:54:11,513 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 20:54:11,513 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-11 20:54:11,513 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-11 20:54:11,513 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-11 20:54:11,513 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-11 20:54:11,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 20:54:11,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 20:54:11,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 20:54:11,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 20:54:11,515 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 20:54:11,678 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 20:54:11,681 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 20:54:11,910 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 20:54:12,092 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 20:54:12,092 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 20:54:12,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 08:54:12 BoogieIcfgContainer [2022-12-11 20:54:12,094 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 20:54:12,096 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 20:54:12,096 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 20:54:12,098 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 20:54:12,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 08:54:10" (1/3) ... [2022-12-11 20:54:12,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a3a471e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 08:54:12, skipping insertion in model container [2022-12-11 20:54:12,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:54:11" (2/3) ... [2022-12-11 20:54:12,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a3a471e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 08:54:12, skipping insertion in model container [2022-12-11 20:54:12,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 08:54:12" (3/3) ... [2022-12-11 20:54:12,103 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018.opt.i [2022-12-11 20:54:12,118 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 20:54:12,118 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 20:54:12,119 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 20:54:12,173 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 20:54:12,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 276 flow [2022-12-11 20:54:12,263 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-11 20:54:12,263 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 20:54:12,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-11 20:54:12,268 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 128 transitions, 276 flow [2022-12-11 20:54:12,273 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 124 transitions, 260 flow [2022-12-11 20:54:12,285 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 20:54:12,292 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=PETRI_NET, 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;@3ed90cce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 20:54:12,293 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-11 20:54:12,321 INFO L130 PetriNetUnfolder]: 0/86 cut-off events. [2022-12-11 20:54:12,321 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 20:54:12,321 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:54:12,322 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:54:12,323 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:54:12,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:54:12,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1886531903, now seen corresponding path program 1 times [2022-12-11 20:54:12,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:54:12,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019837812] [2022-12-11 20:54:12,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:54:12,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:54:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:54:12,857 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-11 20:54:12,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:54:12,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019837812] [2022-12-11 20:54:12,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019837812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:54:12,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:54:12,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 20:54:12,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767021362] [2022-12-11 20:54:12,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:54:12,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 20:54:12,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:54:12,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 20:54:12,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 20:54:12,902 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 128 [2022-12-11 20:54:12,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 124 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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-11 20:54:12,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:54:12,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 128 [2022-12-11 20:54:12,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:54:12,971 INFO L130 PetriNetUnfolder]: 14/163 cut-off events. [2022-12-11 20:54:12,971 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-11 20:54:12,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 163 events. 14/163 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 280 event pairs, 2 based on Foata normal form. 7/161 useless extension candidates. Maximal degree in co-relation 159. Up to 25 conditions per place. [2022-12-11 20:54:12,975 INFO L137 encePairwiseOnDemand]: 123/128 looper letters, 10 selfloop transitions, 2 changer transitions 0/122 dead transitions. [2022-12-11 20:54:12,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 122 transitions, 280 flow [2022-12-11 20:54:12,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 20:54:12,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 20:54:12,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2022-12-11 20:54:12,989 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9348958333333334 [2022-12-11 20:54:12,994 INFO L295 CegarLoopForPetriNet]: 135 programPoint places, 0 predicate places. [2022-12-11 20:54:12,994 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 122 transitions, 280 flow [2022-12-11 20:54:12,997 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 122 transitions, 280 flow [2022-12-11 20:54:12,998 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 122 transitions, 280 flow [2022-12-11 20:54:12,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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-11 20:54:12,998 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:54:12,998 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:54:12,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 20:54:12,999 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:54:13,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:54:13,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1588948766, now seen corresponding path program 1 times [2022-12-11 20:54:13,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:54:13,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346106117] [2022-12-11 20:54:13,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:54:13,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:54:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:54:13,394 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-11 20:54:13,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:54:13,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346106117] [2022-12-11 20:54:13,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346106117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:54:13,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:54:13,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 20:54:13,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393868644] [2022-12-11 20:54:13,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:54:13,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 20:54:13,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:54:13,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 20:54:13,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 20:54:13,398 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 128 [2022-12-11 20:54:13,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 122 transitions, 280 flow. Second operand has 7 states, 7 states have (on average 101.28571428571429) internal successors, (709), 7 states have internal predecessors, (709), 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-11 20:54:13,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:54:13,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 128 [2022-12-11 20:54:13,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:54:14,213 INFO L130 PetriNetUnfolder]: 1866/4519 cut-off events. [2022-12-11 20:54:14,213 INFO L131 PetriNetUnfolder]: For 770/1704 co-relation queries the response was YES. [2022-12-11 20:54:14,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8273 conditions, 4519 events. 1866/4519 cut-off events. For 770/1704 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 38404 event pairs, 229 based on Foata normal form. 2/4412 useless extension candidates. Maximal degree in co-relation 8210. Up to 1023 conditions per place. [2022-12-11 20:54:14,234 INFO L137 encePairwiseOnDemand]: 117/128 looper letters, 34 selfloop transitions, 7 changer transitions 81/206 dead transitions. [2022-12-11 20:54:14,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 206 transitions, 728 flow [2022-12-11 20:54:14,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 20:54:14,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 20:54:14,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1396 transitions. [2022-12-11 20:54:14,237 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8389423076923077 [2022-12-11 20:54:14,238 INFO L295 CegarLoopForPetriNet]: 135 programPoint places, 12 predicate places. [2022-12-11 20:54:14,238 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 206 transitions, 728 flow [2022-12-11 20:54:14,248 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 125 transitions, 378 flow [2022-12-11 20:54:14,249 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 125 transitions, 378 flow [2022-12-11 20:54:14,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.28571428571429) internal successors, (709), 7 states have internal predecessors, (709), 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-11 20:54:14,249 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:54:14,249 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:54:14,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 20:54:14,250 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:54:14,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:54:14,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1775832951, now seen corresponding path program 1 times [2022-12-11 20:54:14,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:54:14,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235846140] [2022-12-11 20:54:14,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:54:14,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:54:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:54:14,455 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-11 20:54:14,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:54:14,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235846140] [2022-12-11 20:54:14,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235846140] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:54:14,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:54:14,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 20:54:14,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484671850] [2022-12-11 20:54:14,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:54:14,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 20:54:14,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:54:14,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 20:54:14,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 20:54:14,458 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 128 [2022-12-11 20:54:14,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 125 transitions, 378 flow. Second operand has 6 states, 6 states have (on average 107.33333333333333) internal successors, (644), 6 states have internal predecessors, (644), 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-11 20:54:14,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:54:14,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 128 [2022-12-11 20:54:14,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:54:14,880 INFO L130 PetriNetUnfolder]: 1135/2410 cut-off events. [2022-12-11 20:54:14,880 INFO L131 PetriNetUnfolder]: For 967/3537 co-relation queries the response was YES. [2022-12-11 20:54:14,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6159 conditions, 2410 events. 1135/2410 cut-off events. For 967/3537 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 16920 event pairs, 178 based on Foata normal form. 54/2416 useless extension candidates. Maximal degree in co-relation 6092. Up to 1215 conditions per place. [2022-12-11 20:54:14,895 INFO L137 encePairwiseOnDemand]: 121/128 looper letters, 43 selfloop transitions, 5 changer transitions 43/184 dead transitions. [2022-12-11 20:54:14,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 184 transitions, 865 flow [2022-12-11 20:54:14,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 20:54:14,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 20:54:14,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1006 transitions. [2022-12-11 20:54:14,898 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8732638888888888 [2022-12-11 20:54:14,899 INFO L295 CegarLoopForPetriNet]: 135 programPoint places, -1 predicate places. [2022-12-11 20:54:14,900 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 184 transitions, 865 flow [2022-12-11 20:54:14,911 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 141 transitions, 571 flow [2022-12-11 20:54:14,914 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 141 transitions, 571 flow [2022-12-11 20:54:14,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.33333333333333) internal successors, (644), 6 states have internal predecessors, (644), 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-11 20:54:14,916 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:54:14,916 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:54:14,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 20:54:14,917 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:54:14,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:54:14,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1502969244, now seen corresponding path program 1 times [2022-12-11 20:54:14,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:54:14,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072483139] [2022-12-11 20:54:14,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:54:14,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:54:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:54:15,163 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-11 20:54:15,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:54:15,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072483139] [2022-12-11 20:54:15,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072483139] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:54:15,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:54:15,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 20:54:15,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052806062] [2022-12-11 20:54:15,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:54:15,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 20:54:15,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:54:15,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 20:54:15,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 20:54:15,165 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 128 [2022-12-11 20:54:15,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 141 transitions, 571 flow. Second operand has 6 states, 6 states have (on average 105.33333333333333) internal successors, (632), 6 states have internal predecessors, (632), 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-11 20:54:15,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:54:15,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 128 [2022-12-11 20:54:15,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:54:15,734 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L821-->L837: Formula: (let ((.cse8 (= 0 (mod v_~z$r_buff1_thd4~0_56 256))) (.cse9 (= (mod v_~z$r_buff0_thd4~0_65 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_128 256) 0)) (.cse1 (and .cse9 (= (mod v_~z$w_buff1_used~0_119 256) 0))) (.cse2 (and .cse9 .cse8))) (let ((.cse7 (= (mod v_~z$w_buff1_used~0_118 256) 0)) (.cse3 (= (mod v_~z$w_buff0_used~0_127 256) 0)) (.cse0 (not (= 0 (mod v_~weak$$choice2~0_66 256)))) (.cse4 (or .cse11 .cse1 .cse2)) (.cse5 (and .cse10 (not .cse11)))) (and (= v_~weak$$choice2~0_66 |v_P3Thread1of1ForFork1_#t~nondet6#1_1|) (= (ite .cse0 v_~z$w_buff1_used~0_119 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_119 0)) v_~z$w_buff1_used~0_118) (= (ite .cse4 v_~z~0_91 (ite .cse5 v_~z$w_buff0~0_61 v_~z$w_buff1~0_72)) v_~__unbuffered_p3_EAX~0_10) (= v_~z$flush_delayed~0_46 0) (= v_~z$mem_tmp~0_32 v_~z~0_91) (= (ite .cse0 v_~z$r_buff1_thd4~0_56 (ite (let ((.cse6 (= 0 (mod v_~z$r_buff0_thd4~0_64 256)))) (or (and .cse6 .cse7) (and .cse6 .cse8) .cse3)) v_~z$r_buff1_thd4~0_56 0)) v_~z$r_buff1_thd4~0_55) (= v_~z$w_buff0~0_61 v_~z$w_buff0~0_60) (= v_~z$r_buff0_thd4~0_64 (ite .cse0 v_~z$r_buff0_thd4~0_65 (ite (or .cse2 (and .cse9 .cse7) .cse3) v_~z$r_buff0_thd4~0_65 (ite (and .cse10 (not .cse3)) 0 v_~z$r_buff0_thd4~0_65)))) (= v_~weak$$choice0~0_12 |v_P3Thread1of1ForFork1_#t~nondet5#1_1|) (= (ite .cse0 v_~z$mem_tmp~0_32 v_~__unbuffered_p3_EAX~0_10) v_~z~0_90) (= v_~z$w_buff1~0_72 v_~z$w_buff1~0_71) (= v_~z$w_buff0_used~0_127 (ite .cse0 v_~z$w_buff0_used~0_128 (ite .cse4 v_~z$w_buff0_used~0_128 (ite .cse5 0 v_~z$w_buff0_used~0_128)))))))) InVars {P3Thread1of1ForFork1_#t~nondet5#1=|v_P3Thread1of1ForFork1_#t~nondet5#1_1|, P3Thread1of1ForFork1_#t~nondet6#1=|v_P3Thread1of1ForFork1_#t~nondet6#1_1|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_56, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_128, ~z$w_buff0~0=v_~z$w_buff0~0_61, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_65, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_119, ~z$w_buff1~0=v_~z$w_buff1~0_72, ~z~0=v_~z~0_91} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_32, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_55, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_127, ~z$w_buff0~0=v_~z$w_buff0~0_60, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_118, ~z$w_buff1~0=v_~z$w_buff1~0_71, ~z$flush_delayed~0=v_~z$flush_delayed~0_46, ~weak$$choice0~0=v_~weak$$choice0~0_12, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_64, ~z~0=v_~z~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_66} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#t~nondet6#1, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, ~weak$$choice0~0, P3Thread1of1ForFork1_#t~nondet5#1, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~z~0, ~weak$$choice2~0][176], [44#L837true, 59#L756true, P3Thread1of1ForFork1InUse, 145#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 105#L771true, P1Thread1of1ForFork2InUse, 197#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 57#$Ultimate##0true, 168#true, 64#L3true, 142#true]) [2022-12-11 20:54:15,734 INFO L382 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-12-11 20:54:15,735 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-11 20:54:15,735 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-11 20:54:15,735 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-11 20:54:15,735 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([390] L783-->L799: Formula: (let ((.cse8 (= (mod v_~z$r_buff1_thd3~0_40 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_42 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and .cse8 .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_112 256) 0)) (.cse4 (and (= (mod v_~z$w_buff1_used~0_105 256) 0) .cse9))) (let ((.cse0 (or .cse3 .cse11 .cse4)) (.cse1 (and (not .cse11) .cse10)) (.cse2 (not (= (mod v_~weak$$choice2~0_58 256) 0))) (.cse6 (= 0 (mod v_~z$w_buff1_used~0_104 256))) (.cse5 (= (mod v_~z$w_buff0_used~0_111 256) 0))) (and (= (ite .cse0 v_~z~0_75 (ite .cse1 v_~z$w_buff0~0_45 v_~z$w_buff1~0_58)) v_~__unbuffered_p2_EAX~0_10) (= v_~z$w_buff1~0_58 v_~z$w_buff1~0_57) (= v_~z$w_buff0_used~0_111 (ite .cse2 v_~z$w_buff0_used~0_112 (ite .cse0 v_~z$w_buff0_used~0_112 (ite .cse1 0 v_~z$w_buff0_used~0_112)))) (= v_~z~0_74 (ite .cse2 v_~z$mem_tmp~0_26 v_~__unbuffered_p2_EAX~0_10)) (= v_~z$w_buff1_used~0_104 (ite .cse2 v_~z$w_buff1_used~0_105 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff1_used~0_105 0))) (= v_~z$w_buff0~0_45 v_~z$w_buff0~0_44) (= v_~z$flush_delayed~0_36 0) (= (ite .cse2 v_~z$r_buff1_thd3~0_40 (ite (let ((.cse7 (= (mod v_~z$r_buff0_thd3~0_41 256) 0))) (or (and .cse6 .cse7) (and .cse8 .cse7) .cse5)) v_~z$r_buff1_thd3~0_40 0)) v_~z$r_buff1_thd3~0_39) (= v_~z$r_buff0_thd3~0_41 (ite .cse2 v_~z$r_buff0_thd3~0_42 (ite (or .cse3 (and .cse6 .cse9) .cse5) v_~z$r_buff0_thd3~0_42 (ite (and .cse10 (not .cse5)) 0 v_~z$r_buff0_thd3~0_42)))) (= |v_P2Thread1of1ForFork3_#t~nondet4_1| v_~weak$$choice2~0_58) (= v_~z$mem_tmp~0_26 v_~z~0_75) (= |v_P2Thread1of1ForFork3_#t~nondet3_1| v_~weak$$choice0~0_8))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_112, ~z$w_buff0~0=v_~z$w_buff0~0_45, P2Thread1of1ForFork3_#t~nondet4=|v_P2Thread1of1ForFork3_#t~nondet4_1|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_40, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_105, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$w_buff1~0=v_~z$w_buff1~0_58, P2Thread1of1ForFork3_#t~nondet3=|v_P2Thread1of1ForFork3_#t~nondet3_1|, ~z~0=v_~z~0_75} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_26, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_111, ~z$w_buff0~0=v_~z$w_buff0~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_104, ~z$w_buff1~0=v_~z$w_buff1~0_57, ~z$flush_delayed~0=v_~z$flush_delayed~0_36, ~weak$$choice0~0=v_~weak$$choice0~0_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_41, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_74, ~weak$$choice2~0=v_~weak$$choice2~0_58} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork3_#t~nondet4, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork3_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][175], [24#L799true, 59#L756true, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 105#L771true, P1Thread1of1ForFork2InUse, 197#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 147#(= ~__unbuffered_p3_EAX~0 0), 7#L821true, 168#true, 64#L3true, 142#true]) [2022-12-11 20:54:15,735 INFO L382 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-12-11 20:54:15,735 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-11 20:54:15,735 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-11 20:54:15,735 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-11 20:54:15,735 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L771-->L776: 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][145], [59#L756true, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P1Thread1of1ForFork2InUse, 57#$Ultimate##0true, 147#(= ~__unbuffered_p3_EAX~0 0), 199#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 7#L821true, 64#L3true, 168#true, 142#true, 55#L776true]) [2022-12-11 20:54:15,736 INFO L382 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-12-11 20:54:15,736 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-11 20:54:15,736 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-11 20:54:15,736 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-11 20:54:15,841 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L771-->L776: 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][145], [24#L799true, 59#L756true, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P1Thread1of1ForFork2InUse, 27#$Ultimate##0true, 147#(= ~__unbuffered_p3_EAX~0 0), 199#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 168#true, 64#L3true, 144#(= ~z$w_buff0_used~0 0), 55#L776true]) [2022-12-11 20:54:15,842 INFO L382 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-12-11 20:54:15,842 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-12-11 20:54:15,842 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-12-11 20:54:15,842 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-12-11 20:54:15,844 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L821-->L837: Formula: (let ((.cse8 (= 0 (mod v_~z$r_buff1_thd4~0_56 256))) (.cse9 (= (mod v_~z$r_buff0_thd4~0_65 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_128 256) 0)) (.cse1 (and .cse9 (= (mod v_~z$w_buff1_used~0_119 256) 0))) (.cse2 (and .cse9 .cse8))) (let ((.cse7 (= (mod v_~z$w_buff1_used~0_118 256) 0)) (.cse3 (= (mod v_~z$w_buff0_used~0_127 256) 0)) (.cse0 (not (= 0 (mod v_~weak$$choice2~0_66 256)))) (.cse4 (or .cse11 .cse1 .cse2)) (.cse5 (and .cse10 (not .cse11)))) (and (= v_~weak$$choice2~0_66 |v_P3Thread1of1ForFork1_#t~nondet6#1_1|) (= (ite .cse0 v_~z$w_buff1_used~0_119 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_119 0)) v_~z$w_buff1_used~0_118) (= (ite .cse4 v_~z~0_91 (ite .cse5 v_~z$w_buff0~0_61 v_~z$w_buff1~0_72)) v_~__unbuffered_p3_EAX~0_10) (= v_~z$flush_delayed~0_46 0) (= v_~z$mem_tmp~0_32 v_~z~0_91) (= (ite .cse0 v_~z$r_buff1_thd4~0_56 (ite (let ((.cse6 (= 0 (mod v_~z$r_buff0_thd4~0_64 256)))) (or (and .cse6 .cse7) (and .cse6 .cse8) .cse3)) v_~z$r_buff1_thd4~0_56 0)) v_~z$r_buff1_thd4~0_55) (= v_~z$w_buff0~0_61 v_~z$w_buff0~0_60) (= v_~z$r_buff0_thd4~0_64 (ite .cse0 v_~z$r_buff0_thd4~0_65 (ite (or .cse2 (and .cse9 .cse7) .cse3) v_~z$r_buff0_thd4~0_65 (ite (and .cse10 (not .cse3)) 0 v_~z$r_buff0_thd4~0_65)))) (= v_~weak$$choice0~0_12 |v_P3Thread1of1ForFork1_#t~nondet5#1_1|) (= (ite .cse0 v_~z$mem_tmp~0_32 v_~__unbuffered_p3_EAX~0_10) v_~z~0_90) (= v_~z$w_buff1~0_72 v_~z$w_buff1~0_71) (= v_~z$w_buff0_used~0_127 (ite .cse0 v_~z$w_buff0_used~0_128 (ite .cse4 v_~z$w_buff0_used~0_128 (ite .cse5 0 v_~z$w_buff0_used~0_128)))))))) InVars {P3Thread1of1ForFork1_#t~nondet5#1=|v_P3Thread1of1ForFork1_#t~nondet5#1_1|, P3Thread1of1ForFork1_#t~nondet6#1=|v_P3Thread1of1ForFork1_#t~nondet6#1_1|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_56, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_128, ~z$w_buff0~0=v_~z$w_buff0~0_61, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_65, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_119, ~z$w_buff1~0=v_~z$w_buff1~0_72, ~z~0=v_~z~0_91} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_32, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_55, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_127, ~z$w_buff0~0=v_~z$w_buff0~0_60, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_118, ~z$w_buff1~0=v_~z$w_buff1~0_71, ~z$flush_delayed~0=v_~z$flush_delayed~0_46, ~weak$$choice0~0=v_~weak$$choice0~0_12, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_64, ~z~0=v_~z~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_66} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#t~nondet6#1, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, ~weak$$choice0~0, P3Thread1of1ForFork1_#t~nondet5#1, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~z~0, ~weak$$choice2~0][176], [59#L756true, 44#L837true, P3Thread1of1ForFork1InUse, 145#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 105#L771true, P1Thread1of1ForFork2InUse, 197#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 57#$Ultimate##0true, 168#true, 127#L3-1true, 142#true]) [2022-12-11 20:54:15,844 INFO L382 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-12-11 20:54:15,844 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-12-11 20:54:15,844 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-12-11 20:54:15,844 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-12-11 20:54:15,844 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([390] L783-->L799: Formula: (let ((.cse8 (= (mod v_~z$r_buff1_thd3~0_40 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_42 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and .cse8 .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_112 256) 0)) (.cse4 (and (= (mod v_~z$w_buff1_used~0_105 256) 0) .cse9))) (let ((.cse0 (or .cse3 .cse11 .cse4)) (.cse1 (and (not .cse11) .cse10)) (.cse2 (not (= (mod v_~weak$$choice2~0_58 256) 0))) (.cse6 (= 0 (mod v_~z$w_buff1_used~0_104 256))) (.cse5 (= (mod v_~z$w_buff0_used~0_111 256) 0))) (and (= (ite .cse0 v_~z~0_75 (ite .cse1 v_~z$w_buff0~0_45 v_~z$w_buff1~0_58)) v_~__unbuffered_p2_EAX~0_10) (= v_~z$w_buff1~0_58 v_~z$w_buff1~0_57) (= v_~z$w_buff0_used~0_111 (ite .cse2 v_~z$w_buff0_used~0_112 (ite .cse0 v_~z$w_buff0_used~0_112 (ite .cse1 0 v_~z$w_buff0_used~0_112)))) (= v_~z~0_74 (ite .cse2 v_~z$mem_tmp~0_26 v_~__unbuffered_p2_EAX~0_10)) (= v_~z$w_buff1_used~0_104 (ite .cse2 v_~z$w_buff1_used~0_105 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff1_used~0_105 0))) (= v_~z$w_buff0~0_45 v_~z$w_buff0~0_44) (= v_~z$flush_delayed~0_36 0) (= (ite .cse2 v_~z$r_buff1_thd3~0_40 (ite (let ((.cse7 (= (mod v_~z$r_buff0_thd3~0_41 256) 0))) (or (and .cse6 .cse7) (and .cse8 .cse7) .cse5)) v_~z$r_buff1_thd3~0_40 0)) v_~z$r_buff1_thd3~0_39) (= v_~z$r_buff0_thd3~0_41 (ite .cse2 v_~z$r_buff0_thd3~0_42 (ite (or .cse3 (and .cse6 .cse9) .cse5) v_~z$r_buff0_thd3~0_42 (ite (and .cse10 (not .cse5)) 0 v_~z$r_buff0_thd3~0_42)))) (= |v_P2Thread1of1ForFork3_#t~nondet4_1| v_~weak$$choice2~0_58) (= v_~z$mem_tmp~0_26 v_~z~0_75) (= |v_P2Thread1of1ForFork3_#t~nondet3_1| v_~weak$$choice0~0_8))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_112, ~z$w_buff0~0=v_~z$w_buff0~0_45, P2Thread1of1ForFork3_#t~nondet4=|v_P2Thread1of1ForFork3_#t~nondet4_1|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_40, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_105, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$w_buff1~0=v_~z$w_buff1~0_58, P2Thread1of1ForFork3_#t~nondet3=|v_P2Thread1of1ForFork3_#t~nondet3_1|, ~z~0=v_~z~0_75} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_26, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_111, ~z$w_buff0~0=v_~z$w_buff0~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_104, ~z$w_buff1~0=v_~z$w_buff1~0_57, ~z$flush_delayed~0=v_~z$flush_delayed~0_36, ~weak$$choice0~0=v_~weak$$choice0~0_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_41, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_74, ~weak$$choice2~0=v_~weak$$choice2~0_58} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork3_#t~nondet4, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork3_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][175], [24#L799true, 59#L756true, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 105#L771true, P1Thread1of1ForFork2InUse, 197#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 147#(= ~__unbuffered_p3_EAX~0 0), 7#L821true, 168#true, 127#L3-1true, 142#true]) [2022-12-11 20:54:15,844 INFO L382 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-12-11 20:54:15,845 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 20:54:15,845 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 20:54:15,845 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 20:54:15,845 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L771-->L776: 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][145], [59#L756true, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P1Thread1of1ForFork2InUse, 57#$Ultimate##0true, 147#(= ~__unbuffered_p3_EAX~0 0), 199#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 7#L821true, 168#true, 127#L3-1true, 142#true, 55#L776true]) [2022-12-11 20:54:15,845 INFO L382 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-12-11 20:54:15,845 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-12-11 20:54:15,846 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-12-11 20:54:15,846 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-12-11 20:54:15,934 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([396] L809-->L821: Formula: (and (= v_~z$r_buff0_thd0~0_27 v_~z$r_buff1_thd0~0_25) (= v_~z$r_buff0_thd1~0_11 v_~z$r_buff1_thd1~0_11) (= v_~z$r_buff0_thd4~0_72 1) (= v_~z$w_buff0~0_68 1) (= v_~z$w_buff0_used~0_136 v_~z$w_buff1_used~0_124) (= v_~z$w_buff0~0_69 v_~z$w_buff1~0_77) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_~expression#1_3| |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3|) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~z$w_buff1_used~0_124 256) 0)) (not (= (mod v_~z$w_buff0_used~0_135 256) 0)))) 1 0)) (not (= |v_P3Thread1of1ForFork1___VERIFIER_assert_~expression#1_3| 0)) (= v_~z$r_buff0_thd4~0_73 v_~z$r_buff1_thd4~0_61) (= v_~z$r_buff0_thd3~0_47 v_~z$r_buff1_thd3~0_45) (= v_~z$w_buff0_used~0_135 1) (= v_~z$r_buff0_thd2~0_13 v_~z$r_buff1_thd2~0_13)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_27, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_136, ~z$w_buff0~0=v_~z$w_buff0~0_69, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_73, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_13} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_61, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_135, ~z$w_buff0~0=v_~z$w_buff0~0_68, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_45, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_13, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_124, ~z$w_buff1~0=v_~z$w_buff1~0_77, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3|, P3Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork1___VERIFIER_assert_~expression#1_3|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_27, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_25, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_72, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_13} AuxVars[] AssignedVars[P3Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression#1][143], [24#L799true, 59#L756true, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 105#L771true, P1Thread1of1ForFork2InUse, 197#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 147#(= ~__unbuffered_p3_EAX~0 0), 7#L821true, 64#L3true, 168#true, 142#true]) [2022-12-11 20:54:15,934 INFO L382 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-12-11 20:54:15,934 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-11 20:54:15,934 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-11 20:54:15,934 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-11 20:54:15,935 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L771-->L776: 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][145], [24#L799true, 59#L756true, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P1Thread1of1ForFork2InUse, 27#$Ultimate##0true, 147#(= ~__unbuffered_p3_EAX~0 0), 199#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 168#true, 127#L3-1true, 144#(= ~z$w_buff0_used~0 0), 55#L776true]) [2022-12-11 20:54:15,935 INFO L382 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-12-11 20:54:15,935 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-11 20:54:15,935 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-11 20:54:15,935 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-11 20:54:15,935 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L771-->L776: 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][203], [59#L756true, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, 131#L804true, P2Thread1of1ForFork3InUse, P1Thread1of1ForFork2InUse, 27#$Ultimate##0true, 147#(= ~__unbuffered_p3_EAX~0 0), 199#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 168#true, 64#L3true, 144#(= ~z$w_buff0_used~0 0), 55#L776true]) [2022-12-11 20:54:15,935 INFO L382 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-12-11 20:54:15,935 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-11 20:54:15,935 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-11 20:54:15,936 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-11 20:54:16,078 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([396] L809-->L821: Formula: (and (= v_~z$r_buff0_thd0~0_27 v_~z$r_buff1_thd0~0_25) (= v_~z$r_buff0_thd1~0_11 v_~z$r_buff1_thd1~0_11) (= v_~z$r_buff0_thd4~0_72 1) (= v_~z$w_buff0~0_68 1) (= v_~z$w_buff0_used~0_136 v_~z$w_buff1_used~0_124) (= v_~z$w_buff0~0_69 v_~z$w_buff1~0_77) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_~expression#1_3| |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3|) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~z$w_buff1_used~0_124 256) 0)) (not (= (mod v_~z$w_buff0_used~0_135 256) 0)))) 1 0)) (not (= |v_P3Thread1of1ForFork1___VERIFIER_assert_~expression#1_3| 0)) (= v_~z$r_buff0_thd4~0_73 v_~z$r_buff1_thd4~0_61) (= v_~z$r_buff0_thd3~0_47 v_~z$r_buff1_thd3~0_45) (= v_~z$w_buff0_used~0_135 1) (= v_~z$r_buff0_thd2~0_13 v_~z$r_buff1_thd2~0_13)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_27, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_136, ~z$w_buff0~0=v_~z$w_buff0~0_69, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_73, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_13} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_61, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_135, ~z$w_buff0~0=v_~z$w_buff0~0_68, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_45, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_13, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_124, ~z$w_buff1~0=v_~z$w_buff1~0_77, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3|, P3Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork1___VERIFIER_assert_~expression#1_3|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_27, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_25, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_72, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_13} AuxVars[] AssignedVars[P3Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression#1][200], [59#L756true, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, 131#L804true, P2Thread1of1ForFork3InUse, 105#L771true, P1Thread1of1ForFork2InUse, 147#(= ~__unbuffered_p3_EAX~0 0), 199#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 7#L821true, 168#true, 64#L3true, 142#true]) [2022-12-11 20:54:16,079 INFO L382 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-12-11 20:54:16,079 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 20:54:16,079 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 20:54:16,079 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 20:54:16,081 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([396] L809-->L821: Formula: (and (= v_~z$r_buff0_thd0~0_27 v_~z$r_buff1_thd0~0_25) (= v_~z$r_buff0_thd1~0_11 v_~z$r_buff1_thd1~0_11) (= v_~z$r_buff0_thd4~0_72 1) (= v_~z$w_buff0~0_68 1) (= v_~z$w_buff0_used~0_136 v_~z$w_buff1_used~0_124) (= v_~z$w_buff0~0_69 v_~z$w_buff1~0_77) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_~expression#1_3| |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3|) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~z$w_buff1_used~0_124 256) 0)) (not (= (mod v_~z$w_buff0_used~0_135 256) 0)))) 1 0)) (not (= |v_P3Thread1of1ForFork1___VERIFIER_assert_~expression#1_3| 0)) (= v_~z$r_buff0_thd4~0_73 v_~z$r_buff1_thd4~0_61) (= v_~z$r_buff0_thd3~0_47 v_~z$r_buff1_thd3~0_45) (= v_~z$w_buff0_used~0_135 1) (= v_~z$r_buff0_thd2~0_13 v_~z$r_buff1_thd2~0_13)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_27, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_136, ~z$w_buff0~0=v_~z$w_buff0~0_69, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_73, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_13} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_61, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_135, ~z$w_buff0~0=v_~z$w_buff0~0_68, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_45, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_13, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_124, ~z$w_buff1~0=v_~z$w_buff1~0_77, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3|, P3Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork1___VERIFIER_assert_~expression#1_3|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_27, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_25, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_72, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_13} AuxVars[] AssignedVars[P3Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression#1][143], [24#L799true, 59#L756true, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 105#L771true, P1Thread1of1ForFork2InUse, 197#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 147#(= ~__unbuffered_p3_EAX~0 0), 7#L821true, 168#true, 127#L3-1true, 142#true]) [2022-12-11 20:54:16,081 INFO L382 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-12-11 20:54:16,081 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 20:54:16,081 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 20:54:16,081 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 20:54:16,082 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L771-->L776: 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][203], [59#L756true, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, 131#L804true, P2Thread1of1ForFork3InUse, P1Thread1of1ForFork2InUse, 27#$Ultimate##0true, 147#(= ~__unbuffered_p3_EAX~0 0), 199#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 168#true, 127#L3-1true, 144#(= ~z$w_buff0_used~0 0), 55#L776true]) [2022-12-11 20:54:16,082 INFO L382 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-12-11 20:54:16,082 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 20:54:16,082 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 20:54:16,082 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 20:54:16,163 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([396] L809-->L821: Formula: (and (= v_~z$r_buff0_thd0~0_27 v_~z$r_buff1_thd0~0_25) (= v_~z$r_buff0_thd1~0_11 v_~z$r_buff1_thd1~0_11) (= v_~z$r_buff0_thd4~0_72 1) (= v_~z$w_buff0~0_68 1) (= v_~z$w_buff0_used~0_136 v_~z$w_buff1_used~0_124) (= v_~z$w_buff0~0_69 v_~z$w_buff1~0_77) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_~expression#1_3| |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3|) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~z$w_buff1_used~0_124 256) 0)) (not (= (mod v_~z$w_buff0_used~0_135 256) 0)))) 1 0)) (not (= |v_P3Thread1of1ForFork1___VERIFIER_assert_~expression#1_3| 0)) (= v_~z$r_buff0_thd4~0_73 v_~z$r_buff1_thd4~0_61) (= v_~z$r_buff0_thd3~0_47 v_~z$r_buff1_thd3~0_45) (= v_~z$w_buff0_used~0_135 1) (= v_~z$r_buff0_thd2~0_13 v_~z$r_buff1_thd2~0_13)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_27, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_136, ~z$w_buff0~0=v_~z$w_buff0~0_69, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_73, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_13} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_61, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_135, ~z$w_buff0~0=v_~z$w_buff0~0_68, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_45, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_13, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_124, ~z$w_buff1~0=v_~z$w_buff1~0_77, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3|, P3Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork1___VERIFIER_assert_~expression#1_3|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_27, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_25, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_72, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_13} AuxVars[] AssignedVars[P3Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression#1][200], [59#L756true, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, 131#L804true, P2Thread1of1ForFork3InUse, 105#L771true, P1Thread1of1ForFork2InUse, 147#(= ~__unbuffered_p3_EAX~0 0), 199#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 7#L821true, 168#true, 127#L3-1true, 142#true]) [2022-12-11 20:54:16,163 INFO L382 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-12-11 20:54:16,163 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-11 20:54:16,163 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-11 20:54:16,163 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-11 20:54:16,702 INFO L130 PetriNetUnfolder]: 8026/13480 cut-off events. [2022-12-11 20:54:16,702 INFO L131 PetriNetUnfolder]: For 22351/24469 co-relation queries the response was YES. [2022-12-11 20:54:16,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38439 conditions, 13480 events. 8026/13480 cut-off events. For 22351/24469 co-relation queries the response was YES. Maximal size of possible extension queue 964. Compared 106883 event pairs, 306 based on Foata normal form. 46/12495 useless extension candidates. Maximal degree in co-relation 38368. Up to 4889 conditions per place. [2022-12-11 20:54:16,778 INFO L137 encePairwiseOnDemand]: 117/128 looper letters, 149 selfloop transitions, 20 changer transitions 0/270 dead transitions. [2022-12-11 20:54:16,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 270 transitions, 1731 flow [2022-12-11 20:54:16,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 20:54:16,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 20:54:16,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1121 transitions. [2022-12-11 20:54:16,781 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.87578125 [2022-12-11 20:54:16,781 INFO L295 CegarLoopForPetriNet]: 135 programPoint places, 2 predicate places. [2022-12-11 20:54:16,781 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 270 transitions, 1731 flow [2022-12-11 20:54:16,871 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 270 transitions, 1731 flow [2022-12-11 20:54:16,872 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 270 transitions, 1731 flow [2022-12-11 20:54:16,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.33333333333333) internal successors, (632), 6 states have internal predecessors, (632), 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-11 20:54:16,872 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:54:16,872 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:54:16,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 20:54:16,873 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:54:16,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:54:16,873 INFO L85 PathProgramCache]: Analyzing trace with hash 146535737, now seen corresponding path program 1 times [2022-12-11 20:54:16,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:54:16,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563981096] [2022-12-11 20:54:16,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:54:16,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:54:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:54:17,085 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-11 20:54:17,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:54:17,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563981096] [2022-12-11 20:54:17,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563981096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:54:17,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:54:17,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 20:54:17,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561811029] [2022-12-11 20:54:17,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:54:17,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 20:54:17,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:54:17,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 20:54:17,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 20:54:17,089 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 128 [2022-12-11 20:54:17,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 270 transitions, 1731 flow. Second operand has 7 states, 7 states have (on average 101.71428571428571) internal successors, (712), 7 states have internal predecessors, (712), 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-11 20:54:17,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:54:17,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 128 [2022-12-11 20:54:17,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:54:19,029 INFO L130 PetriNetUnfolder]: 11005/19043 cut-off events. [2022-12-11 20:54:19,029 INFO L131 PetriNetUnfolder]: For 45757/52186 co-relation queries the response was YES. [2022-12-11 20:54:19,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61064 conditions, 19043 events. 11005/19043 cut-off events. For 45757/52186 co-relation queries the response was YES. Maximal size of possible extension queue 1263. Compared 161178 event pairs, 545 based on Foata normal form. 555/18650 useless extension candidates. Maximal degree in co-relation 60985. Up to 6657 conditions per place. [2022-12-11 20:54:19,264 INFO L137 encePairwiseOnDemand]: 117/128 looper letters, 198 selfloop transitions, 29 changer transitions 32/375 dead transitions. [2022-12-11 20:54:19,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 375 transitions, 3150 flow [2022-12-11 20:54:19,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 20:54:19,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 20:54:19,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1072 transitions. [2022-12-11 20:54:19,266 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8375 [2022-12-11 20:54:19,267 INFO L295 CegarLoopForPetriNet]: 135 programPoint places, 11 predicate places. [2022-12-11 20:54:19,267 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 375 transitions, 3150 flow [2022-12-11 20:54:19,313 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 343 transitions, 2824 flow [2022-12-11 20:54:19,313 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 343 transitions, 2824 flow [2022-12-11 20:54:19,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.71428571428571) internal successors, (712), 7 states have internal predecessors, (712), 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-11 20:54:19,314 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:54:19,314 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:54:19,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 20:54:19,314 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:54:19,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:54:19,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1865455729, now seen corresponding path program 1 times [2022-12-11 20:54:19,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:54:19,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985316494] [2022-12-11 20:54:19,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:54:19,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:54:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:54:19,462 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-11 20:54:19,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:54:19,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985316494] [2022-12-11 20:54:19,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985316494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:54:19,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:54:19,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 20:54:19,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912589018] [2022-12-11 20:54:19,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:54:19,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 20:54:19,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:54:19,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 20:54:19,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 20:54:19,464 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 128 [2022-12-11 20:54:19,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 343 transitions, 2824 flow. Second operand has 7 states, 7 states have (on average 105.14285714285714) internal successors, (736), 7 states have internal predecessors, (736), 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-11 20:54:19,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:54:19,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 128 [2022-12-11 20:54:19,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:54:21,359 INFO L130 PetriNetUnfolder]: 8120/16710 cut-off events. [2022-12-11 20:54:21,359 INFO L131 PetriNetUnfolder]: For 40027/45567 co-relation queries the response was YES. [2022-12-11 20:54:21,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59814 conditions, 16710 events. 8120/16710 cut-off events. For 40027/45567 co-relation queries the response was YES. Maximal size of possible extension queue 1252. Compared 165216 event pairs, 185 based on Foata normal form. 844/17043 useless extension candidates. Maximal degree in co-relation 59731. Up to 5505 conditions per place. [2022-12-11 20:54:21,454 INFO L137 encePairwiseOnDemand]: 117/128 looper letters, 338 selfloop transitions, 46 changer transitions 35/548 dead transitions. [2022-12-11 20:54:21,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 548 transitions, 5710 flow [2022-12-11 20:54:21,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 20:54:21,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 20:54:21,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1458 transitions. [2022-12-11 20:54:21,457 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8762019230769231 [2022-12-11 20:54:21,458 INFO L295 CegarLoopForPetriNet]: 135 programPoint places, 23 predicate places. [2022-12-11 20:54:21,458 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 548 transitions, 5710 flow [2022-12-11 20:54:21,491 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 513 transitions, 5265 flow [2022-12-11 20:54:21,491 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 513 transitions, 5265 flow [2022-12-11 20:54:21,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.14285714285714) internal successors, (736), 7 states have internal predecessors, (736), 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-11 20:54:21,492 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:54:21,492 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:54:21,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 20:54:21,492 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:54:21,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:54:21,492 INFO L85 PathProgramCache]: Analyzing trace with hash 896533544, now seen corresponding path program 1 times [2022-12-11 20:54:21,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:54:21,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081229701] [2022-12-11 20:54:21,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:54:21,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:54:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:54:21,722 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-11 20:54:21,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:54:21,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081229701] [2022-12-11 20:54:21,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081229701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:54:21,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:54:21,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 20:54:21,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437827266] [2022-12-11 20:54:21,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:54:21,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 20:54:21,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:54:21,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 20:54:21,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-11 20:54:21,727 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 128 [2022-12-11 20:54:21,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 513 transitions, 5265 flow. Second operand has 8 states, 8 states have (on average 105.125) internal successors, (841), 8 states have internal predecessors, (841), 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-11 20:54:21,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:54:21,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 128 [2022-12-11 20:54:21,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:54:23,949 INFO L130 PetriNetUnfolder]: 7096/15277 cut-off events. [2022-12-11 20:54:23,949 INFO L131 PetriNetUnfolder]: For 38527/44640 co-relation queries the response was YES. [2022-12-11 20:54:24,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64367 conditions, 15277 events. 7096/15277 cut-off events. For 38527/44640 co-relation queries the response was YES. Maximal size of possible extension queue 1217. Compared 156938 event pairs, 118 based on Foata normal form. 973/15864 useless extension candidates. Maximal degree in co-relation 64280. Up to 4550 conditions per place. [2022-12-11 20:54:24,043 INFO L137 encePairwiseOnDemand]: 117/128 looper letters, 318 selfloop transitions, 88 changer transitions 205/716 dead transitions. [2022-12-11 20:54:24,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 716 transitions, 8797 flow [2022-12-11 20:54:24,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 20:54:24,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 20:54:24,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1795 transitions. [2022-12-11 20:54:24,046 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.87646484375 [2022-12-11 20:54:24,047 INFO L295 CegarLoopForPetriNet]: 135 programPoint places, 38 predicate places. [2022-12-11 20:54:24,047 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 716 transitions, 8797 flow [2022-12-11 20:54:24,075 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 511 transitions, 5976 flow [2022-12-11 20:54:24,076 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 511 transitions, 5976 flow [2022-12-11 20:54:24,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 105.125) internal successors, (841), 8 states have internal predecessors, (841), 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-11 20:54:24,076 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:54:24,076 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:54:24,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 20:54:24,077 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:54:24,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:54:24,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1820098584, now seen corresponding path program 1 times [2022-12-11 20:54:24,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:54:24,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309068716] [2022-12-11 20:54:24,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:54:24,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:54:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:54:24,258 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-11 20:54:24,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:54:24,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309068716] [2022-12-11 20:54:24,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309068716] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:54:24,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:54:24,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 20:54:24,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873894667] [2022-12-11 20:54:24,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:54:24,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 20:54:24,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:54:24,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 20:54:24,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 20:54:24,260 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 128 [2022-12-11 20:54:24,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 511 transitions, 5976 flow. Second operand has 7 states, 7 states have (on average 106.57142857142857) internal successors, (746), 7 states have internal predecessors, (746), 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-11 20:54:24,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:54:24,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 128 [2022-12-11 20:54:24,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:54:26,840 INFO L130 PetriNetUnfolder]: 10636/24750 cut-off events. [2022-12-11 20:54:26,840 INFO L131 PetriNetUnfolder]: For 81308/89595 co-relation queries the response was YES. [2022-12-11 20:54:26,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103987 conditions, 24750 events. 10636/24750 cut-off events. For 81308/89595 co-relation queries the response was YES. Maximal size of possible extension queue 2093. Compared 291078 event pairs, 143 based on Foata normal form. 1045/25362 useless extension candidates. Maximal degree in co-relation 103895. Up to 7362 conditions per place. [2022-12-11 20:54:27,077 INFO L137 encePairwiseOnDemand]: 122/128 looper letters, 387 selfloop transitions, 4 changer transitions 202/802 dead transitions. [2022-12-11 20:54:27,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 802 transitions, 11708 flow [2022-12-11 20:54:27,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 20:54:27,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 20:54:27,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 779 transitions. [2022-12-11 20:54:27,097 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8694196428571429 [2022-12-11 20:54:27,098 INFO L295 CegarLoopForPetriNet]: 135 programPoint places, 38 predicate places. [2022-12-11 20:54:27,098 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 802 transitions, 11708 flow [2022-12-11 20:54:27,152 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 600 transitions, 8140 flow [2022-12-11 20:54:27,153 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 600 transitions, 8140 flow [2022-12-11 20:54:27,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.57142857142857) internal successors, (746), 7 states have internal predecessors, (746), 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-11 20:54:27,153 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:54:27,154 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:54:27,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 20:54:27,154 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:54:27,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:54:27,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1129491486, now seen corresponding path program 2 times [2022-12-11 20:54:27,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:54:27,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97884607] [2022-12-11 20:54:27,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:54:27,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:54:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:54:27,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:54:27,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:54:27,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97884607] [2022-12-11 20:54:27,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97884607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:54:27,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:54:27,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 20:54:27,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252552645] [2022-12-11 20:54:27,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:54:27,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 20:54:27,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:54:27,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 20:54:27,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-11 20:54:27,375 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 128 [2022-12-11 20:54:27,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 600 transitions, 8140 flow. Second operand has 9 states, 9 states have (on average 105.0) internal successors, (945), 9 states have internal predecessors, (945), 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-11 20:54:27,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:54:27,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 128 [2022-12-11 20:54:27,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:54:29,670 INFO L130 PetriNetUnfolder]: 6754/16017 cut-off events. [2022-12-11 20:54:29,671 INFO L131 PetriNetUnfolder]: For 59608/69692 co-relation queries the response was YES. [2022-12-11 20:54:29,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78768 conditions, 16017 events. 6754/16017 cut-off events. For 59608/69692 co-relation queries the response was YES. Maximal size of possible extension queue 1385. Compared 179878 event pairs, 115 based on Foata normal form. 1941/17591 useless extension candidates. Maximal degree in co-relation 78672. Up to 4532 conditions per place. [2022-12-11 20:54:29,770 INFO L137 encePairwiseOnDemand]: 117/128 looper letters, 128 selfloop transitions, 67 changer transitions 330/615 dead transitions. [2022-12-11 20:54:29,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 615 transitions, 9332 flow [2022-12-11 20:54:29,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-11 20:54:29,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-11 20:54:29,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2092 transitions. [2022-12-11 20:54:29,774 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8601973684210527 [2022-12-11 20:54:29,774 INFO L295 CegarLoopForPetriNet]: 135 programPoint places, 53 predicate places. [2022-12-11 20:54:29,774 INFO L82 GeneralOperation]: Start removeDead. Operand has 188 places, 615 transitions, 9332 flow [2022-12-11 20:54:29,795 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 285 transitions, 3346 flow [2022-12-11 20:54:29,795 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 285 transitions, 3346 flow [2022-12-11 20:54:29,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 105.0) internal successors, (945), 9 states have internal predecessors, (945), 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-11 20:54:29,796 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:54:29,796 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:54:29,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 20:54:29,796 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:54:29,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:54:29,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1385408944, now seen corresponding path program 1 times [2022-12-11 20:54:29,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:54:29,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907159986] [2022-12-11 20:54:29,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:54:29,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:54:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:54:31,144 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-11 20:54:31,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:54:31,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907159986] [2022-12-11 20:54:31,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907159986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:54:31,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:54:31,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-11 20:54:31,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823321578] [2022-12-11 20:54:31,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:54:31,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-11 20:54:31,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:54:31,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-11 20:54:31,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-12-11 20:54:31,150 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 128 [2022-12-11 20:54:31,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 285 transitions, 3346 flow. Second operand has 14 states, 14 states have (on average 91.42857142857143) internal successors, (1280), 14 states have internal predecessors, (1280), 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-11 20:54:31,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:54:31,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 128 [2022-12-11 20:54:31,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:54:32,234 INFO L130 PetriNetUnfolder]: 2879/7949 cut-off events. [2022-12-11 20:54:32,234 INFO L131 PetriNetUnfolder]: For 36791/43722 co-relation queries the response was YES. [2022-12-11 20:54:32,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38913 conditions, 7949 events. 2879/7949 cut-off events. For 36791/43722 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 86706 event pairs, 72 based on Foata normal form. 344/8126 useless extension candidates. Maximal degree in co-relation 38800. Up to 3125 conditions per place. [2022-12-11 20:54:32,276 INFO L137 encePairwiseOnDemand]: 109/128 looper letters, 92 selfloop transitions, 111 changer transitions 98/450 dead transitions. [2022-12-11 20:54:32,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 450 transitions, 7015 flow [2022-12-11 20:54:32,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-11 20:54:32,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-11 20:54:32,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1675 transitions. [2022-12-11 20:54:32,279 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7269965277777778 [2022-12-11 20:54:32,280 INFO L295 CegarLoopForPetriNet]: 135 programPoint places, 56 predicate places. [2022-12-11 20:54:32,280 INFO L82 GeneralOperation]: Start removeDead. Operand has 191 places, 450 transitions, 7015 flow [2022-12-11 20:54:32,295 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 186 places, 352 transitions, 4965 flow [2022-12-11 20:54:32,296 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 352 transitions, 4965 flow [2022-12-11 20:54:32,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 91.42857142857143) internal successors, (1280), 14 states have internal predecessors, (1280), 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-11 20:54:32,296 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:54:32,296 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:54:32,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 20:54:32,297 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:54:32,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:54:32,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1000452532, now seen corresponding path program 2 times [2022-12-11 20:54:32,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:54:32,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697732430] [2022-12-11 20:54:32,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:54:32,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:54:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:54:32,479 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-11 20:54:32,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:54:32,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697732430] [2022-12-11 20:54:32,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697732430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:54:32,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:54:32,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 20:54:32,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202655380] [2022-12-11 20:54:32,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:54:32,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 20:54:32,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:54:32,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 20:54:32,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 20:54:32,481 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 128 [2022-12-11 20:54:32,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 352 transitions, 4965 flow. Second operand has 7 states, 7 states have (on average 100.71428571428571) internal successors, (705), 7 states have internal predecessors, (705), 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-11 20:54:32,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:54:32,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 128 [2022-12-11 20:54:32,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:54:32,926 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([390] L783-->L799: Formula: (let ((.cse8 (= (mod v_~z$r_buff1_thd3~0_40 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_42 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and .cse8 .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_112 256) 0)) (.cse4 (and (= (mod v_~z$w_buff1_used~0_105 256) 0) .cse9))) (let ((.cse0 (or .cse3 .cse11 .cse4)) (.cse1 (and (not .cse11) .cse10)) (.cse2 (not (= (mod v_~weak$$choice2~0_58 256) 0))) (.cse6 (= 0 (mod v_~z$w_buff1_used~0_104 256))) (.cse5 (= (mod v_~z$w_buff0_used~0_111 256) 0))) (and (= (ite .cse0 v_~z~0_75 (ite .cse1 v_~z$w_buff0~0_45 v_~z$w_buff1~0_58)) v_~__unbuffered_p2_EAX~0_10) (= v_~z$w_buff1~0_58 v_~z$w_buff1~0_57) (= v_~z$w_buff0_used~0_111 (ite .cse2 v_~z$w_buff0_used~0_112 (ite .cse0 v_~z$w_buff0_used~0_112 (ite .cse1 0 v_~z$w_buff0_used~0_112)))) (= v_~z~0_74 (ite .cse2 v_~z$mem_tmp~0_26 v_~__unbuffered_p2_EAX~0_10)) (= v_~z$w_buff1_used~0_104 (ite .cse2 v_~z$w_buff1_used~0_105 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff1_used~0_105 0))) (= v_~z$w_buff0~0_45 v_~z$w_buff0~0_44) (= v_~z$flush_delayed~0_36 0) (= (ite .cse2 v_~z$r_buff1_thd3~0_40 (ite (let ((.cse7 (= (mod v_~z$r_buff0_thd3~0_41 256) 0))) (or (and .cse6 .cse7) (and .cse8 .cse7) .cse5)) v_~z$r_buff1_thd3~0_40 0)) v_~z$r_buff1_thd3~0_39) (= v_~z$r_buff0_thd3~0_41 (ite .cse2 v_~z$r_buff0_thd3~0_42 (ite (or .cse3 (and .cse6 .cse9) .cse5) v_~z$r_buff0_thd3~0_42 (ite (and .cse10 (not .cse5)) 0 v_~z$r_buff0_thd3~0_42)))) (= |v_P2Thread1of1ForFork3_#t~nondet4_1| v_~weak$$choice2~0_58) (= v_~z$mem_tmp~0_26 v_~z~0_75) (= |v_P2Thread1of1ForFork3_#t~nondet3_1| v_~weak$$choice0~0_8))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_112, ~z$w_buff0~0=v_~z$w_buff0~0_45, P2Thread1of1ForFork3_#t~nondet4=|v_P2Thread1of1ForFork3_#t~nondet4_1|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_40, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_105, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$w_buff1~0=v_~z$w_buff1~0_58, P2Thread1of1ForFork3_#t~nondet3=|v_P2Thread1of1ForFork3_#t~nondet3_1|, ~z~0=v_~z~0_75} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_26, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_111, ~z$w_buff0~0=v_~z$w_buff0~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_104, ~z$w_buff1~0=v_~z$w_buff1~0_57, ~z$flush_delayed~0=v_~z$flush_delayed~0_36, ~weak$$choice0~0=v_~weak$$choice0~0_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_41, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_74, ~weak$$choice2~0=v_~weak$$choice2~0_58} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork3_#t~nondet4, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork3_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][196], [24#L799true, P3Thread1of1ForFork1InUse, 145#true, 233#(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|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork0InUse, 70#L847true, 259#(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|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork2InUse, 105#L771true, 364#(= ~y~0 1), 324#(= ~z$r_buff0_thd0~0 0), 200#true, 15#L761true, 12#L875true, 168#true, 184#true, 272#(= ~a~0 1), 142#true, 307#(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|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0))]) [2022-12-11 20:54:32,926 INFO L382 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-12-11 20:54:32,927 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-11 20:54:32,927 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-11 20:54:32,927 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-11 20:54:33,004 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([390] L783-->L799: Formula: (let ((.cse8 (= (mod v_~z$r_buff1_thd3~0_40 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_42 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and .cse8 .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_112 256) 0)) (.cse4 (and (= (mod v_~z$w_buff1_used~0_105 256) 0) .cse9))) (let ((.cse0 (or .cse3 .cse11 .cse4)) (.cse1 (and (not .cse11) .cse10)) (.cse2 (not (= (mod v_~weak$$choice2~0_58 256) 0))) (.cse6 (= 0 (mod v_~z$w_buff1_used~0_104 256))) (.cse5 (= (mod v_~z$w_buff0_used~0_111 256) 0))) (and (= (ite .cse0 v_~z~0_75 (ite .cse1 v_~z$w_buff0~0_45 v_~z$w_buff1~0_58)) v_~__unbuffered_p2_EAX~0_10) (= v_~z$w_buff1~0_58 v_~z$w_buff1~0_57) (= v_~z$w_buff0_used~0_111 (ite .cse2 v_~z$w_buff0_used~0_112 (ite .cse0 v_~z$w_buff0_used~0_112 (ite .cse1 0 v_~z$w_buff0_used~0_112)))) (= v_~z~0_74 (ite .cse2 v_~z$mem_tmp~0_26 v_~__unbuffered_p2_EAX~0_10)) (= v_~z$w_buff1_used~0_104 (ite .cse2 v_~z$w_buff1_used~0_105 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff1_used~0_105 0))) (= v_~z$w_buff0~0_45 v_~z$w_buff0~0_44) (= v_~z$flush_delayed~0_36 0) (= (ite .cse2 v_~z$r_buff1_thd3~0_40 (ite (let ((.cse7 (= (mod v_~z$r_buff0_thd3~0_41 256) 0))) (or (and .cse6 .cse7) (and .cse8 .cse7) .cse5)) v_~z$r_buff1_thd3~0_40 0)) v_~z$r_buff1_thd3~0_39) (= v_~z$r_buff0_thd3~0_41 (ite .cse2 v_~z$r_buff0_thd3~0_42 (ite (or .cse3 (and .cse6 .cse9) .cse5) v_~z$r_buff0_thd3~0_42 (ite (and .cse10 (not .cse5)) 0 v_~z$r_buff0_thd3~0_42)))) (= |v_P2Thread1of1ForFork3_#t~nondet4_1| v_~weak$$choice2~0_58) (= v_~z$mem_tmp~0_26 v_~z~0_75) (= |v_P2Thread1of1ForFork3_#t~nondet3_1| v_~weak$$choice0~0_8))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_112, ~z$w_buff0~0=v_~z$w_buff0~0_45, P2Thread1of1ForFork3_#t~nondet4=|v_P2Thread1of1ForFork3_#t~nondet4_1|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_40, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_105, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$w_buff1~0=v_~z$w_buff1~0_58, P2Thread1of1ForFork3_#t~nondet3=|v_P2Thread1of1ForFork3_#t~nondet3_1|, ~z~0=v_~z~0_75} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_26, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_111, ~z$w_buff0~0=v_~z$w_buff0~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_104, ~z$w_buff1~0=v_~z$w_buff1~0_57, ~z$flush_delayed~0=v_~z$flush_delayed~0_36, ~weak$$choice0~0=v_~weak$$choice0~0_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_41, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_74, ~weak$$choice2~0=v_~weak$$choice2~0_58} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork3_#t~nondet4, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork3_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][196], [24#L799true, P3Thread1of1ForFork1InUse, 145#true, 233#(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|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 70#L847true, P0Thread1of1ForFork0InUse, 259#(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|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork2InUse, 105#L771true, 364#(= ~y~0 1), 324#(= ~z$r_buff0_thd0~0 0), 200#true, 15#L761true, 74#L2true, 168#true, 184#true, 272#(= ~a~0 1), 142#true, 307#(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|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0))]) [2022-12-11 20:54:33,004 INFO L382 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-12-11 20:54:33,004 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-11 20:54:33,004 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-11 20:54:33,004 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-11 20:54:33,005 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([390] L783-->L799: Formula: (let ((.cse8 (= (mod v_~z$r_buff1_thd3~0_40 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_42 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and .cse8 .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_112 256) 0)) (.cse4 (and (= (mod v_~z$w_buff1_used~0_105 256) 0) .cse9))) (let ((.cse0 (or .cse3 .cse11 .cse4)) (.cse1 (and (not .cse11) .cse10)) (.cse2 (not (= (mod v_~weak$$choice2~0_58 256) 0))) (.cse6 (= 0 (mod v_~z$w_buff1_used~0_104 256))) (.cse5 (= (mod v_~z$w_buff0_used~0_111 256) 0))) (and (= (ite .cse0 v_~z~0_75 (ite .cse1 v_~z$w_buff0~0_45 v_~z$w_buff1~0_58)) v_~__unbuffered_p2_EAX~0_10) (= v_~z$w_buff1~0_58 v_~z$w_buff1~0_57) (= v_~z$w_buff0_used~0_111 (ite .cse2 v_~z$w_buff0_used~0_112 (ite .cse0 v_~z$w_buff0_used~0_112 (ite .cse1 0 v_~z$w_buff0_used~0_112)))) (= v_~z~0_74 (ite .cse2 v_~z$mem_tmp~0_26 v_~__unbuffered_p2_EAX~0_10)) (= v_~z$w_buff1_used~0_104 (ite .cse2 v_~z$w_buff1_used~0_105 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff1_used~0_105 0))) (= v_~z$w_buff0~0_45 v_~z$w_buff0~0_44) (= v_~z$flush_delayed~0_36 0) (= (ite .cse2 v_~z$r_buff1_thd3~0_40 (ite (let ((.cse7 (= (mod v_~z$r_buff0_thd3~0_41 256) 0))) (or (and .cse6 .cse7) (and .cse8 .cse7) .cse5)) v_~z$r_buff1_thd3~0_40 0)) v_~z$r_buff1_thd3~0_39) (= v_~z$r_buff0_thd3~0_41 (ite .cse2 v_~z$r_buff0_thd3~0_42 (ite (or .cse3 (and .cse6 .cse9) .cse5) v_~z$r_buff0_thd3~0_42 (ite (and .cse10 (not .cse5)) 0 v_~z$r_buff0_thd3~0_42)))) (= |v_P2Thread1of1ForFork3_#t~nondet4_1| v_~weak$$choice2~0_58) (= v_~z$mem_tmp~0_26 v_~z~0_75) (= |v_P2Thread1of1ForFork3_#t~nondet3_1| v_~weak$$choice0~0_8))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_112, ~z$w_buff0~0=v_~z$w_buff0~0_45, P2Thread1of1ForFork3_#t~nondet4=|v_P2Thread1of1ForFork3_#t~nondet4_1|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_40, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_105, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$w_buff1~0=v_~z$w_buff1~0_58, P2Thread1of1ForFork3_#t~nondet3=|v_P2Thread1of1ForFork3_#t~nondet3_1|, ~z~0=v_~z~0_75} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_26, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_111, ~z$w_buff0~0=v_~z$w_buff0~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_104, ~z$w_buff1~0=v_~z$w_buff1~0_57, ~z$flush_delayed~0=v_~z$flush_delayed~0_36, ~weak$$choice0~0=v_~weak$$choice0~0_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_41, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_74, ~weak$$choice2~0=v_~weak$$choice2~0_58} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork3_#t~nondet4, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork3_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][261], [24#L799true, P3Thread1of1ForFork1InUse, 145#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P1Thread1of1ForFork2InUse, 105#L771true, 263#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 237#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 311#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 364#(= ~y~0 1), 324#(= ~z$r_buff0_thd0~0 0), 200#true, 15#L761true, 12#L875true, 168#true, 45#L850true, 184#true, 272#(= ~a~0 1), 142#true]) [2022-12-11 20:54:33,005 INFO L382 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-12-11 20:54:33,005 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-11 20:54:33,005 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-11 20:54:33,005 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-11 20:54:33,069 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([390] L783-->L799: Formula: (let ((.cse8 (= (mod v_~z$r_buff1_thd3~0_40 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_42 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and .cse8 .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_112 256) 0)) (.cse4 (and (= (mod v_~z$w_buff1_used~0_105 256) 0) .cse9))) (let ((.cse0 (or .cse3 .cse11 .cse4)) (.cse1 (and (not .cse11) .cse10)) (.cse2 (not (= (mod v_~weak$$choice2~0_58 256) 0))) (.cse6 (= 0 (mod v_~z$w_buff1_used~0_104 256))) (.cse5 (= (mod v_~z$w_buff0_used~0_111 256) 0))) (and (= (ite .cse0 v_~z~0_75 (ite .cse1 v_~z$w_buff0~0_45 v_~z$w_buff1~0_58)) v_~__unbuffered_p2_EAX~0_10) (= v_~z$w_buff1~0_58 v_~z$w_buff1~0_57) (= v_~z$w_buff0_used~0_111 (ite .cse2 v_~z$w_buff0_used~0_112 (ite .cse0 v_~z$w_buff0_used~0_112 (ite .cse1 0 v_~z$w_buff0_used~0_112)))) (= v_~z~0_74 (ite .cse2 v_~z$mem_tmp~0_26 v_~__unbuffered_p2_EAX~0_10)) (= v_~z$w_buff1_used~0_104 (ite .cse2 v_~z$w_buff1_used~0_105 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff1_used~0_105 0))) (= v_~z$w_buff0~0_45 v_~z$w_buff0~0_44) (= v_~z$flush_delayed~0_36 0) (= (ite .cse2 v_~z$r_buff1_thd3~0_40 (ite (let ((.cse7 (= (mod v_~z$r_buff0_thd3~0_41 256) 0))) (or (and .cse6 .cse7) (and .cse8 .cse7) .cse5)) v_~z$r_buff1_thd3~0_40 0)) v_~z$r_buff1_thd3~0_39) (= v_~z$r_buff0_thd3~0_41 (ite .cse2 v_~z$r_buff0_thd3~0_42 (ite (or .cse3 (and .cse6 .cse9) .cse5) v_~z$r_buff0_thd3~0_42 (ite (and .cse10 (not .cse5)) 0 v_~z$r_buff0_thd3~0_42)))) (= |v_P2Thread1of1ForFork3_#t~nondet4_1| v_~weak$$choice2~0_58) (= v_~z$mem_tmp~0_26 v_~z~0_75) (= |v_P2Thread1of1ForFork3_#t~nondet3_1| v_~weak$$choice0~0_8))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_112, ~z$w_buff0~0=v_~z$w_buff0~0_45, P2Thread1of1ForFork3_#t~nondet4=|v_P2Thread1of1ForFork3_#t~nondet4_1|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_40, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_105, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$w_buff1~0=v_~z$w_buff1~0_58, P2Thread1of1ForFork3_#t~nondet3=|v_P2Thread1of1ForFork3_#t~nondet3_1|, ~z~0=v_~z~0_75} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_26, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_111, ~z$w_buff0~0=v_~z$w_buff0~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_104, ~z$w_buff1~0=v_~z$w_buff1~0_57, ~z$flush_delayed~0=v_~z$flush_delayed~0_36, ~weak$$choice0~0=v_~weak$$choice0~0_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_41, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_74, ~weak$$choice2~0=v_~weak$$choice2~0_58} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork3_#t~nondet4, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork3_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][229], [24#L799true, 235#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork1InUse, 145#true, 70#L847true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P1Thread1of1ForFork2InUse, 105#L771true, 364#(= ~y~0 1), 324#(= ~z$r_buff0_thd0~0 0), 200#true, 15#L761true, 309#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 168#true, 64#L3true, 184#true, 272#(= ~a~0 1), 142#true, 261#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-11 20:54:33,070 INFO L382 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-12-11 20:54:33,070 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 20:54:33,070 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 20:54:33,070 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 20:54:33,070 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([390] L783-->L799: Formula: (let ((.cse8 (= (mod v_~z$r_buff1_thd3~0_40 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_42 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and .cse8 .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_112 256) 0)) (.cse4 (and (= (mod v_~z$w_buff1_used~0_105 256) 0) .cse9))) (let ((.cse0 (or .cse3 .cse11 .cse4)) (.cse1 (and (not .cse11) .cse10)) (.cse2 (not (= (mod v_~weak$$choice2~0_58 256) 0))) (.cse6 (= 0 (mod v_~z$w_buff1_used~0_104 256))) (.cse5 (= (mod v_~z$w_buff0_used~0_111 256) 0))) (and (= (ite .cse0 v_~z~0_75 (ite .cse1 v_~z$w_buff0~0_45 v_~z$w_buff1~0_58)) v_~__unbuffered_p2_EAX~0_10) (= v_~z$w_buff1~0_58 v_~z$w_buff1~0_57) (= v_~z$w_buff0_used~0_111 (ite .cse2 v_~z$w_buff0_used~0_112 (ite .cse0 v_~z$w_buff0_used~0_112 (ite .cse1 0 v_~z$w_buff0_used~0_112)))) (= v_~z~0_74 (ite .cse2 v_~z$mem_tmp~0_26 v_~__unbuffered_p2_EAX~0_10)) (= v_~z$w_buff1_used~0_104 (ite .cse2 v_~z$w_buff1_used~0_105 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff1_used~0_105 0))) (= v_~z$w_buff0~0_45 v_~z$w_buff0~0_44) (= v_~z$flush_delayed~0_36 0) (= (ite .cse2 v_~z$r_buff1_thd3~0_40 (ite (let ((.cse7 (= (mod v_~z$r_buff0_thd3~0_41 256) 0))) (or (and .cse6 .cse7) (and .cse8 .cse7) .cse5)) v_~z$r_buff1_thd3~0_40 0)) v_~z$r_buff1_thd3~0_39) (= v_~z$r_buff0_thd3~0_41 (ite .cse2 v_~z$r_buff0_thd3~0_42 (ite (or .cse3 (and .cse6 .cse9) .cse5) v_~z$r_buff0_thd3~0_42 (ite (and .cse10 (not .cse5)) 0 v_~z$r_buff0_thd3~0_42)))) (= |v_P2Thread1of1ForFork3_#t~nondet4_1| v_~weak$$choice2~0_58) (= v_~z$mem_tmp~0_26 v_~z~0_75) (= |v_P2Thread1of1ForFork3_#t~nondet3_1| v_~weak$$choice0~0_8))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_112, ~z$w_buff0~0=v_~z$w_buff0~0_45, P2Thread1of1ForFork3_#t~nondet4=|v_P2Thread1of1ForFork3_#t~nondet4_1|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_40, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_105, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$w_buff1~0=v_~z$w_buff1~0_58, P2Thread1of1ForFork3_#t~nondet3=|v_P2Thread1of1ForFork3_#t~nondet3_1|, ~z~0=v_~z~0_75} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_26, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_111, ~z$w_buff0~0=v_~z$w_buff0~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_104, ~z$w_buff1~0=v_~z$w_buff1~0_57, ~z$flush_delayed~0=v_~z$flush_delayed~0_36, ~weak$$choice0~0=v_~weak$$choice0~0_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_41, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_74, ~weak$$choice2~0=v_~weak$$choice2~0_58} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork3_#t~nondet4, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork3_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][261], [24#L799true, P3Thread1of1ForFork1InUse, 145#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P1Thread1of1ForFork2InUse, 105#L771true, 263#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 237#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 311#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 364#(= ~y~0 1), 324#(= ~z$r_buff0_thd0~0 0), 15#L761true, 74#L2true, 200#true, 168#true, 45#L850true, 184#true, 272#(= ~a~0 1), 142#true]) [2022-12-11 20:54:33,070 INFO L382 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-12-11 20:54:33,070 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 20:54:33,071 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 20:54:33,071 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 20:54:33,123 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([390] L783-->L799: Formula: (let ((.cse8 (= (mod v_~z$r_buff1_thd3~0_40 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_42 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and .cse8 .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_112 256) 0)) (.cse4 (and (= (mod v_~z$w_buff1_used~0_105 256) 0) .cse9))) (let ((.cse0 (or .cse3 .cse11 .cse4)) (.cse1 (and (not .cse11) .cse10)) (.cse2 (not (= (mod v_~weak$$choice2~0_58 256) 0))) (.cse6 (= 0 (mod v_~z$w_buff1_used~0_104 256))) (.cse5 (= (mod v_~z$w_buff0_used~0_111 256) 0))) (and (= (ite .cse0 v_~z~0_75 (ite .cse1 v_~z$w_buff0~0_45 v_~z$w_buff1~0_58)) v_~__unbuffered_p2_EAX~0_10) (= v_~z$w_buff1~0_58 v_~z$w_buff1~0_57) (= v_~z$w_buff0_used~0_111 (ite .cse2 v_~z$w_buff0_used~0_112 (ite .cse0 v_~z$w_buff0_used~0_112 (ite .cse1 0 v_~z$w_buff0_used~0_112)))) (= v_~z~0_74 (ite .cse2 v_~z$mem_tmp~0_26 v_~__unbuffered_p2_EAX~0_10)) (= v_~z$w_buff1_used~0_104 (ite .cse2 v_~z$w_buff1_used~0_105 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff1_used~0_105 0))) (= v_~z$w_buff0~0_45 v_~z$w_buff0~0_44) (= v_~z$flush_delayed~0_36 0) (= (ite .cse2 v_~z$r_buff1_thd3~0_40 (ite (let ((.cse7 (= (mod v_~z$r_buff0_thd3~0_41 256) 0))) (or (and .cse6 .cse7) (and .cse8 .cse7) .cse5)) v_~z$r_buff1_thd3~0_40 0)) v_~z$r_buff1_thd3~0_39) (= v_~z$r_buff0_thd3~0_41 (ite .cse2 v_~z$r_buff0_thd3~0_42 (ite (or .cse3 (and .cse6 .cse9) .cse5) v_~z$r_buff0_thd3~0_42 (ite (and .cse10 (not .cse5)) 0 v_~z$r_buff0_thd3~0_42)))) (= |v_P2Thread1of1ForFork3_#t~nondet4_1| v_~weak$$choice2~0_58) (= v_~z$mem_tmp~0_26 v_~z~0_75) (= |v_P2Thread1of1ForFork3_#t~nondet3_1| v_~weak$$choice0~0_8))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_112, ~z$w_buff0~0=v_~z$w_buff0~0_45, P2Thread1of1ForFork3_#t~nondet4=|v_P2Thread1of1ForFork3_#t~nondet4_1|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_40, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_105, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$w_buff1~0=v_~z$w_buff1~0_58, P2Thread1of1ForFork3_#t~nondet3=|v_P2Thread1of1ForFork3_#t~nondet3_1|, ~z~0=v_~z~0_75} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_26, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_111, ~z$w_buff0~0=v_~z$w_buff0~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_104, ~z$w_buff1~0=v_~z$w_buff1~0_57, ~z$flush_delayed~0=v_~z$flush_delayed~0_36, ~weak$$choice0~0=v_~weak$$choice0~0_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_41, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_74, ~weak$$choice2~0=v_~weak$$choice2~0_58} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork3_#t~nondet4, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork3_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][250], [24#L799true, 189#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 235#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork1InUse, 145#true, 70#L847true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P1Thread1of1ForFork2InUse, 105#L771true, 364#(= ~y~0 1), 324#(= ~z$r_buff0_thd0~0 0), 15#L761true, 200#true, 309#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 168#true, 127#L3-1true, 272#(= ~a~0 1), 142#true, 261#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-11 20:54:33,123 INFO L382 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-12-11 20:54:33,123 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 20:54:33,123 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 20:54:33,123 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 20:54:33,124 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([390] L783-->L799: Formula: (let ((.cse8 (= (mod v_~z$r_buff1_thd3~0_40 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_42 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and .cse8 .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_112 256) 0)) (.cse4 (and (= (mod v_~z$w_buff1_used~0_105 256) 0) .cse9))) (let ((.cse0 (or .cse3 .cse11 .cse4)) (.cse1 (and (not .cse11) .cse10)) (.cse2 (not (= (mod v_~weak$$choice2~0_58 256) 0))) (.cse6 (= 0 (mod v_~z$w_buff1_used~0_104 256))) (.cse5 (= (mod v_~z$w_buff0_used~0_111 256) 0))) (and (= (ite .cse0 v_~z~0_75 (ite .cse1 v_~z$w_buff0~0_45 v_~z$w_buff1~0_58)) v_~__unbuffered_p2_EAX~0_10) (= v_~z$w_buff1~0_58 v_~z$w_buff1~0_57) (= v_~z$w_buff0_used~0_111 (ite .cse2 v_~z$w_buff0_used~0_112 (ite .cse0 v_~z$w_buff0_used~0_112 (ite .cse1 0 v_~z$w_buff0_used~0_112)))) (= v_~z~0_74 (ite .cse2 v_~z$mem_tmp~0_26 v_~__unbuffered_p2_EAX~0_10)) (= v_~z$w_buff1_used~0_104 (ite .cse2 v_~z$w_buff1_used~0_105 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff1_used~0_105 0))) (= v_~z$w_buff0~0_45 v_~z$w_buff0~0_44) (= v_~z$flush_delayed~0_36 0) (= (ite .cse2 v_~z$r_buff1_thd3~0_40 (ite (let ((.cse7 (= (mod v_~z$r_buff0_thd3~0_41 256) 0))) (or (and .cse6 .cse7) (and .cse8 .cse7) .cse5)) v_~z$r_buff1_thd3~0_40 0)) v_~z$r_buff1_thd3~0_39) (= v_~z$r_buff0_thd3~0_41 (ite .cse2 v_~z$r_buff0_thd3~0_42 (ite (or .cse3 (and .cse6 .cse9) .cse5) v_~z$r_buff0_thd3~0_42 (ite (and .cse10 (not .cse5)) 0 v_~z$r_buff0_thd3~0_42)))) (= |v_P2Thread1of1ForFork3_#t~nondet4_1| v_~weak$$choice2~0_58) (= v_~z$mem_tmp~0_26 v_~z~0_75) (= |v_P2Thread1of1ForFork3_#t~nondet3_1| v_~weak$$choice0~0_8))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_112, ~z$w_buff0~0=v_~z$w_buff0~0_45, P2Thread1of1ForFork3_#t~nondet4=|v_P2Thread1of1ForFork3_#t~nondet4_1|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_40, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_105, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$w_buff1~0=v_~z$w_buff1~0_58, P2Thread1of1ForFork3_#t~nondet3=|v_P2Thread1of1ForFork3_#t~nondet3_1|, ~z~0=v_~z~0_75} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_26, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_111, ~z$w_buff0~0=v_~z$w_buff0~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_104, ~z$w_buff1~0=v_~z$w_buff1~0_57, ~z$flush_delayed~0=v_~z$flush_delayed~0_36, ~weak$$choice0~0=v_~weak$$choice0~0_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_41, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_74, ~weak$$choice2~0=v_~weak$$choice2~0_58} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork3_#t~nondet4, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork3_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][328], [24#L799true, P3Thread1of1ForFork1InUse, 145#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P1Thread1of1ForFork2InUse, 239#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 105#L771true, 267#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 364#(= ~y~0 1), 324#(= ~z$r_buff0_thd0~0 0), 200#true, 15#L761true, 168#true, 64#L3true, 45#L850true, 184#true, 272#(= ~a~0 1), 313#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 142#true]) [2022-12-11 20:54:33,124 INFO L382 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-12-11 20:54:33,124 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 20:54:33,124 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 20:54:33,124 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 20:54:33,158 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([390] L783-->L799: Formula: (let ((.cse8 (= (mod v_~z$r_buff1_thd3~0_40 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_42 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and .cse8 .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_112 256) 0)) (.cse4 (and (= (mod v_~z$w_buff1_used~0_105 256) 0) .cse9))) (let ((.cse0 (or .cse3 .cse11 .cse4)) (.cse1 (and (not .cse11) .cse10)) (.cse2 (not (= (mod v_~weak$$choice2~0_58 256) 0))) (.cse6 (= 0 (mod v_~z$w_buff1_used~0_104 256))) (.cse5 (= (mod v_~z$w_buff0_used~0_111 256) 0))) (and (= (ite .cse0 v_~z~0_75 (ite .cse1 v_~z$w_buff0~0_45 v_~z$w_buff1~0_58)) v_~__unbuffered_p2_EAX~0_10) (= v_~z$w_buff1~0_58 v_~z$w_buff1~0_57) (= v_~z$w_buff0_used~0_111 (ite .cse2 v_~z$w_buff0_used~0_112 (ite .cse0 v_~z$w_buff0_used~0_112 (ite .cse1 0 v_~z$w_buff0_used~0_112)))) (= v_~z~0_74 (ite .cse2 v_~z$mem_tmp~0_26 v_~__unbuffered_p2_EAX~0_10)) (= v_~z$w_buff1_used~0_104 (ite .cse2 v_~z$w_buff1_used~0_105 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff1_used~0_105 0))) (= v_~z$w_buff0~0_45 v_~z$w_buff0~0_44) (= v_~z$flush_delayed~0_36 0) (= (ite .cse2 v_~z$r_buff1_thd3~0_40 (ite (let ((.cse7 (= (mod v_~z$r_buff0_thd3~0_41 256) 0))) (or (and .cse6 .cse7) (and .cse8 .cse7) .cse5)) v_~z$r_buff1_thd3~0_40 0)) v_~z$r_buff1_thd3~0_39) (= v_~z$r_buff0_thd3~0_41 (ite .cse2 v_~z$r_buff0_thd3~0_42 (ite (or .cse3 (and .cse6 .cse9) .cse5) v_~z$r_buff0_thd3~0_42 (ite (and .cse10 (not .cse5)) 0 v_~z$r_buff0_thd3~0_42)))) (= |v_P2Thread1of1ForFork3_#t~nondet4_1| v_~weak$$choice2~0_58) (= v_~z$mem_tmp~0_26 v_~z~0_75) (= |v_P2Thread1of1ForFork3_#t~nondet3_1| v_~weak$$choice0~0_8))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_112, ~z$w_buff0~0=v_~z$w_buff0~0_45, P2Thread1of1ForFork3_#t~nondet4=|v_P2Thread1of1ForFork3_#t~nondet4_1|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_40, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_105, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$w_buff1~0=v_~z$w_buff1~0_58, P2Thread1of1ForFork3_#t~nondet3=|v_P2Thread1of1ForFork3_#t~nondet3_1|, ~z~0=v_~z~0_75} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_26, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_111, ~z$w_buff0~0=v_~z$w_buff0~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_104, ~z$w_buff1~0=v_~z$w_buff1~0_57, ~z$flush_delayed~0=v_~z$flush_delayed~0_36, ~weak$$choice0~0=v_~weak$$choice0~0_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_41, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_74, ~weak$$choice2~0=v_~weak$$choice2~0_58} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork3_#t~nondet4, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork3_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0][352], [24#L799true, 189#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), P3Thread1of1ForFork1InUse, 145#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P1Thread1of1ForFork2InUse, 105#L771true, 239#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 267#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 364#(= ~y~0 1), 324#(= ~z$r_buff0_thd0~0 0), 15#L761true, 200#true, 168#true, 45#L850true, 127#L3-1true, 272#(= ~a~0 1), 313#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 142#true]) [2022-12-11 20:54:33,158 INFO L382 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-12-11 20:54:33,158 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:54:33,158 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:54:33,159 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:54:33,251 INFO L130 PetriNetUnfolder]: 2583/6663 cut-off events. [2022-12-11 20:54:33,252 INFO L131 PetriNetUnfolder]: For 48139/56004 co-relation queries the response was YES. [2022-12-11 20:54:33,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35973 conditions, 6663 events. 2583/6663 cut-off events. For 48139/56004 co-relation queries the response was YES. Maximal size of possible extension queue 619. Compared 68209 event pairs, 40 based on Foata normal form. 527/7086 useless extension candidates. Maximal degree in co-relation 35851. Up to 2696 conditions per place. [2022-12-11 20:54:33,290 INFO L137 encePairwiseOnDemand]: 114/128 looper letters, 61 selfloop transitions, 31 changer transitions 211/419 dead transitions. [2022-12-11 20:54:33,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 419 transitions, 6849 flow [2022-12-11 20:54:33,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-11 20:54:33,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-11 20:54:33,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 824 transitions. [2022-12-11 20:54:33,293 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8046875 [2022-12-11 20:54:33,293 INFO L295 CegarLoopForPetriNet]: 135 programPoint places, 58 predicate places. [2022-12-11 20:54:33,293 INFO L82 GeneralOperation]: Start removeDead. Operand has 193 places, 419 transitions, 6849 flow [2022-12-11 20:54:33,304 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 185 places, 208 transitions, 2447 flow [2022-12-11 20:54:33,304 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 208 transitions, 2447 flow [2022-12-11 20:54:33,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 100.71428571428571) internal successors, (705), 7 states have internal predecessors, (705), 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-11 20:54:33,306 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:54:33,306 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:54:33,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-11 20:54:33,306 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:54:33,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:54:33,306 INFO L85 PathProgramCache]: Analyzing trace with hash 520894376, now seen corresponding path program 3 times [2022-12-11 20:54:33,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:54:33,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299705133] [2022-12-11 20:54:33,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:54:33,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:54:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:54:33,488 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-11 20:54:33,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:54:33,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299705133] [2022-12-11 20:54:33,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299705133] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:54:33,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:54:33,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 20:54:33,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314139085] [2022-12-11 20:54:33,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:54:33,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 20:54:33,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:54:33,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 20:54:33,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 20:54:33,490 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 128 [2022-12-11 20:54:33,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 208 transitions, 2447 flow. Second operand has 7 states, 7 states have (on average 106.71428571428571) internal successors, (747), 7 states have internal predecessors, (747), 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-11 20:54:33,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:54:33,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 128 [2022-12-11 20:54:33,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:54:33,886 INFO L130 PetriNetUnfolder]: 951/3896 cut-off events. [2022-12-11 20:54:33,887 INFO L131 PetriNetUnfolder]: For 14883/15663 co-relation queries the response was YES. [2022-12-11 20:54:33,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18231 conditions, 3896 events. 951/3896 cut-off events. For 14883/15663 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 44534 event pairs, 34 based on Foata normal form. 69/3929 useless extension candidates. Maximal degree in co-relation 18104. Up to 1175 conditions per place. [2022-12-11 20:54:33,903 INFO L137 encePairwiseOnDemand]: 122/128 looper letters, 44 selfloop transitions, 3 changer transitions 44/217 dead transitions. [2022-12-11 20:54:33,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 217 transitions, 2793 flow [2022-12-11 20:54:33,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 20:54:33,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 20:54:33,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 760 transitions. [2022-12-11 20:54:33,905 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8482142857142857 [2022-12-11 20:54:33,906 INFO L295 CegarLoopForPetriNet]: 135 programPoint places, 56 predicate places. [2022-12-11 20:54:33,906 INFO L82 GeneralOperation]: Start removeDead. Operand has 191 places, 217 transitions, 2793 flow [2022-12-11 20:54:33,912 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 173 transitions, 1816 flow [2022-12-11 20:54:33,912 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 173 transitions, 1816 flow [2022-12-11 20:54:33,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.71428571428571) internal successors, (747), 7 states have internal predecessors, (747), 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-11 20:54:33,912 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:54:33,913 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:54:33,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-11 20:54:33,913 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:54:33,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:54:33,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1919134618, now seen corresponding path program 4 times [2022-12-11 20:54:33,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:54:33,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438144975] [2022-12-11 20:54:33,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:54:33,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:54:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:54:35,114 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-11 20:54:35,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:54:35,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438144975] [2022-12-11 20:54:35,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438144975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:54:35,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:54:35,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-11 20:54:35,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363456589] [2022-12-11 20:54:35,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:54:35,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 20:54:35,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:54:35,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 20:54:35,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-11 20:54:35,116 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 128 [2022-12-11 20:54:35,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 173 transitions, 1816 flow. Second operand has 12 states, 12 states have (on average 99.16666666666667) internal successors, (1190), 12 states have internal predecessors, (1190), 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-11 20:54:35,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:54:35,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 128 [2022-12-11 20:54:35,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:54:35,488 INFO L130 PetriNetUnfolder]: 562/2286 cut-off events. [2022-12-11 20:54:35,488 INFO L131 PetriNetUnfolder]: For 7756/8211 co-relation queries the response was YES. [2022-12-11 20:54:35,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10365 conditions, 2286 events. 562/2286 cut-off events. For 7756/8211 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 22747 event pairs, 15 based on Foata normal form. 1/2265 useless extension candidates. Maximal degree in co-relation 10224. Up to 725 conditions per place. [2022-12-11 20:54:35,496 INFO L137 encePairwiseOnDemand]: 115/128 looper letters, 20 selfloop transitions, 11 changer transitions 57/181 dead transitions. [2022-12-11 20:54:35,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 181 transitions, 2104 flow [2022-12-11 20:54:35,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 20:54:35,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 20:54:35,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1294 transitions. [2022-12-11 20:54:35,497 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7776442307692307 [2022-12-11 20:54:35,498 INFO L295 CegarLoopForPetriNet]: 135 programPoint places, 59 predicate places. [2022-12-11 20:54:35,498 INFO L82 GeneralOperation]: Start removeDead. Operand has 194 places, 181 transitions, 2104 flow [2022-12-11 20:54:35,500 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 124 transitions, 1046 flow [2022-12-11 20:54:35,500 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 124 transitions, 1046 flow [2022-12-11 20:54:35,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 99.16666666666667) internal successors, (1190), 12 states have internal predecessors, (1190), 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-11 20:54:35,501 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:54:35,501 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:54:35,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-11 20:54:35,501 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:54:35,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:54:35,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1317339898, now seen corresponding path program 5 times [2022-12-11 20:54:35,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:54:35,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443086479] [2022-12-11 20:54:35,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:54:35,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:54:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 20:54:35,528 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 20:54:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 20:54:35,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 20:54:35,578 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 20:54:35,579 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-11 20:54:35,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-11 20:54:35,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-11 20:54:35,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-11 20:54:35,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-11 20:54:35,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-11 20:54:35,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-11 20:54:35,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-11 20:54:35,581 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:54:35,585 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 20:54:35,585 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 20:54:35,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 08:54:35 BasicIcfg [2022-12-11 20:54:35,721 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 20:54:35,722 INFO L158 Benchmark]: Toolchain (without parser) took 24763.02ms. Allocated memory was 181.4MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 157.8MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 875.0MB. Max. memory is 8.0GB. [2022-12-11 20:54:35,722 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 181.4MB. Free memory is still 158.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 20:54:35,722 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.75ms. Allocated memory is still 181.4MB. Free memory was 157.8MB in the beginning and 129.3MB in the end (delta: 28.5MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-11 20:54:35,722 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.90ms. Allocated memory is still 181.4MB. Free memory was 129.3MB in the beginning and 126.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-11 20:54:35,723 INFO L158 Benchmark]: Boogie Preprocessor took 23.82ms. Allocated memory is still 181.4MB. Free memory was 126.7MB in the beginning and 124.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 20:54:35,723 INFO L158 Benchmark]: RCFGBuilder took 643.44ms. Allocated memory is still 181.4MB. Free memory was 124.6MB in the beginning and 86.8MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-11 20:54:35,723 INFO L158 Benchmark]: TraceAbstraction took 23625.74ms. Allocated memory was 181.4MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 85.8MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 802.7MB. Max. memory is 8.0GB. [2022-12-11 20:54:35,724 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.09ms. Allocated memory is still 181.4MB. Free memory is still 158.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 416.75ms. Allocated memory is still 181.4MB. Free memory was 157.8MB in the beginning and 129.3MB in the end (delta: 28.5MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.90ms. Allocated memory is still 181.4MB. Free memory was 129.3MB in the beginning and 126.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.82ms. Allocated memory is still 181.4MB. Free memory was 126.7MB in the beginning and 124.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 643.44ms. Allocated memory is still 181.4MB. Free memory was 124.6MB in the beginning and 86.8MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 23625.74ms. Allocated memory was 181.4MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 85.8MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 802.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L718] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L720] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L721] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L722] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L724] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L726] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L728] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L729] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L730] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L731] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L732] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L733] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L734] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L735] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L736] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L737] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L738] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L739] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L740] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L741] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L742] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L743] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L744] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L745] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L746] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L747] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L748] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 pthread_t t469; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t469={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L865] FCALL, FORK 0 pthread_create(&t469, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t469, ((void *)0), P0, ((void *)0))=-3, t469={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 pthread_t t470; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t469={5:0}, t470={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L867] FCALL, FORK 0 pthread_create(&t470, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t470, ((void *)0), P1, ((void *)0))=-2, t469={5:0}, t470={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 pthread_t t471; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t469={5:0}, t470={6:0}, t471={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L869] FCALL, FORK 0 pthread_create(&t471, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t471, ((void *)0), P2, ((void *)0))=-1, t469={5:0}, t470={6:0}, t471={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L870] 0 pthread_t t472; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t469={5:0}, t470={6:0}, t471={7:0}, t472={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] FCALL, FORK 0 pthread_create(&t472, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t472, ((void *)0), P3, ((void *)0))=0, t469={5:0}, t470={6:0}, t471={7:0}, t472={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L814] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L814] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 z$flush_delayed = weak$$choice2 [L826] 4 z$mem_tmp = z [L827] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L828] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L829] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L830] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L831] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L833] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = z [L835] 4 z = z$flush_delayed ? z$mem_tmp : z [L836] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L839] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L790] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L791] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L792] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 __unbuffered_p2_EAX = z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L842] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L843] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L844] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L845] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L846] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t469={5:0}, t470={6:0}, t471={7:0}, t472={3:0}, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L878] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L879] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L880] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L881] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t469={5:0}, t470={6:0}, t471={7:0}, t472={3:0}, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L884] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t469={5:0}, t470={6:0}, t471={7:0}, t472={3:0}, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 162 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.3s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 23.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 17.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 993 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 993 mSDsluCounter, 895 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 729 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1772 IncrementalHoareTripleChecker+Invalid, 1837 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 166 mSDtfsCounter, 1772 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8140occurred in iteration=8, InterpolantAutomatonStates: 146, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 22277 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 1271 NumberOfCodeBlocks, 1271 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1159 ConstructedInterpolants, 0 QuantifiedInterpolants, 6824 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-11 20:54:35,747 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...