/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 --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe016_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 23:42:07,924 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 23:42:07,926 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 23:42:07,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 23:42:07,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 23:42:07,957 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 23:42:07,960 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 23:42:07,963 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 23:42:07,968 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 23:42:07,971 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 23:42:08,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 23:42:08,008 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 23:42:08,009 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 23:42:08,009 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 23:42:08,010 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 23:42:08,010 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 23:42:08,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 23:42:08,011 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 23:42:08,012 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 23:42:08,013 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 23:42:08,014 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 23:42:08,015 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 23:42:08,016 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 23:42:08,016 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 23:42:08,019 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 23:42:08,019 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 23:42:08,019 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 23:42:08,020 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 23:42:08,020 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 23:42:08,021 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 23:42:08,021 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 23:42:08,021 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 23:42:08,022 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 23:42:08,022 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 23:42:08,035 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 23:42:08,036 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 23:42:08,036 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 23:42:08,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 23:42:08,036 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 23:42:08,037 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 23:42:08,037 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 23:42:08,038 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-11 23:42:08,065 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 23:42:08,065 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 23:42:08,066 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 23:42:08,066 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 23:42:08,066 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 23:42:08,066 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 23:42:08,067 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 23:42:08,067 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 23:42:08,067 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 23:42:08,067 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 23:42:08,067 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 23:42:08,067 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 23:42:08,067 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 23:42:08,067 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 23:42:08,067 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 23:42:08,068 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 23:42:08,068 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 23:42:08,068 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 23:42:08,068 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 23:42:08,068 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 23:42:08,068 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 23:42:08,068 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 23:42:08,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 23:42:08,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 23:42:08,069 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 23:42:08,069 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 23:42:08,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 23:42:08,069 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 23:42:08,069 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 23:42:08,069 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 23:42:08,069 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 23:42:08,069 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-11 23:42:08,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 23:42:08,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 23:42:08,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 23:42:08,465 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 23:42:08,465 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 23:42:08,466 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe016_power.opt.i [2022-12-11 23:42:09,597 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 23:42:09,863 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 23:42:09,863 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_power.opt.i [2022-12-11 23:42:09,891 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af88d0d37/a4c877aec6994c5aa84ae64da413086b/FLAGb3eef14a4 [2022-12-11 23:42:09,902 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af88d0d37/a4c877aec6994c5aa84ae64da413086b [2022-12-11 23:42:09,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 23:42:09,905 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 23:42:09,906 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 23:42:09,906 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 23:42:09,908 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 23:42:09,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 11:42:09" (1/1) ... [2022-12-11 23:42:09,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@367ecaab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:42:09, skipping insertion in model container [2022-12-11 23:42:09,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 11:42:09" (1/1) ... [2022-12-11 23:42:09,914 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 23:42:09,963 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 23:42:10,112 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_power.opt.i[951,964] [2022-12-11 23:42:10,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 23:42:10,340 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 23:42:10,349 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/safe016_power.opt.i[951,964] [2022-12-11 23:42:10,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:42:10,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:42:10,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 23:42:10,440 INFO L208 MainTranslator]: Completed translation [2022-12-11 23:42:10,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:42:10 WrapperNode [2022-12-11 23:42:10,441 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 23:42:10,443 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 23:42:10,443 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 23:42:10,443 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 23:42:10,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:42:10" (1/1) ... [2022-12-11 23:42:10,476 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:42:10" (1/1) ... [2022-12-11 23:42:10,504 INFO L138 Inliner]: procedures = 177, calls = 91, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 181 [2022-12-11 23:42:10,504 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 23:42:10,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 23:42:10,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 23:42:10,505 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 23:42:10,511 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:42:10" (1/1) ... [2022-12-11 23:42:10,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:42:10" (1/1) ... [2022-12-11 23:42:10,525 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:42:10" (1/1) ... [2022-12-11 23:42:10,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:42:10" (1/1) ... [2022-12-11 23:42:10,536 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:42:10" (1/1) ... [2022-12-11 23:42:10,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:42:10" (1/1) ... [2022-12-11 23:42:10,540 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:42:10" (1/1) ... [2022-12-11 23:42:10,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:42:10" (1/1) ... [2022-12-11 23:42:10,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 23:42:10,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 23:42:10,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 23:42:10,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 23:42:10,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:42:10" (1/1) ... [2022-12-11 23:42:10,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 23:42:10,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 23:42:10,617 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-11 23:42:10,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-11 23:42:10,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-11 23:42:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 23:42:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 23:42:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 23:42:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 23:42:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 23:42:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 23:42:10,650 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 23:42:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 23:42:10,650 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 23:42:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-11 23:42:10,650 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-11 23:42:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-11 23:42:10,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-11 23:42:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 23:42:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 23:42:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 23:42:10,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 23:42:10,652 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 23:42:10,828 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 23:42:10,829 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 23:42:11,131 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 23:42:11,379 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 23:42:11,379 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 23:42:11,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 11:42:11 BoogieIcfgContainer [2022-12-11 23:42:11,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 23:42:11,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 23:42:11,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 23:42:11,386 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 23:42:11,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 11:42:09" (1/3) ... [2022-12-11 23:42:11,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e93f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 11:42:11, skipping insertion in model container [2022-12-11 23:42:11,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:42:10" (2/3) ... [2022-12-11 23:42:11,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e93f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 11:42:11, skipping insertion in model container [2022-12-11 23:42:11,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 11:42:11" (3/3) ... [2022-12-11 23:42:11,389 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_power.opt.i [2022-12-11 23:42:11,401 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 23:42:11,402 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-11 23:42:11,402 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 23:42:11,463 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 23:42:11,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 144 transitions, 308 flow [2022-12-11 23:42:11,545 INFO L130 PetriNetUnfolder]: 2/140 cut-off events. [2022-12-11 23:42:11,545 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 23:42:11,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 2/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2022-12-11 23:42:11,551 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 144 transitions, 308 flow [2022-12-11 23:42:11,556 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 126 transitions, 264 flow [2022-12-11 23:42:11,566 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 23:42:11,571 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;@2ebf8ab8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 23:42:11,572 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-11 23:42:11,608 INFO L130 PetriNetUnfolder]: 1/125 cut-off events. [2022-12-11 23:42:11,608 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 23:42:11,609 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:42:11,609 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:42:11,610 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 23:42:11,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:42:11,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1026380738, now seen corresponding path program 1 times [2022-12-11 23:42:11,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:42:11,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007521847] [2022-12-11 23:42:11,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:42:11,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:42:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:42:12,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:42:12,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:42:12,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007521847] [2022-12-11 23:42:12,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007521847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:42:12,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:42:12,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 23:42:12,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014192047] [2022-12-11 23:42:12,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:42:12,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 23:42:12,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:42:12,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 23:42:12,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 23:42:12,318 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 144 [2022-12-11 23:42:12,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 126 transitions, 264 flow. Second operand has 6 states, 6 states have (on average 124.0) internal successors, (744), 6 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:42:12,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:42:12,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 144 [2022-12-11 23:42:12,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:42:12,910 INFO L130 PetriNetUnfolder]: 747/1478 cut-off events. [2022-12-11 23:42:12,911 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-11 23:42:12,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2652 conditions, 1478 events. 747/1478 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 9039 event pairs, 97 based on Foata normal form. 53/1494 useless extension candidates. Maximal degree in co-relation 2579. Up to 585 conditions per place. [2022-12-11 23:42:12,923 INFO L137 encePairwiseOnDemand]: 137/144 looper letters, 24 selfloop transitions, 2 changer transitions 37/170 dead transitions. [2022-12-11 23:42:12,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 170 transitions, 487 flow [2022-12-11 23:42:12,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 23:42:12,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 23:42:12,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1165 transitions. [2022-12-11 23:42:12,942 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8989197530864198 [2022-12-11 23:42:12,946 INFO L295 CegarLoopForPetriNet]: 138 programPoint places, 8 predicate places. [2022-12-11 23:42:12,946 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 170 transitions, 487 flow [2022-12-11 23:42:12,952 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 133 transitions, 339 flow [2022-12-11 23:42:12,953 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 133 transitions, 339 flow [2022-12-11 23:42:12,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.0) internal successors, (744), 6 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:42:12,954 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:42:12,954 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:42:12,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 23:42:12,954 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 23:42:12,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:42:12,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1034199197, now seen corresponding path program 1 times [2022-12-11 23:42:12,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:42:12,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735864641] [2022-12-11 23:42:12,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:42:12,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:42:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:42:13,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:42:13,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:42:13,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735864641] [2022-12-11 23:42:13,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735864641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:42:13,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:42:13,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:42:13,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324120028] [2022-12-11 23:42:13,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:42:13,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:42:13,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:42:13,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:42:13,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:42:13,252 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 144 [2022-12-11 23:42:13,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 133 transitions, 339 flow. Second operand has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:42:13,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:42:13,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 144 [2022-12-11 23:42:13,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:42:13,990 INFO L130 PetriNetUnfolder]: 1436/2767 cut-off events. [2022-12-11 23:42:13,990 INFO L131 PetriNetUnfolder]: For 331/1819 co-relation queries the response was YES. [2022-12-11 23:42:13,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6735 conditions, 2767 events. 1436/2767 cut-off events. For 331/1819 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 18439 event pairs, 216 based on Foata normal form. 58/2699 useless extension candidates. Maximal degree in co-relation 6657. Up to 1671 conditions per place. [2022-12-11 23:42:14,004 INFO L137 encePairwiseOnDemand]: 135/144 looper letters, 30 selfloop transitions, 5 changer transitions 59/198 dead transitions. [2022-12-11 23:42:14,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 198 transitions, 764 flow [2022-12-11 23:42:14,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 23:42:14,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 23:42:14,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1274 transitions. [2022-12-11 23:42:14,007 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8847222222222222 [2022-12-11 23:42:14,008 INFO L295 CegarLoopForPetriNet]: 138 programPoint places, 11 predicate places. [2022-12-11 23:42:14,008 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 198 transitions, 764 flow [2022-12-11 23:42:14,018 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 139 transitions, 422 flow [2022-12-11 23:42:14,019 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 139 transitions, 422 flow [2022-12-11 23:42:14,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:42:14,024 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:42:14,025 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:42:14,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 23:42:14,025 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 23:42:14,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:42:14,039 INFO L85 PathProgramCache]: Analyzing trace with hash 492877918, now seen corresponding path program 1 times [2022-12-11 23:42:14,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:42:14,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989644385] [2022-12-11 23:42:14,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:42:14,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:42:14,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:42:14,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:42:14,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:42:14,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989644385] [2022-12-11 23:42:14,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989644385] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:42:14,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:42:14,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:42:14,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600781178] [2022-12-11 23:42:14,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:42:14,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:42:14,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:42:14,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:42:14,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:42:14,354 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 144 [2022-12-11 23:42:14,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 139 transitions, 422 flow. Second operand has 7 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:42:14,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:42:14,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 144 [2022-12-11 23:42:14,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:42:14,812 INFO L130 PetriNetUnfolder]: 904/1788 cut-off events. [2022-12-11 23:42:14,812 INFO L131 PetriNetUnfolder]: For 629/1551 co-relation queries the response was YES. [2022-12-11 23:42:14,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5469 conditions, 1788 events. 904/1788 cut-off events. For 629/1551 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 10961 event pairs, 131 based on Foata normal form. 34/1760 useless extension candidates. Maximal degree in co-relation 5386. Up to 1201 conditions per place. [2022-12-11 23:42:14,823 INFO L137 encePairwiseOnDemand]: 137/144 looper letters, 33 selfloop transitions, 5 changer transitions 31/180 dead transitions. [2022-12-11 23:42:14,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 180 transitions, 809 flow [2022-12-11 23:42:14,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 23:42:14,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 23:42:14,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1276 transitions. [2022-12-11 23:42:14,825 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8861111111111111 [2022-12-11 23:42:14,826 INFO L295 CegarLoopForPetriNet]: 138 programPoint places, 14 predicate places. [2022-12-11 23:42:14,826 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 180 transitions, 809 flow [2022-12-11 23:42:14,833 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 149 transitions, 561 flow [2022-12-11 23:42:14,833 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 149 transitions, 561 flow [2022-12-11 23:42:14,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:42:14,834 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:42:14,834 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:42:14,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 23:42:14,834 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 23:42:14,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:42:14,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1909834877, now seen corresponding path program 1 times [2022-12-11 23:42:14,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:42:14,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123396590] [2022-12-11 23:42:14,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:42:14,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:42:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:42:15,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:42:15,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:42:15,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123396590] [2022-12-11 23:42:15,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123396590] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:42:15,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:42:15,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:42:15,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020768083] [2022-12-11 23:42:15,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:42:15,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:42:15,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:42:15,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:42:15,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:42:15,063 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 144 [2022-12-11 23:42:15,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 149 transitions, 561 flow. Second operand has 7 states, 7 states have (on average 121.28571428571429) internal successors, (849), 7 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:42:15,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:42:15,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 144 [2022-12-11 23:42:15,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:42:15,837 INFO L130 PetriNetUnfolder]: 1324/2742 cut-off events. [2022-12-11 23:42:15,838 INFO L131 PetriNetUnfolder]: For 2125/10687 co-relation queries the response was YES. [2022-12-11 23:42:15,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10502 conditions, 2742 events. 1324/2742 cut-off events. For 2125/10687 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 19827 event pairs, 71 based on Foata normal form. 74/2716 useless extension candidates. Maximal degree in co-relation 10414. Up to 1837 conditions per place. [2022-12-11 23:42:15,856 INFO L137 encePairwiseOnDemand]: 137/144 looper letters, 50 selfloop transitions, 3 changer transitions 67/224 dead transitions. [2022-12-11 23:42:15,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 224 transitions, 1387 flow [2022-12-11 23:42:15,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-11 23:42:15,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-11 23:42:15,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1765 transitions. [2022-12-11 23:42:15,860 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8754960317460317 [2022-12-11 23:42:15,861 INFO L295 CegarLoopForPetriNet]: 138 programPoint places, 21 predicate places. [2022-12-11 23:42:15,861 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 224 transitions, 1387 flow [2022-12-11 23:42:15,874 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 157 transitions, 736 flow [2022-12-11 23:42:15,874 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 157 transitions, 736 flow [2022-12-11 23:42:15,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.28571428571429) internal successors, (849), 7 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:42:15,875 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:42:15,875 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:42:15,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 23:42:15,875 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 23:42:15,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:42:15,875 INFO L85 PathProgramCache]: Analyzing trace with hash 309395809, now seen corresponding path program 1 times [2022-12-11 23:42:15,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:42:15,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554016205] [2022-12-11 23:42:15,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:42:15,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:42:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:42:16,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:42:16,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:42:16,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554016205] [2022-12-11 23:42:16,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554016205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:42:16,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:42:16,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 23:42:16,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523277017] [2022-12-11 23:42:16,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:42:16,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 23:42:16,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:42:16,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 23:42:16,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 23:42:16,146 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 144 [2022-12-11 23:42:16,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 157 transitions, 736 flow. Second operand has 6 states, 6 states have (on average 120.33333333333333) internal successors, (722), 6 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:42:16,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:42:16,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 144 [2022-12-11 23:42:16,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:42:17,227 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([780] L820-->L827: Formula: (let ((.cse2 (= (mod v_~x$r_buff0_thd3~0_117 256) 0))) (let ((.cse1 (= (mod v_~x$w_buff0_used~0_309 256) 0)) (.cse11 (not (= (mod v_~x$w_buff0_used~0_308 256) 0))) (.cse10 (not .cse2)) (.cse6 (= (mod v_~x$w_buff1_used~0_300 256) 0)) (.cse7 (= (mod v_~x$r_buff1_thd3~0_115 256) 0))) (let ((.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse0 (and .cse11 .cse10)) (.cse9 (not .cse1)) (.cse8 (select |v_#memory_int_317| |v_~#x~0.base_218|))) (and (= (ite .cse0 0 v_~x$r_buff0_thd3~0_117) v_~x$r_buff0_thd3~0_116) (let ((.cse3 (= |v_P2Thread1of1ForFork0_#t~mem25_1| |v_P2_#t~mem25_32|))) (or (and (or .cse1 .cse2) (= |v_P2_#t~ite26_29| |v_P2_#t~ite27_25|) (or (and .cse3 .cse4 (= |v_P2_#t~ite26_29| v_~x$w_buff1~0_148) .cse5) (and (= |v_P2_#t~ite26_29| |v_P2_#t~mem25_32|) (or .cse6 .cse7) (= (select .cse8 |v_~#x~0.offset_218|) |v_P2_#t~mem25_32|)))) (and (= |v_P2_#t~ite27_25| v_~x$w_buff0~0_114) .cse3 .cse9 (= |v_P2_#t~ite26_29| |v_P2Thread1of1ForFork0_#t~ite26_1|) .cse10))) (= v_~x$r_buff1_thd3~0_114 (ite (or (and .cse4 (not (= (mod v_~x$w_buff1_used~0_299 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_116 256) 0)) .cse11)) 0 v_~x$r_buff1_thd3~0_115)) (= v_~x$w_buff1_used~0_299 (ite (or (and .cse4 .cse5) .cse0) 0 v_~x$w_buff1_used~0_300)) (= (ite (and .cse9 .cse10) 0 v_~x$w_buff0_used~0_309) v_~x$w_buff0_used~0_308) (= (store |v_#memory_int_317| |v_~#x~0.base_218| (store .cse8 |v_~#x~0.offset_218| |v_P2_#t~ite27_25|)) |v_#memory_int_316|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_114, P2Thread1of1ForFork0_#t~ite26=|v_P2Thread1of1ForFork0_#t~ite26_1|, ~#x~0.offset=|v_~#x~0.offset_218|, ~x$w_buff1~0=v_~x$w_buff1~0_148, #memory_int=|v_#memory_int_317|, ~#x~0.base=|v_~#x~0.base_218|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_115, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_300, P2Thread1of1ForFork0_#t~mem25=|v_P2Thread1of1ForFork0_#t~mem25_1|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_117, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_309} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_114, P2Thread1of1ForFork0_#t~ite27=|v_P2Thread1of1ForFork0_#t~ite27_1|, ~#x~0.offset=|v_~#x~0.offset_218|, ~x$w_buff1~0=v_~x$w_buff1~0_148, #memory_int=|v_#memory_int_316|, ~#x~0.base=|v_~#x~0.base_218|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_114, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_299, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_116, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_308} AuxVars[|v_P2_#t~mem25_32|, |v_P2_#t~ite26_29|, |v_P2_#t~ite27_25|] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem25, ~x$r_buff0_thd3~0, ~x$w_buff0_used~0][246], [77#L3true, 134#L764true, 174#true, 158#true, 214#(= ~y~0 1), 146#L837true, 65#L791true, 195#true, 85#L827true, P2Thread1of1ForFork0InUse, 250#(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)), P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse]) [2022-12-11 23:42:17,228 INFO L382 tUnfolder$Statistics]: this new event has 100 ancestors and is cut-off event [2022-12-11 23:42:17,228 INFO L385 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-12-11 23:42:17,228 INFO L385 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-12-11 23:42:17,228 INFO L385 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-12-11 23:42:17,229 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([786] L837-->L844: Formula: (let ((.cse6 (= (mod v_~x$r_buff0_thd4~0_30 256) 0))) (let ((.cse8 (not .cse6)) (.cse10 (not (= (mod v_~x$w_buff0_used~0_272 256) 0))) (.cse7 (= (mod v_~x$w_buff0_used~0_273 256) 0)) (.cse1 (= (mod v_~x$w_buff1_used~0_260 256) 0)) (.cse0 (= 0 (mod v_~x$r_buff1_thd4~0_30 256)))) (let ((.cse2 (select |v_#memory_int_267| |v_~#x~0.base_184|)) (.cse3 (not .cse0)) (.cse4 (not .cse1)) (.cse9 (not .cse7)) (.cse11 (and .cse8 .cse10))) (and (let ((.cse5 (= |v_P3_#t~mem28_34| |v_P3Thread1of1ForFork2_#t~mem28_1|))) (or (and (or (and (= |v_P3_#t~ite29_29| |v_P3_#t~mem28_34|) (or .cse0 .cse1) (= (select .cse2 |v_~#x~0.offset_184|) |v_P3_#t~mem28_34|)) (and (= |v_P3_#t~ite29_29| v_~x$w_buff1~0_114) .cse3 .cse4 .cse5)) (or .cse6 .cse7) (= |v_P3_#t~ite29_29| |v_P3_#t~ite30_29|)) (and (= |v_P3Thread1of1ForFork2_#t~ite29_1| |v_P3_#t~ite29_29|) .cse8 (= |v_P3_#t~ite30_29| v_~x$w_buff0~0_84) .cse5 .cse9))) (= v_~x$r_buff1_thd4~0_29 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_259 256) 0))) (and (not (= (mod v_~x$r_buff0_thd4~0_29 256) 0)) .cse10)) 0 v_~x$r_buff1_thd4~0_30)) (= (store |v_#memory_int_267| |v_~#x~0.base_184| (store .cse2 |v_~#x~0.offset_184| |v_P3_#t~ite30_29|)) |v_#memory_int_266|) (= (ite (or .cse11 (and .cse3 .cse4)) 0 v_~x$w_buff1_used~0_260) v_~x$w_buff1_used~0_259) (= (ite (and .cse8 .cse9) 0 v_~x$w_buff0_used~0_273) v_~x$w_buff0_used~0_272) (= (ite .cse11 0 v_~x$r_buff0_thd4~0_30) v_~x$r_buff0_thd4~0_29))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_84, P3Thread1of1ForFork2_#t~ite29=|v_P3Thread1of1ForFork2_#t~ite29_1|, P3Thread1of1ForFork2_#t~mem28=|v_P3Thread1of1ForFork2_#t~mem28_1|, ~#x~0.offset=|v_~#x~0.offset_184|, ~x$w_buff1~0=v_~x$w_buff1~0_114, #memory_int=|v_#memory_int_267|, ~#x~0.base=|v_~#x~0.base_184|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_260, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_30, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_30, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_273} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_84, ~#x~0.offset=|v_~#x~0.offset_184|, ~x$w_buff1~0=v_~x$w_buff1~0_114, #memory_int=|v_#memory_int_266|, ~#x~0.base=|v_~#x~0.base_184|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_259, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_29, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_29, P3Thread1of1ForFork2_#t~ite30=|v_P3Thread1of1ForFork2_#t~ite30_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_272} AuxVars[|v_P3_#t~ite30_29|, |v_P3_#t~mem28_34|, |v_P3_#t~ite29_29|] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~mem28, #memory_int, ~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x$r_buff1_thd4~0, P3Thread1of1ForFork2_#t~ite30, ~x$w_buff0_used~0][252], [77#L3true, 134#L764true, 117#L844true, 95#L820true, 174#true, 158#true, 214#(= ~y~0 1), 65#L791true, 195#true, P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, 250#(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)), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse]) [2022-12-11 23:42:17,229 INFO L382 tUnfolder$Statistics]: this new event has 100 ancestors and is cut-off event [2022-12-11 23:42:17,229 INFO L385 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-12-11 23:42:17,229 INFO L385 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-12-11 23:42:17,229 INFO L385 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-12-11 23:42:17,383 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([767] L766-->L774: Formula: (let ((.cse10 (= (mod v_~x$r_buff0_thd1~0_30 256) 0))) (let ((.cse11 (= (mod v_~x$w_buff0_used~0_313 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_304 256) 0)) (.cse9 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse4 (not (= (mod v_~x$w_buff0_used~0_312 256) 0))) (.cse7 (not .cse10))) (let ((.cse2 (and .cse4 .cse7)) (.cse3 (select |v_#memory_int_321| |v_~#x~0.base_220|)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse5 (not .cse11))) (and (= (ite (or (and .cse0 .cse1) .cse2) 0 v_~x$w_buff1_used~0_304) v_~x$w_buff1_used~0_303) (= v_~x$r_buff0_thd1~0_29 (ite .cse2 0 v_~x$r_buff0_thd1~0_30)) (= (store |v_#memory_int_321| |v_~#x~0.base_220| (store .cse3 |v_~#x~0.offset_220| |v_P0_#t~ite5_27|)) |v_#memory_int_320|) (= v_~x$r_buff1_thd1~0_31 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_29 256) 0)) .cse4) (and .cse0 (not (= (mod v_~x$w_buff1_used~0_303 256) 0)))) 0 v_~x$r_buff1_thd1~0_32)) (let ((.cse6 (= |v_P0_#t~mem3_30| |v_P0Thread1of1ForFork1_#t~mem3_1|))) (or (and (= |v_P0_#t~ite4_27| |v_P0Thread1of1ForFork1_#t~ite4_1|) .cse5 .cse6 (= |v_P0_#t~ite5_27| v_~x$w_buff0~0_116) .cse7) (and (or (and (or .cse8 .cse9) (= (select .cse3 |v_~#x~0.offset_220|) |v_P0_#t~mem3_30|) (= |v_P0_#t~ite4_27| |v_P0_#t~mem3_30|)) (and (= |v_P0_#t~ite4_27| v_~x$w_buff1~0_150) .cse0 .cse6 .cse1)) (= |v_P0_#t~ite4_27| |v_P0_#t~ite5_27|) (or .cse10 .cse11)))) (= (ite (and .cse5 .cse7) 0 v_~x$w_buff0_used~0_313) v_~x$w_buff0_used~0_312))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_116, P0Thread1of1ForFork1_#t~ite4=|v_P0Thread1of1ForFork1_#t~ite4_1|, P0Thread1of1ForFork1_#t~mem3=|v_P0Thread1of1ForFork1_#t~mem3_1|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_30, ~#x~0.offset=|v_~#x~0.offset_220|, ~x$w_buff1~0=v_~x$w_buff1~0_150, #memory_int=|v_#memory_int_321|, ~#x~0.base=|v_~#x~0.base_220|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_304, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_313} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_116, P0Thread1of1ForFork1_#t~ite5=|v_P0Thread1of1ForFork1_#t~ite5_1|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_29, ~#x~0.offset=|v_~#x~0.offset_220|, ~x$w_buff1~0=v_~x$w_buff1~0_150, #memory_int=|v_#memory_int_320|, ~#x~0.base=|v_~#x~0.base_220|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_303, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_312} AuxVars[|v_P0_#t~mem3_30|, |v_P0_#t~ite4_27|, |v_P0_#t~ite5_27|] AssignedVars[P0Thread1of1ForFork1_#t~ite4, P0Thread1of1ForFork1_#t~mem3, P0Thread1of1ForFork1_#t~ite5, ~x$r_buff0_thd1~0, #memory_int, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$w_buff0_used~0][248], [77#L3true, 95#L820true, 174#true, 158#true, 65#L791true, 146#L837true, 214#(= ~y~0 1), 195#true, P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, 250#(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)), 21#L774true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse]) [2022-12-11 23:42:17,383 INFO L382 tUnfolder$Statistics]: this new event has 101 ancestors and is cut-off event [2022-12-11 23:42:17,383 INFO L385 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-12-11 23:42:17,383 INFO L385 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-12-11 23:42:17,383 INFO L385 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-12-11 23:42:17,411 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([780] L820-->L827: Formula: (let ((.cse2 (= (mod v_~x$r_buff0_thd3~0_117 256) 0))) (let ((.cse1 (= (mod v_~x$w_buff0_used~0_309 256) 0)) (.cse11 (not (= (mod v_~x$w_buff0_used~0_308 256) 0))) (.cse10 (not .cse2)) (.cse6 (= (mod v_~x$w_buff1_used~0_300 256) 0)) (.cse7 (= (mod v_~x$r_buff1_thd3~0_115 256) 0))) (let ((.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse0 (and .cse11 .cse10)) (.cse9 (not .cse1)) (.cse8 (select |v_#memory_int_317| |v_~#x~0.base_218|))) (and (= (ite .cse0 0 v_~x$r_buff0_thd3~0_117) v_~x$r_buff0_thd3~0_116) (let ((.cse3 (= |v_P2Thread1of1ForFork0_#t~mem25_1| |v_P2_#t~mem25_32|))) (or (and (or .cse1 .cse2) (= |v_P2_#t~ite26_29| |v_P2_#t~ite27_25|) (or (and .cse3 .cse4 (= |v_P2_#t~ite26_29| v_~x$w_buff1~0_148) .cse5) (and (= |v_P2_#t~ite26_29| |v_P2_#t~mem25_32|) (or .cse6 .cse7) (= (select .cse8 |v_~#x~0.offset_218|) |v_P2_#t~mem25_32|)))) (and (= |v_P2_#t~ite27_25| v_~x$w_buff0~0_114) .cse3 .cse9 (= |v_P2_#t~ite26_29| |v_P2Thread1of1ForFork0_#t~ite26_1|) .cse10))) (= v_~x$r_buff1_thd3~0_114 (ite (or (and .cse4 (not (= (mod v_~x$w_buff1_used~0_299 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_116 256) 0)) .cse11)) 0 v_~x$r_buff1_thd3~0_115)) (= v_~x$w_buff1_used~0_299 (ite (or (and .cse4 .cse5) .cse0) 0 v_~x$w_buff1_used~0_300)) (= (ite (and .cse9 .cse10) 0 v_~x$w_buff0_used~0_309) v_~x$w_buff0_used~0_308) (= (store |v_#memory_int_317| |v_~#x~0.base_218| (store .cse8 |v_~#x~0.offset_218| |v_P2_#t~ite27_25|)) |v_#memory_int_316|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_114, P2Thread1of1ForFork0_#t~ite26=|v_P2Thread1of1ForFork0_#t~ite26_1|, ~#x~0.offset=|v_~#x~0.offset_218|, ~x$w_buff1~0=v_~x$w_buff1~0_148, #memory_int=|v_#memory_int_317|, ~#x~0.base=|v_~#x~0.base_218|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_115, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_300, P2Thread1of1ForFork0_#t~mem25=|v_P2Thread1of1ForFork0_#t~mem25_1|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_117, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_309} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_114, P2Thread1of1ForFork0_#t~ite27=|v_P2Thread1of1ForFork0_#t~ite27_1|, ~#x~0.offset=|v_~#x~0.offset_218|, ~x$w_buff1~0=v_~x$w_buff1~0_148, #memory_int=|v_#memory_int_316|, ~#x~0.base=|v_~#x~0.base_218|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_114, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_299, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_116, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_308} AuxVars[|v_P2_#t~mem25_32|, |v_P2_#t~ite26_29|, |v_P2_#t~ite27_25|] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem25, ~x$r_buff0_thd3~0, ~x$w_buff0_used~0][246], [134#L764true, 174#true, 158#true, 146#L837true, 65#L791true, 214#(= ~y~0 1), 195#true, P2Thread1of1ForFork0InUse, 85#L827true, P3Thread1of1ForFork2InUse, 250#(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)), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 142#L3-1true]) [2022-12-11 23:42:17,411 INFO L382 tUnfolder$Statistics]: this new event has 101 ancestors and is cut-off event [2022-12-11 23:42:17,411 INFO L385 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-12-11 23:42:17,411 INFO L385 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-12-11 23:42:17,411 INFO L385 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-12-11 23:42:17,412 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([786] L837-->L844: Formula: (let ((.cse6 (= (mod v_~x$r_buff0_thd4~0_30 256) 0))) (let ((.cse8 (not .cse6)) (.cse10 (not (= (mod v_~x$w_buff0_used~0_272 256) 0))) (.cse7 (= (mod v_~x$w_buff0_used~0_273 256) 0)) (.cse1 (= (mod v_~x$w_buff1_used~0_260 256) 0)) (.cse0 (= 0 (mod v_~x$r_buff1_thd4~0_30 256)))) (let ((.cse2 (select |v_#memory_int_267| |v_~#x~0.base_184|)) (.cse3 (not .cse0)) (.cse4 (not .cse1)) (.cse9 (not .cse7)) (.cse11 (and .cse8 .cse10))) (and (let ((.cse5 (= |v_P3_#t~mem28_34| |v_P3Thread1of1ForFork2_#t~mem28_1|))) (or (and (or (and (= |v_P3_#t~ite29_29| |v_P3_#t~mem28_34|) (or .cse0 .cse1) (= (select .cse2 |v_~#x~0.offset_184|) |v_P3_#t~mem28_34|)) (and (= |v_P3_#t~ite29_29| v_~x$w_buff1~0_114) .cse3 .cse4 .cse5)) (or .cse6 .cse7) (= |v_P3_#t~ite29_29| |v_P3_#t~ite30_29|)) (and (= |v_P3Thread1of1ForFork2_#t~ite29_1| |v_P3_#t~ite29_29|) .cse8 (= |v_P3_#t~ite30_29| v_~x$w_buff0~0_84) .cse5 .cse9))) (= v_~x$r_buff1_thd4~0_29 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_259 256) 0))) (and (not (= (mod v_~x$r_buff0_thd4~0_29 256) 0)) .cse10)) 0 v_~x$r_buff1_thd4~0_30)) (= (store |v_#memory_int_267| |v_~#x~0.base_184| (store .cse2 |v_~#x~0.offset_184| |v_P3_#t~ite30_29|)) |v_#memory_int_266|) (= (ite (or .cse11 (and .cse3 .cse4)) 0 v_~x$w_buff1_used~0_260) v_~x$w_buff1_used~0_259) (= (ite (and .cse8 .cse9) 0 v_~x$w_buff0_used~0_273) v_~x$w_buff0_used~0_272) (= (ite .cse11 0 v_~x$r_buff0_thd4~0_30) v_~x$r_buff0_thd4~0_29))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_84, P3Thread1of1ForFork2_#t~ite29=|v_P3Thread1of1ForFork2_#t~ite29_1|, P3Thread1of1ForFork2_#t~mem28=|v_P3Thread1of1ForFork2_#t~mem28_1|, ~#x~0.offset=|v_~#x~0.offset_184|, ~x$w_buff1~0=v_~x$w_buff1~0_114, #memory_int=|v_#memory_int_267|, ~#x~0.base=|v_~#x~0.base_184|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_260, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_30, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_30, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_273} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_84, ~#x~0.offset=|v_~#x~0.offset_184|, ~x$w_buff1~0=v_~x$w_buff1~0_114, #memory_int=|v_#memory_int_266|, ~#x~0.base=|v_~#x~0.base_184|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_259, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_29, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_29, P3Thread1of1ForFork2_#t~ite30=|v_P3Thread1of1ForFork2_#t~ite30_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_272} AuxVars[|v_P3_#t~ite30_29|, |v_P3_#t~mem28_34|, |v_P3_#t~ite29_29|] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~mem28, #memory_int, ~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x$r_buff1_thd4~0, P3Thread1of1ForFork2_#t~ite30, ~x$w_buff0_used~0][252], [134#L764true, 117#L844true, 174#true, 95#L820true, 158#true, 65#L791true, 214#(= ~y~0 1), 195#true, P2Thread1of1ForFork0InUse, 250#(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)), P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 142#L3-1true]) [2022-12-11 23:42:17,412 INFO L382 tUnfolder$Statistics]: this new event has 101 ancestors and is cut-off event [2022-12-11 23:42:17,412 INFO L385 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-12-11 23:42:17,412 INFO L385 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-12-11 23:42:17,412 INFO L385 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-12-11 23:42:17,413 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([780] L820-->L827: Formula: (let ((.cse2 (= (mod v_~x$r_buff0_thd3~0_117 256) 0))) (let ((.cse1 (= (mod v_~x$w_buff0_used~0_309 256) 0)) (.cse11 (not (= (mod v_~x$w_buff0_used~0_308 256) 0))) (.cse10 (not .cse2)) (.cse6 (= (mod v_~x$w_buff1_used~0_300 256) 0)) (.cse7 (= (mod v_~x$r_buff1_thd3~0_115 256) 0))) (let ((.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse0 (and .cse11 .cse10)) (.cse9 (not .cse1)) (.cse8 (select |v_#memory_int_317| |v_~#x~0.base_218|))) (and (= (ite .cse0 0 v_~x$r_buff0_thd3~0_117) v_~x$r_buff0_thd3~0_116) (let ((.cse3 (= |v_P2Thread1of1ForFork0_#t~mem25_1| |v_P2_#t~mem25_32|))) (or (and (or .cse1 .cse2) (= |v_P2_#t~ite26_29| |v_P2_#t~ite27_25|) (or (and .cse3 .cse4 (= |v_P2_#t~ite26_29| v_~x$w_buff1~0_148) .cse5) (and (= |v_P2_#t~ite26_29| |v_P2_#t~mem25_32|) (or .cse6 .cse7) (= (select .cse8 |v_~#x~0.offset_218|) |v_P2_#t~mem25_32|)))) (and (= |v_P2_#t~ite27_25| v_~x$w_buff0~0_114) .cse3 .cse9 (= |v_P2_#t~ite26_29| |v_P2Thread1of1ForFork0_#t~ite26_1|) .cse10))) (= v_~x$r_buff1_thd3~0_114 (ite (or (and .cse4 (not (= (mod v_~x$w_buff1_used~0_299 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_116 256) 0)) .cse11)) 0 v_~x$r_buff1_thd3~0_115)) (= v_~x$w_buff1_used~0_299 (ite (or (and .cse4 .cse5) .cse0) 0 v_~x$w_buff1_used~0_300)) (= (ite (and .cse9 .cse10) 0 v_~x$w_buff0_used~0_309) v_~x$w_buff0_used~0_308) (= (store |v_#memory_int_317| |v_~#x~0.base_218| (store .cse8 |v_~#x~0.offset_218| |v_P2_#t~ite27_25|)) |v_#memory_int_316|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_114, P2Thread1of1ForFork0_#t~ite26=|v_P2Thread1of1ForFork0_#t~ite26_1|, ~#x~0.offset=|v_~#x~0.offset_218|, ~x$w_buff1~0=v_~x$w_buff1~0_148, #memory_int=|v_#memory_int_317|, ~#x~0.base=|v_~#x~0.base_218|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_115, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_300, P2Thread1of1ForFork0_#t~mem25=|v_P2Thread1of1ForFork0_#t~mem25_1|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_117, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_309} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_114, P2Thread1of1ForFork0_#t~ite27=|v_P2Thread1of1ForFork0_#t~ite27_1|, ~#x~0.offset=|v_~#x~0.offset_218|, ~x$w_buff1~0=v_~x$w_buff1~0_148, #memory_int=|v_#memory_int_316|, ~#x~0.base=|v_~#x~0.base_218|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_114, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_299, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_116, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_308} AuxVars[|v_P2_#t~mem25_32|, |v_P2_#t~ite26_29|, |v_P2_#t~ite27_25|] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem25, ~x$r_buff0_thd3~0, ~x$w_buff0_used~0][314], [77#L3true, 134#L764true, 43#L794true, 254#(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)), 174#true, 158#true, 214#(= ~y~0 1), 146#L837true, 195#true, 85#L827true, P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse]) [2022-12-11 23:42:17,413 INFO L382 tUnfolder$Statistics]: this new event has 101 ancestors and is cut-off event [2022-12-11 23:42:17,413 INFO L385 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-12-11 23:42:17,413 INFO L385 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-12-11 23:42:17,413 INFO L385 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-12-11 23:42:17,569 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([767] L766-->L774: Formula: (let ((.cse10 (= (mod v_~x$r_buff0_thd1~0_30 256) 0))) (let ((.cse11 (= (mod v_~x$w_buff0_used~0_313 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_304 256) 0)) (.cse9 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse4 (not (= (mod v_~x$w_buff0_used~0_312 256) 0))) (.cse7 (not .cse10))) (let ((.cse2 (and .cse4 .cse7)) (.cse3 (select |v_#memory_int_321| |v_~#x~0.base_220|)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse5 (not .cse11))) (and (= (ite (or (and .cse0 .cse1) .cse2) 0 v_~x$w_buff1_used~0_304) v_~x$w_buff1_used~0_303) (= v_~x$r_buff0_thd1~0_29 (ite .cse2 0 v_~x$r_buff0_thd1~0_30)) (= (store |v_#memory_int_321| |v_~#x~0.base_220| (store .cse3 |v_~#x~0.offset_220| |v_P0_#t~ite5_27|)) |v_#memory_int_320|) (= v_~x$r_buff1_thd1~0_31 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_29 256) 0)) .cse4) (and .cse0 (not (= (mod v_~x$w_buff1_used~0_303 256) 0)))) 0 v_~x$r_buff1_thd1~0_32)) (let ((.cse6 (= |v_P0_#t~mem3_30| |v_P0Thread1of1ForFork1_#t~mem3_1|))) (or (and (= |v_P0_#t~ite4_27| |v_P0Thread1of1ForFork1_#t~ite4_1|) .cse5 .cse6 (= |v_P0_#t~ite5_27| v_~x$w_buff0~0_116) .cse7) (and (or (and (or .cse8 .cse9) (= (select .cse3 |v_~#x~0.offset_220|) |v_P0_#t~mem3_30|) (= |v_P0_#t~ite4_27| |v_P0_#t~mem3_30|)) (and (= |v_P0_#t~ite4_27| v_~x$w_buff1~0_150) .cse0 .cse6 .cse1)) (= |v_P0_#t~ite4_27| |v_P0_#t~ite5_27|) (or .cse10 .cse11)))) (= (ite (and .cse5 .cse7) 0 v_~x$w_buff0_used~0_313) v_~x$w_buff0_used~0_312))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_116, P0Thread1of1ForFork1_#t~ite4=|v_P0Thread1of1ForFork1_#t~ite4_1|, P0Thread1of1ForFork1_#t~mem3=|v_P0Thread1of1ForFork1_#t~mem3_1|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_30, ~#x~0.offset=|v_~#x~0.offset_220|, ~x$w_buff1~0=v_~x$w_buff1~0_150, #memory_int=|v_#memory_int_321|, ~#x~0.base=|v_~#x~0.base_220|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_304, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_313} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_116, P0Thread1of1ForFork1_#t~ite5=|v_P0Thread1of1ForFork1_#t~ite5_1|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_29, ~#x~0.offset=|v_~#x~0.offset_220|, ~x$w_buff1~0=v_~x$w_buff1~0_150, #memory_int=|v_#memory_int_320|, ~#x~0.base=|v_~#x~0.base_220|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_303, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_312} AuxVars[|v_P0_#t~mem3_30|, |v_P0_#t~ite4_27|, |v_P0_#t~ite5_27|] AssignedVars[P0Thread1of1ForFork1_#t~ite4, P0Thread1of1ForFork1_#t~mem3, P0Thread1of1ForFork1_#t~ite5, ~x$r_buff0_thd1~0, #memory_int, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$w_buff0_used~0][315], [77#L3true, 254#(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)), 43#L794true, 174#true, 95#L820true, 158#true, 146#L837true, 214#(= ~y~0 1), 195#true, P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, 21#L774true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse]) [2022-12-11 23:42:17,569 INFO L382 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-12-11 23:42:17,569 INFO L385 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-12-11 23:42:17,569 INFO L385 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-12-11 23:42:17,569 INFO L385 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-12-11 23:42:17,573 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([786] L837-->L844: Formula: (let ((.cse6 (= (mod v_~x$r_buff0_thd4~0_30 256) 0))) (let ((.cse8 (not .cse6)) (.cse10 (not (= (mod v_~x$w_buff0_used~0_272 256) 0))) (.cse7 (= (mod v_~x$w_buff0_used~0_273 256) 0)) (.cse1 (= (mod v_~x$w_buff1_used~0_260 256) 0)) (.cse0 (= 0 (mod v_~x$r_buff1_thd4~0_30 256)))) (let ((.cse2 (select |v_#memory_int_267| |v_~#x~0.base_184|)) (.cse3 (not .cse0)) (.cse4 (not .cse1)) (.cse9 (not .cse7)) (.cse11 (and .cse8 .cse10))) (and (let ((.cse5 (= |v_P3_#t~mem28_34| |v_P3Thread1of1ForFork2_#t~mem28_1|))) (or (and (or (and (= |v_P3_#t~ite29_29| |v_P3_#t~mem28_34|) (or .cse0 .cse1) (= (select .cse2 |v_~#x~0.offset_184|) |v_P3_#t~mem28_34|)) (and (= |v_P3_#t~ite29_29| v_~x$w_buff1~0_114) .cse3 .cse4 .cse5)) (or .cse6 .cse7) (= |v_P3_#t~ite29_29| |v_P3_#t~ite30_29|)) (and (= |v_P3Thread1of1ForFork2_#t~ite29_1| |v_P3_#t~ite29_29|) .cse8 (= |v_P3_#t~ite30_29| v_~x$w_buff0~0_84) .cse5 .cse9))) (= v_~x$r_buff1_thd4~0_29 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_259 256) 0))) (and (not (= (mod v_~x$r_buff0_thd4~0_29 256) 0)) .cse10)) 0 v_~x$r_buff1_thd4~0_30)) (= (store |v_#memory_int_267| |v_~#x~0.base_184| (store .cse2 |v_~#x~0.offset_184| |v_P3_#t~ite30_29|)) |v_#memory_int_266|) (= (ite (or .cse11 (and .cse3 .cse4)) 0 v_~x$w_buff1_used~0_260) v_~x$w_buff1_used~0_259) (= (ite (and .cse8 .cse9) 0 v_~x$w_buff0_used~0_273) v_~x$w_buff0_used~0_272) (= (ite .cse11 0 v_~x$r_buff0_thd4~0_30) v_~x$r_buff0_thd4~0_29))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_84, P3Thread1of1ForFork2_#t~ite29=|v_P3Thread1of1ForFork2_#t~ite29_1|, P3Thread1of1ForFork2_#t~mem28=|v_P3Thread1of1ForFork2_#t~mem28_1|, ~#x~0.offset=|v_~#x~0.offset_184|, ~x$w_buff1~0=v_~x$w_buff1~0_114, #memory_int=|v_#memory_int_267|, ~#x~0.base=|v_~#x~0.base_184|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_260, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_30, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_30, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_273} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_84, ~#x~0.offset=|v_~#x~0.offset_184|, ~x$w_buff1~0=v_~x$w_buff1~0_114, #memory_int=|v_#memory_int_266|, ~#x~0.base=|v_~#x~0.base_184|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_259, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_29, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_29, P3Thread1of1ForFork2_#t~ite30=|v_P3Thread1of1ForFork2_#t~ite30_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_272} AuxVars[|v_P3_#t~ite30_29|, |v_P3_#t~mem28_34|, |v_P3_#t~ite29_29|] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~mem28, #memory_int, ~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x$r_buff1_thd4~0, P3Thread1of1ForFork2_#t~ite30, ~x$w_buff0_used~0][318], [77#L3true, 134#L764true, 43#L794true, 117#L844true, 254#(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)), 95#L820true, 174#true, 158#true, 214#(= ~y~0 1), 195#true, P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse]) [2022-12-11 23:42:17,573 INFO L382 tUnfolder$Statistics]: this new event has 101 ancestors and is not cut-off event [2022-12-11 23:42:17,573 INFO L385 tUnfolder$Statistics]: existing Event has 101 ancestors and is not cut-off event [2022-12-11 23:42:17,573 INFO L385 tUnfolder$Statistics]: existing Event has 101 ancestors and is not cut-off event [2022-12-11 23:42:17,573 INFO L385 tUnfolder$Statistics]: existing Event has 101 ancestors and is not cut-off event [2022-12-11 23:42:17,608 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([767] L766-->L774: Formula: (let ((.cse10 (= (mod v_~x$r_buff0_thd1~0_30 256) 0))) (let ((.cse11 (= (mod v_~x$w_buff0_used~0_313 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_304 256) 0)) (.cse9 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse4 (not (= (mod v_~x$w_buff0_used~0_312 256) 0))) (.cse7 (not .cse10))) (let ((.cse2 (and .cse4 .cse7)) (.cse3 (select |v_#memory_int_321| |v_~#x~0.base_220|)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse5 (not .cse11))) (and (= (ite (or (and .cse0 .cse1) .cse2) 0 v_~x$w_buff1_used~0_304) v_~x$w_buff1_used~0_303) (= v_~x$r_buff0_thd1~0_29 (ite .cse2 0 v_~x$r_buff0_thd1~0_30)) (= (store |v_#memory_int_321| |v_~#x~0.base_220| (store .cse3 |v_~#x~0.offset_220| |v_P0_#t~ite5_27|)) |v_#memory_int_320|) (= v_~x$r_buff1_thd1~0_31 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_29 256) 0)) .cse4) (and .cse0 (not (= (mod v_~x$w_buff1_used~0_303 256) 0)))) 0 v_~x$r_buff1_thd1~0_32)) (let ((.cse6 (= |v_P0_#t~mem3_30| |v_P0Thread1of1ForFork1_#t~mem3_1|))) (or (and (= |v_P0_#t~ite4_27| |v_P0Thread1of1ForFork1_#t~ite4_1|) .cse5 .cse6 (= |v_P0_#t~ite5_27| v_~x$w_buff0~0_116) .cse7) (and (or (and (or .cse8 .cse9) (= (select .cse3 |v_~#x~0.offset_220|) |v_P0_#t~mem3_30|) (= |v_P0_#t~ite4_27| |v_P0_#t~mem3_30|)) (and (= |v_P0_#t~ite4_27| v_~x$w_buff1~0_150) .cse0 .cse6 .cse1)) (= |v_P0_#t~ite4_27| |v_P0_#t~ite5_27|) (or .cse10 .cse11)))) (= (ite (and .cse5 .cse7) 0 v_~x$w_buff0_used~0_313) v_~x$w_buff0_used~0_312))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_116, P0Thread1of1ForFork1_#t~ite4=|v_P0Thread1of1ForFork1_#t~ite4_1|, P0Thread1of1ForFork1_#t~mem3=|v_P0Thread1of1ForFork1_#t~mem3_1|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_30, ~#x~0.offset=|v_~#x~0.offset_220|, ~x$w_buff1~0=v_~x$w_buff1~0_150, #memory_int=|v_#memory_int_321|, ~#x~0.base=|v_~#x~0.base_220|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_304, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_313} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_116, P0Thread1of1ForFork1_#t~ite5=|v_P0Thread1of1ForFork1_#t~ite5_1|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_29, ~#x~0.offset=|v_~#x~0.offset_220|, ~x$w_buff1~0=v_~x$w_buff1~0_150, #memory_int=|v_#memory_int_320|, ~#x~0.base=|v_~#x~0.base_220|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_303, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_312} AuxVars[|v_P0_#t~mem3_30|, |v_P0_#t~ite4_27|, |v_P0_#t~ite5_27|] AssignedVars[P0Thread1of1ForFork1_#t~ite4, P0Thread1of1ForFork1_#t~mem3, P0Thread1of1ForFork1_#t~ite5, ~x$r_buff0_thd1~0, #memory_int, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$w_buff0_used~0][248], [95#L820true, 174#true, 158#true, 214#(= ~y~0 1), 65#L791true, 146#L837true, 195#true, P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, 250#(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)), 21#L774true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 142#L3-1true]) [2022-12-11 23:42:17,608 INFO L382 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-12-11 23:42:17,608 INFO L385 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-12-11 23:42:17,608 INFO L385 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-12-11 23:42:17,609 INFO L385 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-12-11 23:42:17,631 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([780] L820-->L827: Formula: (let ((.cse2 (= (mod v_~x$r_buff0_thd3~0_117 256) 0))) (let ((.cse1 (= (mod v_~x$w_buff0_used~0_309 256) 0)) (.cse11 (not (= (mod v_~x$w_buff0_used~0_308 256) 0))) (.cse10 (not .cse2)) (.cse6 (= (mod v_~x$w_buff1_used~0_300 256) 0)) (.cse7 (= (mod v_~x$r_buff1_thd3~0_115 256) 0))) (let ((.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse0 (and .cse11 .cse10)) (.cse9 (not .cse1)) (.cse8 (select |v_#memory_int_317| |v_~#x~0.base_218|))) (and (= (ite .cse0 0 v_~x$r_buff0_thd3~0_117) v_~x$r_buff0_thd3~0_116) (let ((.cse3 (= |v_P2Thread1of1ForFork0_#t~mem25_1| |v_P2_#t~mem25_32|))) (or (and (or .cse1 .cse2) (= |v_P2_#t~ite26_29| |v_P2_#t~ite27_25|) (or (and .cse3 .cse4 (= |v_P2_#t~ite26_29| v_~x$w_buff1~0_148) .cse5) (and (= |v_P2_#t~ite26_29| |v_P2_#t~mem25_32|) (or .cse6 .cse7) (= (select .cse8 |v_~#x~0.offset_218|) |v_P2_#t~mem25_32|)))) (and (= |v_P2_#t~ite27_25| v_~x$w_buff0~0_114) .cse3 .cse9 (= |v_P2_#t~ite26_29| |v_P2Thread1of1ForFork0_#t~ite26_1|) .cse10))) (= v_~x$r_buff1_thd3~0_114 (ite (or (and .cse4 (not (= (mod v_~x$w_buff1_used~0_299 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_116 256) 0)) .cse11)) 0 v_~x$r_buff1_thd3~0_115)) (= v_~x$w_buff1_used~0_299 (ite (or (and .cse4 .cse5) .cse0) 0 v_~x$w_buff1_used~0_300)) (= (ite (and .cse9 .cse10) 0 v_~x$w_buff0_used~0_309) v_~x$w_buff0_used~0_308) (= (store |v_#memory_int_317| |v_~#x~0.base_218| (store .cse8 |v_~#x~0.offset_218| |v_P2_#t~ite27_25|)) |v_#memory_int_316|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_114, P2Thread1of1ForFork0_#t~ite26=|v_P2Thread1of1ForFork0_#t~ite26_1|, ~#x~0.offset=|v_~#x~0.offset_218|, ~x$w_buff1~0=v_~x$w_buff1~0_148, #memory_int=|v_#memory_int_317|, ~#x~0.base=|v_~#x~0.base_218|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_115, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_300, P2Thread1of1ForFork0_#t~mem25=|v_P2Thread1of1ForFork0_#t~mem25_1|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_117, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_309} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_114, P2Thread1of1ForFork0_#t~ite27=|v_P2Thread1of1ForFork0_#t~ite27_1|, ~#x~0.offset=|v_~#x~0.offset_218|, ~x$w_buff1~0=v_~x$w_buff1~0_148, #memory_int=|v_#memory_int_316|, ~#x~0.base=|v_~#x~0.base_218|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_114, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_299, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_116, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_308} AuxVars[|v_P2_#t~mem25_32|, |v_P2_#t~ite26_29|, |v_P2_#t~ite27_25|] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem25, ~x$r_buff0_thd3~0, ~x$w_buff0_used~0][314], [134#L764true, 254#(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)), 43#L794true, 174#true, 158#true, 146#L837true, 214#(= ~y~0 1), 195#true, P2Thread1of1ForFork0InUse, 85#L827true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 142#L3-1true]) [2022-12-11 23:42:17,631 INFO L382 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-12-11 23:42:17,631 INFO L385 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-12-11 23:42:17,631 INFO L385 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-12-11 23:42:17,632 INFO L385 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-12-11 23:42:17,717 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([767] L766-->L774: Formula: (let ((.cse10 (= (mod v_~x$r_buff0_thd1~0_30 256) 0))) (let ((.cse11 (= (mod v_~x$w_buff0_used~0_313 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_304 256) 0)) (.cse9 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse4 (not (= (mod v_~x$w_buff0_used~0_312 256) 0))) (.cse7 (not .cse10))) (let ((.cse2 (and .cse4 .cse7)) (.cse3 (select |v_#memory_int_321| |v_~#x~0.base_220|)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse5 (not .cse11))) (and (= (ite (or (and .cse0 .cse1) .cse2) 0 v_~x$w_buff1_used~0_304) v_~x$w_buff1_used~0_303) (= v_~x$r_buff0_thd1~0_29 (ite .cse2 0 v_~x$r_buff0_thd1~0_30)) (= (store |v_#memory_int_321| |v_~#x~0.base_220| (store .cse3 |v_~#x~0.offset_220| |v_P0_#t~ite5_27|)) |v_#memory_int_320|) (= v_~x$r_buff1_thd1~0_31 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_29 256) 0)) .cse4) (and .cse0 (not (= (mod v_~x$w_buff1_used~0_303 256) 0)))) 0 v_~x$r_buff1_thd1~0_32)) (let ((.cse6 (= |v_P0_#t~mem3_30| |v_P0Thread1of1ForFork1_#t~mem3_1|))) (or (and (= |v_P0_#t~ite4_27| |v_P0Thread1of1ForFork1_#t~ite4_1|) .cse5 .cse6 (= |v_P0_#t~ite5_27| v_~x$w_buff0~0_116) .cse7) (and (or (and (or .cse8 .cse9) (= (select .cse3 |v_~#x~0.offset_220|) |v_P0_#t~mem3_30|) (= |v_P0_#t~ite4_27| |v_P0_#t~mem3_30|)) (and (= |v_P0_#t~ite4_27| v_~x$w_buff1~0_150) .cse0 .cse6 .cse1)) (= |v_P0_#t~ite4_27| |v_P0_#t~ite5_27|) (or .cse10 .cse11)))) (= (ite (and .cse5 .cse7) 0 v_~x$w_buff0_used~0_313) v_~x$w_buff0_used~0_312))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_116, P0Thread1of1ForFork1_#t~ite4=|v_P0Thread1of1ForFork1_#t~ite4_1|, P0Thread1of1ForFork1_#t~mem3=|v_P0Thread1of1ForFork1_#t~mem3_1|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_30, ~#x~0.offset=|v_~#x~0.offset_220|, ~x$w_buff1~0=v_~x$w_buff1~0_150, #memory_int=|v_#memory_int_321|, ~#x~0.base=|v_~#x~0.base_220|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_304, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_313} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_116, P0Thread1of1ForFork1_#t~ite5=|v_P0Thread1of1ForFork1_#t~ite5_1|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_29, ~#x~0.offset=|v_~#x~0.offset_220|, ~x$w_buff1~0=v_~x$w_buff1~0_150, #memory_int=|v_#memory_int_320|, ~#x~0.base=|v_~#x~0.base_220|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_303, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_312} AuxVars[|v_P0_#t~mem3_30|, |v_P0_#t~ite4_27|, |v_P0_#t~ite5_27|] AssignedVars[P0Thread1of1ForFork1_#t~ite4, P0Thread1of1ForFork1_#t~mem3, P0Thread1of1ForFork1_#t~ite5, ~x$r_buff0_thd1~0, #memory_int, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$w_buff0_used~0][315], [43#L794true, 254#(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)), 95#L820true, 174#true, 158#true, 146#L837true, 214#(= ~y~0 1), 195#true, P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, 21#L774true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 142#L3-1true]) [2022-12-11 23:42:17,718 INFO L382 tUnfolder$Statistics]: this new event has 103 ancestors and is cut-off event [2022-12-11 23:42:17,718 INFO L385 tUnfolder$Statistics]: existing Event has 103 ancestors and is cut-off event [2022-12-11 23:42:17,718 INFO L385 tUnfolder$Statistics]: existing Event has 103 ancestors and is cut-off event [2022-12-11 23:42:17,718 INFO L385 tUnfolder$Statistics]: existing Event has 103 ancestors and is cut-off event [2022-12-11 23:42:17,721 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([786] L837-->L844: Formula: (let ((.cse6 (= (mod v_~x$r_buff0_thd4~0_30 256) 0))) (let ((.cse8 (not .cse6)) (.cse10 (not (= (mod v_~x$w_buff0_used~0_272 256) 0))) (.cse7 (= (mod v_~x$w_buff0_used~0_273 256) 0)) (.cse1 (= (mod v_~x$w_buff1_used~0_260 256) 0)) (.cse0 (= 0 (mod v_~x$r_buff1_thd4~0_30 256)))) (let ((.cse2 (select |v_#memory_int_267| |v_~#x~0.base_184|)) (.cse3 (not .cse0)) (.cse4 (not .cse1)) (.cse9 (not .cse7)) (.cse11 (and .cse8 .cse10))) (and (let ((.cse5 (= |v_P3_#t~mem28_34| |v_P3Thread1of1ForFork2_#t~mem28_1|))) (or (and (or (and (= |v_P3_#t~ite29_29| |v_P3_#t~mem28_34|) (or .cse0 .cse1) (= (select .cse2 |v_~#x~0.offset_184|) |v_P3_#t~mem28_34|)) (and (= |v_P3_#t~ite29_29| v_~x$w_buff1~0_114) .cse3 .cse4 .cse5)) (or .cse6 .cse7) (= |v_P3_#t~ite29_29| |v_P3_#t~ite30_29|)) (and (= |v_P3Thread1of1ForFork2_#t~ite29_1| |v_P3_#t~ite29_29|) .cse8 (= |v_P3_#t~ite30_29| v_~x$w_buff0~0_84) .cse5 .cse9))) (= v_~x$r_buff1_thd4~0_29 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_259 256) 0))) (and (not (= (mod v_~x$r_buff0_thd4~0_29 256) 0)) .cse10)) 0 v_~x$r_buff1_thd4~0_30)) (= (store |v_#memory_int_267| |v_~#x~0.base_184| (store .cse2 |v_~#x~0.offset_184| |v_P3_#t~ite30_29|)) |v_#memory_int_266|) (= (ite (or .cse11 (and .cse3 .cse4)) 0 v_~x$w_buff1_used~0_260) v_~x$w_buff1_used~0_259) (= (ite (and .cse8 .cse9) 0 v_~x$w_buff0_used~0_273) v_~x$w_buff0_used~0_272) (= (ite .cse11 0 v_~x$r_buff0_thd4~0_30) v_~x$r_buff0_thd4~0_29))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_84, P3Thread1of1ForFork2_#t~ite29=|v_P3Thread1of1ForFork2_#t~ite29_1|, P3Thread1of1ForFork2_#t~mem28=|v_P3Thread1of1ForFork2_#t~mem28_1|, ~#x~0.offset=|v_~#x~0.offset_184|, ~x$w_buff1~0=v_~x$w_buff1~0_114, #memory_int=|v_#memory_int_267|, ~#x~0.base=|v_~#x~0.base_184|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_260, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_30, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_30, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_273} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_84, ~#x~0.offset=|v_~#x~0.offset_184|, ~x$w_buff1~0=v_~x$w_buff1~0_114, #memory_int=|v_#memory_int_266|, ~#x~0.base=|v_~#x~0.base_184|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_259, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_29, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_29, P3Thread1of1ForFork2_#t~ite30=|v_P3Thread1of1ForFork2_#t~ite30_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_272} AuxVars[|v_P3_#t~ite30_29|, |v_P3_#t~mem28_34|, |v_P3_#t~ite29_29|] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~mem28, #memory_int, ~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x$r_buff1_thd4~0, P3Thread1of1ForFork2_#t~ite30, ~x$w_buff0_used~0][318], [134#L764true, 117#L844true, 254#(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)), 43#L794true, 95#L820true, 174#true, 158#true, 214#(= ~y~0 1), 195#true, P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 142#L3-1true]) [2022-12-11 23:42:17,721 INFO L382 tUnfolder$Statistics]: this new event has 102 ancestors and is not cut-off event [2022-12-11 23:42:17,721 INFO L385 tUnfolder$Statistics]: existing Event has 102 ancestors and is not cut-off event [2022-12-11 23:42:17,721 INFO L385 tUnfolder$Statistics]: existing Event has 102 ancestors and is not cut-off event [2022-12-11 23:42:17,721 INFO L385 tUnfolder$Statistics]: existing Event has 102 ancestors and is not cut-off event [2022-12-11 23:42:18,458 INFO L130 PetriNetUnfolder]: 9048/14436 cut-off events. [2022-12-11 23:42:18,458 INFO L131 PetriNetUnfolder]: For 52262/55852 co-relation queries the response was YES. [2022-12-11 23:42:18,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54182 conditions, 14436 events. 9048/14436 cut-off events. For 52262/55852 co-relation queries the response was YES. Maximal size of possible extension queue 964. Compared 106252 event pairs, 207 based on Foata normal form. 496/14496 useless extension candidates. Maximal degree in co-relation 54090. Up to 6314 conditions per place. [2022-12-11 23:42:18,524 INFO L137 encePairwiseOnDemand]: 133/144 looper letters, 94 selfloop transitions, 8 changer transitions 139/349 dead transitions. [2022-12-11 23:42:18,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 349 transitions, 2854 flow [2022-12-11 23:42:18,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 23:42:18,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 23:42:18,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1279 transitions. [2022-12-11 23:42:18,527 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8881944444444444 [2022-12-11 23:42:18,528 INFO L295 CegarLoopForPetriNet]: 138 programPoint places, 19 predicate places. [2022-12-11 23:42:18,528 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 349 transitions, 2854 flow [2022-12-11 23:42:18,562 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 210 transitions, 1418 flow [2022-12-11 23:42:18,563 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 210 transitions, 1418 flow [2022-12-11 23:42:18,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.33333333333333) internal successors, (722), 6 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:42:18,563 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:42:18,564 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:42:18,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 23:42:18,564 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 23:42:18,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:42:18,564 INFO L85 PathProgramCache]: Analyzing trace with hash 228159676, now seen corresponding path program 1 times [2022-12-11 23:42:18,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:42:18,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012558144] [2022-12-11 23:42:18,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:42:18,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:42:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:42:18,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:42:18,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:42:18,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012558144] [2022-12-11 23:42:18,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012558144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:42:18,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:42:18,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:42:18,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032615211] [2022-12-11 23:42:18,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:42:18,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:42:18,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:42:18,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:42:18,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:42:18,830 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 144 [2022-12-11 23:42:18,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 210 transitions, 1418 flow. Second operand has 7 states, 7 states have (on average 120.28571428571429) internal successors, (842), 7 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:42:18,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:42:18,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 144 [2022-12-11 23:42:18,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:42:20,332 INFO L130 PetriNetUnfolder]: 3298/6609 cut-off events. [2022-12-11 23:42:20,333 INFO L131 PetriNetUnfolder]: For 22486/24390 co-relation queries the response was YES. [2022-12-11 23:42:20,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27175 conditions, 6609 events. 3298/6609 cut-off events. For 22486/24390 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 53825 event pairs, 74 based on Foata normal form. 298/6813 useless extension candidates. Maximal degree in co-relation 27079. Up to 4170 conditions per place. [2022-12-11 23:42:20,360 INFO L137 encePairwiseOnDemand]: 133/144 looper letters, 106 selfloop transitions, 13 changer transitions 140/367 dead transitions. [2022-12-11 23:42:20,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 367 transitions, 3527 flow [2022-12-11 23:42:20,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 23:42:20,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 23:42:20,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1398 transitions. [2022-12-11 23:42:20,364 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8825757575757576 [2022-12-11 23:42:20,366 INFO L295 CegarLoopForPetriNet]: 138 programPoint places, 25 predicate places. [2022-12-11 23:42:20,366 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 367 transitions, 3527 flow [2022-12-11 23:42:20,382 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 227 transitions, 1799 flow [2022-12-11 23:42:20,383 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 227 transitions, 1799 flow [2022-12-11 23:42:20,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.28571428571429) internal successors, (842), 7 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:42:20,383 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:42:20,383 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:42:20,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 23:42:20,384 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 23:42:20,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:42:20,384 INFO L85 PathProgramCache]: Analyzing trace with hash 820012342, now seen corresponding path program 1 times [2022-12-11 23:42:20,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:42:20,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736078039] [2022-12-11 23:42:20,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:42:20,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:42:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:42:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:42:20,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:42:20,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736078039] [2022-12-11 23:42:20,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736078039] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:42:20,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:42:20,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 23:42:20,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880104188] [2022-12-11 23:42:20,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:42:20,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 23:42:20,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:42:20,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 23:42:20,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-11 23:42:20,740 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 144 [2022-12-11 23:42:20,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 227 transitions, 1799 flow. Second operand has 8 states, 8 states have (on average 120.25) internal successors, (962), 8 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:42:20,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:42:20,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 144 [2022-12-11 23:42:20,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:42:21,456 INFO L130 PetriNetUnfolder]: 992/2590 cut-off events. [2022-12-11 23:42:21,456 INFO L131 PetriNetUnfolder]: For 8542/9499 co-relation queries the response was YES. [2022-12-11 23:42:21,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11892 conditions, 2590 events. 992/2590 cut-off events. For 8542/9499 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 20301 event pairs, 13 based on Foata normal form. 249/2825 useless extension candidates. Maximal degree in co-relation 11792. Up to 1320 conditions per place. [2022-12-11 23:42:21,469 INFO L137 encePairwiseOnDemand]: 134/144 looper letters, 99 selfloop transitions, 17 changer transitions 106/330 dead transitions. [2022-12-11 23:42:21,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 330 transitions, 3405 flow [2022-12-11 23:42:21,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:42:21,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:42:21,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1647 transitions. [2022-12-11 23:42:21,472 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8798076923076923 [2022-12-11 23:42:21,472 INFO L295 CegarLoopForPetriNet]: 138 programPoint places, 34 predicate places. [2022-12-11 23:42:21,472 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 330 transitions, 3405 flow [2022-12-11 23:42:21,480 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 224 transitions, 1957 flow [2022-12-11 23:42:21,480 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 224 transitions, 1957 flow [2022-12-11 23:42:21,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 120.25) internal successors, (962), 8 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:42:21,481 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:42:21,481 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:42:21,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 23:42:21,481 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 23:42:21,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:42:21,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1249220489, now seen corresponding path program 1 times [2022-12-11 23:42:21,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:42:21,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418671745] [2022-12-11 23:42:21,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:42:21,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:42:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:42:22,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:42:22,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:42:22,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418671745] [2022-12-11 23:42:22,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418671745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:42:22,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:42:22,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-11 23:42:22,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43875456] [2022-12-11 23:42:22,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:42:22,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-11 23:42:22,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:42:22,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-11 23:42:22,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-11 23:42:22,805 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 144 [2022-12-11 23:42:22,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 224 transitions, 1957 flow. Second operand has 11 states, 11 states have (on average 112.54545454545455) internal successors, (1238), 11 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:42:22,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:42:22,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 144 [2022-12-11 23:42:22,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:42:23,524 INFO L130 PetriNetUnfolder]: 1106/3717 cut-off events. [2022-12-11 23:42:23,524 INFO L131 PetriNetUnfolder]: For 16198/16673 co-relation queries the response was YES. [2022-12-11 23:42:23,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17481 conditions, 3717 events. 1106/3717 cut-off events. For 16198/16673 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 35550 event pairs, 55 based on Foata normal form. 95/3783 useless extension candidates. Maximal degree in co-relation 17369. Up to 1156 conditions per place. [2022-12-11 23:42:23,550 INFO L137 encePairwiseOnDemand]: 130/144 looper letters, 108 selfloop transitions, 34 changer transitions 47/306 dead transitions. [2022-12-11 23:42:23,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 306 transitions, 3495 flow [2022-12-11 23:42:23,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:42:23,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:42:23,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1498 transitions. [2022-12-11 23:42:23,554 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8002136752136753 [2022-12-11 23:42:23,556 INFO L295 CegarLoopForPetriNet]: 138 programPoint places, 42 predicate places. [2022-12-11 23:42:23,556 INFO L82 GeneralOperation]: Start removeDead. Operand has 180 places, 306 transitions, 3495 flow [2022-12-11 23:42:23,571 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 259 transitions, 2763 flow [2022-12-11 23:42:23,571 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 259 transitions, 2763 flow [2022-12-11 23:42:23,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 112.54545454545455) internal successors, (1238), 11 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:42:23,572 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:42:23,572 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:42:23,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 23:42:23,572 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 23:42:23,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:42:23,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1905607551, now seen corresponding path program 2 times [2022-12-11 23:42:23,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:42:23,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542655664] [2022-12-11 23:42:23,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:42:23,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:42:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:42:25,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:42:25,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:42:25,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542655664] [2022-12-11 23:42:25,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542655664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:42:25,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:42:25,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-11 23:42:25,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314015655] [2022-12-11 23:42:25,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:42:25,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-11 23:42:25,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:42:25,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-11 23:42:25,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-12-11 23:42:25,207 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 144 [2022-12-11 23:42:25,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 259 transitions, 2763 flow. Second operand has 14 states, 14 states have (on average 110.14285714285714) internal successors, (1542), 14 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:42:25,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:42:25,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 144 [2022-12-11 23:42:25,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:42:26,298 INFO L130 PetriNetUnfolder]: 1239/4253 cut-off events. [2022-12-11 23:42:26,298 INFO L131 PetriNetUnfolder]: For 21992/22566 co-relation queries the response was YES. [2022-12-11 23:42:26,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20920 conditions, 4253 events. 1239/4253 cut-off events. For 21992/22566 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 42600 event pairs, 49 based on Foata normal form. 175/4397 useless extension candidates. Maximal degree in co-relation 20794. Up to 1341 conditions per place. [2022-12-11 23:42:26,320 INFO L137 encePairwiseOnDemand]: 128/144 looper letters, 117 selfloop transitions, 54 changer transitions 36/322 dead transitions. [2022-12-11 23:42:26,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 322 transitions, 4183 flow [2022-12-11 23:42:26,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 23:42:26,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 23:42:26,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1801 transitions. [2022-12-11 23:42:26,324 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7816840277777778 [2022-12-11 23:42:26,324 INFO L295 CegarLoopForPetriNet]: 138 programPoint places, 51 predicate places. [2022-12-11 23:42:26,324 INFO L82 GeneralOperation]: Start removeDead. Operand has 189 places, 322 transitions, 4183 flow [2022-12-11 23:42:26,339 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 183 places, 286 transitions, 3577 flow [2022-12-11 23:42:26,339 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 286 transitions, 3577 flow [2022-12-11 23:42:26,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 110.14285714285714) internal successors, (1542), 14 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:42:26,340 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:42:26,340 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:42:26,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 23:42:26,340 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 23:42:26,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:42:26,341 INFO L85 PathProgramCache]: Analyzing trace with hash -810475161, now seen corresponding path program 3 times [2022-12-11 23:42:26,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:42:26,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10943113] [2022-12-11 23:42:26,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:42:26,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:42:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:42:28,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:42:28,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:42:28,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10943113] [2022-12-11 23:42:28,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10943113] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:42:28,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:42:28,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-12-11 23:42:28,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773470695] [2022-12-11 23:42:28,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:42:28,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-11 23:42:28,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:42:28,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-11 23:42:28,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-12-11 23:42:28,438 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 144 [2022-12-11 23:42:28,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 286 transitions, 3577 flow. Second operand has 18 states, 18 states have (on average 108.72222222222223) internal successors, (1957), 18 states have internal predecessors, (1957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:42:28,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:42:28,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 144 [2022-12-11 23:42:28,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:42:29,417 INFO L130 PetriNetUnfolder]: 1346/4606 cut-off events. [2022-12-11 23:42:29,417 INFO L131 PetriNetUnfolder]: For 29421/30125 co-relation queries the response was YES. [2022-12-11 23:42:29,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23928 conditions, 4606 events. 1346/4606 cut-off events. For 29421/30125 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 47269 event pairs, 41 based on Foata normal form. 205/4774 useless extension candidates. Maximal degree in co-relation 23787. Up to 1481 conditions per place. [2022-12-11 23:42:29,446 INFO L137 encePairwiseOnDemand]: 129/144 looper letters, 137 selfloop transitions, 44 changer transitions 30/325 dead transitions. [2022-12-11 23:42:29,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 325 transitions, 4687 flow [2022-12-11 23:42:29,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 23:42:29,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 23:42:29,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1780 transitions. [2022-12-11 23:42:29,450 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7725694444444444 [2022-12-11 23:42:29,450 INFO L295 CegarLoopForPetriNet]: 138 programPoint places, 60 predicate places. [2022-12-11 23:42:29,450 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 325 transitions, 4687 flow [2022-12-11 23:42:29,467 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 192 places, 295 transitions, 4105 flow [2022-12-11 23:42:29,467 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 295 transitions, 4105 flow [2022-12-11 23:42:29,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 108.72222222222223) internal successors, (1957), 18 states have internal predecessors, (1957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:42:29,468 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:42:29,468 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:42:29,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 23:42:29,468 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 23:42:29,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:42:29,469 INFO L85 PathProgramCache]: Analyzing trace with hash -945214874, now seen corresponding path program 1 times [2022-12-11 23:42:29,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:42:29,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171880404] [2022-12-11 23:42:29,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:42:29,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:42:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:42:29,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:42:29,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:42:29,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171880404] [2022-12-11 23:42:29,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171880404] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:42:29,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:42:29,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 23:42:29,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186495075] [2022-12-11 23:42:29,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:42:29,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 23:42:29,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:42:29,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 23:42:29,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-11 23:42:29,714 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 144 [2022-12-11 23:42:29,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 295 transitions, 4105 flow. Second operand has 9 states, 9 states have (on average 120.22222222222223) internal successors, (1082), 9 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:42:29,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:42:29,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 144 [2022-12-11 23:42:29,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:42:30,575 INFO L130 PetriNetUnfolder]: 1186/4195 cut-off events. [2022-12-11 23:42:30,575 INFO L131 PetriNetUnfolder]: For 29267/30524 co-relation queries the response was YES. [2022-12-11 23:42:30,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23992 conditions, 4195 events. 1186/4195 cut-off events. For 29267/30524 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 44529 event pairs, 33 based on Foata normal form. 444/4602 useless extension candidates. Maximal degree in co-relation 23847. Up to 1236 conditions per place. [2022-12-11 23:42:30,595 INFO L137 encePairwiseOnDemand]: 134/144 looper letters, 75 selfloop transitions, 23 changer transitions 117/322 dead transitions. [2022-12-11 23:42:30,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 322 transitions, 4967 flow [2022-12-11 23:42:30,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-11 23:42:30,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-11 23:42:30,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1736 transitions. [2022-12-11 23:42:30,598 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8611111111111112 [2022-12-11 23:42:30,599 INFO L295 CegarLoopForPetriNet]: 138 programPoint places, 67 predicate places. [2022-12-11 23:42:30,599 INFO L82 GeneralOperation]: Start removeDead. Operand has 205 places, 322 transitions, 4967 flow [2022-12-11 23:42:30,694 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 203 places, 205 transitions, 2357 flow [2022-12-11 23:42:30,694 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 205 transitions, 2357 flow [2022-12-11 23:42:30,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 120.22222222222223) internal successors, (1082), 9 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:42:30,695 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:42:30,695 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:42:30,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-11 23:42:30,695 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 23:42:30,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:42:30,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1979956109, now seen corresponding path program 1 times [2022-12-11 23:42:30,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:42:30,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360696997] [2022-12-11 23:42:30,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:42:30,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:42:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:42:32,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:42:32,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:42:32,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360696997] [2022-12-11 23:42:32,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360696997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:42:32,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:42:32,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-12-11 23:42:32,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677552223] [2022-12-11 23:42:32,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:42:32,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-11 23:42:32,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:42:32,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-11 23:42:32,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-12-11 23:42:32,047 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 144 [2022-12-11 23:42:32,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 205 transitions, 2357 flow. Second operand has 15 states, 15 states have (on average 110.13333333333334) internal successors, (1652), 15 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:42:32,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:42:32,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 144 [2022-12-11 23:42:32,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:42:32,567 INFO L130 PetriNetUnfolder]: 794/3449 cut-off events. [2022-12-11 23:42:32,568 INFO L131 PetriNetUnfolder]: For 22174/22794 co-relation queries the response was YES. [2022-12-11 23:42:32,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18954 conditions, 3449 events. 794/3449 cut-off events. For 22174/22794 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 38898 event pairs, 21 based on Foata normal form. 229/3660 useless extension candidates. Maximal degree in co-relation 18795. Up to 1043 conditions per place. [2022-12-11 23:42:32,585 INFO L137 encePairwiseOnDemand]: 129/144 looper letters, 78 selfloop transitions, 22 changer transitions 7/222 dead transitions. [2022-12-11 23:42:32,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 222 transitions, 2955 flow [2022-12-11 23:42:32,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:42:32,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:42:32,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1447 transitions. [2022-12-11 23:42:32,587 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7729700854700855 [2022-12-11 23:42:32,588 INFO L295 CegarLoopForPetriNet]: 138 programPoint places, 77 predicate places. [2022-12-11 23:42:32,588 INFO L82 GeneralOperation]: Start removeDead. Operand has 215 places, 222 transitions, 2955 flow [2022-12-11 23:42:32,597 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 211 places, 215 transitions, 2797 flow [2022-12-11 23:42:32,597 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 215 transitions, 2797 flow [2022-12-11 23:42:32,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 110.13333333333334) internal successors, (1652), 15 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:42:32,598 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:42:32,598 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:42:32,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-11 23:42:32,598 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 23:42:32,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:42:32,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1881731055, now seen corresponding path program 2 times [2022-12-11 23:42:32,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:42:32,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463189430] [2022-12-11 23:42:32,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:42:32,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:42:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:42:34,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:42:34,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:42:34,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463189430] [2022-12-11 23:42:34,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463189430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:42:34,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:42:34,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-12-11 23:42:34,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449405593] [2022-12-11 23:42:34,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:42:34,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-11 23:42:34,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:42:34,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-11 23:42:34,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2022-12-11 23:42:34,407 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 144 [2022-12-11 23:42:34,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 215 transitions, 2797 flow. Second operand has 17 states, 17 states have (on average 108.0) internal successors, (1836), 17 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:42:34,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:42:34,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 144 [2022-12-11 23:42:34,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:42:35,066 INFO L130 PetriNetUnfolder]: 848/3756 cut-off events. [2022-12-11 23:42:35,067 INFO L131 PetriNetUnfolder]: For 27866/28578 co-relation queries the response was YES. [2022-12-11 23:42:35,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21112 conditions, 3756 events. 848/3756 cut-off events. For 27866/28578 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 43442 event pairs, 21 based on Foata normal form. 297/4035 useless extension candidates. Maximal degree in co-relation 20937. Up to 1140 conditions per place. [2022-12-11 23:42:35,084 INFO L137 encePairwiseOnDemand]: 128/144 looper letters, 76 selfloop transitions, 31 changer transitions 8/228 dead transitions. [2022-12-11 23:42:35,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 228 transitions, 3341 flow [2022-12-11 23:42:35,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-11 23:42:35,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-11 23:42:35,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1638 transitions. [2022-12-11 23:42:35,087 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7583333333333333 [2022-12-11 23:42:35,088 INFO L295 CegarLoopForPetriNet]: 138 programPoint places, 87 predicate places. [2022-12-11 23:42:35,088 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 228 transitions, 3341 flow [2022-12-11 23:42:35,097 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 222 places, 220 transitions, 3141 flow [2022-12-11 23:42:35,098 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 220 transitions, 3141 flow [2022-12-11 23:42:35,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 108.0) internal successors, (1836), 17 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:42:35,099 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:42:35,099 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:42:35,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-11 23:42:35,099 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 23:42:35,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:42:35,099 INFO L85 PathProgramCache]: Analyzing trace with hash -786327697, now seen corresponding path program 3 times [2022-12-11 23:42:35,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:42:35,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144609158] [2022-12-11 23:42:35,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:42:35,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:42:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:42:37,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:42:37,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:42:37,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144609158] [2022-12-11 23:42:37,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144609158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:42:37,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:42:37,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-12-11 23:42:37,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337225252] [2022-12-11 23:42:37,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:42:37,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-11 23:42:37,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:42:37,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-11 23:42:37,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2022-12-11 23:42:37,155 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 144 [2022-12-11 23:42:37,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 220 transitions, 3141 flow. Second operand has 19 states, 19 states have (on average 106.84210526315789) internal successors, (2030), 19 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:42:37,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:42:37,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 144 [2022-12-11 23:42:37,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:42:37,876 INFO L130 PetriNetUnfolder]: 950/4299 cut-off events. [2022-12-11 23:42:37,876 INFO L131 PetriNetUnfolder]: For 35187/35851 co-relation queries the response was YES. [2022-12-11 23:42:37,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24471 conditions, 4299 events. 950/4299 cut-off events. For 35187/35851 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 51636 event pairs, 21 based on Foata normal form. 235/4516 useless extension candidates. Maximal degree in co-relation 24279. Up to 1315 conditions per place. [2022-12-11 23:42:37,897 INFO L137 encePairwiseOnDemand]: 127/144 looper letters, 63 selfloop transitions, 20 changer transitions 48/241 dead transitions. [2022-12-11 23:42:37,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 241 transitions, 3947 flow [2022-12-11 23:42:37,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 23:42:37,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 23:42:37,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1731 transitions. [2022-12-11 23:42:37,899 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7513020833333334 [2022-12-11 23:42:37,900 INFO L295 CegarLoopForPetriNet]: 138 programPoint places, 99 predicate places. [2022-12-11 23:42:37,900 INFO L82 GeneralOperation]: Start removeDead. Operand has 237 places, 241 transitions, 3947 flow [2022-12-11 23:42:37,909 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 193 transitions, 2579 flow [2022-12-11 23:42:37,910 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 193 transitions, 2579 flow [2022-12-11 23:42:37,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 106.84210526315789) internal successors, (2030), 19 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:42:37,912 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:42:37,912 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:42:37,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-11 23:42:37,912 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 23:42:37,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:42:37,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1105144383, now seen corresponding path program 4 times [2022-12-11 23:42:37,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:42:37,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207986396] [2022-12-11 23:42:37,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:42:37,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:42:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 23:42:37,996 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 23:42:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 23:42:38,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 23:42:38,135 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 23:42:38,136 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-11 23:42:38,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-11 23:42:38,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-11 23:42:38,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-11 23:42:38,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-11 23:42:38,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-11 23:42:38,138 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:42:38,142 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 23:42:38,142 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 23:42:38,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 11:42:38 BasicIcfg [2022-12-11 23:42:38,261 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 23:42:38,261 INFO L158 Benchmark]: Toolchain (without parser) took 28356.09ms. Allocated memory was 180.4MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 155.5MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 666.2MB. Max. memory is 8.0GB. [2022-12-11 23:42:38,261 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 180.4MB. Free memory is still 157.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 23:42:38,261 INFO L158 Benchmark]: CACSL2BoogieTranslator took 535.74ms. Allocated memory is still 180.4MB. Free memory was 155.5MB in the beginning and 125.7MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-11 23:42:38,262 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.69ms. Allocated memory is still 180.4MB. Free memory was 125.7MB in the beginning and 123.0MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-11 23:42:38,262 INFO L158 Benchmark]: Boogie Preprocessor took 54.21ms. Allocated memory is still 180.4MB. Free memory was 123.0MB in the beginning and 120.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 23:42:38,262 INFO L158 Benchmark]: RCFGBuilder took 823.13ms. Allocated memory was 180.4MB in the beginning and 264.2MB in the end (delta: 83.9MB). Free memory was 120.5MB in the beginning and 183.6MB in the end (delta: -63.1MB). Peak memory consumption was 45.8MB. Max. memory is 8.0GB. [2022-12-11 23:42:38,262 INFO L158 Benchmark]: TraceAbstraction took 26876.61ms. Allocated memory was 264.2MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 182.5MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 608.8MB. Max. memory is 8.0GB. [2022-12-11 23:42:38,263 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.12ms. Allocated memory is still 180.4MB. Free memory is still 157.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 535.74ms. Allocated memory is still 180.4MB. Free memory was 155.5MB in the beginning and 125.7MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.69ms. Allocated memory is still 180.4MB. Free memory was 125.7MB in the beginning and 123.0MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.21ms. Allocated memory is still 180.4MB. Free memory was 123.0MB in the beginning and 120.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 823.13ms. Allocated memory was 180.4MB in the beginning and 264.2MB in the end (delta: 83.9MB). Free memory was 120.5MB in the beginning and 183.6MB in the end (delta: -63.1MB). Peak memory consumption was 45.8MB. Max. memory is 8.0GB. * TraceAbstraction took 26876.61ms. Allocated memory was 264.2MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 182.5MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 608.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0] [L716] 0 int __unbuffered_p2_EAX$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0] [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0] [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0] [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0] [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0] [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0] [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0] [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0] [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0] [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0] [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0] [L727] 0 _Bool __unbuffered_p2_EAX$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0] [L728] 0 int *__unbuffered_p2_EAX$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}] [L729] 0 int __unbuffered_p2_EAX$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0] [L730] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0] [L731] 0 int __unbuffered_p2_EAX$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0] [L732] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0] [L733] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0] [L734] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L736] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}] [L737] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0] [L738] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0] [L739] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L740] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L741] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L742] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L743] 0 _Bool x$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0] [L744] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0] [L745] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L746] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L747] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L748] 0 _Bool x$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0] [L749] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0] [L750] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L751] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L752] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L753] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L754] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L756] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L757] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 0 _Bool weak$$choice1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L759] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L861] 0 pthread_t t2149; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t2149={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L862] FCALL, FORK 0 pthread_create(&t2149, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2149, ((void *)0), P0, ((void *)0))=-3, t2149={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L863] 0 pthread_t t2150; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2149={7:0}, t2150={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L864] FCALL, FORK 0 pthread_create(&t2150, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2150, ((void *)0), P1, ((void *)0))=-2, t2149={7:0}, t2150={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L865] 0 pthread_t t2151; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2149={7:0}, t2150={5:0}, t2151={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L866] FCALL, FORK 0 pthread_create(&t2151, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2151, ((void *)0), P2, ((void *)0))=-1, t2149={7:0}, t2150={5:0}, t2151={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L867] 0 pthread_t t2152; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2149={7:0}, t2150={5:0}, t2151={6:0}, t2152={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L868] FCALL, FORK 0 pthread_create(&t2152, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2152, ((void *)0), P3, ((void *)0))=0, t2149={7:0}, t2150={5:0}, t2151={6:0}, t2152={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 x$flush_delayed = weak$$choice2 [L803] EXPR 3 \read(x) [L803] 3 x$mem_tmp = x [L804] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L805] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L805] EXPR 3 \read(x) [L805] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L805] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L806] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L807] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L808] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L809] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L810] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L811] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L812] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L813] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L814] EXPR 3 \read(x) [L814] 3 __unbuffered_p2_EAX = x [L815] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L815] EXPR 3 \read(x) [L815] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L815] 3 x = x$flush_delayed ? x$mem_tmp : x [L816] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L819] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L822] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L822] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L822] EXPR 3 \read(x) [L822] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L822] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L822] 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) [L823] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L824] 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 [L825] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L826] 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_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L836] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L839] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L839] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L839] EXPR 4 \read(x) [L839] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L839] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L839] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L840] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L841] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L842] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L843] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L763] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L769] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L769] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L769] EXPR 1 \read(x) [L769] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L769] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L769] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L770] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L771] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L772] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L773] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L786] EXPR 2 \read(x) [L786] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] 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) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 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 [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L846] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L870] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2149={7:0}, t2150={5:0}, t2151={6:0}, t2152={9:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L872] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L872] RET 0 assume_abort_if_not(main$tmp_guard0) [L874] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L874] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L874] EXPR 0 \read(x) [L874] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L874] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L874] 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) [L875] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L876] 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 [L877] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L878] 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=4, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2149={7:0}, t2150={5:0}, t2151={6:0}, t2152={9:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L881] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L882] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L883] 0 x$flush_delayed = weak$$choice2 [L884] EXPR 0 \read(x) [L884] 0 x$mem_tmp = x [L885] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L885] EXPR 0 \read(x) [L885] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L885] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L886] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L887] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L888] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L889] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L890] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L891] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L892] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L893] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L893] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L893] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L893] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L893] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L893] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L894] EXPR 0 \read(x) [L894] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 2) [L895] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L895] EXPR 0 \read(x) [L895] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L895] 0 x = x$flush_delayed ? x$mem_tmp : x [L896] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2149={7:0}, t2150={5:0}, t2151={6:0}, t2152={9:0}, weak$$choice0=2, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L898] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 866]: 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: 868]: 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: 864]: 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: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 177 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.3s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 26.7s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1284 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1284 mSDsluCounter, 927 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 748 mSDsCounter, 210 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2290 IncrementalHoareTripleChecker+Invalid, 2500 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 210 mSolverCounterUnsat, 179 mSDtfsCounter, 2290 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 249 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4105occurred in iteration=10, InterpolantAutomatonStates: 180, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 12257 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 1635 NumberOfCodeBlocks, 1635 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1505 ConstructedInterpolants, 0 QuantifiedInterpolants, 11499 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-11 23:42:38,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...