/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/safe012_pso.oepc_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 16:36:34,203 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 16:36:34,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 16:36:34,230 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 16:36:34,231 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 16:36:34,235 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 16:36:34,240 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 16:36:34,243 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 16:36:34,247 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 16:36:34,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 16:36:34,250 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 16:36:34,250 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 16:36:34,250 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 16:36:34,251 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 16:36:34,252 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 16:36:34,252 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 16:36:34,253 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 16:36:34,253 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 16:36:34,254 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 16:36:34,255 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 16:36:34,256 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 16:36:34,262 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 16:36:34,263 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 16:36:34,265 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 16:36:34,272 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 16:36:34,273 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 16:36:34,273 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 16:36:34,274 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 16:36:34,274 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 16:36:34,275 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 16:36:34,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 16:36:34,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 16:36:34,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 16:36:34,278 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 16:36:34,278 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 16:36:34,279 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 16:36:34,279 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 16:36:34,279 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 16:36:34,279 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 16:36:34,280 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 16:36:34,280 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 16:36:34,281 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-06 16:36:34,309 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 16:36:34,309 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 16:36:34,310 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-06 16:36:34,310 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-06 16:36:34,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 16:36:34,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 16:36:34,312 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 16:36:34,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 16:36:34,312 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 16:36:34,312 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 16:36:34,312 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 16:36:34,313 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 16:36:34,313 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 16:36:34,313 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 16:36:34,313 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 16:36:34,313 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 16:36:34,313 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 16:36:34,313 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 16:36:34,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 16:36:34,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 16:36:34,313 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 16:36:34,313 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 16:36:34,314 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 16:36:34,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:36:34,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 16:36:34,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 16:36:34,314 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 16:36:34,314 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 16:36:34,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 16:36:34,314 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-06 16:36:34,314 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-06 16:36:34,314 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-06 16:36:34,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 16:36:34,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 16:36:34,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 16:36:34,621 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 16:36:34,621 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 16:36:34,622 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2022-12-06 16:36:35,599 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 16:36:35,837 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 16:36:35,838 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2022-12-06 16:36:35,865 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1403fbd93/a9b02d405a28443384675520fc1acf49/FLAGe8542b244 [2022-12-06 16:36:35,880 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1403fbd93/a9b02d405a28443384675520fc1acf49 [2022-12-06 16:36:35,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 16:36:35,882 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 16:36:35,883 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 16:36:35,883 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 16:36:35,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 16:36:35,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:36:35" (1/1) ... [2022-12-06 16:36:35,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@528a51d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:35, skipping insertion in model container [2022-12-06 16:36:35,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:36:35" (1/1) ... [2022-12-06 16:36:35,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 16:36:35,917 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 16:36:36,064 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/safe012_pso.oepc_pso.opt_rmo.opt.i[1009,1022] [2022-12-06 16:36:36,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:36,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:36,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:36,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:36,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:36,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:36,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:36,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:36,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:36,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:36,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:36,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:36,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:36,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:36,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:36,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:36,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:36,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:36,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:36,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:36,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:36,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:36,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:36,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:36,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:36,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:36,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:36,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:36,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:36,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:36,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:36:36,232 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 16:36:36,241 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/safe012_pso.oepc_pso.opt_rmo.opt.i[1009,1022] [2022-12-06 16:36:36,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:36,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:36,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:36,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:36,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:36,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:36,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:36,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:36,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:36,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:36,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:36,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:36,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:36,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:36,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:36,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:36,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:36,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:36,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:36,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:36,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:36,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:36,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:36,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:36,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:36,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:36,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:36,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:36,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:36:36,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:36:36,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:36:36,347 INFO L208 MainTranslator]: Completed translation [2022-12-06 16:36:36,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:36 WrapperNode [2022-12-06 16:36:36,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 16:36:36,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 16:36:36,349 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 16:36:36,349 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 16:36:36,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:36" (1/1) ... [2022-12-06 16:36:36,363 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:36" (1/1) ... [2022-12-06 16:36:36,380 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2022-12-06 16:36:36,380 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 16:36:36,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 16:36:36,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 16:36:36,381 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 16:36:36,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:36" (1/1) ... [2022-12-06 16:36:36,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:36" (1/1) ... [2022-12-06 16:36:36,389 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:36" (1/1) ... [2022-12-06 16:36:36,389 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:36" (1/1) ... [2022-12-06 16:36:36,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:36" (1/1) ... [2022-12-06 16:36:36,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:36" (1/1) ... [2022-12-06 16:36:36,396 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:36" (1/1) ... [2022-12-06 16:36:36,397 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:36" (1/1) ... [2022-12-06 16:36:36,399 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 16:36:36,400 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 16:36:36,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 16:36:36,400 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 16:36:36,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:36" (1/1) ... [2022-12-06 16:36:36,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:36:36,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:36:36,428 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 16:36:36,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 16:36:36,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 16:36:36,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 16:36:36,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 16:36:36,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 16:36:36,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 16:36:36,453 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 16:36:36,453 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 16:36:36,453 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 16:36:36,453 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 16:36:36,453 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 16:36:36,453 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 16:36:36,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 16:36:36,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 16:36:36,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 16:36:36,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 16:36:36,454 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 16:36:36,561 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 16:36:36,562 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 16:36:36,737 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 16:36:36,830 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 16:36:36,831 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 16:36:36,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:36:36 BoogieIcfgContainer [2022-12-06 16:36:36,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 16:36:36,834 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 16:36:36,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 16:36:36,836 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 16:36:36,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:36:35" (1/3) ... [2022-12-06 16:36:36,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ffc6c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:36:36, skipping insertion in model container [2022-12-06 16:36:36,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:36" (2/3) ... [2022-12-06 16:36:36,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ffc6c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:36:36, skipping insertion in model container [2022-12-06 16:36:36,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:36:36" (3/3) ... [2022-12-06 16:36:36,837 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_pso.oepc_pso.opt_rmo.opt.i [2022-12-06 16:36:36,849 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 16:36:36,849 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 16:36:36,849 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 16:36:36,906 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 16:36:36,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2022-12-06 16:36:36,986 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-06 16:36:36,986 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 16:36:36,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 16:36:36,990 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2022-12-06 16:36:36,993 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2022-12-06 16:36:37,004 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 16:36:37,009 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;@6aebd5df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 16:36:37,009 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 16:36:37,026 INFO L130 PetriNetUnfolder]: 0/57 cut-off events. [2022-12-06 16:36:37,026 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 16:36:37,026 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:36:37,027 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:36:37,028 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:36:37,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:36:37,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1531857526, now seen corresponding path program 1 times [2022-12-06 16:36:37,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:36:37,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177609805] [2022-12-06 16:36:37,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:36:37,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:36:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:36:37,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:36:37,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:36:37,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177609805] [2022-12-06 16:36:37,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177609805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:36:37,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:36:37,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 16:36:37,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275672042] [2022-12-06 16:36:37,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:36:37,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 16:36:37,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:36:37,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 16:36:37,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 16:36:37,513 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 108 [2022-12-06 16:36:37,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 105 transitions, 219 flow. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:37,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:36:37,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 108 [2022-12-06 16:36:37,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:36:37,617 INFO L130 PetriNetUnfolder]: 37/216 cut-off events. [2022-12-06 16:36:37,617 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 16:36:37,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309 conditions, 216 events. 37/216 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 701 event pairs, 7 based on Foata normal form. 13/214 useless extension candidates. Maximal degree in co-relation 259. Up to 51 conditions per place. [2022-12-06 16:36:37,621 INFO L137 encePairwiseOnDemand]: 103/108 looper letters, 11 selfloop transitions, 2 changer transitions 0/105 dead transitions. [2022-12-06 16:36:37,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 105 transitions, 248 flow [2022-12-06 16:36:37,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 16:36:37,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 16:36:37,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2022-12-06 16:36:37,633 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9351851851851852 [2022-12-06 16:36:37,636 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 0 predicate places. [2022-12-06 16:36:37,636 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 105 transitions, 248 flow [2022-12-06 16:36:37,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:37,636 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:36:37,636 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:36:37,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 16:36:37,637 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:36:37,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:36:37,638 INFO L85 PathProgramCache]: Analyzing trace with hash 540807915, now seen corresponding path program 1 times [2022-12-06 16:36:37,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:36:37,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359475421] [2022-12-06 16:36:37,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:36:37,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:36:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:36:38,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:36:38,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:36:38,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359475421] [2022-12-06 16:36:38,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359475421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:36:38,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:36:38,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:36:38,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379914848] [2022-12-06 16:36:38,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:36:38,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:36:38,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:36:38,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:36:38,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:36:38,029 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 108 [2022-12-06 16:36:38,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 105 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:38,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:36:38,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 108 [2022-12-06 16:36:38,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:36:38,472 INFO L130 PetriNetUnfolder]: 618/1783 cut-off events. [2022-12-06 16:36:38,473 INFO L131 PetriNetUnfolder]: For 441/596 co-relation queries the response was YES. [2022-12-06 16:36:38,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3289 conditions, 1783 events. 618/1783 cut-off events. For 441/596 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13202 event pairs, 160 based on Foata normal form. 0/1729 useless extension candidates. Maximal degree in co-relation 3233. Up to 570 conditions per place. [2022-12-06 16:36:38,485 INFO L137 encePairwiseOnDemand]: 99/108 looper letters, 27 selfloop transitions, 5 changer transitions 55/159 dead transitions. [2022-12-06 16:36:38,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 159 transitions, 583 flow [2022-12-06 16:36:38,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 16:36:38,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 16:36:38,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 824 transitions. [2022-12-06 16:36:38,488 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8477366255144033 [2022-12-06 16:36:38,489 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 8 predicate places. [2022-12-06 16:36:38,489 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 159 transitions, 583 flow [2022-12-06 16:36:38,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:38,490 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:36:38,490 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:36:38,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 16:36:38,490 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:36:38,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:36:38,490 INFO L85 PathProgramCache]: Analyzing trace with hash 730639980, now seen corresponding path program 1 times [2022-12-06 16:36:38,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:36:38,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059693202] [2022-12-06 16:36:38,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:36:38,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:36:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:36:38,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:36:38,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:36:38,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059693202] [2022-12-06 16:36:38,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059693202] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:36:38,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:36:38,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:36:38,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786340115] [2022-12-06 16:36:38,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:36:38,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:36:38,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:36:38,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:36:38,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:36:38,639 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 108 [2022-12-06 16:36:38,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 159 transitions, 583 flow. Second operand has 7 states, 7 states have (on average 84.14285714285714) internal successors, (589), 7 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:38,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:36:38,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 108 [2022-12-06 16:36:38,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:36:39,236 INFO L130 PetriNetUnfolder]: 1385/3526 cut-off events. [2022-12-06 16:36:39,237 INFO L131 PetriNetUnfolder]: For 1453/2006 co-relation queries the response was YES. [2022-12-06 16:36:39,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8695 conditions, 3526 events. 1385/3526 cut-off events. For 1453/2006 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 29917 event pairs, 47 based on Foata normal form. 9/3464 useless extension candidates. Maximal degree in co-relation 8632. Up to 1295 conditions per place. [2022-12-06 16:36:39,248 INFO L137 encePairwiseOnDemand]: 96/108 looper letters, 60 selfloop transitions, 13 changer transitions 208/351 dead transitions. [2022-12-06 16:36:39,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 351 transitions, 2140 flow [2022-12-06 16:36:39,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 16:36:39,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 16:36:39,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1536 transitions. [2022-12-06 16:36:39,251 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8366013071895425 [2022-12-06 16:36:39,251 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 24 predicate places. [2022-12-06 16:36:39,251 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 351 transitions, 2140 flow [2022-12-06 16:36:39,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.14285714285714) internal successors, (589), 7 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:39,252 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:36:39,252 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:36:39,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 16:36:39,252 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:36:39,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:36:39,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1418366410, now seen corresponding path program 1 times [2022-12-06 16:36:39,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:36:39,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746865492] [2022-12-06 16:36:39,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:36:39,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:36:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:36:39,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:36:39,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:36:39,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746865492] [2022-12-06 16:36:39,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746865492] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:36:39,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:36:39,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:36:39,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980277447] [2022-12-06 16:36:39,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:36:39,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:36:39,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:36:39,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:36:39,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:36:39,380 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 108 [2022-12-06 16:36:39,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 351 transitions, 2140 flow. Second operand has 7 states, 7 states have (on average 86.0) internal successors, (602), 7 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:39,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:36:39,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 108 [2022-12-06 16:36:39,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:36:39,944 INFO L130 PetriNetUnfolder]: 1453/3782 cut-off events. [2022-12-06 16:36:39,945 INFO L131 PetriNetUnfolder]: For 3105/5904 co-relation queries the response was YES. [2022-12-06 16:36:39,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11306 conditions, 3782 events. 1453/3782 cut-off events. For 3105/5904 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 33012 event pairs, 60 based on Foata normal form. 14/3743 useless extension candidates. Maximal degree in co-relation 11237. Up to 1411 conditions per place. [2022-12-06 16:36:39,956 INFO L137 encePairwiseOnDemand]: 102/108 looper letters, 68 selfloop transitions, 4 changer transitions 336/481 dead transitions. [2022-12-06 16:36:39,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 481 transitions, 3906 flow [2022-12-06 16:36:39,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 16:36:39,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 16:36:39,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 824 transitions. [2022-12-06 16:36:39,958 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8477366255144033 [2022-12-06 16:36:39,958 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 32 predicate places. [2022-12-06 16:36:39,959 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 481 transitions, 3906 flow [2022-12-06 16:36:39,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.0) internal successors, (602), 7 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:39,959 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:36:39,959 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:36:39,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 16:36:39,959 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:36:39,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:36:39,960 INFO L85 PathProgramCache]: Analyzing trace with hash 351589104, now seen corresponding path program 1 times [2022-12-06 16:36:39,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:36:39,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716883765] [2022-12-06 16:36:39,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:36:39,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:36:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:36:40,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:36:40,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:36:40,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716883765] [2022-12-06 16:36:40,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716883765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:36:40,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:36:40,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:36:40,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087567955] [2022-12-06 16:36:40,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:36:40,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:36:40,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:36:40,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:36:40,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:36:40,104 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 108 [2022-12-06 16:36:40,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 481 transitions, 3906 flow. Second operand has 7 states, 7 states have (on average 86.14285714285714) internal successors, (603), 7 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:40,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:36:40,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 108 [2022-12-06 16:36:40,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:36:40,661 INFO L130 PetriNetUnfolder]: 1550/4198 cut-off events. [2022-12-06 16:36:40,662 INFO L131 PetriNetUnfolder]: For 4039/6675 co-relation queries the response was YES. [2022-12-06 16:36:40,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14487 conditions, 4198 events. 1550/4198 cut-off events. For 4039/6675 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 38279 event pairs, 20 based on Foata normal form. 26/4176 useless extension candidates. Maximal degree in co-relation 14412. Up to 1565 conditions per place. [2022-12-06 16:36:40,675 INFO L137 encePairwiseOnDemand]: 100/108 looper letters, 76 selfloop transitions, 6 changer transitions 455/610 dead transitions. [2022-12-06 16:36:40,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 610 transitions, 6158 flow [2022-12-06 16:36:40,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 16:36:40,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 16:36:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 906 transitions. [2022-12-06 16:36:40,678 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8388888888888889 [2022-12-06 16:36:40,680 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 41 predicate places. [2022-12-06 16:36:40,680 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 610 transitions, 6158 flow [2022-12-06 16:36:40,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.14285714285714) internal successors, (603), 7 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:40,680 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:36:40,680 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:36:40,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 16:36:40,681 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:36:40,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:36:40,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1038099957, now seen corresponding path program 1 times [2022-12-06 16:36:40,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:36:40,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539882093] [2022-12-06 16:36:40,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:36:40,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:36:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:36:40,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:36:40,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:36:40,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539882093] [2022-12-06 16:36:40,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539882093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:36:40,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:36:40,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:36:40,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967440150] [2022-12-06 16:36:40,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:36:40,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:36:40,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:36:40,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:36:40,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:36:40,870 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 108 [2022-12-06 16:36:40,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 610 transitions, 6158 flow. Second operand has 7 states, 7 states have (on average 84.28571428571429) internal successors, (590), 7 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:40,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:36:40,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 108 [2022-12-06 16:36:40,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:36:42,153 INFO L130 PetriNetUnfolder]: 3052/8178 cut-off events. [2022-12-06 16:36:42,154 INFO L131 PetriNetUnfolder]: For 16787/63826 co-relation queries the response was YES. [2022-12-06 16:36:42,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31412 conditions, 8178 events. 3052/8178 cut-off events. For 16787/63826 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 83406 event pairs, 8 based on Foata normal form. 79/8199 useless extension candidates. Maximal degree in co-relation 31330. Up to 2923 conditions per place. [2022-12-06 16:36:42,187 INFO L137 encePairwiseOnDemand]: 96/108 looper letters, 124 selfloop transitions, 20 changer transitions 973/1188 dead transitions. [2022-12-06 16:36:42,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 1188 transitions, 14665 flow [2022-12-06 16:36:42,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 16:36:42,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 16:36:42,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1536 transitions. [2022-12-06 16:36:42,191 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8366013071895425 [2022-12-06 16:36:42,193 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 57 predicate places. [2022-12-06 16:36:42,193 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 1188 transitions, 14665 flow [2022-12-06 16:36:42,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.28571428571429) internal successors, (590), 7 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:42,194 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:36:42,194 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:36:42,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 16:36:42,194 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:36:42,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:36:42,195 INFO L85 PathProgramCache]: Analyzing trace with hash -972461937, now seen corresponding path program 1 times [2022-12-06 16:36:42,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:36:42,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952251824] [2022-12-06 16:36:42,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:36:42,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:36:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:36:42,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:36:42,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:36:42,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952251824] [2022-12-06 16:36:42,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952251824] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:36:42,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:36:42,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 16:36:42,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166137130] [2022-12-06 16:36:42,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:36:42,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 16:36:42,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:36:42,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 16:36:42,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 16:36:42,394 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 108 [2022-12-06 16:36:42,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 1188 transitions, 14665 flow. Second operand has 8 states, 8 states have (on average 84.125) internal successors, (673), 8 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:42,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:36:42,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 108 [2022-12-06 16:36:42,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:36:43,858 INFO L130 PetriNetUnfolder]: 3392/9272 cut-off events. [2022-12-06 16:36:43,859 INFO L131 PetriNetUnfolder]: For 21725/74310 co-relation queries the response was YES. [2022-12-06 16:36:43,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40317 conditions, 9272 events. 3392/9272 cut-off events. For 21725/74310 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 97110 event pairs, 5 based on Foata normal form. 147/9366 useless extension candidates. Maximal degree in co-relation 40228. Up to 3258 conditions per place. [2022-12-06 16:36:43,900 INFO L137 encePairwiseOnDemand]: 98/108 looper letters, 65 selfloop transitions, 9 changer transitions 1202/1347 dead transitions. [2022-12-06 16:36:43,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 1347 transitions, 19253 flow [2022-12-06 16:36:43,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 16:36:43,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 16:36:43,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1242 transitions. [2022-12-06 16:36:43,903 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8214285714285714 [2022-12-06 16:36:43,903 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 70 predicate places. [2022-12-06 16:36:43,903 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 1347 transitions, 19253 flow [2022-12-06 16:36:43,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 84.125) internal successors, (673), 8 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:43,904 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:36:43,904 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:36:43,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 16:36:43,904 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:36:43,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:36:43,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1789996664, now seen corresponding path program 1 times [2022-12-06 16:36:43,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:36:43,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331646539] [2022-12-06 16:36:43,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:36:43,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:36:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:36:44,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:36:44,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:36:44,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331646539] [2022-12-06 16:36:44,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331646539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:36:44,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:36:44,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-06 16:36:44,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117081822] [2022-12-06 16:36:44,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:36:44,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 16:36:44,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:36:44,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 16:36:44,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-06 16:36:44,254 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 108 [2022-12-06 16:36:44,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 1347 transitions, 19253 flow. Second operand has 11 states, 11 states have (on average 81.72727272727273) internal successors, (899), 11 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:44,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:36:44,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 108 [2022-12-06 16:36:44,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:36:47,155 INFO L130 PetriNetUnfolder]: 5127/15079 cut-off events. [2022-12-06 16:36:47,155 INFO L131 PetriNetUnfolder]: For 33640/99700 co-relation queries the response was YES. [2022-12-06 16:36:47,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68925 conditions, 15079 events. 5127/15079 cut-off events. For 33640/99700 co-relation queries the response was YES. Maximal size of possible extension queue 937. Compared 177232 event pairs, 33 based on Foata normal form. 602/15605 useless extension candidates. Maximal degree in co-relation 68827. Up to 4921 conditions per place. [2022-12-06 16:36:47,234 INFO L137 encePairwiseOnDemand]: 92/108 looper letters, 88 selfloop transitions, 46 changer transitions 2545/2748 dead transitions. [2022-12-06 16:36:47,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 2748 transitions, 45183 flow [2022-12-06 16:36:47,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-06 16:36:47,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-12-06 16:36:47,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 3056 transitions. [2022-12-06 16:36:47,241 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8084656084656084 [2022-12-06 16:36:47,242 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 104 predicate places. [2022-12-06 16:36:47,242 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 2748 transitions, 45183 flow [2022-12-06 16:36:47,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 81.72727272727273) internal successors, (899), 11 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:47,243 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:36:47,243 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:36:47,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 16:36:47,244 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:36:47,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:36:47,244 INFO L85 PathProgramCache]: Analyzing trace with hash 180853258, now seen corresponding path program 2 times [2022-12-06 16:36:47,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:36:47,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160389890] [2022-12-06 16:36:47,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:36:47,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:36:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:36:47,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:36:47,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:36:47,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160389890] [2022-12-06 16:36:47,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160389890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:36:47,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:36:47,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-06 16:36:47,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845805714] [2022-12-06 16:36:47,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:36:47,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 16:36:47,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:36:47,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 16:36:47,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-06 16:36:47,484 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 108 [2022-12-06 16:36:47,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 2748 transitions, 45183 flow. Second operand has 11 states, 11 states have (on average 81.72727272727273) internal successors, (899), 11 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:47,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:36:47,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 108 [2022-12-06 16:36:47,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:36:51,751 INFO L130 PetriNetUnfolder]: 5865/17394 cut-off events. [2022-12-06 16:36:51,751 INFO L131 PetriNetUnfolder]: For 33713/104299 co-relation queries the response was YES. [2022-12-06 16:36:51,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88697 conditions, 17394 events. 5865/17394 cut-off events. For 33713/104299 co-relation queries the response was YES. Maximal size of possible extension queue 1043. Compared 209550 event pairs, 54 based on Foata normal form. 982/18283 useless extension candidates. Maximal degree in co-relation 88590. Up to 5739 conditions per place. [2022-12-06 16:36:51,841 INFO L137 encePairwiseOnDemand]: 92/108 looper letters, 30 selfloop transitions, 9 changer transitions 3111/3218 dead transitions. [2022-12-06 16:36:51,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 3218 transitions, 59403 flow [2022-12-06 16:36:51,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-06 16:36:51,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-06 16:36:51,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 2760 transitions. [2022-12-06 16:36:51,845 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7986111111111112 [2022-12-06 16:36:51,845 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 135 predicate places. [2022-12-06 16:36:51,845 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 3218 transitions, 59403 flow [2022-12-06 16:36:51,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 81.72727272727273) internal successors, (899), 11 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:51,846 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:36:51,846 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:36:51,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 16:36:51,846 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:36:51,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:36:51,846 INFO L85 PathProgramCache]: Analyzing trace with hash -306054938, now seen corresponding path program 1 times [2022-12-06 16:36:51,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:36:51,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291289005] [2022-12-06 16:36:51,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:36:51,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:36:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:36:52,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:36:52,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:36:52,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291289005] [2022-12-06 16:36:52,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291289005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:36:52,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:36:52,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:36:52,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139345205] [2022-12-06 16:36:52,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:36:52,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:36:52,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:36:52,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:36:52,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:36:52,130 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 108 [2022-12-06 16:36:52,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 3218 transitions, 59403 flow. Second operand has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:52,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:36:52,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 108 [2022-12-06 16:36:52,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:36:54,418 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][647], [395#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 122#true, 186#true, 71#L4true, 234#true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 169#true, 13#L763true, 93#L787true, 55#L814true]) [2022-12-06 16:36:54,419 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:36:54,419 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:36:54,419 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:36:54,419 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:36:54,419 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([324] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][650], [395#(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)), 24#L807true, 262#(= 0 ~x$r_buff0_thd0~0), 14#L794true, 122#true, 186#true, 71#L4true, 234#true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 169#true, 13#L763true]) [2022-12-06 16:36:54,420 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:36:54,420 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:36:54,420 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:36:54,420 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:36:54,898 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][647], [395#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 122#true, 77#L4-1true, 186#true, 234#true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 169#true, 13#L763true, 93#L787true, 55#L814true]) [2022-12-06 16:36:54,898 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:36:54,898 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:36:54,898 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:36:54,898 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:36:54,899 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([324] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][650], [395#(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)), 24#L807true, 262#(= 0 ~x$r_buff0_thd0~0), 77#L4-1true, 14#L794true, 122#true, 186#true, 234#true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 169#true, 13#L763true]) [2022-12-06 16:36:54,899 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:36:54,899 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:36:54,899 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:36:54,899 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:36:54,902 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][710], [262#(= 0 ~x$r_buff0_thd0~0), 122#true, 399#(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)), 186#true, 50#L768true, 71#L4true, 234#true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 169#true, 93#L787true, 55#L814true]) [2022-12-06 16:36:54,902 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:36:54,902 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:36:54,902 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:36:54,902 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:36:54,902 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([324] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][713], [24#L807true, 262#(= 0 ~x$r_buff0_thd0~0), 14#L794true, 122#true, 399#(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)), 186#true, 50#L768true, 71#L4true, 234#true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 169#true]) [2022-12-06 16:36:54,902 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:36:54,902 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:36:54,902 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:36:54,902 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:36:55,403 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][710], [262#(= 0 ~x$r_buff0_thd0~0), 122#true, 77#L4-1true, 399#(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)), 186#true, 50#L768true, 234#true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 169#true, 93#L787true, 55#L814true]) [2022-12-06 16:36:55,403 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-06 16:36:55,404 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:36:55,404 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:36:55,404 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:36:55,404 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([324] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][713], [24#L807true, 262#(= 0 ~x$r_buff0_thd0~0), 77#L4-1true, 14#L794true, 122#true, 399#(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)), 186#true, 50#L768true, 234#true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 169#true]) [2022-12-06 16:36:55,404 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-06 16:36:55,404 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:36:55,404 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:36:55,404 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:36:58,381 INFO L130 PetriNetUnfolder]: 9542/21891 cut-off events. [2022-12-06 16:36:58,381 INFO L131 PetriNetUnfolder]: For 212351/234420 co-relation queries the response was YES. [2022-12-06 16:36:58,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115517 conditions, 21891 events. 9542/21891 cut-off events. For 212351/234420 co-relation queries the response was YES. Maximal size of possible extension queue 1044. Compared 228605 event pairs, 214 based on Foata normal form. 777/22164 useless extension candidates. Maximal degree in co-relation 115406. Up to 8752 conditions per place. [2022-12-06 16:36:58,588 INFO L137 encePairwiseOnDemand]: 98/108 looper letters, 56 selfloop transitions, 8 changer transitions 1954/2119 dead transitions. [2022-12-06 16:36:58,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 2119 transitions, 41657 flow [2022-12-06 16:36:58,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 16:36:58,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 16:36:58,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 931 transitions. [2022-12-06 16:36:58,612 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.862037037037037 [2022-12-06 16:36:58,612 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 132 predicate places. [2022-12-06 16:36:58,612 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 2119 transitions, 41657 flow [2022-12-06 16:36:58,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:58,613 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:36:58,613 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:36:58,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 16:36:58,613 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:36:58,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:36:58,614 INFO L85 PathProgramCache]: Analyzing trace with hash -2140074653, now seen corresponding path program 1 times [2022-12-06 16:36:58,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:36:58,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813702027] [2022-12-06 16:36:58,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:36:58,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:36:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:36:58,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:36:58,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:36:58,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813702027] [2022-12-06 16:36:58,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813702027] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:36:58,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:36:58,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:36:58,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028447801] [2022-12-06 16:36:58,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:36:58,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:36:58,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:36:58,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:36:58,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:36:58,788 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 108 [2022-12-06 16:36:58,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 2119 transitions, 41657 flow. Second operand has 7 states, 7 states have (on average 87.0) internal successors, (609), 7 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:36:58,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:36:58,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 108 [2022-12-06 16:36:58,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:37:00,209 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([324] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][425], [24#L807true, 262#(= 0 ~x$r_buff0_thd0~0), 14#L794true, 122#true, 186#true, 234#true, 52#L3true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 412#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 169#true, 13#L763true, 393#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:37:00,210 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,210 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,210 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,210 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,210 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][430], [262#(= 0 ~x$r_buff0_thd0~0), 122#true, 186#true, 234#true, 52#L3true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 412#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 169#true, 13#L763true, 93#L787true, 393#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 55#L814true]) [2022-12-06 16:37:00,210 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,210 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,210 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,210 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,511 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([316] L747-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse6 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse4 .cse6)) (.cse8 (and .cse5 (not .cse11))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse6) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse7 v_~x$w_buff0_used~0_118 (ite .cse8 0 v_~x$w_buff0_used~0_118)))) (= v_~__unbuffered_p0_EBX~0_6 (ite .cse7 v_~x~0_72 (ite .cse8 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EBX~0_6) v_~x~0_70) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][469], [24#L807true, 262#(= 0 ~x$r_buff0_thd0~0), 14#L794true, 122#true, 186#true, 234#true, 52#L3true, 203#true, 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 412#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 138#true, 169#true, 13#L763true, 327#(= 0 ~x$r_buff0_thd0~0), 393#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:37:00,512 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,512 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,512 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,512 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,512 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][470], [262#(= 0 ~x$r_buff0_thd0~0), 122#true, 14#L794true, 186#true, 234#true, 52#L3true, 203#true, 119#true, 69#L747true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 412#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 169#true, 327#(= 0 ~x$r_buff0_thd0~0), 393#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 55#L814true]) [2022-12-06 16:37:00,512 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,512 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,512 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,512 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,517 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([316] L747-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse6 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse4 .cse6)) (.cse8 (and .cse5 (not .cse11))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse6) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse7 v_~x$w_buff0_used~0_118 (ite .cse8 0 v_~x$w_buff0_used~0_118)))) (= v_~__unbuffered_p0_EBX~0_6 (ite .cse7 v_~x~0_72 (ite .cse8 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EBX~0_6) v_~x~0_70) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][474], [24#L807true, 262#(= 0 ~x$r_buff0_thd0~0), 122#true, 14#L794true, 186#true, 234#true, 52#L3true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 412#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 169#true, 13#L763true, 393#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:37:00,517 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,517 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,517 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,518 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:37:00,762 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][680], [395#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 122#true, 186#true, 234#true, 71#L4true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 414#(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)), P0Thread1of1ForFork2InUse, 138#true, 169#true, 13#L763true, 93#L787true, 55#L814true]) [2022-12-06 16:37:00,762 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,762 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,762 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,762 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,762 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([324] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][682], [395#(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)), 24#L807true, 262#(= 0 ~x$r_buff0_thd0~0), 14#L794true, 122#true, 186#true, 234#true, 71#L4true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 414#(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)), P0Thread1of1ForFork2InUse, 138#true, 169#true, 13#L763true]) [2022-12-06 16:37:00,763 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,763 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,763 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,763 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,768 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][543], [397#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 122#true, 186#true, 50#L768true, 234#true, 52#L3true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 169#true, 416#(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)), 93#L787true, 55#L814true]) [2022-12-06 16:37:00,768 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,768 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,768 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,768 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,769 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([324] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][541], [24#L807true, 397#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 14#L794true, 122#true, 50#L768true, 186#true, 234#true, 52#L3true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 169#true, 416#(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-06 16:37:00,769 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,769 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,769 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,769 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,922 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][475], [14#L794true, 122#true, 186#true, 234#true, 266#(and (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))) (= 0 ~x$r_buff0_thd0~0)), 52#L3true, 203#true, 119#true, 69#L747true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 412#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 169#true, 393#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 55#L814true]) [2022-12-06 16:37:00,922 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event [2022-12-06 16:37:00,922 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is not cut-off event [2022-12-06 16:37:00,922 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is not cut-off event [2022-12-06 16:37:00,922 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is not cut-off event [2022-12-06 16:37:00,965 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([316] L747-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse6 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse4 .cse6)) (.cse8 (and .cse5 (not .cse11))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse6) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse7 v_~x$w_buff0_used~0_118 (ite .cse8 0 v_~x$w_buff0_used~0_118)))) (= v_~__unbuffered_p0_EBX~0_6 (ite .cse7 v_~x~0_72 (ite .cse8 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EBX~0_6) v_~x~0_70) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][643], [395#(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)), 24#L807true, 262#(= 0 ~x$r_buff0_thd0~0), 122#true, 14#L794true, 186#true, 71#L4true, 234#true, 203#true, 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 414#(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)), P0Thread1of1ForFork2InUse, 138#true, 169#true, 13#L763true, 327#(= 0 ~x$r_buff0_thd0~0)]) [2022-12-06 16:37:00,965 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,965 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,965 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,965 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,965 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][640], [395#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 14#L794true, 122#true, 186#true, 71#L4true, 234#true, 203#true, 119#true, 69#L747true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 414#(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)), 138#true, 169#true, 327#(= 0 ~x$r_buff0_thd0~0), 55#L814true]) [2022-12-06 16:37:00,965 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,965 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,965 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,966 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,968 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([316] L747-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse6 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse4 .cse6)) (.cse8 (and .cse5 (not .cse11))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse6) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse7 v_~x$w_buff0_used~0_118 (ite .cse8 0 v_~x$w_buff0_used~0_118)))) (= v_~__unbuffered_p0_EBX~0_6 (ite .cse7 v_~x~0_72 (ite .cse8 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EBX~0_6) v_~x~0_70) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][501], [24#L807true, 397#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 122#true, 186#true, 234#true, 97#L797true, 52#L3true, 203#true, 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 169#true, 13#L763true, 416#(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)), 327#(= 0 ~x$r_buff0_thd0~0)]) [2022-12-06 16:37:00,968 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,968 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,968 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,968 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,968 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][500], [397#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 122#true, 186#true, 234#true, 97#L797true, 52#L3true, 203#true, 119#true, 69#L747true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 169#true, 416#(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)), 327#(= 0 ~x$r_buff0_thd0~0), 55#L814true]) [2022-12-06 16:37:00,968 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,968 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,968 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,968 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,972 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([316] L747-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse6 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse4 .cse6)) (.cse8 (and .cse5 (not .cse11))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse6) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse7 v_~x$w_buff0_used~0_118 (ite .cse8 0 v_~x$w_buff0_used~0_118)))) (= v_~__unbuffered_p0_EBX~0_6 (ite .cse7 v_~x~0_72 (ite .cse8 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EBX~0_6) v_~x~0_70) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][641], [395#(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)), 24#L807true, 262#(= 0 ~x$r_buff0_thd0~0), 14#L794true, 122#true, 186#true, 71#L4true, 234#true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 414#(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)), P0Thread1of1ForFork2InUse, 138#true, 169#true, 13#L763true]) [2022-12-06 16:37:00,972 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,972 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,972 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,972 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,972 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][645], [395#(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)), 122#true, 14#L794true, 186#true, 234#true, 266#(and (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))) (= 0 ~x$r_buff0_thd0~0)), 71#L4true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), 69#L747true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 141#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 414#(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)), P0Thread1of1ForFork2InUse, 169#true, 55#L814true]) [2022-12-06 16:37:00,972 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,972 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,972 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,973 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,976 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][503], [397#(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)), 122#true, 186#true, 234#true, 266#(and (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))) (= 0 ~x$r_buff0_thd0~0)), 97#L797true, 52#L3true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), 69#L747true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 169#true, 416#(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)), 55#L814true]) [2022-12-06 16:37:00,976 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,977 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,977 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,977 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,977 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([316] L747-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse6 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse4 .cse6)) (.cse8 (and .cse5 (not .cse11))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse6) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse7 v_~x$w_buff0_used~0_118 (ite .cse8 0 v_~x$w_buff0_used~0_118)))) (= v_~__unbuffered_p0_EBX~0_6 (ite .cse7 v_~x~0_72 (ite .cse8 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EBX~0_6) v_~x~0_70) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][499], [24#L807true, 397#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 122#true, 186#true, 234#true, 97#L797true, 52#L3true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 169#true, 13#L763true, 416#(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-06 16:37:00,977 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,977 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,977 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:00,977 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:01,160 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][680], [395#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 122#true, 77#L4-1true, 186#true, 234#true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 414#(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)), P0Thread1of1ForFork2InUse, 138#true, 169#true, 13#L763true, 93#L787true, 55#L814true]) [2022-12-06 16:37:01,160 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,160 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,160 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,160 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,161 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([324] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][682], [395#(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)), 24#L807true, 262#(= 0 ~x$r_buff0_thd0~0), 77#L4-1true, 14#L794true, 122#true, 186#true, 234#true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 414#(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)), P0Thread1of1ForFork2InUse, 138#true, 169#true, 13#L763true]) [2022-12-06 16:37:01,161 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,161 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,161 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,161 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,163 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([324] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][806], [24#L807true, 418#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 399#(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)), 14#L794true, 122#true, 186#true, 50#L768true, 234#true, 71#L4true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 169#true]) [2022-12-06 16:37:01,163 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,163 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,163 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,163 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,163 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][807], [418#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 122#true, 399#(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)), 186#true, 50#L768true, 234#true, 71#L4true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 169#true, 93#L787true, 55#L814true]) [2022-12-06 16:37:01,163 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,163 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,163 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,163 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,366 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([316] L747-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse6 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse4 .cse6)) (.cse8 (and .cse5 (not .cse11))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse6) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse7 v_~x$w_buff0_used~0_118 (ite .cse8 0 v_~x$w_buff0_used~0_118)))) (= v_~__unbuffered_p0_EBX~0_6 (ite .cse7 v_~x~0_72 (ite .cse8 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EBX~0_6) v_~x~0_70) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][643], [395#(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)), 24#L807true, 262#(= 0 ~x$r_buff0_thd0~0), 77#L4-1true, 14#L794true, 122#true, 186#true, 234#true, 203#true, 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 414#(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)), 138#true, 169#true, 13#L763true, 327#(= 0 ~x$r_buff0_thd0~0)]) [2022-12-06 16:37:01,366 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,366 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,366 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,366 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,366 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][640], [395#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 77#L4-1true, 14#L794true, 122#true, 186#true, 234#true, 203#true, 119#true, 69#L747true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 414#(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)), P0Thread1of1ForFork2InUse, 138#true, 169#true, 327#(= 0 ~x$r_buff0_thd0~0), 55#L814true]) [2022-12-06 16:37:01,366 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,367 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,367 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,367 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,368 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][744], [418#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 122#true, 399#(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)), 186#true, 71#L4true, 234#true, 97#L797true, 203#true, 119#true, 69#L747true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 169#true, 327#(= 0 ~x$r_buff0_thd0~0), 55#L814true]) [2022-12-06 16:37:01,369 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,369 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,369 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,369 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,369 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([316] L747-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse6 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse4 .cse6)) (.cse8 (and .cse5 (not .cse11))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse6) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse7 v_~x$w_buff0_used~0_118 (ite .cse8 0 v_~x$w_buff0_used~0_118)))) (= v_~__unbuffered_p0_EBX~0_6 (ite .cse7 v_~x~0_72 (ite .cse8 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EBX~0_6) v_~x~0_70) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][743], [24#L807true, 418#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 122#true, 399#(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)), 186#true, 71#L4true, 234#true, 97#L797true, 203#true, 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 169#true, 13#L763true, 327#(= 0 ~x$r_buff0_thd0~0)]) [2022-12-06 16:37:01,369 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,369 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,369 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,369 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,372 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([316] L747-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse6 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse4 .cse6)) (.cse8 (and .cse5 (not .cse11))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse6) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse7 v_~x$w_buff0_used~0_118 (ite .cse8 0 v_~x$w_buff0_used~0_118)))) (= v_~__unbuffered_p0_EBX~0_6 (ite .cse7 v_~x~0_72 (ite .cse8 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EBX~0_6) v_~x~0_70) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][641], [395#(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)), 24#L807true, 262#(= 0 ~x$r_buff0_thd0~0), 122#true, 77#L4-1true, 14#L794true, 186#true, 234#true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 414#(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)), 138#true, 169#true, 13#L763true]) [2022-12-06 16:37:01,372 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,372 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,372 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,372 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,372 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][645], [395#(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)), 77#L4-1true, 14#L794true, 122#true, 186#true, 266#(and (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))) (= 0 ~x$r_buff0_thd0~0)), 234#true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), 69#L747true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 414#(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)), P0Thread1of1ForFork2InUse, 141#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 169#true, 55#L814true]) [2022-12-06 16:37:01,372 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,372 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,372 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,372 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,374 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][741], [418#(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)), 122#true, 399#(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)), 186#true, 71#L4true, 234#true, 266#(and (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))) (= 0 ~x$r_buff0_thd0~0)), 97#L797true, 203#true, 119#true, 69#L747true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 169#true, 55#L814true]) [2022-12-06 16:37:01,374 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,374 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,374 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,374 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,375 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([316] L747-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse6 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse4 .cse6)) (.cse8 (and .cse5 (not .cse11))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse6) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse7 v_~x$w_buff0_used~0_118 (ite .cse8 0 v_~x$w_buff0_used~0_118)))) (= v_~__unbuffered_p0_EBX~0_6 (ite .cse7 v_~x~0_72 (ite .cse8 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EBX~0_6) v_~x~0_70) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][742], [24#L807true, 418#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 122#true, 399#(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)), 186#true, 71#L4true, 234#true, 97#L797true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 169#true, 13#L763true]) [2022-12-06 16:37:01,375 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,375 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,375 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,375 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:01,532 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([324] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][806], [24#L807true, 418#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 77#L4-1true, 14#L794true, 122#true, 399#(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)), 50#L768true, 186#true, 234#true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 169#true]) [2022-12-06 16:37:01,532 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-06 16:37:01,532 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:01,532 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:01,533 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:01,533 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][807], [418#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 77#L4-1true, 122#true, 399#(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)), 50#L768true, 186#true, 234#true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 169#true, 93#L787true, 55#L814true]) [2022-12-06 16:37:01,533 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-06 16:37:01,533 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:01,533 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:01,533 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:01,710 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][744], [418#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 77#L4-1true, 122#true, 399#(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)), 186#true, 234#true, 97#L797true, 203#true, 119#true, 69#L747true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 169#true, 327#(= 0 ~x$r_buff0_thd0~0), 55#L814true]) [2022-12-06 16:37:01,710 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-06 16:37:01,710 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:01,710 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:01,710 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:01,710 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([316] L747-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse6 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse4 .cse6)) (.cse8 (and .cse5 (not .cse11))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse6) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse7 v_~x$w_buff0_used~0_118 (ite .cse8 0 v_~x$w_buff0_used~0_118)))) (= v_~__unbuffered_p0_EBX~0_6 (ite .cse7 v_~x~0_72 (ite .cse8 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EBX~0_6) v_~x~0_70) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][743], [24#L807true, 418#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 77#L4-1true, 122#true, 399#(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)), 186#true, 234#true, 97#L797true, 203#true, 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 169#true, 13#L763true, 327#(= 0 ~x$r_buff0_thd0~0)]) [2022-12-06 16:37:01,710 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-06 16:37:01,710 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:01,710 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:01,711 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:01,712 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][741], [418#(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)), 122#true, 399#(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)), 77#L4-1true, 186#true, 234#true, 266#(and (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))) (= 0 ~x$r_buff0_thd0~0)), 97#L797true, 203#true, 119#true, 69#L747true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 141#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), P0Thread1of1ForFork2InUse, 169#true, 55#L814true]) [2022-12-06 16:37:01,712 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-06 16:37:01,713 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:01,713 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:01,713 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:01,713 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([316] L747-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse6 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse4 .cse6)) (.cse8 (and .cse5 (not .cse11))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse6) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse7 v_~x$w_buff0_used~0_118 (ite .cse8 0 v_~x$w_buff0_used~0_118)))) (= v_~__unbuffered_p0_EBX~0_6 (ite .cse7 v_~x~0_72 (ite .cse8 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EBX~0_6) v_~x~0_70) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][742], [24#L807true, 418#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 122#true, 77#L4-1true, 399#(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)), 186#true, 234#true, 97#L797true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 169#true, 13#L763true]) [2022-12-06 16:37:01,713 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-06 16:37:01,713 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:01,713 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:01,713 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:02,702 INFO L130 PetriNetUnfolder]: 6909/14516 cut-off events. [2022-12-06 16:37:02,703 INFO L131 PetriNetUnfolder]: For 189898/208241 co-relation queries the response was YES. [2022-12-06 16:37:02,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83975 conditions, 14516 events. 6909/14516 cut-off events. For 189898/208241 co-relation queries the response was YES. Maximal size of possible extension queue 1039. Compared 138447 event pairs, 127 based on Foata normal form. 1667/15916 useless extension candidates. Maximal degree in co-relation 83860. Up to 5358 conditions per place. [2022-12-06 16:37:02,741 INFO L137 encePairwiseOnDemand]: 98/108 looper letters, 38 selfloop transitions, 9 changer transitions 1677/1808 dead transitions. [2022-12-06 16:37:02,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 1808 transitions, 38667 flow [2022-12-06 16:37:02,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:37:02,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:37:02,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1213 transitions. [2022-12-06 16:37:02,743 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.863960113960114 [2022-12-06 16:37:02,744 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 117 predicate places. [2022-12-06 16:37:02,744 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 1808 transitions, 38667 flow [2022-12-06 16:37:02,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 87.0) internal successors, (609), 7 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:37:02,744 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:37:02,744 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:37:02,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 16:37:02,744 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:37:02,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:37:02,745 INFO L85 PathProgramCache]: Analyzing trace with hash 84589460, now seen corresponding path program 1 times [2022-12-06 16:37:02,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:37:02,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221555604] [2022-12-06 16:37:02,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:37:02,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:37:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:37:03,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:37:03,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:37:03,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221555604] [2022-12-06 16:37:03,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221555604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:37:03,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:37:03,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 16:37:03,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059322709] [2022-12-06 16:37:03,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:37:03,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 16:37:03,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:37:03,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 16:37:03,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 16:37:03,203 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 108 [2022-12-06 16:37:03,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 1808 transitions, 38667 flow. Second operand has 9 states, 9 states have (on average 84.22222222222223) internal successors, (758), 9 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:37:03,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:37:03,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 108 [2022-12-06 16:37:03,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:37:04,460 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([324] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][809], [395#(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)), 24#L807true, 262#(= 0 ~x$r_buff0_thd0~0), 14#L794true, 122#true, 186#true, 234#true, 71#L4true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 427#(and (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 0) (not (= ~x~0 0)) (= ~x$r_buff1_thd1~0 0)), 414#(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)), P0Thread1of1ForFork2InUse, 138#true, 169#true, 13#L763true]) [2022-12-06 16:37:04,460 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:37:04,460 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:04,460 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:04,461 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:04,461 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][810], [395#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 425#(= 0 ~x$r_buff0_thd1~0), 122#true, 186#true, 71#L4true, 234#true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 414#(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)), P0Thread1of1ForFork2InUse, 138#true, 169#true, 13#L763true, 93#L787true, 55#L814true]) [2022-12-06 16:37:04,461 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:37:04,461 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:04,461 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:04,461 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:04,717 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][752], [395#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 425#(= 0 ~x$r_buff0_thd1~0), 14#L794true, 122#true, 186#true, 71#L4true, 234#true, 203#true, 119#true, 69#L747true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 414#(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)), P0Thread1of1ForFork2InUse, 138#true, 169#true, 327#(= 0 ~x$r_buff0_thd0~0), 55#L814true]) [2022-12-06 16:37:04,717 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:37:04,717 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:04,717 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:04,717 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:04,717 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([316] L747-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse6 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse4 .cse6)) (.cse8 (and .cse5 (not .cse11))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse6) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse7 v_~x$w_buff0_used~0_118 (ite .cse8 0 v_~x$w_buff0_used~0_118)))) (= v_~__unbuffered_p0_EBX~0_6 (ite .cse7 v_~x~0_72 (ite .cse8 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EBX~0_6) v_~x~0_70) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][749], [395#(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)), 24#L807true, 433#(and (= 0 ~x$r_buff0_thd1~0) (not (= ~__unbuffered_p0_EBX~0 0)) (= ~x$w_buff0_used~0 0) (not (= ~x~0 0)) (= ~x$r_buff1_thd1~0 0)), 262#(= 0 ~x$r_buff0_thd0~0), 14#L794true, 122#true, 186#true, 71#L4true, 234#true, 203#true, 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 414#(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)), 138#true, 169#true, 13#L763true, 327#(= 0 ~x$r_buff0_thd0~0)]) [2022-12-06 16:37:04,717 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:37:04,718 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:04,718 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:04,718 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:04,721 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][754], [395#(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)), 425#(= 0 ~x$r_buff0_thd1~0), 14#L794true, 122#true, 186#true, 266#(and (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))) (= 0 ~x$r_buff0_thd0~0)), 234#true, 71#L4true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), 69#L747true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 141#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 414#(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)), P0Thread1of1ForFork2InUse, 169#true, 55#L814true]) [2022-12-06 16:37:04,722 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:37:04,722 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:04,722 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:04,722 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:04,722 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([316] L747-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse6 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse4 .cse6)) (.cse8 (and .cse5 (not .cse11))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse6) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse7 v_~x$w_buff0_used~0_118 (ite .cse8 0 v_~x$w_buff0_used~0_118)))) (= v_~__unbuffered_p0_EBX~0_6 (ite .cse7 v_~x~0_72 (ite .cse8 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EBX~0_6) v_~x~0_70) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][753], [395#(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)), 433#(and (= 0 ~x$r_buff0_thd1~0) (not (= ~__unbuffered_p0_EBX~0 0)) (= ~x$w_buff0_used~0 0) (not (= ~x~0 0)) (= ~x$r_buff1_thd1~0 0)), 24#L807true, 262#(= 0 ~x$r_buff0_thd0~0), 122#true, 14#L794true, 186#true, 234#true, 71#L4true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 414#(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)), P0Thread1of1ForFork2InUse, 138#true, 169#true, 13#L763true]) [2022-12-06 16:37:04,722 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:37:04,722 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:04,722 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:04,722 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:37:04,846 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([324] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][809], [395#(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)), 24#L807true, 262#(= 0 ~x$r_buff0_thd0~0), 77#L4-1true, 14#L794true, 122#true, 186#true, 234#true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 427#(and (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 0) (not (= ~x~0 0)) (= ~x$r_buff1_thd1~0 0)), 414#(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)), P0Thread1of1ForFork2InUse, 138#true, 169#true, 13#L763true]) [2022-12-06 16:37:04,847 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,847 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,847 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,847 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,847 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][810], [395#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 425#(= 0 ~x$r_buff0_thd1~0), 77#L4-1true, 122#true, 186#true, 234#true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 414#(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)), P0Thread1of1ForFork2InUse, 138#true, 169#true, 13#L763true, 93#L787true, 55#L814true]) [2022-12-06 16:37:04,847 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,847 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,847 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,847 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,848 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([324] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][927], [24#L807true, 418#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 14#L794true, 122#true, 399#(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)), 186#true, 50#L768true, 71#L4true, 234#true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 427#(and (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 0) (not (= ~x~0 0)) (= ~x$r_buff1_thd1~0 0)), P0Thread1of1ForFork2InUse, 138#true, 169#true]) [2022-12-06 16:37:04,848 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,848 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,849 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,849 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,849 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][931], [418#(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)), 425#(= 0 ~x$r_buff0_thd1~0), 262#(= 0 ~x$r_buff0_thd0~0), 122#true, 399#(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)), 50#L768true, 186#true, 71#L4true, 234#true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 169#true, 93#L787true, 55#L814true]) [2022-12-06 16:37:04,849 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,849 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,849 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,849 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,954 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][752], [395#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 425#(= 0 ~x$r_buff0_thd1~0), 122#true, 14#L794true, 77#L4-1true, 186#true, 234#true, 203#true, 119#true, 69#L747true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 414#(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)), 138#true, 169#true, 327#(= 0 ~x$r_buff0_thd0~0), 55#L814true]) [2022-12-06 16:37:04,955 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,955 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,955 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,955 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,955 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([316] L747-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse6 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse4 .cse6)) (.cse8 (and .cse5 (not .cse11))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse6) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse7 v_~x$w_buff0_used~0_118 (ite .cse8 0 v_~x$w_buff0_used~0_118)))) (= v_~__unbuffered_p0_EBX~0_6 (ite .cse7 v_~x~0_72 (ite .cse8 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EBX~0_6) v_~x~0_70) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][749], [395#(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)), 24#L807true, 433#(and (= 0 ~x$r_buff0_thd1~0) (not (= ~__unbuffered_p0_EBX~0 0)) (= ~x$w_buff0_used~0 0) (not (= ~x~0 0)) (= ~x$r_buff1_thd1~0 0)), 262#(= 0 ~x$r_buff0_thd0~0), 14#L794true, 122#true, 77#L4-1true, 186#true, 234#true, 203#true, 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 414#(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)), 138#true, 169#true, 13#L763true, 327#(= 0 ~x$r_buff0_thd0~0)]) [2022-12-06 16:37:04,955 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,955 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,955 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,955 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,957 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([316] L747-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse6 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse4 .cse6)) (.cse8 (and .cse5 (not .cse11))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse6) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse7 v_~x$w_buff0_used~0_118 (ite .cse8 0 v_~x$w_buff0_used~0_118)))) (= v_~__unbuffered_p0_EBX~0_6 (ite .cse7 v_~x~0_72 (ite .cse8 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EBX~0_6) v_~x~0_70) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][840], [433#(and (= 0 ~x$r_buff0_thd1~0) (not (= ~__unbuffered_p0_EBX~0 0)) (= ~x$w_buff0_used~0 0) (not (= ~x~0 0)) (= ~x$r_buff1_thd1~0 0)), 24#L807true, 418#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 122#true, 399#(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)), 186#true, 71#L4true, 234#true, 97#L797true, 203#true, 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 169#true, 13#L763true, 327#(= 0 ~x$r_buff0_thd0~0)]) [2022-12-06 16:37:04,957 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,957 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,957 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,957 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,957 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][841], [418#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 425#(= 0 ~x$r_buff0_thd1~0), 122#true, 399#(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)), 186#true, 234#true, 71#L4true, 97#L797true, 203#true, 119#true, 69#L747true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 169#true, 327#(= 0 ~x$r_buff0_thd0~0), 55#L814true]) [2022-12-06 16:37:04,957 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,957 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,957 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,957 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,959 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][754], [395#(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)), 425#(= 0 ~x$r_buff0_thd1~0), 14#L794true, 122#true, 77#L4-1true, 186#true, 266#(and (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))) (= 0 ~x$r_buff0_thd0~0)), 234#true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), 69#L747true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 141#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), 414#(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)), P0Thread1of1ForFork2InUse, 169#true, 55#L814true]) [2022-12-06 16:37:04,959 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,959 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,959 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,959 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,960 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([316] L747-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse6 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse4 .cse6)) (.cse8 (and .cse5 (not .cse11))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse6) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse7 v_~x$w_buff0_used~0_118 (ite .cse8 0 v_~x$w_buff0_used~0_118)))) (= v_~__unbuffered_p0_EBX~0_6 (ite .cse7 v_~x~0_72 (ite .cse8 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EBX~0_6) v_~x~0_70) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][753], [395#(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)), 24#L807true, 433#(and (= 0 ~x$r_buff0_thd1~0) (not (= ~__unbuffered_p0_EBX~0 0)) (= ~x$w_buff0_used~0 0) (not (= ~x~0 0)) (= ~x$r_buff1_thd1~0 0)), 262#(= 0 ~x$r_buff0_thd0~0), 14#L794true, 122#true, 77#L4-1true, 186#true, 234#true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 414#(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)), P0Thread1of1ForFork2InUse, 138#true, 169#true, 13#L763true]) [2022-12-06 16:37:04,960 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,960 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,960 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,960 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,961 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([316] L747-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse6 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse4 .cse6)) (.cse8 (and .cse5 (not .cse11))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse6) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse7 v_~x$w_buff0_used~0_118 (ite .cse8 0 v_~x$w_buff0_used~0_118)))) (= v_~__unbuffered_p0_EBX~0_6 (ite .cse7 v_~x~0_72 (ite .cse8 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EBX~0_6) v_~x~0_70) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][839], [433#(and (= 0 ~x$r_buff0_thd1~0) (not (= ~__unbuffered_p0_EBX~0 0)) (= ~x$w_buff0_used~0 0) (not (= ~x~0 0)) (= ~x$r_buff1_thd1~0 0)), 24#L807true, 418#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 122#true, 399#(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)), 186#true, 234#true, 71#L4true, 97#L797true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 169#true, 13#L763true]) [2022-12-06 16:37:04,961 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,961 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,961 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,961 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,961 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][843], [418#(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)), 425#(= 0 ~x$r_buff0_thd1~0), 122#true, 399#(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)), 186#true, 234#true, 266#(and (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))) (= 0 ~x$r_buff0_thd0~0)), 71#L4true, 97#L797true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), 69#L747true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 141#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), P0Thread1of1ForFork2InUse, 169#true, 55#L814true]) [2022-12-06 16:37:04,961 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,961 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,961 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:04,961 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:37:05,088 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([324] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][927], [24#L807true, 418#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 77#L4-1true, 399#(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)), 14#L794true, 122#true, 50#L768true, 186#true, 234#true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 427#(and (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 0) (not (= ~x~0 0)) (= ~x$r_buff1_thd1~0 0)), P0Thread1of1ForFork2InUse, 138#true, 169#true]) [2022-12-06 16:37:05,088 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-06 16:37:05,088 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:05,088 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:05,088 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:05,089 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][931], [418#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 425#(= 0 ~x$r_buff0_thd1~0), 77#L4-1true, 122#true, 399#(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)), 50#L768true, 186#true, 234#true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 169#true, 93#L787true, 55#L814true]) [2022-12-06 16:37:05,089 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-06 16:37:05,089 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:05,089 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:05,089 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:05,179 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([316] L747-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse6 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse4 .cse6)) (.cse8 (and .cse5 (not .cse11))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse6) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse7 v_~x$w_buff0_used~0_118 (ite .cse8 0 v_~x$w_buff0_used~0_118)))) (= v_~__unbuffered_p0_EBX~0_6 (ite .cse7 v_~x~0_72 (ite .cse8 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EBX~0_6) v_~x~0_70) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][840], [24#L807true, 433#(and (= 0 ~x$r_buff0_thd1~0) (not (= ~__unbuffered_p0_EBX~0 0)) (= ~x$w_buff0_used~0 0) (not (= ~x~0 0)) (= ~x$r_buff1_thd1~0 0)), 418#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 122#true, 399#(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)), 77#L4-1true, 186#true, 234#true, 97#L797true, 203#true, 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 169#true, 13#L763true, 327#(= 0 ~x$r_buff0_thd0~0)]) [2022-12-06 16:37:05,179 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-06 16:37:05,179 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:05,179 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:05,179 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:05,179 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][841], [418#(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)), 425#(= 0 ~x$r_buff0_thd1~0), 262#(= 0 ~x$r_buff0_thd0~0), 122#true, 77#L4-1true, 399#(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)), 186#true, 234#true, 97#L797true, 203#true, 119#true, 69#L747true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 169#true, 327#(= 0 ~x$r_buff0_thd0~0), 55#L814true]) [2022-12-06 16:37:05,179 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-06 16:37:05,179 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:05,179 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:05,180 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:05,181 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([316] L747-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse6 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse4 .cse6)) (.cse8 (and .cse5 (not .cse11))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse6) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse7 v_~x$w_buff0_used~0_118 (ite .cse8 0 v_~x$w_buff0_used~0_118)))) (= v_~__unbuffered_p0_EBX~0_6 (ite .cse7 v_~x~0_72 (ite .cse8 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EBX~0_6) v_~x~0_70) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][839], [24#L807true, 433#(and (= 0 ~x$r_buff0_thd1~0) (not (= ~__unbuffered_p0_EBX~0 0)) (= ~x$w_buff0_used~0 0) (not (= ~x~0 0)) (= ~x$r_buff1_thd1~0 0)), 418#(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)), 262#(= 0 ~x$r_buff0_thd0~0), 122#true, 399#(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)), 77#L4-1true, 186#true, 234#true, 97#L797true, 203#true, 119#true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 138#true, 169#true, 13#L763true]) [2022-12-06 16:37:05,181 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-06 16:37:05,181 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:05,181 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:05,181 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:05,181 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][843], [418#(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)), 425#(= 0 ~x$r_buff0_thd1~0), 122#true, 399#(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)), 77#L4-1true, 186#true, 234#true, 266#(and (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))) (= 0 ~x$r_buff0_thd0~0)), 97#L797true, 203#true, 119#true, 69#L747true, 329#(and (= ~__unbuffered_p0_EAX~0 0) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 141#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1))), P0Thread1of1ForFork2InUse, 169#true, 55#L814true]) [2022-12-06 16:37:05,181 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-06 16:37:05,181 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:05,181 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:05,181 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:37:06,168 INFO L130 PetriNetUnfolder]: 9079/20155 cut-off events. [2022-12-06 16:37:06,169 INFO L131 PetriNetUnfolder]: For 306937/333173 co-relation queries the response was YES. [2022-12-06 16:37:06,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111493 conditions, 20155 events. 9079/20155 cut-off events. For 306937/333173 co-relation queries the response was YES. Maximal size of possible extension queue 1431. Compared 212179 event pairs, 140 based on Foata normal form. 973/20866 useless extension candidates. Maximal degree in co-relation 111368. Up to 6267 conditions per place. [2022-12-06 16:37:06,267 INFO L137 encePairwiseOnDemand]: 98/108 looper letters, 34 selfloop transitions, 17 changer transitions 2207/2347 dead transitions. [2022-12-06 16:37:06,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 2347 transitions, 55354 flow [2022-12-06 16:37:06,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 16:37:06,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 16:37:06,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 875 transitions. [2022-12-06 16:37:06,275 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8101851851851852 [2022-12-06 16:37:06,275 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 126 predicate places. [2022-12-06 16:37:06,276 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 2347 transitions, 55354 flow [2022-12-06 16:37:06,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 84.22222222222223) internal successors, (758), 9 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:37:06,276 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:37:06,276 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:37:06,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 16:37:06,276 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:37:06,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:37:06,276 INFO L85 PathProgramCache]: Analyzing trace with hash 354130134, now seen corresponding path program 2 times [2022-12-06 16:37:06,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:37:06,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070767451] [2022-12-06 16:37:06,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:37:06,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:37:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:37:06,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:37:06,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:37:06,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070767451] [2022-12-06 16:37:06,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070767451] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:37:06,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:37:06,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 16:37:06,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029876506] [2022-12-06 16:37:06,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:37:06,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 16:37:06,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:37:06,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 16:37:06,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 16:37:06,459 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 108 [2022-12-06 16:37:06,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 2347 transitions, 55354 flow. Second operand has 8 states, 8 states have (on average 87.0) internal successors, (696), 8 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:37:06,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:37:06,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 108 [2022-12-06 16:37:06,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:37:12,510 INFO L130 PetriNetUnfolder]: 8380/17895 cut-off events. [2022-12-06 16:37:12,510 INFO L131 PetriNetUnfolder]: For 268537/285491 co-relation queries the response was YES. [2022-12-06 16:37:12,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110662 conditions, 17895 events. 8380/17895 cut-off events. For 268537/285491 co-relation queries the response was YES. Maximal size of possible extension queue 1431. Compared 188558 event pairs, 153 based on Foata normal form. 1764/19436 useless extension candidates. Maximal degree in co-relation 110533. Up to 5183 conditions per place. [2022-12-06 16:37:12,585 INFO L137 encePairwiseOnDemand]: 98/108 looper letters, 35 selfloop transitions, 12 changer transitions 1923/2044 dead transitions. [2022-12-06 16:37:12,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 2044 transitions, 52418 flow [2022-12-06 16:37:12,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 16:37:12,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 16:37:12,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1459 transitions. [2022-12-06 16:37:12,588 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8443287037037037 [2022-12-06 16:37:12,588 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 96 predicate places. [2022-12-06 16:37:12,588 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 2044 transitions, 52418 flow [2022-12-06 16:37:12,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.0) internal successors, (696), 8 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:37:12,588 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:37:12,589 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:37:12,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 16:37:12,589 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:37:12,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:37:12,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1615113361, now seen corresponding path program 1 times [2022-12-06 16:37:12,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:37:12,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812381265] [2022-12-06 16:37:12,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:37:12,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:37:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:37:13,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:37:13,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:37:13,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812381265] [2022-12-06 16:37:13,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812381265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:37:13,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:37:13,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-06 16:37:13,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729237480] [2022-12-06 16:37:13,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:37:13,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 16:37:13,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:37:13,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 16:37:13,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-12-06 16:37:13,138 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 108 [2022-12-06 16:37:13,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 2044 transitions, 52418 flow. Second operand has 12 states, 12 states have (on average 77.33333333333333) internal successors, (928), 12 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:37:13,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:37:13,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 108 [2022-12-06 16:37:13,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:37:16,454 INFO L130 PetriNetUnfolder]: 8957/19697 cut-off events. [2022-12-06 16:37:16,455 INFO L131 PetriNetUnfolder]: For 316133/334683 co-relation queries the response was YES. [2022-12-06 16:37:16,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121177 conditions, 19697 events. 8957/19697 cut-off events. For 316133/334683 co-relation queries the response was YES. Maximal size of possible extension queue 1576. Compared 215089 event pairs, 158 based on Foata normal form. 1099/20593 useless extension candidates. Maximal degree in co-relation 121033. Up to 5194 conditions per place. [2022-12-06 16:37:16,543 INFO L137 encePairwiseOnDemand]: 92/108 looper letters, 27 selfloop transitions, 14 changer transitions 2073/2182 dead transitions. [2022-12-06 16:37:16,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 2182 transitions, 60016 flow [2022-12-06 16:37:16,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 16:37:16,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 16:37:16,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1184 transitions. [2022-12-06 16:37:16,545 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7308641975308642 [2022-12-06 16:37:16,546 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 110 predicate places. [2022-12-06 16:37:16,546 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 2182 transitions, 60016 flow [2022-12-06 16:37:16,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 77.33333333333333) internal successors, (928), 12 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:37:16,546 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:37:16,546 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:37:16,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 16:37:16,547 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:37:16,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:37:16,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1531321465, now seen corresponding path program 2 times [2022-12-06 16:37:16,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:37:16,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131501942] [2022-12-06 16:37:16,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:37:16,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:37:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 16:37:16,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 16:37:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 16:37:16,648 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 16:37:16,648 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 16:37:16,649 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 16:37:16,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 16:37:16,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 16:37:16,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 16:37:16,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 16:37:16,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 16:37:16,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 16:37:16,651 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:37:16,656 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 16:37:16,656 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 16:37:16,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:37:16 BasicIcfg [2022-12-06 16:37:16,748 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 16:37:16,749 INFO L158 Benchmark]: Toolchain (without parser) took 40866.60ms. Allocated memory was 188.7MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 162.1MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-12-06 16:37:16,749 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 188.7MB. Free memory is still 164.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 16:37:16,749 INFO L158 Benchmark]: CACSL2BoogieTranslator took 465.47ms. Allocated memory is still 188.7MB. Free memory was 162.1MB in the beginning and 136.4MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-06 16:37:16,749 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.56ms. Allocated memory is still 188.7MB. Free memory was 136.4MB in the beginning and 133.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 16:37:16,749 INFO L158 Benchmark]: Boogie Preprocessor took 18.51ms. Allocated memory is still 188.7MB. Free memory was 133.8MB in the beginning and 131.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 16:37:16,749 INFO L158 Benchmark]: RCFGBuilder took 432.83ms. Allocated memory is still 188.7MB. Free memory was 131.2MB in the beginning and 99.7MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-06 16:37:16,749 INFO L158 Benchmark]: TraceAbstraction took 39914.42ms. Allocated memory was 188.7MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 99.2MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-12-06 16:37:16,750 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 188.7MB. Free memory is still 164.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 465.47ms. Allocated memory is still 188.7MB. Free memory was 162.1MB in the beginning and 136.4MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.56ms. Allocated memory is still 188.7MB. Free memory was 136.4MB in the beginning and 133.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.51ms. Allocated memory is still 188.7MB. Free memory was 133.8MB in the beginning and 131.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 432.83ms. Allocated memory is still 188.7MB. Free memory was 131.2MB in the beginning and 99.7MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 39914.42ms. Allocated memory was 188.7MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 99.2MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L716] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L722] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L723] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L724] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L725] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L726] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L727] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L728] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L729] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L730] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L731] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L732] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L733] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L734] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L735] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L736] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L738] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L740] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L741] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L742] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L831] 0 pthread_t t2055; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2055={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L832] FCALL, FORK 0 pthread_create(&t2055, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2055, ((void *)0), P0, ((void *)0))=-2, t2055={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L833] 0 pthread_t t2056; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2055={5:0}, t2056={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t2056, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2056, ((void *)0), P1, ((void *)0))=-1, t2055={5:0}, t2056={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t2057; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2055={5:0}, t2056={6:0}, t2057={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L836] FCALL, FORK 0 pthread_create(&t2057, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2057, ((void *)0), P2, ((void *)0))=0, t2055={5:0}, t2056={6:0}, t2057={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] 1 __unbuffered_p0_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=2, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=2, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2055={5:0}, t2056={6:0}, t2057={3:0}, weak$$choice0=2, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2055={5:0}, t2056={6:0}, t2057={3:0}, weak$$choice0=2, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L849] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2055={5:0}, t2056={6:0}, t2057={3:0}, weak$$choice0=2, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: 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: 834]: 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: 836]: 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: 832]: 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 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 39.7s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 35.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1437 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1437 mSDsluCounter, 1139 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 909 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2384 IncrementalHoareTripleChecker+Invalid, 2465 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 230 mSDtfsCounter, 2384 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 905 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60016occurred in iteration=14, InterpolantAutomatonStates: 210, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1130 NumberOfCodeBlocks, 1130 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1032 ConstructedInterpolants, 0 QuantifiedInterpolants, 4684 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 16:37:16,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...