/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/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 16:39:30,118 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 16:39:30,120 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 16:39:30,153 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 16:39:30,153 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 16:39:30,154 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 16:39:30,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 16:39:30,162 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 16:39:30,165 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 16:39:30,170 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 16:39:30,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 16:39:30,172 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 16:39:30,172 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 16:39:30,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 16:39:30,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 16:39:30,177 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 16:39:30,177 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 16:39:30,178 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 16:39:30,180 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 16:39:30,185 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 16:39:30,186 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 16:39:30,187 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 16:39:30,188 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 16:39:30,188 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 16:39:30,194 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 16:39:30,194 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 16:39:30,194 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 16:39:30,195 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 16:39:30,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 16:39:30,196 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 16:39:30,196 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 16:39:30,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 16:39:30,199 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 16:39:30,200 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 16:39:30,200 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 16:39:30,200 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 16:39:30,201 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 16:39:30,201 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 16:39:30,201 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 16:39:30,202 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 16:39:30,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 16:39:30,205 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:39:30,231 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 16:39:30,231 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 16:39:30,233 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-06 16:39:30,233 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-06 16:39:30,233 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 16:39:30,234 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 16:39:30,234 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 16:39:30,234 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 16:39:30,234 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 16:39:30,234 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 16:39:30,235 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 16:39:30,235 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 16:39:30,235 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 16:39:30,235 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 16:39:30,235 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 16:39:30,236 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 16:39:30,236 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 16:39:30,236 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 16:39:30,236 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 16:39:30,236 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 16:39:30,236 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 16:39:30,236 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 16:39:30,236 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 16:39:30,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:39:30,237 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 16:39:30,237 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 16:39:30,237 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 16:39:30,237 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 16:39:30,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 16:39:30,237 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-06 16:39:30,237 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-06 16:39:30,237 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:39:30,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 16:39:30,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 16:39:30,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 16:39:30,488 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 16:39:30,488 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 16:39:30,489 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 16:39:31,442 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 16:39:31,699 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 16:39:31,700 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 16:39:31,720 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/226c8f1a3/b65c133c0d9e44fcad2168593a41f353/FLAG88037d3a5 [2022-12-06 16:39:31,734 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/226c8f1a3/b65c133c0d9e44fcad2168593a41f353 [2022-12-06 16:39:31,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 16:39:31,737 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 16:39:31,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 16:39:31,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 16:39:31,742 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 16:39:31,742 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:39:31" (1/1) ... [2022-12-06 16:39:31,743 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36991f41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:39:31, skipping insertion in model container [2022-12-06 16:39:31,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:39:31" (1/1) ... [2022-12-06 16:39:31,748 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 16:39:31,798 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 16:39:31,938 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/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-06 16:39:32,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:39:32,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:39:32,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:39:32,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:39:32,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:39:32,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:39:32,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:39:32,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:39:32,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:39:32,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:39:32,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:39:32,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:39:32,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:39:32,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:39:32,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:39:32,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:39:32,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:39:32,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:39:32,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:39:32,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:39:32,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:39:32,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:39:32,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:39:32,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:39:32,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:39:32,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:39:32,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:39:32,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:39:32,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:39:32,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:39:32,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:39:32,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:39:32,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:39:32,145 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 16:39:32,155 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/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-06 16:39:32,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:39:32,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:39:32,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:39:32,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:39:32,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:39:32,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:39:32,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:39:32,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:39:32,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:39:32,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:39:32,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:39:32,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:39:32,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:39:32,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:39:32,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:39:32,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:39:32,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:39:32,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:39:32,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:39:32,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:39:32,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:39:32,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:39:32,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:39:32,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:39:32,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:39:32,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:39:32,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:39:32,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:39:32,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:39:32,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:39:32,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:39:32,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:39:32,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:39:32,230 INFO L208 MainTranslator]: Completed translation [2022-12-06 16:39:32,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:39:32 WrapperNode [2022-12-06 16:39:32,231 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 16:39:32,231 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 16:39:32,232 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 16:39:32,233 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 16:39:32,237 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:39:32" (1/1) ... [2022-12-06 16:39:32,264 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:39:32" (1/1) ... [2022-12-06 16:39:32,282 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2022-12-06 16:39:32,282 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 16:39:32,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 16:39:32,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 16:39:32,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 16:39:32,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:39:32" (1/1) ... [2022-12-06 16:39:32,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:39:32" (1/1) ... [2022-12-06 16:39:32,292 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:39:32" (1/1) ... [2022-12-06 16:39:32,293 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:39:32" (1/1) ... [2022-12-06 16:39:32,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:39:32" (1/1) ... [2022-12-06 16:39:32,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:39:32" (1/1) ... [2022-12-06 16:39:32,301 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:39:32" (1/1) ... [2022-12-06 16:39:32,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:39:32" (1/1) ... [2022-12-06 16:39:32,304 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 16:39:32,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 16:39:32,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 16:39:32,307 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 16:39:32,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:39:32" (1/1) ... [2022-12-06 16:39:32,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:39:32,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:39:32,335 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:39:32,345 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:39:32,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 16:39:32,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 16:39:32,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 16:39:32,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 16:39:32,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 16:39:32,376 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 16:39:32,376 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 16:39:32,377 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 16:39:32,377 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 16:39:32,377 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 16:39:32,377 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 16:39:32,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 16:39:32,377 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 16:39:32,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 16:39:32,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 16:39:32,378 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:39:32,516 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 16:39:32,517 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 16:39:32,711 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 16:39:32,830 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 16:39:32,830 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 16:39:32,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:39:32 BoogieIcfgContainer [2022-12-06 16:39:32,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 16:39:32,833 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 16:39:32,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 16:39:32,836 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 16:39:32,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:39:31" (1/3) ... [2022-12-06 16:39:32,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52736849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:39:32, skipping insertion in model container [2022-12-06 16:39:32,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:39:32" (2/3) ... [2022-12-06 16:39:32,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52736849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:39:32, skipping insertion in model container [2022-12-06 16:39:32,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:39:32" (3/3) ... [2022-12-06 16:39:32,839 INFO L112 eAbstractionObserver]: Analyzing ICFG safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 16:39:32,852 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 16:39:32,853 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 16:39:32,853 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 16:39:32,900 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 16:39:32,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2022-12-06 16:39:33,004 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-06 16:39:33,004 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 16:39:33,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 16:39:33,012 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2022-12-06 16:39:33,015 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2022-12-06 16:39:33,027 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 16:39:33,033 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;@36498e36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 16:39:33,033 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 16:39:33,054 INFO L130 PetriNetUnfolder]: 0/57 cut-off events. [2022-12-06 16:39:33,055 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 16:39:33,055 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:39:33,056 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:39:33,056 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:39:33,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:39:33,060 INFO L85 PathProgramCache]: Analyzing trace with hash 2130019754, now seen corresponding path program 1 times [2022-12-06 16:39:33,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:39:33,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650540287] [2022-12-06 16:39:33,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:39:33,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:39:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:39:33,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:39:33,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:39:33,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650540287] [2022-12-06 16:39:33,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650540287] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:39:33,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:39:33,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 16:39:33,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071654725] [2022-12-06 16:39:33,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:39:33,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 16:39:33,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:39:33,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 16:39:33,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 16:39:33,502 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 108 [2022-12-06 16:39:33,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 105 transitions, 219 flow. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:39:33,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:39:33,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 108 [2022-12-06 16:39:33,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:39:33,620 INFO L130 PetriNetUnfolder]: 37/216 cut-off events. [2022-12-06 16:39:33,620 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 16:39:33,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309 conditions, 216 events. 37/216 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 711 event pairs, 7 based on Foata normal form. 13/214 useless extension candidates. Maximal degree in co-relation 259. Up to 51 conditions per place. [2022-12-06 16:39:33,624 INFO L137 encePairwiseOnDemand]: 103/108 looper letters, 11 selfloop transitions, 2 changer transitions 0/105 dead transitions. [2022-12-06 16:39:33,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 105 transitions, 248 flow [2022-12-06 16:39:33,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 16:39:33,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 16:39:33,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2022-12-06 16:39:33,639 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9351851851851852 [2022-12-06 16:39:33,642 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 0 predicate places. [2022-12-06 16:39:33,642 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 105 transitions, 248 flow [2022-12-06 16:39:33,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:39:33,643 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:39:33,643 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:39:33,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 16:39:33,644 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:39:33,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:39:33,645 INFO L85 PathProgramCache]: Analyzing trace with hash -950785167, now seen corresponding path program 1 times [2022-12-06 16:39:33,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:39:33,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557539413] [2022-12-06 16:39:33,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:39:33,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:39:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:39:33,912 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:39:33,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:39:33,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557539413] [2022-12-06 16:39:33,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557539413] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:39:33,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:39:33,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:39:33,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67616450] [2022-12-06 16:39:33,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:39:33,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:39:33,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:39:33,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:39:33,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:39:33,916 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 108 [2022-12-06 16:39:33,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 105 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 88.83333333333333) internal successors, (533), 6 states have internal predecessors, (533), 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:39:33,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:39:33,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 108 [2022-12-06 16:39:33,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:39:34,266 INFO L130 PetriNetUnfolder]: 330/989 cut-off events. [2022-12-06 16:39:34,267 INFO L131 PetriNetUnfolder]: For 321/478 co-relation queries the response was YES. [2022-12-06 16:39:34,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1896 conditions, 989 events. 330/989 cut-off events. For 321/478 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6391 event pairs, 41 based on Foata normal form. 0/961 useless extension candidates. Maximal degree in co-relation 1842. Up to 273 conditions per place. [2022-12-06 16:39:34,275 INFO L137 encePairwiseOnDemand]: 102/108 looper letters, 24 selfloop transitions, 2 changer transitions 52/153 dead transitions. [2022-12-06 16:39:34,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 153 transitions, 554 flow [2022-12-06 16:39:34,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 16:39:34,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 16:39:34,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 839 transitions. [2022-12-06 16:39:34,280 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8631687242798354 [2022-12-06 16:39:34,280 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 8 predicate places. [2022-12-06 16:39:34,280 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 153 transitions, 554 flow [2022-12-06 16:39:34,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.83333333333333) internal successors, (533), 6 states have internal predecessors, (533), 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:39:34,281 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:39:34,281 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:39:34,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 16:39:34,281 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:39:34,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:39:34,282 INFO L85 PathProgramCache]: Analyzing trace with hash -303332750, now seen corresponding path program 1 times [2022-12-06 16:39:34,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:39:34,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263331497] [2022-12-06 16:39:34,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:39:34,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:39:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:39:34,502 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:39:34,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:39:34,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263331497] [2022-12-06 16:39:34,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263331497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:39:34,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:39:34,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:39:34,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761635789] [2022-12-06 16:39:34,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:39:34,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:39:34,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:39:34,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:39:34,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:39:34,506 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 108 [2022-12-06 16:39:34,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 153 transitions, 554 flow. Second operand has 7 states, 7 states have (on average 86.85714285714286) internal successors, (608), 7 states have internal predecessors, (608), 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:39:34,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:39:34,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 108 [2022-12-06 16:39:34,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:39:34,933 INFO L130 PetriNetUnfolder]: 574/1675 cut-off events. [2022-12-06 16:39:34,934 INFO L131 PetriNetUnfolder]: For 730/2068 co-relation queries the response was YES. [2022-12-06 16:39:34,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4070 conditions, 1675 events. 574/1675 cut-off events. For 730/2068 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 12699 event pairs, 27 based on Foata normal form. 6/1649 useless extension candidates. Maximal degree in co-relation 4011. Up to 485 conditions per place. [2022-12-06 16:39:34,941 INFO L137 encePairwiseOnDemand]: 100/108 looper letters, 23 selfloop transitions, 4 changer transitions 135/235 dead transitions. [2022-12-06 16:39:34,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 235 transitions, 1289 flow [2022-12-06 16:39:34,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:39:34,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:39:34,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1185 transitions. [2022-12-06 16:39:34,944 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.844017094017094 [2022-12-06 16:39:34,945 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 20 predicate places. [2022-12-06 16:39:34,945 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 235 transitions, 1289 flow [2022-12-06 16:39:34,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.85714285714286) internal successors, (608), 7 states have internal predecessors, (608), 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:39:34,946 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:39:34,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] [2022-12-06 16:39:34,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 16:39:34,946 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:39:34,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:39:34,947 INFO L85 PathProgramCache]: Analyzing trace with hash 861024329, now seen corresponding path program 1 times [2022-12-06 16:39:34,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:39:34,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046660807] [2022-12-06 16:39:34,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:39:34,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:39:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:39:35,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:39:35,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:39:35,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046660807] [2022-12-06 16:39:35,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046660807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:39:35,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:39:35,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:39:35,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246859732] [2022-12-06 16:39:35,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:39:35,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:39:35,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:39:35,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:39:35,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:39:35,213 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 108 [2022-12-06 16:39:35,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 235 transitions, 1289 flow. Second operand has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:39:35,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:39:35,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 108 [2022-12-06 16:39:35,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:39:35,903 INFO L130 PetriNetUnfolder]: 2058/4574 cut-off events. [2022-12-06 16:39:35,903 INFO L131 PetriNetUnfolder]: For 7336/7890 co-relation queries the response was YES. [2022-12-06 16:39:35,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12938 conditions, 4574 events. 2058/4574 cut-off events. For 7336/7890 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 36740 event pairs, 39 based on Foata normal form. 78/4524 useless extension candidates. Maximal degree in co-relation 12875. Up to 1521 conditions per place. [2022-12-06 16:39:35,928 INFO L137 encePairwiseOnDemand]: 98/108 looper letters, 58 selfloop transitions, 6 changer transitions 190/356 dead transitions. [2022-12-06 16:39:35,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 356 transitions, 2553 flow [2022-12-06 16:39:35,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 16:39:35,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 16:39:35,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 931 transitions. [2022-12-06 16:39:35,931 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.862037037037037 [2022-12-06 16:39:35,931 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 29 predicate places. [2022-12-06 16:39:35,931 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 356 transitions, 2553 flow [2022-12-06 16:39:35,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:39:35,932 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:39:35,932 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:39:35,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 16:39:35,932 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:39:35,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:39:35,932 INFO L85 PathProgramCache]: Analyzing trace with hash -629313700, now seen corresponding path program 1 times [2022-12-06 16:39:35,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:39:35,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279561219] [2022-12-06 16:39:35,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:39:35,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:39:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:39:36,167 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:39:36,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:39:36,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279561219] [2022-12-06 16:39:36,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279561219] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:39:36,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:39:36,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:39:36,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205479262] [2022-12-06 16:39:36,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:39:36,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:39:36,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:39:36,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:39:36,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:39:36,169 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 108 [2022-12-06 16:39:36,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 356 transitions, 2553 flow. Second operand has 7 states, 7 states have (on average 87.0) internal successors, (609), 7 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:39:36,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:39:36,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 108 [2022-12-06 16:39:36,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:39:36,756 INFO L130 PetriNetUnfolder]: 1557/3379 cut-off events. [2022-12-06 16:39:36,756 INFO L131 PetriNetUnfolder]: For 6700/7730 co-relation queries the response was YES. [2022-12-06 16:39:36,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11721 conditions, 3379 events. 1557/3379 cut-off events. For 6700/7730 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 25849 event pairs, 30 based on Foata normal form. 279/3598 useless extension candidates. Maximal degree in co-relation 11654. Up to 1065 conditions per place. [2022-12-06 16:39:36,769 INFO L137 encePairwiseOnDemand]: 98/108 looper letters, 53 selfloop transitions, 11 changer transitions 287/434 dead transitions. [2022-12-06 16:39:36,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 434 transitions, 3776 flow [2022-12-06 16:39:36,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:39:36,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:39:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1213 transitions. [2022-12-06 16:39:36,772 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.863960113960114 [2022-12-06 16:39:36,773 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 41 predicate places. [2022-12-06 16:39:36,773 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 434 transitions, 3776 flow [2022-12-06 16:39:36,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 87.0) internal successors, (609), 7 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:39:36,773 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:39:36,774 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:39:36,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 16:39:36,774 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:39:36,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:39:36,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1252809799, now seen corresponding path program 1 times [2022-12-06 16:39:36,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:39:36,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572326314] [2022-12-06 16:39:36,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:39:36,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:39:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:39:36,932 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:39:36,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:39:36,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572326314] [2022-12-06 16:39:36,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572326314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:39:36,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:39:36,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 16:39:36,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667519390] [2022-12-06 16:39:36,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:39:36,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 16:39:36,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:39:36,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 16:39:36,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 16:39:36,934 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 108 [2022-12-06 16:39:36,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 434 transitions, 3776 flow. Second operand has 8 states, 8 states have (on average 87.0) internal successors, (696), 8 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:39:36,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:39:36,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 108 [2022-12-06 16:39:36,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:39:37,480 INFO L130 PetriNetUnfolder]: 1560/3157 cut-off events. [2022-12-06 16:39:37,480 INFO L131 PetriNetUnfolder]: For 7268/8598 co-relation queries the response was YES. [2022-12-06 16:39:37,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13724 conditions, 3157 events. 1560/3157 cut-off events. For 7268/8598 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 23937 event pairs, 22 based on Foata normal form. 216/3347 useless extension candidates. Maximal degree in co-relation 13653. Up to 1016 conditions per place. [2022-12-06 16:39:37,492 INFO L137 encePairwiseOnDemand]: 98/108 looper letters, 33 selfloop transitions, 12 changer transitions 315/433 dead transitions. [2022-12-06 16:39:37,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 433 transitions, 4442 flow [2022-12-06 16:39:37,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 16:39:37,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 16:39:37,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1459 transitions. [2022-12-06 16:39:37,494 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8443287037037037 [2022-12-06 16:39:37,495 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 44 predicate places. [2022-12-06 16:39:37,495 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 433 transitions, 4442 flow [2022-12-06 16:39:37,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.0) internal successors, (696), 8 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:39:37,495 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:39:37,496 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:39:37,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 16:39:37,496 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:39:37,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:39:37,496 INFO L85 PathProgramCache]: Analyzing trace with hash -309784309, now seen corresponding path program 1 times [2022-12-06 16:39:37,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:39:37,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928277894] [2022-12-06 16:39:37,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:39:37,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:39:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:39:37,757 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:39:37,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:39:37,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928277894] [2022-12-06 16:39:37,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928277894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:39:37,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:39:37,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:39:37,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856188758] [2022-12-06 16:39:37,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:39:37,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:39:37,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:39:37,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:39:37,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:39:37,763 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 108 [2022-12-06 16:39:37,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 433 transitions, 4442 flow. Second operand has 7 states, 7 states have (on average 87.57142857142857) internal successors, (613), 7 states have internal predecessors, (613), 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:39:37,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:39:37,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 108 [2022-12-06 16:39:37,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:39:38,120 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L809-->L816: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_83 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff0_used~0_84 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_73 256) 0))))) (and (= v_~x$r_buff0_thd3~0_21 (ite .cse0 0 v_~x$r_buff0_thd3~0_22)) (= v_~x$w_buff0_used~0_83 (ite .cse1 0 v_~x$w_buff0_used~0_84)) (= v_~x$w_buff1_used~0_72 (ite (or .cse0 .cse2) 0 v_~x$w_buff1_used~0_73)) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_72 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18) v_~x$r_buff1_thd3~0_17) (= (ite .cse1 v_~x$w_buff0~0_38 (ite .cse2 v_~x$w_buff1~0_35 v_~x~0_55)) v_~x~0_54)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_73, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_84} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][219], [193#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 122#true, 70#L747true, 234#(= ~z~0 1), 71#L4true, 108#L816true, 174#(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)), 219#(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)), 119#true, 146#(and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 96#L786true]) [2022-12-06 16:39:38,121 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:39:38,121 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:39:38,121 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:39:38,121 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:39:38,121 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([316] L747-->L765: Formula: (let ((.cse11 (= (mod v_~x$r_buff1_thd1~0_46 256) 0)) (.cse1 (= (mod v_~x$r_buff0_thd1~0_44 256) 0))) (let ((.cse5 (not .cse1)) (.cse12 (= (mod v_~x$w_buff0_used~0_120 256) 0)) (.cse9 (and .cse1 (= (mod v_~x$w_buff1_used~0_101 256) 0))) (.cse4 (and .cse1 .cse11))) (let ((.cse6 (or .cse12 .cse9 .cse4)) (.cse7 (and .cse5 (not .cse12)))) (let ((.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~x$w_buff0_used~0_119 256) 0)) (.cse2 (= (mod v_~x$w_buff1_used~0_100 256) 0)) (.cse8 (ite .cse6 v_~x~0_85 (ite .cse7 v_~x$w_buff0~0_67 v_~x$w_buff1~0_60)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_44 (ite (or (and .cse1 .cse2) .cse3 .cse4) v_~x$r_buff0_thd1~0_44 (ite (and .cse5 (not .cse3)) 0 v_~x$r_buff0_thd1~0_44))) v_~x$r_buff0_thd1~0_43) (= v_~x~0_85 v_~x$mem_tmp~0_20) (= v_~x$w_buff1~0_60 v_~x$w_buff1~0_59) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= v_~x$w_buff0_used~0_119 (ite .cse0 v_~x$w_buff0_used~0_120 (ite .cse6 v_~x$w_buff0_used~0_120 (ite .cse7 0 v_~x$w_buff0_used~0_120)))) (= (ite .cse0 v_~x$mem_tmp~0_20 .cse8) v_~x~0_84) (= (ite .cse0 v_~x$w_buff1_used~0_101 (ite (or .cse3 .cse9 .cse4) v_~x$w_buff1_used~0_101 0)) v_~x$w_buff1_used~0_100) (= (ite .cse0 v_~x$r_buff1_thd1~0_46 (ite (let ((.cse10 (= (mod v_~x$r_buff0_thd1~0_43 256) 0))) (or .cse3 (and .cse10 .cse11) (and .cse10 .cse2))) v_~x$r_buff1_thd1~0_46 0)) v_~x$r_buff1_thd1~0_45) (= v_~x$w_buff0~0_67 v_~x$w_buff0~0_66) (= v_~x$flush_delayed~0_25 0) (= .cse8 v_~__unbuffered_p0_EAX~0_12)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_67, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_60, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_101, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_46, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_85, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_66, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, ~x$flush_delayed~0=v_~x$flush_delayed~0_25, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_100, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_45, ~x$mem_tmp~0=v_~x$mem_tmp~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_84} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][221], [193#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 122#true, 234#(= ~z~0 1), 71#L4true, 174#(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)), 219#(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)), 119#true, 146#(and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 96#L786true, 22#L765true, 55#L809true]) [2022-12-06 16:39:38,121 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:39:38,122 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:39:38,122 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:39:38,122 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:39:38,169 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([324] L789-->L796: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_27 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_112 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse2)) (.cse4 (and .cse5 .cse3))) (and (= v_~x~0_74 (ite .cse0 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_53 v_~x~0_75))) (= v_~x$w_buff0_used~0_111 (ite .cse0 0 v_~x$w_buff0_used~0_112)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd2~0_26 256) 0)) .cse3)) 0 v_~x$r_buff1_thd2~0_22)) (= v_~x$r_buff0_thd2~0_26 (ite .cse4 0 v_~x$r_buff0_thd2~0_27)) (= v_~x$w_buff1_used~0_92 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_27, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][189], [111#L796true, 172#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 240#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 122#true, 191#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 52#L3true, 217#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(= ~__unbuffered_p2_EAX~0 0), 22#L765true, 55#L809true]) [2022-12-06 16:39:38,170 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:39:38,170 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:39:38,170 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:39:38,170 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:39:38,170 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L809-->L816: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_83 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff0_used~0_84 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_73 256) 0))))) (and (= v_~x$r_buff0_thd3~0_21 (ite .cse0 0 v_~x$r_buff0_thd3~0_22)) (= v_~x$w_buff0_used~0_83 (ite .cse1 0 v_~x$w_buff0_used~0_84)) (= v_~x$w_buff1_used~0_72 (ite (or .cse0 .cse2) 0 v_~x$w_buff1_used~0_73)) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_72 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18) v_~x$r_buff1_thd3~0_17) (= (ite .cse1 v_~x$w_buff0~0_38 (ite .cse2 v_~x$w_buff1~0_35 v_~x~0_55)) v_~x~0_54)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_73, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_84} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][190], [172#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 240#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 73#L789true, 122#true, 191#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 108#L816true, 52#L3true, 217#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(= ~__unbuffered_p2_EAX~0 0), 22#L765true]) [2022-12-06 16:39:38,170 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:39:38,170 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:39:38,170 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:39:38,170 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:39:38,256 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L809-->L816: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_83 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff0_used~0_84 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_73 256) 0))))) (and (= v_~x$r_buff0_thd3~0_21 (ite .cse0 0 v_~x$r_buff0_thd3~0_22)) (= v_~x$w_buff0_used~0_83 (ite .cse1 0 v_~x$w_buff0_used~0_84)) (= v_~x$w_buff1_used~0_72 (ite (or .cse0 .cse2) 0 v_~x$w_buff1_used~0_73)) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_72 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18) v_~x$r_buff1_thd3~0_17) (= (ite .cse1 v_~x$w_buff0~0_38 (ite .cse2 v_~x$w_buff1~0_35 v_~x~0_55)) v_~x~0_54)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_73, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_84} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][214], [193#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 122#true, 73#L789true, 70#L747true, 108#L816true, 71#L4true, 234#(= ~z~0 1), 174#(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)), 219#(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)), 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:39:38,256 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:39:38,256 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:39:38,256 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:39:38,257 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:39:38,257 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([316] L747-->L765: Formula: (let ((.cse11 (= (mod v_~x$r_buff1_thd1~0_46 256) 0)) (.cse1 (= (mod v_~x$r_buff0_thd1~0_44 256) 0))) (let ((.cse5 (not .cse1)) (.cse12 (= (mod v_~x$w_buff0_used~0_120 256) 0)) (.cse9 (and .cse1 (= (mod v_~x$w_buff1_used~0_101 256) 0))) (.cse4 (and .cse1 .cse11))) (let ((.cse6 (or .cse12 .cse9 .cse4)) (.cse7 (and .cse5 (not .cse12)))) (let ((.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~x$w_buff0_used~0_119 256) 0)) (.cse2 (= (mod v_~x$w_buff1_used~0_100 256) 0)) (.cse8 (ite .cse6 v_~x~0_85 (ite .cse7 v_~x$w_buff0~0_67 v_~x$w_buff1~0_60)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_44 (ite (or (and .cse1 .cse2) .cse3 .cse4) v_~x$r_buff0_thd1~0_44 (ite (and .cse5 (not .cse3)) 0 v_~x$r_buff0_thd1~0_44))) v_~x$r_buff0_thd1~0_43) (= v_~x~0_85 v_~x$mem_tmp~0_20) (= v_~x$w_buff1~0_60 v_~x$w_buff1~0_59) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= v_~x$w_buff0_used~0_119 (ite .cse0 v_~x$w_buff0_used~0_120 (ite .cse6 v_~x$w_buff0_used~0_120 (ite .cse7 0 v_~x$w_buff0_used~0_120)))) (= (ite .cse0 v_~x$mem_tmp~0_20 .cse8) v_~x~0_84) (= (ite .cse0 v_~x$w_buff1_used~0_101 (ite (or .cse3 .cse9 .cse4) v_~x$w_buff1_used~0_101 0)) v_~x$w_buff1_used~0_100) (= (ite .cse0 v_~x$r_buff1_thd1~0_46 (ite (let ((.cse10 (= (mod v_~x$r_buff0_thd1~0_43 256) 0))) (or .cse3 (and .cse10 .cse11) (and .cse10 .cse2))) v_~x$r_buff1_thd1~0_46 0)) v_~x$r_buff1_thd1~0_45) (= v_~x$w_buff0~0_67 v_~x$w_buff0~0_66) (= v_~x$flush_delayed~0_25 0) (= .cse8 v_~__unbuffered_p0_EAX~0_12)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_67, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_60, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_101, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_46, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_85, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_66, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, ~x$flush_delayed~0=v_~x$flush_delayed~0_25, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_100, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_45, ~x$mem_tmp~0=v_~x$mem_tmp~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_84} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][218], [193#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 122#true, 73#L789true, 71#L4true, 234#(= ~z~0 1), 174#(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)), 219#(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)), 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(= ~__unbuffered_p2_EAX~0 0), 22#L765true, 55#L809true]) [2022-12-06 16:39:38,257 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:39:38,257 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:39:38,257 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:39:38,257 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:39:38,257 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([324] L789-->L796: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_27 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_112 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse2)) (.cse4 (and .cse5 .cse3))) (and (= v_~x~0_74 (ite .cse0 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_53 v_~x~0_75))) (= v_~x$w_buff0_used~0_111 (ite .cse0 0 v_~x$w_buff0_used~0_112)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd2~0_26 256) 0)) .cse3)) 0 v_~x$r_buff1_thd2~0_22)) (= v_~x$r_buff0_thd2~0_26 (ite .cse4 0 v_~x$r_buff0_thd2~0_27)) (= v_~x$w_buff1_used~0_92 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_27, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][226], [111#L796true, 193#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 122#true, 70#L747true, 234#(= ~z~0 1), 71#L4true, 219#(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)), 174#(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)), 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(= ~__unbuffered_p2_EAX~0 0), 55#L809true]) [2022-12-06 16:39:38,257 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:39:38,257 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:39:38,257 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:39:38,257 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:39:38,258 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L809-->L816: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_83 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff0_used~0_84 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_73 256) 0))))) (and (= v_~x$r_buff0_thd3~0_21 (ite .cse0 0 v_~x$r_buff0_thd3~0_22)) (= v_~x$w_buff0_used~0_83 (ite .cse1 0 v_~x$w_buff0_used~0_84)) (= v_~x$w_buff1_used~0_72 (ite (or .cse0 .cse2) 0 v_~x$w_buff1_used~0_73)) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_72 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18) v_~x$r_buff1_thd3~0_17) (= (ite .cse1 v_~x$w_buff0~0_38 (ite .cse2 v_~x$w_buff1~0_35 v_~x~0_55)) v_~x~0_54)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_73, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_84} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][219], [193#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 122#true, 70#L747true, 108#L816true, 234#(= ~z~0 1), 174#(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)), 219#(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)), 119#true, 146#(and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 78#L4-1true, 96#L786true]) [2022-12-06 16:39:38,258 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:39:38,258 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:39:38,258 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:39:38,258 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:39:38,258 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([316] L747-->L765: Formula: (let ((.cse11 (= (mod v_~x$r_buff1_thd1~0_46 256) 0)) (.cse1 (= (mod v_~x$r_buff0_thd1~0_44 256) 0))) (let ((.cse5 (not .cse1)) (.cse12 (= (mod v_~x$w_buff0_used~0_120 256) 0)) (.cse9 (and .cse1 (= (mod v_~x$w_buff1_used~0_101 256) 0))) (.cse4 (and .cse1 .cse11))) (let ((.cse6 (or .cse12 .cse9 .cse4)) (.cse7 (and .cse5 (not .cse12)))) (let ((.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~x$w_buff0_used~0_119 256) 0)) (.cse2 (= (mod v_~x$w_buff1_used~0_100 256) 0)) (.cse8 (ite .cse6 v_~x~0_85 (ite .cse7 v_~x$w_buff0~0_67 v_~x$w_buff1~0_60)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_44 (ite (or (and .cse1 .cse2) .cse3 .cse4) v_~x$r_buff0_thd1~0_44 (ite (and .cse5 (not .cse3)) 0 v_~x$r_buff0_thd1~0_44))) v_~x$r_buff0_thd1~0_43) (= v_~x~0_85 v_~x$mem_tmp~0_20) (= v_~x$w_buff1~0_60 v_~x$w_buff1~0_59) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= v_~x$w_buff0_used~0_119 (ite .cse0 v_~x$w_buff0_used~0_120 (ite .cse6 v_~x$w_buff0_used~0_120 (ite .cse7 0 v_~x$w_buff0_used~0_120)))) (= (ite .cse0 v_~x$mem_tmp~0_20 .cse8) v_~x~0_84) (= (ite .cse0 v_~x$w_buff1_used~0_101 (ite (or .cse3 .cse9 .cse4) v_~x$w_buff1_used~0_101 0)) v_~x$w_buff1_used~0_100) (= (ite .cse0 v_~x$r_buff1_thd1~0_46 (ite (let ((.cse10 (= (mod v_~x$r_buff0_thd1~0_43 256) 0))) (or .cse3 (and .cse10 .cse11) (and .cse10 .cse2))) v_~x$r_buff1_thd1~0_46 0)) v_~x$r_buff1_thd1~0_45) (= v_~x$w_buff0~0_67 v_~x$w_buff0~0_66) (= v_~x$flush_delayed~0_25 0) (= .cse8 v_~__unbuffered_p0_EAX~0_12)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_67, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_60, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_101, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_46, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_85, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_66, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, ~x$flush_delayed~0=v_~x$flush_delayed~0_25, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_100, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_45, ~x$mem_tmp~0=v_~x$mem_tmp~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_84} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][221], [193#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 122#true, 234#(= ~z~0 1), 174#(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)), 219#(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)), 119#true, 146#(and (= ~y~0 0) (= ~__unbuffered_p2_EAX~0 0)), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 78#L4-1true, 96#L786true, 22#L765true, 55#L809true]) [2022-12-06 16:39:38,259 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:39:38,259 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:39:38,259 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:39:38,259 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:39:38,276 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([324] L789-->L796: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_27 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_112 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse2)) (.cse4 (and .cse5 .cse3))) (and (= v_~x~0_74 (ite .cse0 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_53 v_~x~0_75))) (= v_~x$w_buff0_used~0_111 (ite .cse0 0 v_~x$w_buff0_used~0_112)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd2~0_26 256) 0)) .cse3)) 0 v_~x$r_buff1_thd2~0_22)) (= v_~x$r_buff0_thd2~0_26 (ite .cse4 0 v_~x$r_buff0_thd2~0_27)) (= v_~x$w_buff1_used~0_92 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_27, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][281], [111#L796true, 240#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 32#L770true, 122#true, 52#L3true, 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(= ~__unbuffered_p2_EAX~0 0), 195#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 221#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 176#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 55#L809true]) [2022-12-06 16:39:38,276 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,276 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,276 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,276 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,277 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L809-->L816: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_83 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff0_used~0_84 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_73 256) 0))))) (and (= v_~x$r_buff0_thd3~0_21 (ite .cse0 0 v_~x$r_buff0_thd3~0_22)) (= v_~x$w_buff0_used~0_83 (ite .cse1 0 v_~x$w_buff0_used~0_84)) (= v_~x$w_buff1_used~0_72 (ite (or .cse0 .cse2) 0 v_~x$w_buff1_used~0_73)) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_72 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18) v_~x$r_buff1_thd3~0_17) (= (ite .cse1 v_~x$w_buff0~0_38 (ite .cse2 v_~x$w_buff1~0_35 v_~x~0_55)) v_~x~0_54)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_73, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_84} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][277], [240#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 32#L770true, 73#L789true, 122#true, 108#L816true, 52#L3true, 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(= ~__unbuffered_p2_EAX~0 0), 195#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 221#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 176#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:39:38,277 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,277 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,277 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,277 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,286 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([324] L789-->L796: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_27 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_112 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse2)) (.cse4 (and .cse5 .cse3))) (and (= v_~x~0_74 (ite .cse0 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_53 v_~x~0_75))) (= v_~x$w_buff0_used~0_111 (ite .cse0 0 v_~x$w_buff0_used~0_112)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd2~0_26 256) 0)) .cse3)) 0 v_~x$r_buff1_thd2~0_22)) (= v_~x$r_buff0_thd2~0_26 (ite .cse4 0 v_~x$r_buff0_thd2~0_27)) (= v_~x$w_buff1_used~0_92 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_27, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][308], [111#L796true, 240#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 193#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 122#true, 71#L4true, 174#(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)), 219#(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)), 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(= ~__unbuffered_p2_EAX~0 0), 22#L765true, 55#L809true]) [2022-12-06 16:39:38,286 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,286 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,286 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,286 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,287 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L809-->L816: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_83 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff0_used~0_84 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_73 256) 0))))) (and (= v_~x$r_buff0_thd3~0_21 (ite .cse0 0 v_~x$r_buff0_thd3~0_22)) (= v_~x$w_buff0_used~0_83 (ite .cse1 0 v_~x$w_buff0_used~0_84)) (= v_~x$w_buff1_used~0_72 (ite (or .cse0 .cse2) 0 v_~x$w_buff1_used~0_73)) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_72 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18) v_~x$r_buff1_thd3~0_17) (= (ite .cse1 v_~x$w_buff0~0_38 (ite .cse2 v_~x$w_buff1~0_35 v_~x~0_55)) v_~x~0_54)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_73, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_84} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][298], [240#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 193#(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)), 73#L789true, 122#true, 71#L4true, 108#L816true, 174#(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)), 219#(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)), 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(= ~__unbuffered_p2_EAX~0 0), 22#L765true]) [2022-12-06 16:39:38,287 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,287 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,287 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,287 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,308 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([331] L809-->L816: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_83 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff0_used~0_84 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_73 256) 0))))) (and (= v_~x$r_buff0_thd3~0_21 (ite .cse0 0 v_~x$r_buff0_thd3~0_22)) (= v_~x$w_buff0_used~0_83 (ite .cse1 0 v_~x$w_buff0_used~0_84)) (= v_~x$w_buff1_used~0_72 (ite (or .cse0 .cse2) 0 v_~x$w_buff1_used~0_73)) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_72 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18) v_~x$r_buff1_thd3~0_17) (= (ite .cse1 v_~x$w_buff0~0_38 (ite .cse2 v_~x$w_buff1~0_35 v_~x~0_55)) v_~x~0_54)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_73, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_84} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][298], [240#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 193#(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)), 73#L789true, 122#true, 71#L4true, 108#L816true, 174#(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)), 219#(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)), 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(= ~__unbuffered_p2_EAX~0 0), 22#L765true]) [2022-12-06 16:39:38,309 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,309 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,309 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,309 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,309 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,309 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([324] L789-->L796: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_27 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_112 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse2)) (.cse4 (and .cse5 .cse3))) (and (= v_~x~0_74 (ite .cse0 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_53 v_~x~0_75))) (= v_~x$w_buff0_used~0_111 (ite .cse0 0 v_~x$w_buff0_used~0_112)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd2~0_26 256) 0)) .cse3)) 0 v_~x$r_buff1_thd2~0_22)) (= v_~x$r_buff0_thd2~0_26 (ite .cse4 0 v_~x$r_buff0_thd2~0_27)) (= v_~x$w_buff1_used~0_92 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_27, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][308], [111#L796true, 240#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 193#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 122#true, 71#L4true, 174#(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)), 219#(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)), 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(= ~__unbuffered_p2_EAX~0 0), 22#L765true, 55#L809true]) [2022-12-06 16:39:38,309 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,309 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,309 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,309 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,309 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,335 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L809-->L816: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_83 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff0_used~0_84 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_73 256) 0))))) (and (= v_~x$r_buff0_thd3~0_21 (ite .cse0 0 v_~x$r_buff0_thd3~0_22)) (= v_~x$w_buff0_used~0_83 (ite .cse1 0 v_~x$w_buff0_used~0_84)) (= v_~x$w_buff1_used~0_72 (ite (or .cse0 .cse2) 0 v_~x$w_buff1_used~0_73)) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_72 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18) v_~x$r_buff1_thd3~0_17) (= (ite .cse1 v_~x$w_buff0~0_38 (ite .cse2 v_~x$w_buff1~0_35 v_~x~0_55)) v_~x~0_54)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_73, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_84} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][214], [193#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 122#true, 73#L789true, 70#L747true, 108#L816true, 234#(= ~z~0 1), 174#(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)), 219#(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)), 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(= ~__unbuffered_p2_EAX~0 0), 78#L4-1true]) [2022-12-06 16:39:38,336 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,336 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,336 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,336 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,336 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([316] L747-->L765: Formula: (let ((.cse11 (= (mod v_~x$r_buff1_thd1~0_46 256) 0)) (.cse1 (= (mod v_~x$r_buff0_thd1~0_44 256) 0))) (let ((.cse5 (not .cse1)) (.cse12 (= (mod v_~x$w_buff0_used~0_120 256) 0)) (.cse9 (and .cse1 (= (mod v_~x$w_buff1_used~0_101 256) 0))) (.cse4 (and .cse1 .cse11))) (let ((.cse6 (or .cse12 .cse9 .cse4)) (.cse7 (and .cse5 (not .cse12)))) (let ((.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~x$w_buff0_used~0_119 256) 0)) (.cse2 (= (mod v_~x$w_buff1_used~0_100 256) 0)) (.cse8 (ite .cse6 v_~x~0_85 (ite .cse7 v_~x$w_buff0~0_67 v_~x$w_buff1~0_60)))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_44 (ite (or (and .cse1 .cse2) .cse3 .cse4) v_~x$r_buff0_thd1~0_44 (ite (and .cse5 (not .cse3)) 0 v_~x$r_buff0_thd1~0_44))) v_~x$r_buff0_thd1~0_43) (= v_~x~0_85 v_~x$mem_tmp~0_20) (= v_~x$w_buff1~0_60 v_~x$w_buff1~0_59) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= v_~x$w_buff0_used~0_119 (ite .cse0 v_~x$w_buff0_used~0_120 (ite .cse6 v_~x$w_buff0_used~0_120 (ite .cse7 0 v_~x$w_buff0_used~0_120)))) (= (ite .cse0 v_~x$mem_tmp~0_20 .cse8) v_~x~0_84) (= (ite .cse0 v_~x$w_buff1_used~0_101 (ite (or .cse3 .cse9 .cse4) v_~x$w_buff1_used~0_101 0)) v_~x$w_buff1_used~0_100) (= (ite .cse0 v_~x$r_buff1_thd1~0_46 (ite (let ((.cse10 (= (mod v_~x$r_buff0_thd1~0_43 256) 0))) (or .cse3 (and .cse10 .cse11) (and .cse10 .cse2))) v_~x$r_buff1_thd1~0_46 0)) v_~x$r_buff1_thd1~0_45) (= v_~x$w_buff0~0_67 v_~x$w_buff0~0_66) (= v_~x$flush_delayed~0_25 0) (= .cse8 v_~__unbuffered_p0_EAX~0_12)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_67, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_60, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_101, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_46, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_85, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_66, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, ~x$flush_delayed~0=v_~x$flush_delayed~0_25, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_100, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_45, ~x$mem_tmp~0=v_~x$mem_tmp~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_84} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][218], [193#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 122#true, 73#L789true, 234#(= ~z~0 1), 174#(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)), 219#(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)), 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(= ~__unbuffered_p2_EAX~0 0), 78#L4-1true, 22#L765true, 55#L809true]) [2022-12-06 16:39:38,337 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,337 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,337 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,337 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,337 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([324] L789-->L796: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_27 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_112 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse2)) (.cse4 (and .cse5 .cse3))) (and (= v_~x~0_74 (ite .cse0 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_53 v_~x~0_75))) (= v_~x$w_buff0_used~0_111 (ite .cse0 0 v_~x$w_buff0_used~0_112)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd2~0_26 256) 0)) .cse3)) 0 v_~x$r_buff1_thd2~0_22)) (= v_~x$r_buff0_thd2~0_26 (ite .cse4 0 v_~x$r_buff0_thd2~0_27)) (= v_~x$w_buff1_used~0_92 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_27, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][226], [111#L796true, 193#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 122#true, 70#L747true, 234#(= ~z~0 1), 174#(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)), 219#(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)), 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 141#(= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork2InUse, 78#L4-1true, 55#L809true]) [2022-12-06 16:39:38,337 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,337 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,337 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,337 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:39:38,353 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([324] L789-->L796: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_27 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_112 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse2)) (.cse4 (and .cse5 .cse3))) (and (= v_~x~0_74 (ite .cse0 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_53 v_~x~0_75))) (= v_~x$w_buff0_used~0_111 (ite .cse0 0 v_~x$w_buff0_used~0_112)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd2~0_26 256) 0)) .cse3)) 0 v_~x$r_buff1_thd2~0_22)) (= v_~x$r_buff0_thd2~0_26 (ite .cse4 0 v_~x$r_buff0_thd2~0_27)) (= v_~x$w_buff1_used~0_92 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_27, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][378], [111#L796true, 240#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 32#L770true, 122#true, 71#L4true, 197#(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)), 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(= ~__unbuffered_p2_EAX~0 0), 223#(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)), 55#L809true, 178#(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))]) [2022-12-06 16:39:38,353 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,353 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,353 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,353 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,354 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L809-->L816: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_83 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff0_used~0_84 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_73 256) 0))))) (and (= v_~x$r_buff0_thd3~0_21 (ite .cse0 0 v_~x$r_buff0_thd3~0_22)) (= v_~x$w_buff0_used~0_83 (ite .cse1 0 v_~x$w_buff0_used~0_84)) (= v_~x$w_buff1_used~0_72 (ite (or .cse0 .cse2) 0 v_~x$w_buff1_used~0_73)) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_72 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18) v_~x$r_buff1_thd3~0_17) (= (ite .cse1 v_~x$w_buff0~0_38 (ite .cse2 v_~x$w_buff1~0_35 v_~x~0_55)) v_~x~0_54)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_73, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_84} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][377], [240#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 32#L770true, 73#L789true, 122#true, 71#L4true, 108#L816true, 197#(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)), 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(= ~__unbuffered_p2_EAX~0 0), 223#(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)), 178#(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))]) [2022-12-06 16:39:38,354 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,354 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,354 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,354 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,362 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([324] L789-->L796: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_27 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_112 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse2)) (.cse4 (and .cse5 .cse3))) (and (= v_~x~0_74 (ite .cse0 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_53 v_~x~0_75))) (= v_~x$w_buff0_used~0_111 (ite .cse0 0 v_~x$w_buff0_used~0_112)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd2~0_26 256) 0)) .cse3)) 0 v_~x$r_buff1_thd2~0_22)) (= v_~x$r_buff0_thd2~0_26 (ite .cse4 0 v_~x$r_buff0_thd2~0_27)) (= v_~x$w_buff1_used~0_92 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_27, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][308], [111#L796true, 240#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 193#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 122#true, 174#(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)), 219#(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)), 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(= ~__unbuffered_p2_EAX~0 0), 78#L4-1true, 22#L765true, 55#L809true]) [2022-12-06 16:39:38,362 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,362 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,362 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,362 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,363 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L809-->L816: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_83 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff0_used~0_84 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_73 256) 0))))) (and (= v_~x$r_buff0_thd3~0_21 (ite .cse0 0 v_~x$r_buff0_thd3~0_22)) (= v_~x$w_buff0_used~0_83 (ite .cse1 0 v_~x$w_buff0_used~0_84)) (= v_~x$w_buff1_used~0_72 (ite (or .cse0 .cse2) 0 v_~x$w_buff1_used~0_73)) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_72 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18) v_~x$r_buff1_thd3~0_17) (= (ite .cse1 v_~x$w_buff0~0_38 (ite .cse2 v_~x$w_buff1~0_35 v_~x~0_55)) v_~x~0_54)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_73, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_84} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][298], [240#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 193#(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)), 73#L789true, 122#true, 108#L816true, 174#(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)), 219#(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)), 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(= ~__unbuffered_p2_EAX~0 0), 78#L4-1true, 22#L765true]) [2022-12-06 16:39:38,363 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,363 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,363 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,363 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,386 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([331] L809-->L816: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_83 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff0_used~0_84 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_73 256) 0))))) (and (= v_~x$r_buff0_thd3~0_21 (ite .cse0 0 v_~x$r_buff0_thd3~0_22)) (= v_~x$w_buff0_used~0_83 (ite .cse1 0 v_~x$w_buff0_used~0_84)) (= v_~x$w_buff1_used~0_72 (ite (or .cse0 .cse2) 0 v_~x$w_buff1_used~0_73)) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_72 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18) v_~x$r_buff1_thd3~0_17) (= (ite .cse1 v_~x$w_buff0~0_38 (ite .cse2 v_~x$w_buff1~0_35 v_~x~0_55)) v_~x~0_54)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_73, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_84} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][298], [240#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 193#(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)), 73#L789true, 122#true, 108#L816true, 174#(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)), 219#(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)), 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(= ~__unbuffered_p2_EAX~0 0), 78#L4-1true, 22#L765true]) [2022-12-06 16:39:38,386 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,386 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,386 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,386 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,387 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,387 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([324] L789-->L796: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_27 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_112 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse2)) (.cse4 (and .cse5 .cse3))) (and (= v_~x~0_74 (ite .cse0 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_53 v_~x~0_75))) (= v_~x$w_buff0_used~0_111 (ite .cse0 0 v_~x$w_buff0_used~0_112)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd2~0_26 256) 0)) .cse3)) 0 v_~x$r_buff1_thd2~0_22)) (= v_~x$r_buff0_thd2~0_26 (ite .cse4 0 v_~x$r_buff0_thd2~0_27)) (= v_~x$w_buff1_used~0_92 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_27, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][308], [111#L796true, 240#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 193#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 122#true, 174#(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)), 219#(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)), 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(= ~__unbuffered_p2_EAX~0 0), 78#L4-1true, 22#L765true, 55#L809true]) [2022-12-06 16:39:38,387 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,387 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,387 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,387 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,387 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,388 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([331] L809-->L816: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_83 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff0_used~0_84 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_73 256) 0))))) (and (= v_~x$r_buff0_thd3~0_21 (ite .cse0 0 v_~x$r_buff0_thd3~0_22)) (= v_~x$w_buff0_used~0_83 (ite .cse1 0 v_~x$w_buff0_used~0_84)) (= v_~x$w_buff1_used~0_72 (ite (or .cse0 .cse2) 0 v_~x$w_buff1_used~0_73)) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_72 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18) v_~x$r_buff1_thd3~0_17) (= (ite .cse1 v_~x$w_buff0~0_38 (ite .cse2 v_~x$w_buff1~0_35 v_~x~0_55)) v_~x~0_54)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_73, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_84} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][377], [240#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 32#L770true, 122#true, 73#L789true, 108#L816true, 71#L4true, 197#(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)), 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(= ~__unbuffered_p2_EAX~0 0), 223#(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)), 178#(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))]) [2022-12-06 16:39:38,388 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,388 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,388 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,388 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,388 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,389 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([324] L789-->L796: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_27 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_112 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse2)) (.cse4 (and .cse5 .cse3))) (and (= v_~x~0_74 (ite .cse0 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_53 v_~x~0_75))) (= v_~x$w_buff0_used~0_111 (ite .cse0 0 v_~x$w_buff0_used~0_112)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd2~0_26 256) 0)) .cse3)) 0 v_~x$r_buff1_thd2~0_22)) (= v_~x$r_buff0_thd2~0_26 (ite .cse4 0 v_~x$r_buff0_thd2~0_27)) (= v_~x$w_buff1_used~0_92 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_27, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][378], [111#L796true, 240#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 32#L770true, 122#true, 71#L4true, 197#(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)), 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(= ~__unbuffered_p2_EAX~0 0), 223#(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)), 178#(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)), 55#L809true]) [2022-12-06 16:39:38,389 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,389 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,389 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,389 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,389 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:38,426 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([324] L789-->L796: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_27 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_112 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse2)) (.cse4 (and .cse5 .cse3))) (and (= v_~x~0_74 (ite .cse0 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_53 v_~x~0_75))) (= v_~x$w_buff0_used~0_111 (ite .cse0 0 v_~x$w_buff0_used~0_112)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd2~0_26 256) 0)) .cse3)) 0 v_~x$r_buff1_thd2~0_22)) (= v_~x$r_buff0_thd2~0_26 (ite .cse4 0 v_~x$r_buff0_thd2~0_27)) (= v_~x$w_buff1_used~0_92 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_27, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][378], [111#L796true, 240#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 32#L770true, 122#true, 197#(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)), 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(= ~__unbuffered_p2_EAX~0 0), 78#L4-1true, 223#(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)), 55#L809true, 178#(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))]) [2022-12-06 16:39:38,426 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-06 16:39:38,426 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:39:38,426 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:39:38,426 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:39:38,427 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L809-->L816: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_83 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff0_used~0_84 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_73 256) 0))))) (and (= v_~x$r_buff0_thd3~0_21 (ite .cse0 0 v_~x$r_buff0_thd3~0_22)) (= v_~x$w_buff0_used~0_83 (ite .cse1 0 v_~x$w_buff0_used~0_84)) (= v_~x$w_buff1_used~0_72 (ite (or .cse0 .cse2) 0 v_~x$w_buff1_used~0_73)) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_72 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18) v_~x$r_buff1_thd3~0_17) (= (ite .cse1 v_~x$w_buff0~0_38 (ite .cse2 v_~x$w_buff1~0_35 v_~x~0_55)) v_~x~0_54)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_73, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_84} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][377], [240#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 32#L770true, 73#L789true, 122#true, 108#L816true, 197#(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)), 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(= ~__unbuffered_p2_EAX~0 0), 78#L4-1true, 223#(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)), 178#(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))]) [2022-12-06 16:39:38,427 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-06 16:39:38,427 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:39:38,427 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:39:38,427 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:39:38,455 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([331] L809-->L816: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_83 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff0_used~0_84 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_73 256) 0))))) (and (= v_~x$r_buff0_thd3~0_21 (ite .cse0 0 v_~x$r_buff0_thd3~0_22)) (= v_~x$w_buff0_used~0_83 (ite .cse1 0 v_~x$w_buff0_used~0_84)) (= v_~x$w_buff1_used~0_72 (ite (or .cse0 .cse2) 0 v_~x$w_buff1_used~0_73)) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_72 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18) v_~x$r_buff1_thd3~0_17) (= (ite .cse1 v_~x$w_buff0~0_38 (ite .cse2 v_~x$w_buff1~0_35 v_~x~0_55)) v_~x~0_54)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_73, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_84} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][377], [240#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 32#L770true, 122#true, 73#L789true, 108#L816true, 197#(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)), 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(= ~__unbuffered_p2_EAX~0 0), 78#L4-1true, 223#(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)), 178#(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))]) [2022-12-06 16:39:38,455 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-06 16:39:38,455 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:39:38,455 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:39:38,455 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:39:38,456 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:39:38,456 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([324] L789-->L796: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_27 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_112 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse2)) (.cse4 (and .cse5 .cse3))) (and (= v_~x~0_74 (ite .cse0 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_53 v_~x~0_75))) (= v_~x$w_buff0_used~0_111 (ite .cse0 0 v_~x$w_buff0_used~0_112)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd2~0_26 256) 0)) .cse3)) 0 v_~x$r_buff1_thd2~0_22)) (= v_~x$r_buff0_thd2~0_26 (ite .cse4 0 v_~x$r_buff0_thd2~0_27)) (= v_~x$w_buff1_used~0_92 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_27, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][378], [111#L796true, 240#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 32#L770true, 122#true, 197#(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)), 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(= ~__unbuffered_p2_EAX~0 0), 78#L4-1true, 223#(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)), 55#L809true, 178#(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))]) [2022-12-06 16:39:38,456 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-06 16:39:38,456 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:39:38,456 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:39:38,456 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:39:38,456 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:39:38,609 INFO L130 PetriNetUnfolder]: 3742/7241 cut-off events. [2022-12-06 16:39:38,609 INFO L131 PetriNetUnfolder]: For 33099/36497 co-relation queries the response was YES. [2022-12-06 16:39:38,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35025 conditions, 7241 events. 3742/7241 cut-off events. For 33099/36497 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 61471 event pairs, 87 based on Foata normal form. 671/7816 useless extension candidates. Maximal degree in co-relation 34949. Up to 2574 conditions per place. [2022-12-06 16:39:38,636 INFO L137 encePairwiseOnDemand]: 102/108 looper letters, 31 selfloop transitions, 1 changer transitions 590/700 dead transitions. [2022-12-06 16:39:38,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 700 transitions, 9139 flow [2022-12-06 16:39:38,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 16:39:38,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 16:39:38,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 631 transitions. [2022-12-06 16:39:38,637 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8346560846560847 [2022-12-06 16:39:38,638 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 50 predicate places. [2022-12-06 16:39:38,638 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 700 transitions, 9139 flow [2022-12-06 16:39:38,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 87.57142857142857) internal successors, (613), 7 states have internal predecessors, (613), 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:39:38,638 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:39:38,638 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:39:38,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 16:39:38,639 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:39:38,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:39:38,639 INFO L85 PathProgramCache]: Analyzing trace with hash 580017767, now seen corresponding path program 2 times [2022-12-06 16:39:38,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:39:38,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231219022] [2022-12-06 16:39:38,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:39:38,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:39:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:39:39,260 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:39:39,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:39:39,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231219022] [2022-12-06 16:39:39,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231219022] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:39:39,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:39:39,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-06 16:39:39,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882601398] [2022-12-06 16:39:39,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:39:39,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 16:39:39,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:39:39,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 16:39:39,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-06 16:39:39,262 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 108 [2022-12-06 16:39:39,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 700 transitions, 9139 flow. Second operand has 11 states, 11 states have (on average 80.27272727272727) internal successors, (883), 11 states have internal predecessors, (883), 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:39:39,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:39:39,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 108 [2022-12-06 16:39:39,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:39:40,028 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L809-->L816: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_83 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff0_used~0_84 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_73 256) 0))))) (and (= v_~x$r_buff0_thd3~0_21 (ite .cse0 0 v_~x$r_buff0_thd3~0_22)) (= v_~x$w_buff0_used~0_83 (ite .cse1 0 v_~x$w_buff0_used~0_84)) (= v_~x$w_buff1_used~0_72 (ite (or .cse0 .cse2) 0 v_~x$w_buff1_used~0_73)) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_72 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18) v_~x$r_buff1_thd3~0_17) (= (ite .cse1 v_~x$w_buff0~0_38 (ite .cse2 v_~x$w_buff1~0_35 v_~x~0_55)) v_~x~0_54)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_73, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_84} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][420], [240#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 247#true, 32#L770true, 122#true, 73#L789true, 108#L816true, 52#L3true, 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(= ~__unbuffered_p2_EAX~0 0), 195#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 221#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 176#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0))]) [2022-12-06 16:39:40,028 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is not cut-off event [2022-12-06 16:39:40,028 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-12-06 16:39:40,028 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-12-06 16:39:40,028 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-12-06 16:39:40,029 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([324] L789-->L796: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_27 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_112 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse2)) (.cse4 (and .cse5 .cse3))) (and (= v_~x~0_74 (ite .cse0 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_53 v_~x~0_75))) (= v_~x$w_buff0_used~0_111 (ite .cse0 0 v_~x$w_buff0_used~0_112)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd2~0_26 256) 0)) .cse3)) 0 v_~x$r_buff1_thd2~0_22)) (= v_~x$r_buff0_thd2~0_26 (ite .cse4 0 v_~x$r_buff0_thd2~0_27)) (= v_~x$w_buff1_used~0_92 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_27, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][421], [111#L796true, 240#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 247#true, 32#L770true, 122#true, 52#L3true, 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(= ~__unbuffered_p2_EAX~0 0), 195#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 221#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 176#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 55#L809true]) [2022-12-06 16:39:40,029 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is not cut-off event [2022-12-06 16:39:40,029 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-12-06 16:39:40,029 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-12-06 16:39:40,029 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-12-06 16:39:40,110 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([324] L789-->L796: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_27 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_112 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse2)) (.cse4 (and .cse5 .cse3))) (and (= v_~x~0_74 (ite .cse0 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_53 v_~x~0_75))) (= v_~x$w_buff0_used~0_111 (ite .cse0 0 v_~x$w_buff0_used~0_112)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd2~0_26 256) 0)) .cse3)) 0 v_~x$r_buff1_thd2~0_22)) (= v_~x$r_buff0_thd2~0_26 (ite .cse4 0 v_~x$r_buff0_thd2~0_27)) (= v_~x$w_buff1_used~0_92 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_27, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][490], [111#L796true, 240#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 247#true, 32#L770true, 122#true, 71#L4true, 197#(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)), 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(= ~__unbuffered_p2_EAX~0 0), 223#(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)), 55#L809true, 178#(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))]) [2022-12-06 16:39:40,110 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:39:40,110 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:40,110 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:40,110 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:40,110 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L809-->L816: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_83 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff0_used~0_84 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_73 256) 0))))) (and (= v_~x$r_buff0_thd3~0_21 (ite .cse0 0 v_~x$r_buff0_thd3~0_22)) (= v_~x$w_buff0_used~0_83 (ite .cse1 0 v_~x$w_buff0_used~0_84)) (= v_~x$w_buff1_used~0_72 (ite (or .cse0 .cse2) 0 v_~x$w_buff1_used~0_73)) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_72 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18) v_~x$r_buff1_thd3~0_17) (= (ite .cse1 v_~x$w_buff0~0_38 (ite .cse2 v_~x$w_buff1~0_35 v_~x~0_55)) v_~x~0_54)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_73, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_84} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][494], [240#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 247#true, 32#L770true, 73#L789true, 122#true, 71#L4true, 108#L816true, 197#(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)), 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 141#(= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork2InUse, 223#(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)), 178#(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))]) [2022-12-06 16:39:40,110 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-06 16:39:40,110 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:40,111 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:40,111 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 16:39:40,249 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([324] L789-->L796: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_27 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_112 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse2)) (.cse4 (and .cse5 .cse3))) (and (= v_~x~0_74 (ite .cse0 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_53 v_~x~0_75))) (= v_~x$w_buff0_used~0_111 (ite .cse0 0 v_~x$w_buff0_used~0_112)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd2~0_26 256) 0)) .cse3)) 0 v_~x$r_buff1_thd2~0_22)) (= v_~x$r_buff0_thd2~0_26 (ite .cse4 0 v_~x$r_buff0_thd2~0_27)) (= v_~x$w_buff1_used~0_92 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_27, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][490], [111#L796true, 240#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 247#true, 32#L770true, 122#true, 197#(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)), 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(= ~__unbuffered_p2_EAX~0 0), 78#L4-1true, 223#(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)), 55#L809true, 178#(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))]) [2022-12-06 16:39:40,249 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-06 16:39:40,250 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:39:40,250 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:39:40,250 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:39:40,250 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L809-->L816: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_83 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff0_used~0_84 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_73 256) 0))))) (and (= v_~x$r_buff0_thd3~0_21 (ite .cse0 0 v_~x$r_buff0_thd3~0_22)) (= v_~x$w_buff0_used~0_83 (ite .cse1 0 v_~x$w_buff0_used~0_84)) (= v_~x$w_buff1_used~0_72 (ite (or .cse0 .cse2) 0 v_~x$w_buff1_used~0_73)) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_72 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18) v_~x$r_buff1_thd3~0_17) (= (ite .cse1 v_~x$w_buff0~0_38 (ite .cse2 v_~x$w_buff1~0_35 v_~x~0_55)) v_~x~0_54)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_73, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_84} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][494], [240#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 247#true, 32#L770true, 73#L789true, 122#true, 108#L816true, 197#(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)), 119#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 141#(= ~__unbuffered_p2_EAX~0 0), 78#L4-1true, 223#(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)), 178#(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))]) [2022-12-06 16:39:40,250 INFO L382 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-12-06 16:39:40,250 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:39:40,250 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:39:40,250 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 16:39:40,596 INFO L130 PetriNetUnfolder]: 5023/10602 cut-off events. [2022-12-06 16:39:40,596 INFO L131 PetriNetUnfolder]: For 51341/56867 co-relation queries the response was YES. [2022-12-06 16:39:40,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50394 conditions, 10602 events. 5023/10602 cut-off events. For 51341/56867 co-relation queries the response was YES. Maximal size of possible extension queue 874. Compared 102339 event pairs, 89 based on Foata normal form. 723/11219 useless extension candidates. Maximal degree in co-relation 50306. Up to 2977 conditions per place. [2022-12-06 16:39:40,662 INFO L137 encePairwiseOnDemand]: 93/108 looper letters, 27 selfloop transitions, 7 changer transitions 994/1099 dead transitions. [2022-12-06 16:39:40,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 1099 transitions, 17121 flow [2022-12-06 16:39:40,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 16:39:40,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 16:39:40,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 914 transitions. [2022-12-06 16:39:40,665 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7693602693602694 [2022-12-06 16:39:40,666 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 60 predicate places. [2022-12-06 16:39:40,666 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 1099 transitions, 17121 flow [2022-12-06 16:39:40,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 80.27272727272727) internal successors, (883), 11 states have internal predecessors, (883), 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:39:40,666 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:39:40,667 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:39:40,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 16:39:40,667 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:39:40,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:39:40,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1906506009, now seen corresponding path program 3 times [2022-12-06 16:39:40,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:39:40,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816708336] [2022-12-06 16:39:40,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:39:40,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:39:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 16:39:40,721 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 16:39:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 16:39:40,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 16:39:40,802 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 16:39:40,803 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 16:39:40,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 16:39:40,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 16:39:40,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 16:39:40,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 16:39:40,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 16:39:40,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 16:39:40,806 INFO L458 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2022-12-06 16:39:40,812 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 16:39:40,812 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 16:39:40,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:39:40 BasicIcfg [2022-12-06 16:39:40,887 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 16:39:40,888 INFO L158 Benchmark]: Toolchain (without parser) took 9150.61ms. Allocated memory was 206.6MB in the beginning and 1.2GB in the end (delta: 984.6MB). Free memory was 181.1MB in the beginning and 634.5MB in the end (delta: -453.4MB). Peak memory consumption was 531.4MB. Max. memory is 8.0GB. [2022-12-06 16:39:40,888 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 206.6MB. Free memory is still 182.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 16:39:40,888 INFO L158 Benchmark]: CACSL2BoogieTranslator took 491.36ms. Allocated memory is still 206.6MB. Free memory was 180.8MB in the beginning and 154.6MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 16:39:40,888 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.01ms. Allocated memory is still 206.6MB. Free memory was 154.6MB in the beginning and 152.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 16:39:40,888 INFO L158 Benchmark]: Boogie Preprocessor took 21.53ms. Allocated memory is still 206.6MB. Free memory was 152.5MB in the beginning and 150.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 16:39:40,889 INFO L158 Benchmark]: RCFGBuilder took 525.12ms. Allocated memory is still 206.6MB. Free memory was 150.4MB in the beginning and 118.4MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-06 16:39:40,889 INFO L158 Benchmark]: TraceAbstraction took 8053.86ms. Allocated memory was 206.6MB in the beginning and 1.2GB in the end (delta: 984.6MB). Free memory was 117.9MB in the beginning and 634.5MB in the end (delta: -516.6MB). Peak memory consumption was 468.5MB. Max. memory is 8.0GB. [2022-12-06 16:39:40,890 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 206.6MB. Free memory is still 182.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 491.36ms. Allocated memory is still 206.6MB. Free memory was 180.8MB in the beginning and 154.6MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.01ms. Allocated memory is still 206.6MB. Free memory was 154.6MB in the beginning and 152.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.53ms. Allocated memory is still 206.6MB. Free memory was 152.5MB in the beginning and 150.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 525.12ms. Allocated memory is still 206.6MB. Free memory was 150.4MB in the beginning and 118.4MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 8053.86ms. Allocated memory was 206.6MB in the beginning and 1.2GB in the end (delta: 984.6MB). Free memory was 117.9MB in the beginning and 634.5MB in the end (delta: -516.6MB). Peak memory consumption was 468.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L722] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L723] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L724] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L725] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L726] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L727] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L728] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L729] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L730] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L731] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L732] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L733] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L734] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L735] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L736] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L738] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L740] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L741] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L742] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L833] 0 pthread_t t2345; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2345={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t2345, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2345, ((void *)0), P0, ((void *)0))=-2, t2345={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t2346; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2345={5:0}, t2346={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L836] FCALL, FORK 0 pthread_create(&t2346, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2346, ((void *)0), P1, ((void *)0))=-1, t2345={5:0}, t2346={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L776] 2 x$w_buff1 = x$w_buff0 [L777] 2 x$w_buff0 = 1 [L778] 2 x$w_buff1_used = x$w_buff0_used [L779] 2 x$w_buff0_used = (_Bool)1 [L780] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L780] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L781] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L782] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L783] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L784] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L785] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t2347; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2345={5:0}, t2346={6:0}, t2347={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L838] FCALL, FORK 0 pthread_create(&t2347, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t2347, ((void *)0), P2, ((void *)0))=0, t2345={5:0}, t2346={6:0}, t2347={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L808] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L811] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L812] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L813] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L814] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L815] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L746] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L751] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 1 x$flush_delayed = weak$$choice2 [L754] 1 x$mem_tmp = x [L755] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L757] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L758] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L759] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L761] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 __unbuffered_p0_EAX = x [L763] 1 x = x$flush_delayed ? x$mem_tmp : x [L764] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=66, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=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=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=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, t2345={5:0}, t2346={6:0}, t2347={3:0}, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=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=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L845] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L846] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L847] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L848] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=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, t2345={5:0}, t2346={6:0}, t2347={3:0}, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L851] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=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, t2345={5:0}, t2346={6:0}, t2347={3:0}, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 838]: 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: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.9s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 538 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 538 mSDsluCounter, 362 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 300 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 930 IncrementalHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 62 mSDtfsCounter, 930 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17121occurred in iteration=8, InterpolantAutomatonStates: 82, 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.0s InterpolantComputationTime, 676 NumberOfCodeBlocks, 676 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 584 ConstructedInterpolants, 0 QuantifiedInterpolants, 2039 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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:39:40,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...