/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 16:16:05,150 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 16:16:05,151 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 16:16:05,181 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 16:16:05,182 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 16:16:05,184 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 16:16:05,187 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 16:16:05,192 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 16:16:05,197 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 16:16:05,201 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 16:16:05,202 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 16:16:05,202 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 16:16:05,203 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 16:16:05,203 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 16:16:05,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 16:16:05,204 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 16:16:05,204 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 16:16:05,205 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 16:16:05,206 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 16:16:05,207 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 16:16:05,217 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 16:16:05,229 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 16:16:05,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 16:16:05,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 16:16:05,235 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 16:16:05,236 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 16:16:05,236 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 16:16:05,237 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 16:16:05,238 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 16:16:05,238 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 16:16:05,238 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 16:16:05,240 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 16:16:05,241 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 16:16:05,241 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 16:16:05,242 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 16:16:05,242 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 16:16:05,242 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 16:16:05,242 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 16:16:05,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 16:16:05,243 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 16:16:05,243 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 16:16:05,247 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-06 16:16:05,274 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 16:16:05,274 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 16:16:05,275 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-06 16:16:05,275 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-06 16:16:05,275 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 16:16:05,276 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 16:16:05,276 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 16:16:05,276 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 16:16:05,276 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 16:16:05,276 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 16:16:05,277 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 16:16:05,277 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 16:16:05,277 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 16:16:05,277 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 16:16:05,277 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 16:16:05,277 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 16:16:05,278 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 16:16:05,278 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 16:16:05,278 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 16:16:05,278 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 16:16:05,278 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 16:16:05,278 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 16:16:05,278 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 16:16:05,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:16:05,278 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 16:16:05,278 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 16:16:05,278 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 16:16:05,279 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 16:16:05,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 16:16:05,279 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-06 16:16:05,279 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-06 16:16:05,279 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 16:16:05,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 16:16:05,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 16:16:05,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 16:16:05,552 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 16:16:05,552 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 16:16:05,553 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i [2022-12-06 16:16:06,429 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 16:16:06,678 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 16:16:06,679 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i [2022-12-06 16:16:06,704 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaf20daba/221be696e1bb4cce8a0d8701a5bcfb7b/FLAG04b5e5c05 [2022-12-06 16:16:06,721 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaf20daba/221be696e1bb4cce8a0d8701a5bcfb7b [2022-12-06 16:16:06,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 16:16:06,723 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 16:16:06,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 16:16:06,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 16:16:06,726 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 16:16:06,726 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:16:06" (1/1) ... [2022-12-06 16:16:06,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35b3a43f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:06, skipping insertion in model container [2022-12-06 16:16:06,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:16:06" (1/1) ... [2022-12-06 16:16:06,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 16:16:06,769 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 16:16:06,894 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/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i[974,987] [2022-12-06 16:16:07,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:16:07,075 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 16:16:07,084 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/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i[974,987] [2022-12-06 16:16:07,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:16:07,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:16:07,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:16:07,173 INFO L208 MainTranslator]: Completed translation [2022-12-06 16:16:07,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:07 WrapperNode [2022-12-06 16:16:07,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 16:16:07,175 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 16:16:07,175 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 16:16:07,175 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 16:16:07,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:07" (1/1) ... [2022-12-06 16:16:07,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:07" (1/1) ... [2022-12-06 16:16:07,217 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 149 [2022-12-06 16:16:07,217 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 16:16:07,218 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 16:16:07,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 16:16:07,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 16:16:07,229 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:07" (1/1) ... [2022-12-06 16:16:07,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:07" (1/1) ... [2022-12-06 16:16:07,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:07" (1/1) ... [2022-12-06 16:16:07,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:07" (1/1) ... [2022-12-06 16:16:07,237 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:07" (1/1) ... [2022-12-06 16:16:07,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:07" (1/1) ... [2022-12-06 16:16:07,240 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:07" (1/1) ... [2022-12-06 16:16:07,241 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:07" (1/1) ... [2022-12-06 16:16:07,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 16:16:07,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 16:16:07,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 16:16:07,244 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 16:16:07,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:07" (1/1) ... [2022-12-06 16:16:07,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:16:07,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:16:07,283 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 16:16:07,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 16:16:07,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 16:16:07,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 16:16:07,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 16:16:07,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 16:16:07,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 16:16:07,334 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 16:16:07,334 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 16:16:07,335 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 16:16:07,335 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 16:16:07,335 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 16:16:07,335 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 16:16:07,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 16:16:07,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 16:16:07,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 16:16:07,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 16:16:07,336 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 16:16:07,474 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 16:16:07,491 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 16:16:07,810 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 16:16:07,905 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 16:16:07,905 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 16:16:07,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:16:07 BoogieIcfgContainer [2022-12-06 16:16:07,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 16:16:07,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 16:16:07,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 16:16:07,910 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 16:16:07,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:16:06" (1/3) ... [2022-12-06 16:16:07,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bf6e4b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:16:07, skipping insertion in model container [2022-12-06 16:16:07,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:07" (2/3) ... [2022-12-06 16:16:07,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bf6e4b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:16:07, skipping insertion in model container [2022-12-06 16:16:07,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:16:07" (3/3) ... [2022-12-06 16:16:07,912 INFO L112 eAbstractionObserver]: Analyzing ICFG mix003_power.opt_pso.opt_rmo.opt_tso.opt.i [2022-12-06 16:16:07,923 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 16:16:07,925 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 16:16:07,925 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 16:16:07,960 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 16:16:07,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 237 flow [2022-12-06 16:16:08,036 INFO L130 PetriNetUnfolder]: 2/108 cut-off events. [2022-12-06 16:16:08,037 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 16:16:08,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 16:16:08,042 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 111 transitions, 237 flow [2022-12-06 16:16:08,045 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 108 transitions, 225 flow [2022-12-06 16:16:08,057 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 16:16:08,063 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;@1e3a61b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 16:16:08,063 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 16:16:08,086 INFO L130 PetriNetUnfolder]: 0/73 cut-off events. [2022-12-06 16:16:08,086 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 16:16:08,087 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:16:08,087 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:16:08,088 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:16:08,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:16:08,092 INFO L85 PathProgramCache]: Analyzing trace with hash -435406366, now seen corresponding path program 1 times [2022-12-06 16:16:08,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:16:08,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385650046] [2022-12-06 16:16:08,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:16:08,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:16:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:16:08,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:16:08,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:16:08,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385650046] [2022-12-06 16:16:08,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385650046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:16:08,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:16:08,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 16:16:08,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563665501] [2022-12-06 16:16:08,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:16:08,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 16:16:08,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:16:08,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 16:16:08,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 16:16:08,550 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 111 [2022-12-06 16:16:08,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 108 transitions, 225 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:16:08,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:16:08,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 111 [2022-12-06 16:16:08,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:16:08,598 INFO L130 PetriNetUnfolder]: 14/147 cut-off events. [2022-12-06 16:16:08,599 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 16:16:08,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 147 events. 14/147 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 295 event pairs, 2 based on Foata normal form. 8/147 useless extension candidates. Maximal degree in co-relation 142. Up to 25 conditions per place. [2022-12-06 16:16:08,601 INFO L137 encePairwiseOnDemand]: 106/111 looper letters, 9 selfloop transitions, 2 changer transitions 0/106 dead transitions. [2022-12-06 16:16:08,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 106 transitions, 243 flow [2022-12-06 16:16:08,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 16:16:08,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 16:16:08,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 310 transitions. [2022-12-06 16:16:08,610 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9309309309309309 [2022-12-06 16:16:08,612 INFO L294 CegarLoopForPetriNet]: 116 programPoint places, 0 predicate places. [2022-12-06 16:16:08,613 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 106 transitions, 243 flow [2022-12-06 16:16:08,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:16:08,613 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:16:08,613 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:16:08,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 16:16:08,613 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:16:08,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:16:08,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1056857100, now seen corresponding path program 1 times [2022-12-06 16:16:08,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:16:08,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599261712] [2022-12-06 16:16:08,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:16:08,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:16:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:16:08,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:16:08,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:16:08,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599261712] [2022-12-06 16:16:08,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599261712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:16:08,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:16:08,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:16:08,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871604637] [2022-12-06 16:16:08,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:16:08,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:16:08,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:16:08,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:16:08,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:16:08,888 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 111 [2022-12-06 16:16:08,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 106 transitions, 243 flow. Second operand has 6 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:16:08,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:16:08,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 111 [2022-12-06 16:16:08,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:16:09,239 INFO L130 PetriNetUnfolder]: 162/595 cut-off events. [2022-12-06 16:16:09,239 INFO L131 PetriNetUnfolder]: For 155/224 co-relation queries the response was YES. [2022-12-06 16:16:09,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1081 conditions, 595 events. 162/595 cut-off events. For 155/224 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3203 event pairs, 24 based on Foata normal form. 0/578 useless extension candidates. Maximal degree in co-relation 1025. Up to 149 conditions per place. [2022-12-06 16:16:09,247 INFO L137 encePairwiseOnDemand]: 105/111 looper letters, 22 selfloop transitions, 2 changer transitions 46/148 dead transitions. [2022-12-06 16:16:09,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 148 transitions, 512 flow [2022-12-06 16:16:09,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 16:16:09,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 16:16:09,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 867 transitions. [2022-12-06 16:16:09,254 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8678678678678678 [2022-12-06 16:16:09,254 INFO L294 CegarLoopForPetriNet]: 116 programPoint places, 8 predicate places. [2022-12-06 16:16:09,255 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 148 transitions, 512 flow [2022-12-06 16:16:09,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:16:09,255 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:16:09,255 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:16:09,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 16:16:09,255 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:16:09,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:16:09,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1618975095, now seen corresponding path program 1 times [2022-12-06 16:16:09,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:16:09,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065297948] [2022-12-06 16:16:09,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:16:09,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:16:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:16:09,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:16:09,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:16:09,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065297948] [2022-12-06 16:16:09,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065297948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:16:09,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:16:09,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:16:09,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995784479] [2022-12-06 16:16:09,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:16:09,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:16:09,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:16:09,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:16:09,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:16:09,544 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 111 [2022-12-06 16:16:09,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 148 transitions, 512 flow. Second operand has 7 states, 7 states have (on average 86.28571428571429) internal successors, (604), 7 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:16:09,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:16:09,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 111 [2022-12-06 16:16:09,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:16:09,954 INFO L130 PetriNetUnfolder]: 807/2184 cut-off events. [2022-12-06 16:16:09,954 INFO L131 PetriNetUnfolder]: For 634/1487 co-relation queries the response was YES. [2022-12-06 16:16:09,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4903 conditions, 2184 events. 807/2184 cut-off events. For 634/1487 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 16891 event pairs, 97 based on Foata normal form. 2/2144 useless extension candidates. Maximal degree in co-relation 4839. Up to 534 conditions per place. [2022-12-06 16:16:09,964 INFO L137 encePairwiseOnDemand]: 103/111 looper letters, 30 selfloop transitions, 5 changer transitions 117/224 dead transitions. [2022-12-06 16:16:09,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 224 transitions, 1148 flow [2022-12-06 16:16:09,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 16:16:09,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 16:16:09,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 908 transitions. [2022-12-06 16:16:09,966 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.818018018018018 [2022-12-06 16:16:09,968 INFO L294 CegarLoopForPetriNet]: 116 programPoint places, 17 predicate places. [2022-12-06 16:16:09,968 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 224 transitions, 1148 flow [2022-12-06 16:16:09,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.28571428571429) internal successors, (604), 7 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:16:09,968 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:16:09,968 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:16:09,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 16:16:09,969 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:16:09,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:16:09,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1042088251, now seen corresponding path program 1 times [2022-12-06 16:16:09,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:16:09,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291607895] [2022-12-06 16:16:09,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:16:09,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:16:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:16:10,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:16:10,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:16:10,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291607895] [2022-12-06 16:16:10,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291607895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:16:10,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:16:10,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:16:10,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309684925] [2022-12-06 16:16:10,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:16:10,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:16:10,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:16:10,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:16:10,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:16:10,212 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 111 [2022-12-06 16:16:10,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 224 transitions, 1148 flow. Second operand has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:16:10,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:16:10,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 111 [2022-12-06 16:16:10,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:16:10,755 INFO L130 PetriNetUnfolder]: 1546/3768 cut-off events. [2022-12-06 16:16:10,755 INFO L131 PetriNetUnfolder]: For 4462/4684 co-relation queries the response was YES. [2022-12-06 16:16:10,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9893 conditions, 3768 events. 1546/3768 cut-off events. For 4462/4684 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 29393 event pairs, 118 based on Foata normal form. 1/3640 useless extension candidates. Maximal degree in co-relation 9825. Up to 1004 conditions per place. [2022-12-06 16:16:10,774 INFO L137 encePairwiseOnDemand]: 101/111 looper letters, 86 selfloop transitions, 13 changer transitions 114/320 dead transitions. [2022-12-06 16:16:10,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 320 transitions, 2105 flow [2022-12-06 16:16:10,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 16:16:10,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 16:16:10,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 961 transitions. [2022-12-06 16:16:10,777 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8657657657657658 [2022-12-06 16:16:10,778 INFO L294 CegarLoopForPetriNet]: 116 programPoint places, 26 predicate places. [2022-12-06 16:16:10,778 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 320 transitions, 2105 flow [2022-12-06 16:16:10,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:16:10,778 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:16:10,779 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:16:10,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 16:16:10,779 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:16:10,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:16:10,779 INFO L85 PathProgramCache]: Analyzing trace with hash -2083233276, now seen corresponding path program 1 times [2022-12-06 16:16:10,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:16:10,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656157804] [2022-12-06 16:16:10,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:16:10,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:16:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:16:11,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:16:11,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:16:11,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656157804] [2022-12-06 16:16:11,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656157804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:16:11,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:16:11,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:16:11,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33125084] [2022-12-06 16:16:11,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:16:11,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:16:11,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:16:11,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:16:11,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:16:11,033 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 111 [2022-12-06 16:16:11,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 320 transitions, 2105 flow. Second operand has 7 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:16:11,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:16:11,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 111 [2022-12-06 16:16:11,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:16:11,496 INFO L130 PetriNetUnfolder]: 999/2326 cut-off events. [2022-12-06 16:16:11,496 INFO L131 PetriNetUnfolder]: For 3941/4243 co-relation queries the response was YES. [2022-12-06 16:16:11,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7627 conditions, 2326 events. 999/2326 cut-off events. For 3941/4243 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 15853 event pairs, 48 based on Foata normal form. 78/2327 useless extension candidates. Maximal degree in co-relation 7555. Up to 614 conditions per place. [2022-12-06 16:16:11,507 INFO L137 encePairwiseOnDemand]: 101/111 looper letters, 92 selfloop transitions, 34 changer transitions 135/348 dead transitions. [2022-12-06 16:16:11,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 348 transitions, 2714 flow [2022-12-06 16:16:11,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:16:11,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:16:11,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1252 transitions. [2022-12-06 16:16:11,510 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8676368676368676 [2022-12-06 16:16:11,510 INFO L294 CegarLoopForPetriNet]: 116 programPoint places, 38 predicate places. [2022-12-06 16:16:11,510 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 348 transitions, 2714 flow [2022-12-06 16:16:11,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:16:11,511 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:16:11,511 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:16:11,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 16:16:11,511 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:16:11,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:16:11,512 INFO L85 PathProgramCache]: Analyzing trace with hash -2141371776, now seen corresponding path program 1 times [2022-12-06 16:16:11,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:16:11,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215783670] [2022-12-06 16:16:11,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:16:11,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:16:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:16:11,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:16:11,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:16:11,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215783670] [2022-12-06 16:16:11,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215783670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:16:11,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:16:11,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 16:16:11,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817391774] [2022-12-06 16:16:11,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:16:11,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 16:16:11,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:16:11,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 16:16:11,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 16:16:11,742 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 111 [2022-12-06 16:16:11,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 348 transitions, 2714 flow. Second operand has 8 states, 8 states have (on average 90.125) internal successors, (721), 8 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:16:11,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:16:11,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 111 [2022-12-06 16:16:11,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:16:12,203 INFO L130 PetriNetUnfolder]: 943/2057 cut-off events. [2022-12-06 16:16:12,203 INFO L131 PetriNetUnfolder]: For 4185/4722 co-relation queries the response was YES. [2022-12-06 16:16:12,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8554 conditions, 2057 events. 943/2057 cut-off events. For 4185/4722 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 14239 event pairs, 36 based on Foata normal form. 116/2125 useless extension candidates. Maximal degree in co-relation 8478. Up to 544 conditions per place. [2022-12-06 16:16:12,213 INFO L137 encePairwiseOnDemand]: 101/111 looper letters, 82 selfloop transitions, 36 changer transitions 145/340 dead transitions. [2022-12-06 16:16:12,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 340 transitions, 3136 flow [2022-12-06 16:16:12,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 16:16:12,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 16:16:12,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1507 transitions. [2022-12-06 16:16:12,216 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.848536036036036 [2022-12-06 16:16:12,217 INFO L294 CegarLoopForPetriNet]: 116 programPoint places, 41 predicate places. [2022-12-06 16:16:12,217 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 340 transitions, 3136 flow [2022-12-06 16:16:12,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.125) internal successors, (721), 8 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:16:12,217 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:16:12,217 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:16:12,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 16:16:12,218 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:16:12,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:16:12,218 INFO L85 PathProgramCache]: Analyzing trace with hash -263649768, now seen corresponding path program 1 times [2022-12-06 16:16:12,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:16:12,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384467003] [2022-12-06 16:16:12,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:16:12,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:16:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:16:12,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:16:12,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:16:12,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384467003] [2022-12-06 16:16:12,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384467003] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:16:12,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:16:12,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:16:12,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027646310] [2022-12-06 16:16:12,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:16:12,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:16:12,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:16:12,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:16:12,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:16:12,408 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 111 [2022-12-06 16:16:12,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 340 transitions, 3136 flow. Second operand has 7 states, 7 states have (on average 90.57142857142857) internal successors, (634), 7 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:16:12,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:16:12,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 111 [2022-12-06 16:16:12,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:16:12,903 INFO L130 PetriNetUnfolder]: 1846/3799 cut-off events. [2022-12-06 16:16:12,903 INFO L131 PetriNetUnfolder]: For 13660/14783 co-relation queries the response was YES. [2022-12-06 16:16:12,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16970 conditions, 3799 events. 1846/3799 cut-off events. For 13660/14783 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 29835 event pairs, 59 based on Foata normal form. 82/3743 useless extension candidates. Maximal degree in co-relation 16889. Up to 1032 conditions per place. [2022-12-06 16:16:12,916 INFO L137 encePairwiseOnDemand]: 105/111 looper letters, 60 selfloop transitions, 1 changer transitions 288/458 dead transitions. [2022-12-06 16:16:12,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 458 transitions, 5294 flow [2022-12-06 16:16:12,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 16:16:12,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 16:16:12,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 651 transitions. [2022-12-06 16:16:12,917 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8378378378378378 [2022-12-06 16:16:12,918 INFO L294 CegarLoopForPetriNet]: 116 programPoint places, 47 predicate places. [2022-12-06 16:16:12,918 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 458 transitions, 5294 flow [2022-12-06 16:16:12,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.57142857142857) internal successors, (634), 7 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:16:12,918 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:16:12,918 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:16:12,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 16:16:12,919 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:16:12,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:16:12,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1736930816, now seen corresponding path program 2 times [2022-12-06 16:16:12,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:16:12,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123395507] [2022-12-06 16:16:12,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:16:12,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:16:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:16:13,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:16:13,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:16:13,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123395507] [2022-12-06 16:16:13,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123395507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:16:13,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:16:13,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:16:13,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759875490] [2022-12-06 16:16:13,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:16:13,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:16:13,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:16:13,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:16:13,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:16:13,092 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 111 [2022-12-06 16:16:13,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 458 transitions, 5294 flow. Second operand has 7 states, 7 states have (on average 89.71428571428571) internal successors, (628), 7 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:16:13,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:16:13,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 111 [2022-12-06 16:16:13,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:16:13,686 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L768-->L784: Formula: (let ((.cse10 (= (mod v_~y$r_buff1_thd2~0_42 256) 0)) (.cse6 (= (mod v_~y$r_buff0_thd2~0_38 256) 0))) (let ((.cse8 (not .cse6)) (.cse4 (and .cse6 .cse10)) (.cse11 (= 0 (mod v_~y$w_buff0_used~0_126 256))) (.cse5 (and .cse6 (= (mod v_~y$w_buff1_used~0_125 256) 0)))) (let ((.cse1 (or .cse4 .cse11 .cse5)) (.cse2 (and .cse8 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_64 256) 0))) (.cse3 (= (mod v_~y$w_buff0_used~0_125 256) 0)) (.cse7 (= (mod v_~y$w_buff1_used~0_124 256) 0))) (and (= (ite .cse0 v_~y$w_buff0_used~0_126 (ite .cse1 v_~y$w_buff0_used~0_126 (ite .cse2 0 v_~y$w_buff0_used~0_126))) v_~y$w_buff0_used~0_125) (= v_~y$w_buff0~0_71 v_~y$w_buff0~0_70) (= 0 v_~y$flush_delayed~0_42) (= v_~y$w_buff1~0_66 v_~y$w_buff1~0_65) (= v_~y$w_buff1_used~0_124 (ite .cse0 v_~y$w_buff1_used~0_125 (ite (or .cse3 .cse4 .cse5) v_~y$w_buff1_used~0_125 0))) (= v_~__unbuffered_p1_EBX~0_14 (ite .cse1 v_~y~0_89 (ite .cse2 v_~y$w_buff0~0_71 v_~y$w_buff1~0_66))) (= (ite .cse0 v_~y$r_buff0_thd2~0_38 (ite (or .cse3 .cse4 (and .cse6 .cse7)) v_~y$r_buff0_thd2~0_38 (ite (and .cse8 (not .cse3)) 0 v_~y$r_buff0_thd2~0_38))) v_~y$r_buff0_thd2~0_37) (= |v_P1Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_64) (= v_~y~0_89 v_~y$mem_tmp~0_34) (= |v_P1Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_8) (= (ite .cse0 v_~y$mem_tmp~0_34 v_~__unbuffered_p1_EBX~0_14) v_~y~0_88) (= (ite .cse0 v_~y$r_buff1_thd2~0_42 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd2~0_37 256) 0))) (or .cse3 (and .cse9 .cse10) (and .cse7 .cse9))) v_~y$r_buff1_thd2~0_42 0)) v_~y$r_buff1_thd2~0_41))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_42, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_126, ~y$w_buff1~0=v_~y$w_buff1~0_66, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_1|, ~y$w_buff0~0=v_~y$w_buff0~0_71, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_1|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_38, ~y~0=v_~y~0_89, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_125} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_14, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_125, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_41, ~weak$$choice0~0=v_~weak$$choice0~0_8, ~y$mem_tmp~0=v_~y$mem_tmp~0_34, ~y$w_buff1~0=v_~y$w_buff1~0_65, ~y$w_buff0~0=v_~y$w_buff0~0_70, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$flush_delayed~0=v_~y$flush_delayed~0_42, ~y~0=v_~y~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_124} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][355], [33#L784true, 122#true, 229#(= ~z~0 1), 190#(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)), 54#L3true, 125#true, 10#L831true, 171#(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)), P1Thread1of1ForFork2InUse, 141#true, P2Thread1of1ForFork0InUse, 78#L753true, P0Thread1of1ForFork1InUse, 244#(= ~x~0 1), 216#(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))]) [2022-12-06 16:16:13,686 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-06 16:16:13,686 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:16:13,687 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:16:13,687 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:16:13,748 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L768-->L784: Formula: (let ((.cse10 (= (mod v_~y$r_buff1_thd2~0_42 256) 0)) (.cse6 (= (mod v_~y$r_buff0_thd2~0_38 256) 0))) (let ((.cse8 (not .cse6)) (.cse4 (and .cse6 .cse10)) (.cse11 (= 0 (mod v_~y$w_buff0_used~0_126 256))) (.cse5 (and .cse6 (= (mod v_~y$w_buff1_used~0_125 256) 0)))) (let ((.cse1 (or .cse4 .cse11 .cse5)) (.cse2 (and .cse8 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_64 256) 0))) (.cse3 (= (mod v_~y$w_buff0_used~0_125 256) 0)) (.cse7 (= (mod v_~y$w_buff1_used~0_124 256) 0))) (and (= (ite .cse0 v_~y$w_buff0_used~0_126 (ite .cse1 v_~y$w_buff0_used~0_126 (ite .cse2 0 v_~y$w_buff0_used~0_126))) v_~y$w_buff0_used~0_125) (= v_~y$w_buff0~0_71 v_~y$w_buff0~0_70) (= 0 v_~y$flush_delayed~0_42) (= v_~y$w_buff1~0_66 v_~y$w_buff1~0_65) (= v_~y$w_buff1_used~0_124 (ite .cse0 v_~y$w_buff1_used~0_125 (ite (or .cse3 .cse4 .cse5) v_~y$w_buff1_used~0_125 0))) (= v_~__unbuffered_p1_EBX~0_14 (ite .cse1 v_~y~0_89 (ite .cse2 v_~y$w_buff0~0_71 v_~y$w_buff1~0_66))) (= (ite .cse0 v_~y$r_buff0_thd2~0_38 (ite (or .cse3 .cse4 (and .cse6 .cse7)) v_~y$r_buff0_thd2~0_38 (ite (and .cse8 (not .cse3)) 0 v_~y$r_buff0_thd2~0_38))) v_~y$r_buff0_thd2~0_37) (= |v_P1Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_64) (= v_~y~0_89 v_~y$mem_tmp~0_34) (= |v_P1Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_8) (= (ite .cse0 v_~y$mem_tmp~0_34 v_~__unbuffered_p1_EBX~0_14) v_~y~0_88) (= (ite .cse0 v_~y$r_buff1_thd2~0_42 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd2~0_37 256) 0))) (or .cse3 (and .cse9 .cse10) (and .cse7 .cse9))) v_~y$r_buff1_thd2~0_42 0)) v_~y$r_buff1_thd2~0_41))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_42, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_126, ~y$w_buff1~0=v_~y$w_buff1~0_66, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_1|, ~y$w_buff0~0=v_~y$w_buff0~0_71, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_1|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_38, ~y~0=v_~y~0_89, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_125} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_14, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_125, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_41, ~weak$$choice0~0=v_~weak$$choice0~0_8, ~y$mem_tmp~0=v_~y$mem_tmp~0_34, ~y$w_buff1~0=v_~y$w_buff1~0_65, ~y$w_buff0~0=v_~y$w_buff0~0_70, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$flush_delayed~0=v_~y$flush_delayed~0_42, ~y~0=v_~y~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_124} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][355], [33#L784true, 122#true, 229#(= ~z~0 1), 190#(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)), 109#L3-1true, 125#true, 10#L831true, 171#(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)), P1Thread1of1ForFork2InUse, 141#true, P2Thread1of1ForFork0InUse, 78#L753true, P0Thread1of1ForFork1InUse, 244#(= ~x~0 1), 216#(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))]) [2022-12-06 16:16:13,748 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-12-06 16:16:13,748 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:16:13,749 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:16:13,749 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:16:13,749 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L768-->L784: Formula: (let ((.cse10 (= (mod v_~y$r_buff1_thd2~0_42 256) 0)) (.cse6 (= (mod v_~y$r_buff0_thd2~0_38 256) 0))) (let ((.cse8 (not .cse6)) (.cse4 (and .cse6 .cse10)) (.cse11 (= 0 (mod v_~y$w_buff0_used~0_126 256))) (.cse5 (and .cse6 (= (mod v_~y$w_buff1_used~0_125 256) 0)))) (let ((.cse1 (or .cse4 .cse11 .cse5)) (.cse2 (and .cse8 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_64 256) 0))) (.cse3 (= (mod v_~y$w_buff0_used~0_125 256) 0)) (.cse7 (= (mod v_~y$w_buff1_used~0_124 256) 0))) (and (= (ite .cse0 v_~y$w_buff0_used~0_126 (ite .cse1 v_~y$w_buff0_used~0_126 (ite .cse2 0 v_~y$w_buff0_used~0_126))) v_~y$w_buff0_used~0_125) (= v_~y$w_buff0~0_71 v_~y$w_buff0~0_70) (= 0 v_~y$flush_delayed~0_42) (= v_~y$w_buff1~0_66 v_~y$w_buff1~0_65) (= v_~y$w_buff1_used~0_124 (ite .cse0 v_~y$w_buff1_used~0_125 (ite (or .cse3 .cse4 .cse5) v_~y$w_buff1_used~0_125 0))) (= v_~__unbuffered_p1_EBX~0_14 (ite .cse1 v_~y~0_89 (ite .cse2 v_~y$w_buff0~0_71 v_~y$w_buff1~0_66))) (= (ite .cse0 v_~y$r_buff0_thd2~0_38 (ite (or .cse3 .cse4 (and .cse6 .cse7)) v_~y$r_buff0_thd2~0_38 (ite (and .cse8 (not .cse3)) 0 v_~y$r_buff0_thd2~0_38))) v_~y$r_buff0_thd2~0_37) (= |v_P1Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_64) (= v_~y~0_89 v_~y$mem_tmp~0_34) (= |v_P1Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_8) (= (ite .cse0 v_~y$mem_tmp~0_34 v_~__unbuffered_p1_EBX~0_14) v_~y~0_88) (= (ite .cse0 v_~y$r_buff1_thd2~0_42 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd2~0_37 256) 0))) (or .cse3 (and .cse9 .cse10) (and .cse7 .cse9))) v_~y$r_buff1_thd2~0_42 0)) v_~y$r_buff1_thd2~0_41))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_42, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_126, ~y$w_buff1~0=v_~y$w_buff1~0_66, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_1|, ~y$w_buff0~0=v_~y$w_buff0~0_71, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_1|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_38, ~y~0=v_~y~0_89, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_125} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_14, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_125, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_41, ~weak$$choice0~0=v_~weak$$choice0~0_8, ~y$mem_tmp~0=v_~y$mem_tmp~0_34, ~y$w_buff1~0=v_~y$w_buff1~0_65, ~y$w_buff0~0=v_~y$w_buff0~0_70, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$flush_delayed~0=v_~y$flush_delayed~0_42, ~y~0=v_~y~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_124} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][462], [33#L784true, 122#true, 229#(= ~z~0 1), 192#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 173#(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)), 218#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 54#L3true, 125#true, P1Thread1of1ForFork2InUse, 141#true, P2Thread1of1ForFork0InUse, 78#L753true, P0Thread1of1ForFork1InUse, 244#(= ~x~0 1), 64#L834true]) [2022-12-06 16:16:13,749 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-12-06 16:16:13,749 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:16:13,749 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:16:13,749 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:16:13,795 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L768-->L784: Formula: (let ((.cse10 (= (mod v_~y$r_buff1_thd2~0_42 256) 0)) (.cse6 (= (mod v_~y$r_buff0_thd2~0_38 256) 0))) (let ((.cse8 (not .cse6)) (.cse4 (and .cse6 .cse10)) (.cse11 (= 0 (mod v_~y$w_buff0_used~0_126 256))) (.cse5 (and .cse6 (= (mod v_~y$w_buff1_used~0_125 256) 0)))) (let ((.cse1 (or .cse4 .cse11 .cse5)) (.cse2 (and .cse8 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_64 256) 0))) (.cse3 (= (mod v_~y$w_buff0_used~0_125 256) 0)) (.cse7 (= (mod v_~y$w_buff1_used~0_124 256) 0))) (and (= (ite .cse0 v_~y$w_buff0_used~0_126 (ite .cse1 v_~y$w_buff0_used~0_126 (ite .cse2 0 v_~y$w_buff0_used~0_126))) v_~y$w_buff0_used~0_125) (= v_~y$w_buff0~0_71 v_~y$w_buff0~0_70) (= 0 v_~y$flush_delayed~0_42) (= v_~y$w_buff1~0_66 v_~y$w_buff1~0_65) (= v_~y$w_buff1_used~0_124 (ite .cse0 v_~y$w_buff1_used~0_125 (ite (or .cse3 .cse4 .cse5) v_~y$w_buff1_used~0_125 0))) (= v_~__unbuffered_p1_EBX~0_14 (ite .cse1 v_~y~0_89 (ite .cse2 v_~y$w_buff0~0_71 v_~y$w_buff1~0_66))) (= (ite .cse0 v_~y$r_buff0_thd2~0_38 (ite (or .cse3 .cse4 (and .cse6 .cse7)) v_~y$r_buff0_thd2~0_38 (ite (and .cse8 (not .cse3)) 0 v_~y$r_buff0_thd2~0_38))) v_~y$r_buff0_thd2~0_37) (= |v_P1Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_64) (= v_~y~0_89 v_~y$mem_tmp~0_34) (= |v_P1Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_8) (= (ite .cse0 v_~y$mem_tmp~0_34 v_~__unbuffered_p1_EBX~0_14) v_~y~0_88) (= (ite .cse0 v_~y$r_buff1_thd2~0_42 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd2~0_37 256) 0))) (or .cse3 (and .cse9 .cse10) (and .cse7 .cse9))) v_~y$r_buff1_thd2~0_42 0)) v_~y$r_buff1_thd2~0_41))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_42, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_126, ~y$w_buff1~0=v_~y$w_buff1~0_66, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_1|, ~y$w_buff0~0=v_~y$w_buff0~0_71, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_1|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_38, ~y~0=v_~y~0_89, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_125} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_14, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_125, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_41, ~weak$$choice0~0=v_~weak$$choice0~0_8, ~y$mem_tmp~0=v_~y$mem_tmp~0_34, ~y$w_buff1~0=v_~y$w_buff1~0_65, ~y$w_buff0~0=v_~y$w_buff0~0_70, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$flush_delayed~0=v_~y$flush_delayed~0_42, ~y~0=v_~y~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_124} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][462], [33#L784true, 122#true, 229#(= ~z~0 1), 192#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 109#L3-1true, 173#(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)), 218#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 125#true, P1Thread1of1ForFork2InUse, 141#true, P2Thread1of1ForFork0InUse, 78#L753true, P0Thread1of1ForFork1InUse, 244#(= ~x~0 1), 64#L834true]) [2022-12-06 16:16:13,795 INFO L382 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-12-06 16:16:13,795 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-06 16:16:13,795 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-06 16:16:13,795 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-06 16:16:13,908 INFO L130 PetriNetUnfolder]: 3068/6557 cut-off events. [2022-12-06 16:16:13,911 INFO L131 PetriNetUnfolder]: For 31589/34520 co-relation queries the response was YES. [2022-12-06 16:16:13,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30615 conditions, 6557 events. 3068/6557 cut-off events. For 31589/34520 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 57806 event pairs, 75 based on Foata normal form. 279/6706 useless extension candidates. Maximal degree in co-relation 30529. Up to 1662 conditions per place. [2022-12-06 16:16:13,941 INFO L137 encePairwiseOnDemand]: 105/111 looper letters, 27 selfloop transitions, 1 changer transitions 609/717 dead transitions. [2022-12-06 16:16:13,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 717 transitions, 10404 flow [2022-12-06 16:16:13,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 16:16:13,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 16:16:13,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 647 transitions. [2022-12-06 16:16:13,943 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8326898326898327 [2022-12-06 16:16:13,945 INFO L294 CegarLoopForPetriNet]: 116 programPoint places, 53 predicate places. [2022-12-06 16:16:13,946 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 717 transitions, 10404 flow [2022-12-06 16:16:13,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.71428571428571) internal successors, (628), 7 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:16:13,946 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:16:13,946 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:16:13,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 16:16:13,946 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:16:13,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:16:13,947 INFO L85 PathProgramCache]: Analyzing trace with hash 876236544, now seen corresponding path program 3 times [2022-12-06 16:16:13,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:16:13,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054132293] [2022-12-06 16:16:13,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:16:13,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:16:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:16:15,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:16:15,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:16:15,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054132293] [2022-12-06 16:16:15,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054132293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:16:15,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:16:15,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-06 16:16:15,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416338453] [2022-12-06 16:16:15,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:16:15,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 16:16:15,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:16:15,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 16:16:15,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-06 16:16:15,084 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2022-12-06 16:16:15,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 717 transitions, 10404 flow. Second operand has 13 states, 13 states have (on average 83.84615384615384) internal successors, (1090), 13 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:16:15,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:16:15,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2022-12-06 16:16:15,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:16:15,755 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L768-->L784: Formula: (let ((.cse10 (= (mod v_~y$r_buff1_thd2~0_42 256) 0)) (.cse6 (= (mod v_~y$r_buff0_thd2~0_38 256) 0))) (let ((.cse8 (not .cse6)) (.cse4 (and .cse6 .cse10)) (.cse11 (= 0 (mod v_~y$w_buff0_used~0_126 256))) (.cse5 (and .cse6 (= (mod v_~y$w_buff1_used~0_125 256) 0)))) (let ((.cse1 (or .cse4 .cse11 .cse5)) (.cse2 (and .cse8 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_64 256) 0))) (.cse3 (= (mod v_~y$w_buff0_used~0_125 256) 0)) (.cse7 (= (mod v_~y$w_buff1_used~0_124 256) 0))) (and (= (ite .cse0 v_~y$w_buff0_used~0_126 (ite .cse1 v_~y$w_buff0_used~0_126 (ite .cse2 0 v_~y$w_buff0_used~0_126))) v_~y$w_buff0_used~0_125) (= v_~y$w_buff0~0_71 v_~y$w_buff0~0_70) (= 0 v_~y$flush_delayed~0_42) (= v_~y$w_buff1~0_66 v_~y$w_buff1~0_65) (= v_~y$w_buff1_used~0_124 (ite .cse0 v_~y$w_buff1_used~0_125 (ite (or .cse3 .cse4 .cse5) v_~y$w_buff1_used~0_125 0))) (= v_~__unbuffered_p1_EBX~0_14 (ite .cse1 v_~y~0_89 (ite .cse2 v_~y$w_buff0~0_71 v_~y$w_buff1~0_66))) (= (ite .cse0 v_~y$r_buff0_thd2~0_38 (ite (or .cse3 .cse4 (and .cse6 .cse7)) v_~y$r_buff0_thd2~0_38 (ite (and .cse8 (not .cse3)) 0 v_~y$r_buff0_thd2~0_38))) v_~y$r_buff0_thd2~0_37) (= |v_P1Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_64) (= v_~y~0_89 v_~y$mem_tmp~0_34) (= |v_P1Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_8) (= (ite .cse0 v_~y$mem_tmp~0_34 v_~__unbuffered_p1_EBX~0_14) v_~y~0_88) (= (ite .cse0 v_~y$r_buff1_thd2~0_42 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd2~0_37 256) 0))) (or .cse3 (and .cse9 .cse10) (and .cse7 .cse9))) v_~y$r_buff1_thd2~0_42 0)) v_~y$r_buff1_thd2~0_41))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_42, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_126, ~y$w_buff1~0=v_~y$w_buff1~0_66, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_1|, ~y$w_buff0~0=v_~y$w_buff0~0_71, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_1|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_38, ~y~0=v_~y~0_89, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_125} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_14, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_125, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_41, ~weak$$choice0~0=v_~weak$$choice0~0_8, ~y$mem_tmp~0=v_~y$mem_tmp~0_34, ~y$w_buff1~0=v_~y$w_buff1~0_65, ~y$w_buff0~0=v_~y$w_buff0~0_70, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$flush_delayed~0=v_~y$flush_delayed~0_42, ~y~0=v_~y~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_124} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][541], [33#L784true, 229#(= ~z~0 1), 122#true, 190#(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)), 54#L3true, 125#true, 10#L831true, 171#(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)), P1Thread1of1ForFork2InUse, 141#true, P2Thread1of1ForFork0InUse, 282#(and (= ~y$r_buff1_thd2~0 0) (or (not (= ~__unbuffered_p2_EAX~0 1)) (= ~__unbuffered_p1_EBX~0 1)) (= ~y$r_buff0_thd2~0 0) (or (not (= ~y~0 ~y$w_buff0~0)) (= ~y~0 1)) (or (and (= ~y~0 ~__unbuffered_p2_EAX~0) (= ~y$w_buff0~0 1)) (= ~y~0 ~y$w_buff0~0) (and (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0)))), 78#L753true, P0Thread1of1ForFork1InUse, 244#(= ~x~0 1), 216#(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))]) [2022-12-06 16:16:15,755 INFO L382 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-12-06 16:16:15,755 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:16:15,755 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:16:15,755 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 16:16:15,897 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L768-->L784: Formula: (let ((.cse10 (= (mod v_~y$r_buff1_thd2~0_42 256) 0)) (.cse6 (= (mod v_~y$r_buff0_thd2~0_38 256) 0))) (let ((.cse8 (not .cse6)) (.cse4 (and .cse6 .cse10)) (.cse11 (= 0 (mod v_~y$w_buff0_used~0_126 256))) (.cse5 (and .cse6 (= (mod v_~y$w_buff1_used~0_125 256) 0)))) (let ((.cse1 (or .cse4 .cse11 .cse5)) (.cse2 (and .cse8 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_64 256) 0))) (.cse3 (= (mod v_~y$w_buff0_used~0_125 256) 0)) (.cse7 (= (mod v_~y$w_buff1_used~0_124 256) 0))) (and (= (ite .cse0 v_~y$w_buff0_used~0_126 (ite .cse1 v_~y$w_buff0_used~0_126 (ite .cse2 0 v_~y$w_buff0_used~0_126))) v_~y$w_buff0_used~0_125) (= v_~y$w_buff0~0_71 v_~y$w_buff0~0_70) (= 0 v_~y$flush_delayed~0_42) (= v_~y$w_buff1~0_66 v_~y$w_buff1~0_65) (= v_~y$w_buff1_used~0_124 (ite .cse0 v_~y$w_buff1_used~0_125 (ite (or .cse3 .cse4 .cse5) v_~y$w_buff1_used~0_125 0))) (= v_~__unbuffered_p1_EBX~0_14 (ite .cse1 v_~y~0_89 (ite .cse2 v_~y$w_buff0~0_71 v_~y$w_buff1~0_66))) (= (ite .cse0 v_~y$r_buff0_thd2~0_38 (ite (or .cse3 .cse4 (and .cse6 .cse7)) v_~y$r_buff0_thd2~0_38 (ite (and .cse8 (not .cse3)) 0 v_~y$r_buff0_thd2~0_38))) v_~y$r_buff0_thd2~0_37) (= |v_P1Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_64) (= v_~y~0_89 v_~y$mem_tmp~0_34) (= |v_P1Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_8) (= (ite .cse0 v_~y$mem_tmp~0_34 v_~__unbuffered_p1_EBX~0_14) v_~y~0_88) (= (ite .cse0 v_~y$r_buff1_thd2~0_42 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd2~0_37 256) 0))) (or .cse3 (and .cse9 .cse10) (and .cse7 .cse9))) v_~y$r_buff1_thd2~0_42 0)) v_~y$r_buff1_thd2~0_41))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_42, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_126, ~y$w_buff1~0=v_~y$w_buff1~0_66, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_1|, ~y$w_buff0~0=v_~y$w_buff0~0_71, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_1|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_38, ~y~0=v_~y~0_89, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_125} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_14, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_125, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_41, ~weak$$choice0~0=v_~weak$$choice0~0_8, ~y$mem_tmp~0=v_~y$mem_tmp~0_34, ~y$w_buff1~0=v_~y$w_buff1~0_65, ~y$w_buff0~0=v_~y$w_buff0~0_70, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$flush_delayed~0=v_~y$flush_delayed~0_42, ~y~0=v_~y~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_124} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][541], [33#L784true, 122#true, 229#(= ~z~0 1), 190#(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)), 109#L3-1true, 125#true, 10#L831true, 171#(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)), P1Thread1of1ForFork2InUse, 141#true, P2Thread1of1ForFork0InUse, 282#(and (= ~y$r_buff1_thd2~0 0) (or (not (= ~__unbuffered_p2_EAX~0 1)) (= ~__unbuffered_p1_EBX~0 1)) (= ~y$r_buff0_thd2~0 0) (or (not (= ~y~0 ~y$w_buff0~0)) (= ~y~0 1)) (or (and (= ~y~0 ~__unbuffered_p2_EAX~0) (= ~y$w_buff0~0 1)) (= ~y~0 ~y$w_buff0~0) (and (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0)))), 78#L753true, P0Thread1of1ForFork1InUse, 244#(= ~x~0 1), 216#(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))]) [2022-12-06 16:16:15,897 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-12-06 16:16:15,897 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:16:15,897 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:16:15,897 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:16:15,898 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L768-->L784: Formula: (let ((.cse10 (= (mod v_~y$r_buff1_thd2~0_42 256) 0)) (.cse6 (= (mod v_~y$r_buff0_thd2~0_38 256) 0))) (let ((.cse8 (not .cse6)) (.cse4 (and .cse6 .cse10)) (.cse11 (= 0 (mod v_~y$w_buff0_used~0_126 256))) (.cse5 (and .cse6 (= (mod v_~y$w_buff1_used~0_125 256) 0)))) (let ((.cse1 (or .cse4 .cse11 .cse5)) (.cse2 (and .cse8 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_64 256) 0))) (.cse3 (= (mod v_~y$w_buff0_used~0_125 256) 0)) (.cse7 (= (mod v_~y$w_buff1_used~0_124 256) 0))) (and (= (ite .cse0 v_~y$w_buff0_used~0_126 (ite .cse1 v_~y$w_buff0_used~0_126 (ite .cse2 0 v_~y$w_buff0_used~0_126))) v_~y$w_buff0_used~0_125) (= v_~y$w_buff0~0_71 v_~y$w_buff0~0_70) (= 0 v_~y$flush_delayed~0_42) (= v_~y$w_buff1~0_66 v_~y$w_buff1~0_65) (= v_~y$w_buff1_used~0_124 (ite .cse0 v_~y$w_buff1_used~0_125 (ite (or .cse3 .cse4 .cse5) v_~y$w_buff1_used~0_125 0))) (= v_~__unbuffered_p1_EBX~0_14 (ite .cse1 v_~y~0_89 (ite .cse2 v_~y$w_buff0~0_71 v_~y$w_buff1~0_66))) (= (ite .cse0 v_~y$r_buff0_thd2~0_38 (ite (or .cse3 .cse4 (and .cse6 .cse7)) v_~y$r_buff0_thd2~0_38 (ite (and .cse8 (not .cse3)) 0 v_~y$r_buff0_thd2~0_38))) v_~y$r_buff0_thd2~0_37) (= |v_P1Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_64) (= v_~y~0_89 v_~y$mem_tmp~0_34) (= |v_P1Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_8) (= (ite .cse0 v_~y$mem_tmp~0_34 v_~__unbuffered_p1_EBX~0_14) v_~y~0_88) (= (ite .cse0 v_~y$r_buff1_thd2~0_42 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd2~0_37 256) 0))) (or .cse3 (and .cse9 .cse10) (and .cse7 .cse9))) v_~y$r_buff1_thd2~0_42 0)) v_~y$r_buff1_thd2~0_41))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_42, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_126, ~y$w_buff1~0=v_~y$w_buff1~0_66, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_1|, ~y$w_buff0~0=v_~y$w_buff0~0_71, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_1|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_38, ~y~0=v_~y~0_89, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_125} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_14, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_125, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_41, ~weak$$choice0~0=v_~weak$$choice0~0_8, ~y$mem_tmp~0=v_~y$mem_tmp~0_34, ~y$w_buff1~0=v_~y$w_buff1~0_65, ~y$w_buff0~0=v_~y$w_buff0~0_70, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$flush_delayed~0=v_~y$flush_delayed~0_42, ~y~0=v_~y~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_124} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][543], [33#L784true, 122#true, 229#(= ~z~0 1), 192#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 173#(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)), 218#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 54#L3true, 125#true, P1Thread1of1ForFork2InUse, 141#true, P2Thread1of1ForFork0InUse, 78#L753true, 282#(and (= ~y$r_buff1_thd2~0 0) (or (not (= ~__unbuffered_p2_EAX~0 1)) (= ~__unbuffered_p1_EBX~0 1)) (= ~y$r_buff0_thd2~0 0) (or (not (= ~y~0 ~y$w_buff0~0)) (= ~y~0 1)) (or (and (= ~y~0 ~__unbuffered_p2_EAX~0) (= ~y$w_buff0~0 1)) (= ~y~0 ~y$w_buff0~0) (and (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0)))), P0Thread1of1ForFork1InUse, 244#(= ~x~0 1), 64#L834true]) [2022-12-06 16:16:15,898 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-12-06 16:16:15,898 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:16:15,898 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:16:15,898 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 16:16:15,954 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L768-->L784: Formula: (let ((.cse10 (= (mod v_~y$r_buff1_thd2~0_42 256) 0)) (.cse6 (= (mod v_~y$r_buff0_thd2~0_38 256) 0))) (let ((.cse8 (not .cse6)) (.cse4 (and .cse6 .cse10)) (.cse11 (= 0 (mod v_~y$w_buff0_used~0_126 256))) (.cse5 (and .cse6 (= (mod v_~y$w_buff1_used~0_125 256) 0)))) (let ((.cse1 (or .cse4 .cse11 .cse5)) (.cse2 (and .cse8 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_64 256) 0))) (.cse3 (= (mod v_~y$w_buff0_used~0_125 256) 0)) (.cse7 (= (mod v_~y$w_buff1_used~0_124 256) 0))) (and (= (ite .cse0 v_~y$w_buff0_used~0_126 (ite .cse1 v_~y$w_buff0_used~0_126 (ite .cse2 0 v_~y$w_buff0_used~0_126))) v_~y$w_buff0_used~0_125) (= v_~y$w_buff0~0_71 v_~y$w_buff0~0_70) (= 0 v_~y$flush_delayed~0_42) (= v_~y$w_buff1~0_66 v_~y$w_buff1~0_65) (= v_~y$w_buff1_used~0_124 (ite .cse0 v_~y$w_buff1_used~0_125 (ite (or .cse3 .cse4 .cse5) v_~y$w_buff1_used~0_125 0))) (= v_~__unbuffered_p1_EBX~0_14 (ite .cse1 v_~y~0_89 (ite .cse2 v_~y$w_buff0~0_71 v_~y$w_buff1~0_66))) (= (ite .cse0 v_~y$r_buff0_thd2~0_38 (ite (or .cse3 .cse4 (and .cse6 .cse7)) v_~y$r_buff0_thd2~0_38 (ite (and .cse8 (not .cse3)) 0 v_~y$r_buff0_thd2~0_38))) v_~y$r_buff0_thd2~0_37) (= |v_P1Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_64) (= v_~y~0_89 v_~y$mem_tmp~0_34) (= |v_P1Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_8) (= (ite .cse0 v_~y$mem_tmp~0_34 v_~__unbuffered_p1_EBX~0_14) v_~y~0_88) (= (ite .cse0 v_~y$r_buff1_thd2~0_42 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd2~0_37 256) 0))) (or .cse3 (and .cse9 .cse10) (and .cse7 .cse9))) v_~y$r_buff1_thd2~0_42 0)) v_~y$r_buff1_thd2~0_41))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_42, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_126, ~y$w_buff1~0=v_~y$w_buff1~0_66, P1Thread1of1ForFork2_#t~nondet4=|v_P1Thread1of1ForFork2_#t~nondet4_1|, ~y$w_buff0~0=v_~y$w_buff0~0_71, P1Thread1of1ForFork2_#t~nondet3=|v_P1Thread1of1ForFork2_#t~nondet3_1|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_38, ~y~0=v_~y~0_89, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_125} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_14, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_125, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_41, ~weak$$choice0~0=v_~weak$$choice0~0_8, ~y$mem_tmp~0=v_~y$mem_tmp~0_34, ~y$w_buff1~0=v_~y$w_buff1~0_65, ~y$w_buff0~0=v_~y$w_buff0~0_70, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$flush_delayed~0=v_~y$flush_delayed~0_42, ~y~0=v_~y~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_124} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork2_#t~nondet3, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0][543], [33#L784true, 122#true, 229#(= ~z~0 1), 192#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 109#L3-1true, 173#(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)), 218#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 125#true, P1Thread1of1ForFork2InUse, 141#true, P2Thread1of1ForFork0InUse, 78#L753true, 282#(and (= ~y$r_buff1_thd2~0 0) (or (not (= ~__unbuffered_p2_EAX~0 1)) (= ~__unbuffered_p1_EBX~0 1)) (= ~y$r_buff0_thd2~0 0) (or (not (= ~y~0 ~y$w_buff0~0)) (= ~y~0 1)) (or (and (= ~y~0 ~__unbuffered_p2_EAX~0) (= ~y$w_buff0~0 1)) (= ~y~0 ~y$w_buff0~0) (and (= ~y$w_buff0~0 1) (= ~__unbuffered_p2_EAX~0 0)))), P0Thread1of1ForFork1InUse, 244#(= ~x~0 1), 64#L834true]) [2022-12-06 16:16:15,954 INFO L382 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-12-06 16:16:15,954 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-06 16:16:15,954 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-06 16:16:15,954 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-06 16:16:16,098 INFO L130 PetriNetUnfolder]: 3685/8313 cut-off events. [2022-12-06 16:16:16,098 INFO L131 PetriNetUnfolder]: For 46879/49655 co-relation queries the response was YES. [2022-12-06 16:16:16,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38117 conditions, 8313 events. 3685/8313 cut-off events. For 46879/49655 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 79894 event pairs, 76 based on Foata normal form. 223/8398 useless extension candidates. Maximal degree in co-relation 38018. Up to 1828 conditions per place. [2022-12-06 16:16:16,125 INFO L137 encePairwiseOnDemand]: 97/111 looper letters, 16 selfloop transitions, 11 changer transitions 733/835 dead transitions. [2022-12-06 16:16:16,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 835 transitions, 13683 flow [2022-12-06 16:16:16,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 16:16:16,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 16:16:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1350 transitions. [2022-12-06 16:16:16,128 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7601351351351351 [2022-12-06 16:16:16,128 INFO L294 CegarLoopForPetriNet]: 116 programPoint places, 68 predicate places. [2022-12-06 16:16:16,129 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 835 transitions, 13683 flow [2022-12-06 16:16:16,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.84615384615384) internal successors, (1090), 13 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:16:16,129 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:16:16,129 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:16:16,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 16:16:16,129 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:16:16,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:16:16,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1160640398, now seen corresponding path program 4 times [2022-12-06 16:16:16,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:16:16,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481474148] [2022-12-06 16:16:16,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:16:16,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:16:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 16:16:16,159 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 16:16:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 16:16:16,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 16:16:16,205 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 16:16:16,205 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 16:16:16,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 16:16:16,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 16:16:16,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 16:16:16,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 16:16:16,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 16:16:16,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 16:16:16,207 INFO L458 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2022-12-06 16:16:16,211 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 16:16:16,211 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 16:16:16,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:16:16 BasicIcfg [2022-12-06 16:16:16,272 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 16:16:16,272 INFO L158 Benchmark]: Toolchain (without parser) took 9549.08ms. Allocated memory was 176.2MB in the beginning and 841.0MB in the end (delta: 664.8MB). Free memory was 132.9MB in the beginning and 422.8MB in the end (delta: -289.9MB). Peak memory consumption was 376.1MB. Max. memory is 8.0GB. [2022-12-06 16:16:16,273 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 176.2MB. Free memory is still 152.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 16:16:16,273 INFO L158 Benchmark]: CACSL2BoogieTranslator took 450.20ms. Allocated memory is still 176.2MB. Free memory was 132.6MB in the beginning and 144.8MB in the end (delta: -12.2MB). Peak memory consumption was 24.9MB. Max. memory is 8.0GB. [2022-12-06 16:16:16,273 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.42ms. Allocated memory is still 176.2MB. Free memory was 144.8MB in the beginning and 142.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 16:16:16,273 INFO L158 Benchmark]: Boogie Preprocessor took 25.98ms. Allocated memory is still 176.2MB. Free memory was 142.3MB in the beginning and 140.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 16:16:16,273 INFO L158 Benchmark]: RCFGBuilder took 662.75ms. Allocated memory is still 176.2MB. Free memory was 140.2MB in the beginning and 103.0MB in the end (delta: 37.2MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-06 16:16:16,273 INFO L158 Benchmark]: TraceAbstraction took 8363.77ms. Allocated memory was 176.2MB in the beginning and 841.0MB in the end (delta: 664.8MB). Free memory was 102.5MB in the beginning and 422.8MB in the end (delta: -320.3MB). Peak memory consumption was 344.9MB. Max. memory is 8.0GB. [2022-12-06 16:16:16,274 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 176.2MB. Free memory is still 152.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 450.20ms. Allocated memory is still 176.2MB. Free memory was 132.6MB in the beginning and 144.8MB in the end (delta: -12.2MB). Peak memory consumption was 24.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.42ms. Allocated memory is still 176.2MB. Free memory was 144.8MB in the beginning and 142.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.98ms. Allocated memory is still 176.2MB. Free memory was 142.3MB in the beginning and 140.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 662.75ms. Allocated memory is still 176.2MB. Free memory was 140.2MB in the beginning and 103.0MB in the end (delta: 37.2MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 8363.77ms. Allocated memory was 176.2MB in the beginning and 841.0MB in the end (delta: 664.8MB). Free memory was 102.5MB in the beginning and 422.8MB in the end (delta: -320.3MB). Peak memory consumption was 344.9MB. 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: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L717] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L719] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L720] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L721] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L723] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L725] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L726] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L727] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L728] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L729] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L730] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L731] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L732] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L733] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L734] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L735] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L736] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L737] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L738] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L739] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L740] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L741] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L744] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L745] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t65; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t65={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L849] FCALL, FORK 0 pthread_create(&t65, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t65, ((void *)0), P0, ((void *)0))=-2, t65={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t66; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t65={5:0}, t66={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t66, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t66, ((void *)0), P1, ((void *)0))=-1, t65={5:0}, t66={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] 0 pthread_t t67; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t65={5:0}, t66={6:0}, t67={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L853] FCALL, FORK 0 pthread_create(&t67, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t67, ((void *)0), P2, ((void *)0))=0, t65={5:0}, t66={6:0}, t67={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] 3 y$w_buff1 = y$w_buff0 [L796] 3 y$w_buff0 = 1 [L797] 3 y$w_buff1_used = y$w_buff0_used [L798] 3 y$w_buff0_used = (_Bool)1 [L799] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L799] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L800] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L801] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L802] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L803] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 y$flush_delayed = weak$$choice2 [L810] 3 y$mem_tmp = y [L811] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EAX = y [L819] 3 y = y$flush_delayed ? y$mem_tmp : y [L820] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L823] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L749] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 y$flush_delayed = weak$$choice2 [L773] 2 y$mem_tmp = y [L774] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L775] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L776] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L777] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L778] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L780] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EBX = y [L782] 2 y = y$flush_delayed ? y$mem_tmp : y [L783] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L827] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L828] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L829] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L830] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t65={5:0}, t66={6:0}, t67={3:0}, weak$$choice0=2, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t65={5:0}, t66={6:0}, t67={3:0}, weak$$choice0=2, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L866] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t65={5:0}, t66={6:0}, t67={3:0}, weak$$choice0=2, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 851]: 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: 853]: 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: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 138 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 565 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 565 mSDsluCounter, 388 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 310 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 976 IncrementalHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 78 mSDtfsCounter, 976 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13683occurred in iteration=9, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 795 NumberOfCodeBlocks, 795 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 699 ConstructedInterpolants, 0 QuantifiedInterpolants, 2550 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 16:16:16,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...