/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/mix019_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 20:54:36,185 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 20:54:36,187 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 20:54:36,223 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 20:54:36,224 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 20:54:36,226 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 20:54:36,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 20:54:36,233 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 20:54:36,237 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 20:54:36,243 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 20:54:36,244 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 20:54:36,246 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 20:54:36,246 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 20:54:36,248 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 20:54:36,249 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 20:54:36,250 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 20:54:36,250 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 20:54:36,251 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 20:54:36,252 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 20:54:36,253 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 20:54:36,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 20:54:36,255 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 20:54:36,256 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 20:54:36,257 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 20:54:36,259 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 20:54:36,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 20:54:36,260 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 20:54:36,260 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 20:54:36,261 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 20:54:36,262 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 20:54:36,262 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 20:54:36,262 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 20:54:36,263 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 20:54:36,264 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 20:54:36,264 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 20:54:36,265 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 20:54:36,265 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 20:54:36,265 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 20:54:36,266 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 20:54:36,266 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 20:54:36,272 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 20:54:36,273 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-11 20:54:36,305 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 20:54:36,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 20:54:36,307 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 20:54:36,307 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 20:54:36,308 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 20:54:36,308 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 20:54:36,308 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 20:54:36,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 20:54:36,309 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 20:54:36,309 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 20:54:36,310 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 20:54:36,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 20:54:36,310 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 20:54:36,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 20:54:36,310 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 20:54:36,310 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 20:54:36,310 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 20:54:36,311 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 20:54:36,311 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 20:54:36,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 20:54:36,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 20:54:36,311 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 20:54:36,311 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 20:54:36,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 20:54:36,312 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 20:54:36,312 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 20:54:36,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 20:54:36,312 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 20:54:36,312 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 20:54:36,312 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 20:54:36,313 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 20:54:36,313 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-11 20:54:36,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 20:54:36,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 20:54:36,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 20:54:36,634 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 20:54:36,635 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 20:54:36,636 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i [2022-12-11 20:54:37,830 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 20:54:38,127 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 20:54:38,128 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i [2022-12-11 20:54:38,142 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54af31761/6b477c5029ba45dca29048200ea7a9f0/FLAGb349ec712 [2022-12-11 20:54:38,161 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54af31761/6b477c5029ba45dca29048200ea7a9f0 [2022-12-11 20:54:38,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 20:54:38,164 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 20:54:38,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 20:54:38,165 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 20:54:38,167 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 20:54:38,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 08:54:38" (1/1) ... [2022-12-11 20:54:38,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@528749b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:54:38, skipping insertion in model container [2022-12-11 20:54:38,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 08:54:38" (1/1) ... [2022-12-11 20:54:38,174 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 20:54:38,225 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 20:54:38,341 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/mix019_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-11 20:54:38,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:38,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:38,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:38,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:38,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:38,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:38,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:38,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:38,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:38,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:38,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:38,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:38,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:38,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:38,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:38,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:38,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:38,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:38,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:38,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:38,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:38,562 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:38,562 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:38,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:38,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:38,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:38,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:38,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:38,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:38,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:38,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:38,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:38,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 20:54:38,599 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 20:54:38,613 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/mix019_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-11 20:54:38,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:38,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:38,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:38,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:38,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:38,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:38,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:38,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:38,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:38,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:38,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:38,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:38,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:38,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:38,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:38,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:38,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:38,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:38,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:38,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:38,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:38,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:38,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:38,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:38,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:38,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:38,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:38,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:38,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:38,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:38,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:54:38,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:54:38,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 20:54:38,734 INFO L208 MainTranslator]: Completed translation [2022-12-11 20:54:38,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:54:38 WrapperNode [2022-12-11 20:54:38,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 20:54:38,736 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 20:54:38,736 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 20:54:38,737 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 20:54:38,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:54:38" (1/1) ... [2022-12-11 20:54:38,772 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:54:38" (1/1) ... [2022-12-11 20:54:38,802 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2022-12-11 20:54:38,802 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 20:54:38,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 20:54:38,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 20:54:38,804 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 20:54:38,810 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:54:38" (1/1) ... [2022-12-11 20:54:38,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:54:38" (1/1) ... [2022-12-11 20:54:38,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:54:38" (1/1) ... [2022-12-11 20:54:38,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:54:38" (1/1) ... [2022-12-11 20:54:38,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:54:38" (1/1) ... [2022-12-11 20:54:38,832 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:54:38" (1/1) ... [2022-12-11 20:54:38,835 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:54:38" (1/1) ... [2022-12-11 20:54:38,836 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:54:38" (1/1) ... [2022-12-11 20:54:38,849 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 20:54:38,851 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 20:54:38,851 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 20:54:38,851 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 20:54:38,852 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:54:38" (1/1) ... [2022-12-11 20:54:38,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 20:54:38,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 20:54:38,885 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-11 20:54:38,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-11 20:54:38,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 20:54:38,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 20:54:38,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 20:54:38,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 20:54:38,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 20:54:38,926 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 20:54:38,926 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 20:54:38,926 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 20:54:38,926 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 20:54:38,926 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-11 20:54:38,926 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-11 20:54:38,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 20:54:38,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 20:54:38,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 20:54:38,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 20:54:38,928 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 20:54:39,073 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 20:54:39,075 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 20:54:39,459 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 20:54:39,549 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 20:54:39,550 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 20:54:39,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 08:54:39 BoogieIcfgContainer [2022-12-11 20:54:39,558 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 20:54:39,560 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 20:54:39,560 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 20:54:39,563 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 20:54:39,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 08:54:38" (1/3) ... [2022-12-11 20:54:39,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6268ffad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 08:54:39, skipping insertion in model container [2022-12-11 20:54:39,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:54:38" (2/3) ... [2022-12-11 20:54:39,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6268ffad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 08:54:39, skipping insertion in model container [2022-12-11 20:54:39,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 08:54:39" (3/3) ... [2022-12-11 20:54:39,566 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019_power.oepc_pso.oepc_rmo.oepc.i [2022-12-11 20:54:39,583 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 20:54:39,583 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 20:54:39,583 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 20:54:39,654 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 20:54:39,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 235 flow [2022-12-11 20:54:39,755 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-11 20:54:39,755 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 20:54:39,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-11 20:54:39,762 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 110 transitions, 235 flow [2022-12-11 20:54:39,767 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 107 transitions, 223 flow [2022-12-11 20:54:39,782 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 20:54:39,789 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;@1a8666d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 20:54:39,790 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-11 20:54:39,806 INFO L130 PetriNetUnfolder]: 0/44 cut-off events. [2022-12-11 20:54:39,806 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 20:54:39,806 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:54:39,807 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:54:39,808 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 20:54:39,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:54:39,814 INFO L85 PathProgramCache]: Analyzing trace with hash -650301474, now seen corresponding path program 1 times [2022-12-11 20:54:39,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:54:39,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991336205] [2022-12-11 20:54:39,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:54:39,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:54:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:54:40,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:54:40,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:54:40,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991336205] [2022-12-11 20:54:40,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991336205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:54:40,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:54:40,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 20:54:40,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970289784] [2022-12-11 20:54:40,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:54:40,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 20:54:40,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:54:40,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 20:54:40,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 20:54:40,477 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110 [2022-12-11 20:54:40,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 107 transitions, 223 flow. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:54:40,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:54:40,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110 [2022-12-11 20:54:40,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:54:40,591 INFO L130 PetriNetUnfolder]: 58/271 cut-off events. [2022-12-11 20:54:40,591 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-11 20:54:40,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 271 events. 58/271 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1102 event pairs, 10 based on Foata normal form. 25/280 useless extension candidates. Maximal degree in co-relation 350. Up to 79 conditions per place. [2022-12-11 20:54:40,595 INFO L137 encePairwiseOnDemand]: 105/110 looper letters, 14 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2022-12-11 20:54:40,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 109 transitions, 265 flow [2022-12-11 20:54:40,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 20:54:40,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 20:54:40,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2022-12-11 20:54:40,607 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9363636363636364 [2022-12-11 20:54:40,611 INFO L295 CegarLoopForPetriNet]: 115 programPoint places, 0 predicate places. [2022-12-11 20:54:40,612 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 109 transitions, 265 flow [2022-12-11 20:54:40,616 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 109 transitions, 265 flow [2022-12-11 20:54:40,617 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 109 transitions, 265 flow [2022-12-11 20:54:40,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:54:40,618 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:54:40,618 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:54:40,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 20:54:40,618 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 20:54:40,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:54:40,619 INFO L85 PathProgramCache]: Analyzing trace with hash -822883475, now seen corresponding path program 1 times [2022-12-11 20:54:40,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:54:40,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518727789] [2022-12-11 20:54:40,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:54:40,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:54:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:54:41,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:54:41,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:54:41,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518727789] [2022-12-11 20:54:41,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518727789] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:54:41,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:54:41,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 20:54:41,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706367613] [2022-12-11 20:54:41,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:54:41,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 20:54:41,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:54:41,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 20:54:41,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 20:54:41,142 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 110 [2022-12-11 20:54:41,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 109 transitions, 265 flow. Second operand has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:54:41,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:54:41,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 110 [2022-12-11 20:54:41,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:54:42,347 INFO L130 PetriNetUnfolder]: 2424/5818 cut-off events. [2022-12-11 20:54:42,348 INFO L131 PetriNetUnfolder]: For 1299/2578 co-relation queries the response was YES. [2022-12-11 20:54:42,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11207 conditions, 5818 events. 2424/5818 cut-off events. For 1299/2578 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 50491 event pairs, 594 based on Foata normal form. 0/5605 useless extension candidates. Maximal degree in co-relation 11150. Up to 1640 conditions per place. [2022-12-11 20:54:42,385 INFO L137 encePairwiseOnDemand]: 98/110 looper letters, 38 selfloop transitions, 8 changer transitions 83/199 dead transitions. [2022-12-11 20:54:42,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 199 transitions, 787 flow [2022-12-11 20:54:42,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 20:54:42,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 20:54:42,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 843 transitions. [2022-12-11 20:54:42,390 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8515151515151516 [2022-12-11 20:54:42,390 INFO L295 CegarLoopForPetriNet]: 115 programPoint places, 8 predicate places. [2022-12-11 20:54:42,390 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 199 transitions, 787 flow [2022-12-11 20:54:42,408 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 116 transitions, 395 flow [2022-12-11 20:54:42,409 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 116 transitions, 395 flow [2022-12-11 20:54:42,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:54:42,409 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:54:42,410 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:54:42,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 20:54:42,410 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 20:54:42,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:54:42,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1549224078, now seen corresponding path program 1 times [2022-12-11 20:54:42,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:54:42,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713941940] [2022-12-11 20:54:42,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:54:42,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:54:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:54:42,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:54:42,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:54:42,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713941940] [2022-12-11 20:54:42,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713941940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:54:42,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:54:42,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 20:54:42,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971481531] [2022-12-11 20:54:42,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:54:42,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 20:54:42,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:54:42,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 20:54:42,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 20:54:42,666 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 110 [2022-12-11 20:54:42,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 116 transitions, 395 flow. Second operand has 7 states, 7 states have (on average 84.14285714285714) internal successors, (589), 7 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:54:42,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:54:42,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 110 [2022-12-11 20:54:42,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:54:43,488 INFO L130 PetriNetUnfolder]: 1613/3263 cut-off events. [2022-12-11 20:54:43,488 INFO L131 PetriNetUnfolder]: For 995/7917 co-relation queries the response was YES. [2022-12-11 20:54:43,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9557 conditions, 3263 events. 1613/3263 cut-off events. For 995/7917 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 22679 event pairs, 190 based on Foata normal form. 77/3280 useless extension candidates. Maximal degree in co-relation 9493. Up to 1808 conditions per place. [2022-12-11 20:54:43,508 INFO L137 encePairwiseOnDemand]: 100/110 looper letters, 52 selfloop transitions, 7 changer transitions 91/220 dead transitions. [2022-12-11 20:54:43,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 220 transitions, 1237 flow [2022-12-11 20:54:43,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 20:54:43,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 20:54:43,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1174 transitions. [2022-12-11 20:54:43,512 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.820979020979021 [2022-12-11 20:54:43,512 INFO L295 CegarLoopForPetriNet]: 115 programPoint places, 4 predicate places. [2022-12-11 20:54:43,512 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 220 transitions, 1237 flow [2022-12-11 20:54:43,527 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 129 transitions, 583 flow [2022-12-11 20:54:43,527 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 129 transitions, 583 flow [2022-12-11 20:54:43,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.14285714285714) internal successors, (589), 7 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:54:43,528 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:54:43,528 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:54:43,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 20:54:43,529 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 20:54:43,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:54:43,529 INFO L85 PathProgramCache]: Analyzing trace with hash -122500352, now seen corresponding path program 1 times [2022-12-11 20:54:43,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:54:43,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131103204] [2022-12-11 20:54:43,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:54:43,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:54:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:54:43,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:54:43,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:54:43,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131103204] [2022-12-11 20:54:43,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131103204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:54:43,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:54:43,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 20:54:43,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375707984] [2022-12-11 20:54:43,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:54:43,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 20:54:43,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:54:43,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 20:54:43,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 20:54:43,728 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 110 [2022-12-11 20:54:43,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 129 transitions, 583 flow. Second operand has 7 states, 7 states have (on average 84.14285714285714) internal successors, (589), 7 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:54:43,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:54:43,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 110 [2022-12-11 20:54:43,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:54:44,458 INFO L130 PetriNetUnfolder]: 1450/2968 cut-off events. [2022-12-11 20:54:44,458 INFO L131 PetriNetUnfolder]: For 1613/7584 co-relation queries the response was YES. [2022-12-11 20:54:44,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10992 conditions, 2968 events. 1450/2968 cut-off events. For 1613/7584 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 19836 event pairs, 203 based on Foata normal form. 90/2947 useless extension candidates. Maximal degree in co-relation 10921. Up to 1641 conditions per place. [2022-12-11 20:54:44,481 INFO L137 encePairwiseOnDemand]: 98/110 looper letters, 58 selfloop transitions, 15 changer transitions 82/225 dead transitions. [2022-12-11 20:54:44,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 225 transitions, 1597 flow [2022-12-11 20:54:44,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 20:54:44,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 20:54:44,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1181 transitions. [2022-12-11 20:54:44,484 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8258741258741259 [2022-12-11 20:54:44,485 INFO L295 CegarLoopForPetriNet]: 115 programPoint places, 7 predicate places. [2022-12-11 20:54:44,485 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 225 transitions, 1597 flow [2022-12-11 20:54:44,499 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 143 transitions, 839 flow [2022-12-11 20:54:44,499 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 143 transitions, 839 flow [2022-12-11 20:54:44,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.14285714285714) internal successors, (589), 7 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:54:44,500 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:54:44,500 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:54:44,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 20:54:44,500 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 20:54:44,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:54:44,501 INFO L85 PathProgramCache]: Analyzing trace with hash -385566579, now seen corresponding path program 1 times [2022-12-11 20:54:44,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:54:44,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906396581] [2022-12-11 20:54:44,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:54:44,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:54:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:54:44,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:54:44,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:54:44,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906396581] [2022-12-11 20:54:44,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906396581] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:54:44,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:54:44,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 20:54:44,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656706310] [2022-12-11 20:54:44,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:54:44,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 20:54:44,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:54:44,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 20:54:44,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 20:54:44,695 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 110 [2022-12-11 20:54:44,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 143 transitions, 839 flow. Second operand has 6 states, 6 states have (on average 87.83333333333333) internal successors, (527), 6 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:54:44,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:54:44,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 110 [2022-12-11 20:54:44,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:54:45,210 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([345] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_50 256) 0)) (.cse7 (= (mod v_~z$r_buff0_thd3~0_58 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and .cse7 (= (mod v_~z$w_buff1_used~0_109 256) 0))) (.cse11 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse5 (and .cse7 .cse10))) (let ((.cse1 (or .cse3 .cse11 .cse5)) (.cse2 (and .cse8 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_108 256) 0)) (.cse4 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= |v_P2Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_8) v_~z~0_60) (= v_~z$w_buff0_used~0_123 (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse1 v_~z$w_buff0_used~0_124 (ite .cse2 0 v_~z$w_buff0_used~0_124)))) (= v_~z$w_buff1~0_45 v_~z$w_buff1~0_44) (= |v_P2Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= v_~z$mem_tmp~0_18 v_~z~0_62) (= (ite .cse0 v_~z$w_buff1_used~0_109 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff1_used~0_109 0)) v_~z$w_buff1_used~0_108) (= v_~__unbuffered_p2_EBX~0_8 (ite .cse1 v_~z~0_62 (ite .cse2 v_~z$w_buff0~0_44 v_~z$w_buff1~0_45))) (= (ite .cse0 v_~z$r_buff0_thd3~0_58 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~z$r_buff0_thd3~0_58 (ite (and .cse8 (not .cse4)) 0 v_~z$r_buff0_thd3~0_58))) v_~z$r_buff0_thd3~0_57) (= v_~z$flush_delayed~0_21 0) (= v_~z$w_buff0~0_44 v_~z$w_buff0~0_43) (= (ite .cse0 v_~z$r_buff1_thd3~0_50 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_57 256) 0))) (or (and .cse6 .cse9) (and .cse9 .cse10) .cse4)) v_~z$r_buff1_thd3~0_50 0)) v_~z$r_buff1_thd3~0_49))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_109, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z~0=v_~z~0_62, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_49, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_108, ~z$w_buff1~0=v_~z$w_buff1~0_44, ~z$flush_delayed~0=v_~z$flush_delayed~0_21, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~z~0=v_~z~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][166], [51#L3true, P0Thread1of1ForFork0InUse, 124#true, 140#true, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 16#L814true, 47#L755true, 121#true, 163#true, 197#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 92#L778true]) [2022-12-11 20:54:45,210 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-11 20:54:45,210 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-11 20:54:45,210 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-11 20:54:45,210 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-11 20:54:45,211 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([338] L778-->L785: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_127 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_24 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff0_used~0_128 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_113 256) 0)) .cse3))) (and (= v_~z$r_buff0_thd2~0_23 (ite .cse0 0 v_~z$r_buff0_thd2~0_24)) (= v_~z$w_buff0_used~0_127 (ite .cse1 0 v_~z$w_buff0_used~0_128)) (= v_~z$w_buff1_used~0_112 (ite (or .cse2 .cse0) 0 v_~z$w_buff1_used~0_113)) (= v_~z~0_66 (ite .cse1 v_~z$w_buff0~0_47 (ite .cse2 v_~z$w_buff1~0_48 v_~z~0_67))) (= v_~z$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= 0 (mod v_~z$w_buff1_used~0_112 256)))) (and .cse4 (not (= (mod v_~z$r_buff0_thd2~0_23 256) 0)))) 0 v_~z$r_buff1_thd2~0_22))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_128, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_113, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_67, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_24} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_127, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_66, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_23} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0][164], [51#L3true, 111#L785true, P0Thread1of1ForFork0InUse, 124#true, 140#true, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 47#L755true, 97#L798true, 121#true, 163#true, 197#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-11 20:54:45,211 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-11 20:54:45,211 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-11 20:54:45,211 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-11 20:54:45,211 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-11 20:54:45,306 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([345] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_50 256) 0)) (.cse7 (= (mod v_~z$r_buff0_thd3~0_58 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and .cse7 (= (mod v_~z$w_buff1_used~0_109 256) 0))) (.cse11 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse5 (and .cse7 .cse10))) (let ((.cse1 (or .cse3 .cse11 .cse5)) (.cse2 (and .cse8 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_108 256) 0)) (.cse4 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= |v_P2Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_8) v_~z~0_60) (= v_~z$w_buff0_used~0_123 (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse1 v_~z$w_buff0_used~0_124 (ite .cse2 0 v_~z$w_buff0_used~0_124)))) (= v_~z$w_buff1~0_45 v_~z$w_buff1~0_44) (= |v_P2Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= v_~z$mem_tmp~0_18 v_~z~0_62) (= (ite .cse0 v_~z$w_buff1_used~0_109 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff1_used~0_109 0)) v_~z$w_buff1_used~0_108) (= v_~__unbuffered_p2_EBX~0_8 (ite .cse1 v_~z~0_62 (ite .cse2 v_~z$w_buff0~0_44 v_~z$w_buff1~0_45))) (= (ite .cse0 v_~z$r_buff0_thd3~0_58 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~z$r_buff0_thd3~0_58 (ite (and .cse8 (not .cse4)) 0 v_~z$r_buff0_thd3~0_58))) v_~z$r_buff0_thd3~0_57) (= v_~z$flush_delayed~0_21 0) (= v_~z$w_buff0~0_44 v_~z$w_buff0~0_43) (= (ite .cse0 v_~z$r_buff1_thd3~0_50 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_57 256) 0))) (or (and .cse6 .cse9) (and .cse9 .cse10) .cse4)) v_~z$r_buff1_thd3~0_50 0)) v_~z$r_buff1_thd3~0_49))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_109, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z~0=v_~z~0_62, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_49, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_108, ~z$w_buff1~0=v_~z$w_buff1~0_44, ~z$flush_delayed~0=v_~z$flush_delayed~0_21, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~z~0=v_~z~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][166], [P0Thread1of1ForFork0InUse, 124#true, 140#true, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 16#L814true, 47#L755true, 109#L3-1true, 121#true, 163#true, 197#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 92#L778true]) [2022-12-11 20:54:45,306 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-11 20:54:45,306 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 20:54:45,306 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 20:54:45,306 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 20:54:45,306 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([338] L778-->L785: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_127 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_24 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff0_used~0_128 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_113 256) 0)) .cse3))) (and (= v_~z$r_buff0_thd2~0_23 (ite .cse0 0 v_~z$r_buff0_thd2~0_24)) (= v_~z$w_buff0_used~0_127 (ite .cse1 0 v_~z$w_buff0_used~0_128)) (= v_~z$w_buff1_used~0_112 (ite (or .cse2 .cse0) 0 v_~z$w_buff1_used~0_113)) (= v_~z~0_66 (ite .cse1 v_~z$w_buff0~0_47 (ite .cse2 v_~z$w_buff1~0_48 v_~z~0_67))) (= v_~z$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= 0 (mod v_~z$w_buff1_used~0_112 256)))) (and .cse4 (not (= (mod v_~z$r_buff0_thd2~0_23 256) 0)))) 0 v_~z$r_buff1_thd2~0_22))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_128, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_113, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_67, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_24} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_127, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_66, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_23} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0][164], [111#L785true, P0Thread1of1ForFork0InUse, 124#true, 140#true, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 47#L755true, 109#L3-1true, 97#L798true, 121#true, 163#true, 197#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-11 20:54:45,307 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-11 20:54:45,307 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 20:54:45,307 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 20:54:45,307 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 20:54:45,307 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L758-->L765: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_131 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_29 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff1_used~0_117 256) 0)) .cse3)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_132 256) 0)))) (.cse1 (and .cse5 .cse4))) (and (= v_~z$w_buff1_used~0_116 (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_117)) (= (ite .cse2 v_~z$w_buff0~0_49 (ite .cse0 v_~z$w_buff1~0_50 v_~z~0_71)) v_~z~0_70) (= v_~z$r_buff1_thd1~0_19 (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_116 256) 0))) (and (not (= (mod v_~z$r_buff0_thd1~0_28 256) 0)) .cse4)) 0 v_~z$r_buff1_thd1~0_20)) (= (ite .cse2 0 v_~z$w_buff0_used~0_132) v_~z$w_buff0_used~0_131) (= v_~z$r_buff0_thd1~0_28 (ite .cse1 0 v_~z$r_buff0_thd1~0_29))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_132, ~z$w_buff0~0=v_~z$w_buff0~0_49, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_117, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_71, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_131, ~z$w_buff0~0=v_~z$w_buff0~0_49, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_116, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_70, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][162], [51#L3true, 42#L765true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 143#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))), P1Thread1of1ForFork1InUse, 166#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))), 97#L798true, 126#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))), 121#true, 197#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 92#L778true]) [2022-12-11 20:54:45,307 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-11 20:54:45,307 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 20:54:45,308 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 20:54:45,308 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 20:54:45,308 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([338] L778-->L785: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_127 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_24 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff0_used~0_128 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_113 256) 0)) .cse3))) (and (= v_~z$r_buff0_thd2~0_23 (ite .cse0 0 v_~z$r_buff0_thd2~0_24)) (= v_~z$w_buff0_used~0_127 (ite .cse1 0 v_~z$w_buff0_used~0_128)) (= v_~z$w_buff1_used~0_112 (ite (or .cse2 .cse0) 0 v_~z$w_buff1_used~0_113)) (= v_~z~0_66 (ite .cse1 v_~z$w_buff0~0_47 (ite .cse2 v_~z$w_buff1~0_48 v_~z~0_67))) (= v_~z$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= 0 (mod v_~z$w_buff1_used~0_112 256)))) (and .cse4 (not (= (mod v_~z$r_buff0_thd2~0_23 256) 0)))) 0 v_~z$r_buff1_thd2~0_22))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_128, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_113, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_67, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_24} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_127, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_66, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_23} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0][191], [51#L3true, 111#L785true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 143#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))), P1Thread1of1ForFork1InUse, 166#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))), 50#L758true, 97#L798true, 126#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))), 121#true, 197#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-11 20:54:45,308 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-11 20:54:45,308 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 20:54:45,308 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 20:54:45,308 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 20:54:45,309 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([345] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_50 256) 0)) (.cse7 (= (mod v_~z$r_buff0_thd3~0_58 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and .cse7 (= (mod v_~z$w_buff1_used~0_109 256) 0))) (.cse11 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse5 (and .cse7 .cse10))) (let ((.cse1 (or .cse3 .cse11 .cse5)) (.cse2 (and .cse8 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_108 256) 0)) (.cse4 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= |v_P2Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_8) v_~z~0_60) (= v_~z$w_buff0_used~0_123 (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse1 v_~z$w_buff0_used~0_124 (ite .cse2 0 v_~z$w_buff0_used~0_124)))) (= v_~z$w_buff1~0_45 v_~z$w_buff1~0_44) (= |v_P2Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= v_~z$mem_tmp~0_18 v_~z~0_62) (= (ite .cse0 v_~z$w_buff1_used~0_109 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff1_used~0_109 0)) v_~z$w_buff1_used~0_108) (= v_~__unbuffered_p2_EBX~0_8 (ite .cse1 v_~z~0_62 (ite .cse2 v_~z$w_buff0~0_44 v_~z$w_buff1~0_45))) (= (ite .cse0 v_~z$r_buff0_thd3~0_58 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~z$r_buff0_thd3~0_58 (ite (and .cse8 (not .cse4)) 0 v_~z$r_buff0_thd3~0_58))) v_~z$r_buff0_thd3~0_57) (= v_~z$flush_delayed~0_21 0) (= v_~z$w_buff0~0_44 v_~z$w_buff0~0_43) (= (ite .cse0 v_~z$r_buff1_thd3~0_50 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_57 256) 0))) (or (and .cse6 .cse9) (and .cse9 .cse10) .cse4)) v_~z$r_buff1_thd3~0_50 0)) v_~z$r_buff1_thd3~0_49))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_109, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z~0=v_~z~0_62, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_49, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_108, ~z$w_buff1~0=v_~z$w_buff1~0_44, ~z$flush_delayed~0=v_~z$flush_delayed~0_21, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~z~0=v_~z~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][168], [51#L3true, P0Thread1of1ForFork0InUse, 124#true, 140#true, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 16#L814true, 50#L758true, 121#true, 163#true, 197#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 92#L778true]) [2022-12-11 20:54:45,309 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-11 20:54:45,309 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 20:54:45,309 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 20:54:45,309 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 20:54:45,378 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L758-->L765: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_131 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_29 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff1_used~0_117 256) 0)) .cse3)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_132 256) 0)))) (.cse1 (and .cse5 .cse4))) (and (= v_~z$w_buff1_used~0_116 (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_117)) (= (ite .cse2 v_~z$w_buff0~0_49 (ite .cse0 v_~z$w_buff1~0_50 v_~z~0_71)) v_~z~0_70) (= v_~z$r_buff1_thd1~0_19 (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_116 256) 0))) (and (not (= (mod v_~z$r_buff0_thd1~0_28 256) 0)) .cse4)) 0 v_~z$r_buff1_thd1~0_20)) (= (ite .cse2 0 v_~z$w_buff0_used~0_132) v_~z$w_buff0_used~0_131) (= v_~z$r_buff0_thd1~0_28 (ite .cse1 0 v_~z$r_buff0_thd1~0_29))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_132, ~z$w_buff0~0=v_~z$w_buff0~0_49, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_117, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_71, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_131, ~z$w_buff0~0=v_~z$w_buff0~0_49, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_116, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_70, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][162], [42#L765true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 143#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))), P1Thread1of1ForFork1InUse, 166#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))), 109#L3-1true, 97#L798true, 126#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))), 121#true, 197#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 92#L778true]) [2022-12-11 20:54:45,378 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-11 20:54:45,379 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-11 20:54:45,379 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-11 20:54:45,379 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-11 20:54:45,379 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([338] L778-->L785: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_127 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_24 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff0_used~0_128 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_113 256) 0)) .cse3))) (and (= v_~z$r_buff0_thd2~0_23 (ite .cse0 0 v_~z$r_buff0_thd2~0_24)) (= v_~z$w_buff0_used~0_127 (ite .cse1 0 v_~z$w_buff0_used~0_128)) (= v_~z$w_buff1_used~0_112 (ite (or .cse2 .cse0) 0 v_~z$w_buff1_used~0_113)) (= v_~z~0_66 (ite .cse1 v_~z$w_buff0~0_47 (ite .cse2 v_~z$w_buff1~0_48 v_~z~0_67))) (= v_~z$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= 0 (mod v_~z$w_buff1_used~0_112 256)))) (and .cse4 (not (= (mod v_~z$r_buff0_thd2~0_23 256) 0)))) 0 v_~z$r_buff1_thd2~0_22))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_128, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_113, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_67, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_24} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_127, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_66, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_23} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0][191], [111#L785true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 143#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))), P1Thread1of1ForFork1InUse, 166#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))), 50#L758true, 109#L3-1true, 97#L798true, 126#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))), 121#true, 197#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0))]) [2022-12-11 20:54:45,379 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-11 20:54:45,379 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-11 20:54:45,379 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-11 20:54:45,379 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-11 20:54:45,380 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([345] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_50 256) 0)) (.cse7 (= (mod v_~z$r_buff0_thd3~0_58 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and .cse7 (= (mod v_~z$w_buff1_used~0_109 256) 0))) (.cse11 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse5 (and .cse7 .cse10))) (let ((.cse1 (or .cse3 .cse11 .cse5)) (.cse2 (and .cse8 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_108 256) 0)) (.cse4 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= |v_P2Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_8) v_~z~0_60) (= v_~z$w_buff0_used~0_123 (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse1 v_~z$w_buff0_used~0_124 (ite .cse2 0 v_~z$w_buff0_used~0_124)))) (= v_~z$w_buff1~0_45 v_~z$w_buff1~0_44) (= |v_P2Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= v_~z$mem_tmp~0_18 v_~z~0_62) (= (ite .cse0 v_~z$w_buff1_used~0_109 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff1_used~0_109 0)) v_~z$w_buff1_used~0_108) (= v_~__unbuffered_p2_EBX~0_8 (ite .cse1 v_~z~0_62 (ite .cse2 v_~z$w_buff0~0_44 v_~z$w_buff1~0_45))) (= (ite .cse0 v_~z$r_buff0_thd3~0_58 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~z$r_buff0_thd3~0_58 (ite (and .cse8 (not .cse4)) 0 v_~z$r_buff0_thd3~0_58))) v_~z$r_buff0_thd3~0_57) (= v_~z$flush_delayed~0_21 0) (= v_~z$w_buff0~0_44 v_~z$w_buff0~0_43) (= (ite .cse0 v_~z$r_buff1_thd3~0_50 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_57 256) 0))) (or (and .cse6 .cse9) (and .cse9 .cse10) .cse4)) v_~z$r_buff1_thd3~0_50 0)) v_~z$r_buff1_thd3~0_49))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_109, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z~0=v_~z~0_62, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_49, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_108, ~z$w_buff1~0=v_~z$w_buff1~0_44, ~z$flush_delayed~0=v_~z$flush_delayed~0_21, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~z~0=v_~z~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][168], [P0Thread1of1ForFork0InUse, 124#true, 140#true, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 16#L814true, 50#L758true, 109#L3-1true, 121#true, 163#true, 197#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 92#L778true]) [2022-12-11 20:54:45,380 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-11 20:54:45,380 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-11 20:54:45,380 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-11 20:54:45,380 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-11 20:54:45,740 INFO L130 PetriNetUnfolder]: 3640/6699 cut-off events. [2022-12-11 20:54:45,741 INFO L131 PetriNetUnfolder]: For 21612/27349 co-relation queries the response was YES. [2022-12-11 20:54:45,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24602 conditions, 6699 events. 3640/6699 cut-off events. For 21612/27349 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 50093 event pairs, 77 based on Foata normal form. 181/6582 useless extension candidates. Maximal degree in co-relation 24527. Up to 2522 conditions per place. [2022-12-11 20:54:45,784 INFO L137 encePairwiseOnDemand]: 100/110 looper letters, 174 selfloop transitions, 17 changer transitions 33/313 dead transitions. [2022-12-11 20:54:45,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 313 transitions, 2759 flow [2022-12-11 20:54:45,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 20:54:45,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 20:54:45,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 949 transitions. [2022-12-11 20:54:45,787 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8627272727272727 [2022-12-11 20:54:45,788 INFO L295 CegarLoopForPetriNet]: 115 programPoint places, 7 predicate places. [2022-12-11 20:54:45,788 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 313 transitions, 2759 flow [2022-12-11 20:54:45,813 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 280 transitions, 2363 flow [2022-12-11 20:54:45,813 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 280 transitions, 2363 flow [2022-12-11 20:54:45,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.83333333333333) internal successors, (527), 6 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:54:45,814 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:54:45,814 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:54:45,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 20:54:45,815 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 20:54:45,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:54:45,815 INFO L85 PathProgramCache]: Analyzing trace with hash -443177545, now seen corresponding path program 1 times [2022-12-11 20:54:45,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:54:45,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659064897] [2022-12-11 20:54:45,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:54:45,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:54:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:54:46,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:54:46,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:54:46,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659064897] [2022-12-11 20:54:46,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659064897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:54:46,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:54:46,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 20:54:46,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626380343] [2022-12-11 20:54:46,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:54:46,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 20:54:46,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:54:46,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 20:54:46,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 20:54:46,055 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 110 [2022-12-11 20:54:46,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 280 transitions, 2363 flow. Second operand has 7 states, 7 states have (on average 84.57142857142857) internal successors, (592), 7 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:54:46,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:54:46,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 110 [2022-12-11 20:54:46,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:54:47,475 INFO L130 PetriNetUnfolder]: 4393/8575 cut-off events. [2022-12-11 20:54:47,475 INFO L131 PetriNetUnfolder]: For 33575/40201 co-relation queries the response was YES. [2022-12-11 20:54:47,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34213 conditions, 8575 events. 4393/8575 cut-off events. For 33575/40201 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 69772 event pairs, 124 based on Foata normal form. 558/8830 useless extension candidates. Maximal degree in co-relation 34131. Up to 3228 conditions per place. [2022-12-11 20:54:47,532 INFO L137 encePairwiseOnDemand]: 100/110 looper letters, 188 selfloop transitions, 19 changer transitions 63/365 dead transitions. [2022-12-11 20:54:47,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 365 transitions, 3831 flow [2022-12-11 20:54:47,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 20:54:47,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 20:54:47,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 904 transitions. [2022-12-11 20:54:47,536 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8218181818181818 [2022-12-11 20:54:47,538 INFO L295 CegarLoopForPetriNet]: 115 programPoint places, 16 predicate places. [2022-12-11 20:54:47,538 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 365 transitions, 3831 flow [2022-12-11 20:54:47,570 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 302 transitions, 3021 flow [2022-12-11 20:54:47,570 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 302 transitions, 3021 flow [2022-12-11 20:54:47,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.57142857142857) internal successors, (592), 7 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:54:47,571 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:54:47,571 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:54:47,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 20:54:47,571 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 20:54:47,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:54:47,572 INFO L85 PathProgramCache]: Analyzing trace with hash 109915465, now seen corresponding path program 1 times [2022-12-11 20:54:47,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:54:47,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595041220] [2022-12-11 20:54:47,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:54:47,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:54:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:54:47,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:54:47,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:54:47,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595041220] [2022-12-11 20:54:47,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595041220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:54:47,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:54:47,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 20:54:47,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487645426] [2022-12-11 20:54:47,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:54:47,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 20:54:47,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:54:47,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 20:54:47,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-11 20:54:47,833 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 110 [2022-12-11 20:54:47,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 302 transitions, 3021 flow. Second operand has 8 states, 8 states have (on average 82.5) internal successors, (660), 8 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:54:47,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:54:47,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 110 [2022-12-11 20:54:47,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:54:48,597 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([345] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_50 256) 0)) (.cse7 (= (mod v_~z$r_buff0_thd3~0_58 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and .cse7 (= (mod v_~z$w_buff1_used~0_109 256) 0))) (.cse11 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse5 (and .cse7 .cse10))) (let ((.cse1 (or .cse3 .cse11 .cse5)) (.cse2 (and .cse8 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_108 256) 0)) (.cse4 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= |v_P2Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_8) v_~z~0_60) (= v_~z$w_buff0_used~0_123 (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse1 v_~z$w_buff0_used~0_124 (ite .cse2 0 v_~z$w_buff0_used~0_124)))) (= v_~z$w_buff1~0_45 v_~z$w_buff1~0_44) (= |v_P2Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= v_~z$mem_tmp~0_18 v_~z~0_62) (= (ite .cse0 v_~z$w_buff1_used~0_109 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff1_used~0_109 0)) v_~z$w_buff1_used~0_108) (= v_~__unbuffered_p2_EBX~0_8 (ite .cse1 v_~z~0_62 (ite .cse2 v_~z$w_buff0~0_44 v_~z$w_buff1~0_45))) (= (ite .cse0 v_~z$r_buff0_thd3~0_58 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~z$r_buff0_thd3~0_58 (ite (and .cse8 (not .cse4)) 0 v_~z$r_buff0_thd3~0_58))) v_~z$r_buff0_thd3~0_57) (= v_~z$flush_delayed~0_21 0) (= v_~z$w_buff0~0_44 v_~z$w_buff0~0_43) (= (ite .cse0 v_~z$r_buff1_thd3~0_50 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_57 256) 0))) (or (and .cse6 .cse9) (and .cse9 .cse10) .cse4)) v_~z$r_buff1_thd3~0_50 0)) v_~z$r_buff1_thd3~0_49))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_109, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z~0=v_~z~0_62, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_49, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_108, ~z$w_buff1~0=v_~z$w_buff1~0_44, ~z$flush_delayed~0=v_~z$flush_delayed~0_21, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~z~0=v_~z~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][272], [16#L814true, 47#L755true, 109#L3-1true, 197#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 124#true, 140#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 230#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 121#true, 163#true, 202#true, 92#L778true]) [2022-12-11 20:54:48,597 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-11 20:54:48,597 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 20:54:48,597 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 20:54:48,597 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-11 20:54:48,708 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([331] L758-->L765: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_131 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_29 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff1_used~0_117 256) 0)) .cse3)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_132 256) 0)))) (.cse1 (and .cse5 .cse4))) (and (= v_~z$w_buff1_used~0_116 (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_117)) (= (ite .cse2 v_~z$w_buff0~0_49 (ite .cse0 v_~z$w_buff1~0_50 v_~z~0_71)) v_~z~0_70) (= v_~z$r_buff1_thd1~0_19 (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_116 256) 0))) (and (not (= (mod v_~z$r_buff0_thd1~0_28 256) 0)) .cse4)) 0 v_~z$r_buff1_thd1~0_20)) (= (ite .cse2 0 v_~z$w_buff0_used~0_132) v_~z$w_buff0_used~0_131) (= v_~z$r_buff0_thd1~0_28 (ite .cse1 0 v_~z$r_buff0_thd1~0_29))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_132, ~z$w_buff0~0=v_~z$w_buff0~0_49, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_117, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_71, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_131, ~z$w_buff0~0=v_~z$w_buff0~0_49, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_116, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_70, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][290], [42#L765true, 166#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))), 109#L3-1true, 97#L798true, 197#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 143#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))), P1Thread1of1ForFork1InUse, 230#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 126#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))), 121#true, 204#(= ~x~0 1), 92#L778true]) [2022-12-11 20:54:48,708 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-11 20:54:48,708 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-11 20:54:48,708 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-11 20:54:48,708 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-11 20:54:48,709 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([345] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_50 256) 0)) (.cse7 (= (mod v_~z$r_buff0_thd3~0_58 256) 0))) (let ((.cse8 (not .cse7)) (.cse3 (and .cse7 (= (mod v_~z$w_buff1_used~0_109 256) 0))) (.cse11 (= (mod v_~z$w_buff0_used~0_124 256) 0)) (.cse5 (and .cse7 .cse10))) (let ((.cse1 (or .cse3 .cse11 .cse5)) (.cse2 (and .cse8 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_108 256) 0)) (.cse4 (= (mod v_~z$w_buff0_used~0_123 256) 0))) (and (= |v_P2Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_8) v_~z~0_60) (= v_~z$w_buff0_used~0_123 (ite .cse0 v_~z$w_buff0_used~0_124 (ite .cse1 v_~z$w_buff0_used~0_124 (ite .cse2 0 v_~z$w_buff0_used~0_124)))) (= v_~z$w_buff1~0_45 v_~z$w_buff1~0_44) (= |v_P2Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= v_~z$mem_tmp~0_18 v_~z~0_62) (= (ite .cse0 v_~z$w_buff1_used~0_109 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff1_used~0_109 0)) v_~z$w_buff1_used~0_108) (= v_~__unbuffered_p2_EBX~0_8 (ite .cse1 v_~z~0_62 (ite .cse2 v_~z$w_buff0~0_44 v_~z$w_buff1~0_45))) (= (ite .cse0 v_~z$r_buff0_thd3~0_58 (ite (or (and .cse6 .cse7) .cse4 .cse5) v_~z$r_buff0_thd3~0_58 (ite (and .cse8 (not .cse4)) 0 v_~z$r_buff0_thd3~0_58))) v_~z$r_buff0_thd3~0_57) (= v_~z$flush_delayed~0_21 0) (= v_~z$w_buff0~0_44 v_~z$w_buff0~0_43) (= (ite .cse0 v_~z$r_buff1_thd3~0_50 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_57 256) 0))) (or (and .cse6 .cse9) (and .cse9 .cse10) .cse4)) v_~z$r_buff1_thd3~0_50 0)) v_~z$r_buff1_thd3~0_49))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_124, ~z$w_buff0~0=v_~z$w_buff0~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_109, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z~0=v_~z~0_62, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_123, ~z$w_buff0~0=v_~z$w_buff0~0_43, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_49, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_108, ~z$w_buff1~0=v_~z$w_buff1~0_44, ~z$flush_delayed~0=v_~z$flush_delayed~0_21, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~z~0=v_~z~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][293], [16#L814true, 50#L758true, 109#L3-1true, 197#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork0InUse, 124#true, 140#true, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, 230#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 121#true, 163#true, 204#(= ~x~0 1), 92#L778true]) [2022-12-11 20:54:48,709 INFO L382 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-12-11 20:54:48,709 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-11 20:54:48,709 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-11 20:54:48,709 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-11 20:54:49,759 INFO L130 PetriNetUnfolder]: 5757/12077 cut-off events. [2022-12-11 20:54:49,759 INFO L131 PetriNetUnfolder]: For 60042/72372 co-relation queries the response was YES. [2022-12-11 20:54:49,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52920 conditions, 12077 events. 5757/12077 cut-off events. For 60042/72372 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 111955 event pairs, 226 based on Foata normal form. 1214/12942 useless extension candidates. Maximal degree in co-relation 52830. Up to 4298 conditions per place. [2022-12-11 20:54:49,835 INFO L137 encePairwiseOnDemand]: 97/110 looper letters, 209 selfloop transitions, 27 changer transitions 207/524 dead transitions. [2022-12-11 20:54:49,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 524 transitions, 6827 flow [2022-12-11 20:54:49,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 20:54:49,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 20:54:49,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 806 transitions. [2022-12-11 20:54:49,838 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8141414141414142 [2022-12-11 20:54:49,838 INFO L295 CegarLoopForPetriNet]: 115 programPoint places, 24 predicate places. [2022-12-11 20:54:49,838 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 524 transitions, 6827 flow [2022-12-11 20:54:49,870 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 317 transitions, 3711 flow [2022-12-11 20:54:49,871 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 317 transitions, 3711 flow [2022-12-11 20:54:49,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 82.5) internal successors, (660), 8 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:54:49,872 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:54:49,872 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:54:49,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 20:54:49,872 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 20:54:49,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:54:49,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1131507545, now seen corresponding path program 2 times [2022-12-11 20:54:49,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:54:49,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209659968] [2022-12-11 20:54:49,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:54:49,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:54:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:54:50,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:54:50,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:54:50,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209659968] [2022-12-11 20:54:50,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209659968] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:54:50,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:54:50,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 20:54:50,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093189595] [2022-12-11 20:54:50,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:54:50,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 20:54:50,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:54:50,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 20:54:50,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 20:54:50,070 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 110 [2022-12-11 20:54:50,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 317 transitions, 3711 flow. Second operand has 7 states, 7 states have (on average 87.85714285714286) internal successors, (615), 7 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:54:50,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:54:50,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 110 [2022-12-11 20:54:50,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:54:51,068 INFO L130 PetriNetUnfolder]: 1762/4905 cut-off events. [2022-12-11 20:54:51,068 INFO L131 PetriNetUnfolder]: For 23442/27003 co-relation queries the response was YES. [2022-12-11 20:54:51,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21348 conditions, 4905 events. 1762/4905 cut-off events. For 23442/27003 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 46927 event pairs, 115 based on Foata normal form. 304/5117 useless extension candidates. Maximal degree in co-relation 21254. Up to 1890 conditions per place. [2022-12-11 20:54:51,100 INFO L137 encePairwiseOnDemand]: 100/110 looper letters, 132 selfloop transitions, 24 changer transitions 209/460 dead transitions. [2022-12-11 20:54:51,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 460 transitions, 6326 flow [2022-12-11 20:54:51,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 20:54:51,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 20:54:51,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1220 transitions. [2022-12-11 20:54:51,103 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8531468531468531 [2022-12-11 20:54:51,105 INFO L295 CegarLoopForPetriNet]: 115 programPoint places, 34 predicate places. [2022-12-11 20:54:51,106 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 460 transitions, 6326 flow [2022-12-11 20:54:51,119 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 251 transitions, 2894 flow [2022-12-11 20:54:51,119 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 251 transitions, 2894 flow [2022-12-11 20:54:51,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 87.85714285714286) internal successors, (615), 7 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:54:51,120 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:54:51,120 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:54:51,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 20:54:51,120 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 20:54:51,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:54:51,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1928476819, now seen corresponding path program 1 times [2022-12-11 20:54:51,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:54:51,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024811439] [2022-12-11 20:54:51,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:54:51,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:54:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:54:51,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:54:51,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:54:51,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024811439] [2022-12-11 20:54:51,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024811439] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:54:51,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:54:51,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 20:54:51,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089620989] [2022-12-11 20:54:51,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:54:51,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 20:54:51,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:54:51,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 20:54:51,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-11 20:54:51,436 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 110 [2022-12-11 20:54:51,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 251 transitions, 2894 flow. Second operand has 8 states, 8 states have (on average 88.0) internal successors, (704), 8 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:54:51,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:54:51,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 110 [2022-12-11 20:54:51,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:54:52,221 INFO L130 PetriNetUnfolder]: 949/3288 cut-off events. [2022-12-11 20:54:52,221 INFO L131 PetriNetUnfolder]: For 12770/14735 co-relation queries the response was YES. [2022-12-11 20:54:52,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15424 conditions, 3288 events. 949/3288 cut-off events. For 12770/14735 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 32721 event pairs, 85 based on Foata normal form. 202/3434 useless extension candidates. Maximal degree in co-relation 15326. Up to 887 conditions per place. [2022-12-11 20:54:52,241 INFO L137 encePairwiseOnDemand]: 100/110 looper letters, 52 selfloop transitions, 16 changer transitions 117/269 dead transitions. [2022-12-11 20:54:52,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 269 transitions, 3450 flow [2022-12-11 20:54:52,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 20:54:52,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 20:54:52,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1464 transitions. [2022-12-11 20:54:52,245 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8318181818181818 [2022-12-11 20:54:52,246 INFO L295 CegarLoopForPetriNet]: 115 programPoint places, 40 predicate places. [2022-12-11 20:54:52,246 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 269 transitions, 3450 flow [2022-12-11 20:54:52,255 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 152 transitions, 1500 flow [2022-12-11 20:54:52,255 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 152 transitions, 1500 flow [2022-12-11 20:54:52,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.0) internal successors, (704), 8 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:54:52,256 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:54:52,256 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:54:52,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 20:54:52,257 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 20:54:52,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:54:52,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1750247436, now seen corresponding path program 1 times [2022-12-11 20:54:52,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:54:52,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085397002] [2022-12-11 20:54:52,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:54:52,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:54:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:54:53,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:54:53,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:54:53,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085397002] [2022-12-11 20:54:53,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085397002] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:54:53,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:54:53,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-11 20:54:53,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826627612] [2022-12-11 20:54:53,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:54:53,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-11 20:54:53,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:54:53,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-11 20:54:53,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-11 20:54:53,343 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 110 [2022-12-11 20:54:53,344 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 152 transitions, 1500 flow. Second operand has 11 states, 11 states have (on average 76.81818181818181) internal successors, (845), 11 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:54:53,344 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:54:53,344 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 110 [2022-12-11 20:54:53,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:54:53,741 INFO L130 PetriNetUnfolder]: 260/1106 cut-off events. [2022-12-11 20:54:53,741 INFO L131 PetriNetUnfolder]: For 5906/7462 co-relation queries the response was YES. [2022-12-11 20:54:53,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5592 conditions, 1106 events. 260/1106 cut-off events. For 5906/7462 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8944 event pairs, 26 based on Foata normal form. 46/1129 useless extension candidates. Maximal degree in co-relation 5479. Up to 295 conditions per place. [2022-12-11 20:54:53,747 INFO L137 encePairwiseOnDemand]: 93/110 looper letters, 39 selfloop transitions, 11 changer transitions 65/187 dead transitions. [2022-12-11 20:54:53,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 187 transitions, 2302 flow [2022-12-11 20:54:53,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 20:54:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 20:54:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1022 transitions. [2022-12-11 20:54:53,750 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7146853146853147 [2022-12-11 20:54:53,750 INFO L295 CegarLoopForPetriNet]: 115 programPoint places, 44 predicate places. [2022-12-11 20:54:53,750 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 187 transitions, 2302 flow [2022-12-11 20:54:53,753 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 122 transitions, 1147 flow [2022-12-11 20:54:53,753 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 122 transitions, 1147 flow [2022-12-11 20:54:53,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 76.81818181818181) internal successors, (845), 11 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 20:54:53,754 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:54:53,754 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:54:53,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 20:54:53,754 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-11 20:54:53,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:54:53,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1951858184, now seen corresponding path program 2 times [2022-12-11 20:54:53,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:54:53,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118058476] [2022-12-11 20:54:53,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:54:53,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:54:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 20:54:53,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 20:54:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 20:54:53,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 20:54:53,892 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 20:54:53,893 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-11 20:54:53,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-11 20:54:53,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-11 20:54:53,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-11 20:54:53,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-11 20:54:53,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-11 20:54:53,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-11 20:54:53,897 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:54:53,903 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 20:54:53,903 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 20:54:53,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 08:54:53 BasicIcfg [2022-12-11 20:54:53,990 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 20:54:53,991 INFO L158 Benchmark]: Toolchain (without parser) took 15827.23ms. Allocated memory was 176.2MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 151.2MB in the beginning and 1.1GB in the end (delta: -907.7MB). Peak memory consumption was 387.3MB. Max. memory is 8.0GB. [2022-12-11 20:54:53,991 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 176.2MB. Free memory is still 152.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 20:54:53,991 INFO L158 Benchmark]: CACSL2BoogieTranslator took 570.63ms. Allocated memory is still 176.2MB. Free memory was 150.6MB in the beginning and 124.4MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-11 20:54:53,992 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.96ms. Allocated memory is still 176.2MB. Free memory was 124.4MB in the beginning and 121.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-11 20:54:53,992 INFO L158 Benchmark]: Boogie Preprocessor took 46.31ms. Allocated memory is still 176.2MB. Free memory was 121.8MB in the beginning and 120.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-11 20:54:53,992 INFO L158 Benchmark]: RCFGBuilder took 706.71ms. Allocated memory is still 176.2MB. Free memory was 119.7MB in the beginning and 85.6MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-12-11 20:54:53,992 INFO L158 Benchmark]: TraceAbstraction took 14430.43ms. Allocated memory was 176.2MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 84.6MB in the beginning and 1.1GB in the end (delta: -974.3MB). Peak memory consumption was 321.2MB. Max. memory is 8.0GB. [2022-12-11 20:54:53,994 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 176.2MB. Free memory is still 152.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 570.63ms. Allocated memory is still 176.2MB. Free memory was 150.6MB in the beginning and 124.4MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.96ms. Allocated memory is still 176.2MB. Free memory was 124.4MB in the beginning and 121.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.31ms. Allocated memory is still 176.2MB. Free memory was 121.8MB in the beginning and 120.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 706.71ms. Allocated memory is still 176.2MB. Free memory was 119.7MB in the beginning and 85.6MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 14430.43ms. Allocated memory was 176.2MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 84.6MB in the beginning and 1.1GB in the end (delta: -974.3MB). Peak memory consumption was 321.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L715] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L716] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L717] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L719] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L723] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L724] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L725] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L726] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L727] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L728] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L729] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L730] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L731] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L732] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L733] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L734] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L735] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L736] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L737] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L738] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L739] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L740] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t497; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t497={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t497, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t497, ((void *)0), P0, ((void *)0))=-2, t497={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$w_buff1 = z$w_buff0 [L746] 1 z$w_buff0 = 1 [L747] 1 z$w_buff1_used = z$w_buff0_used [L748] 1 z$w_buff0_used = (_Bool)1 [L749] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L749] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L750] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L751] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L752] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L753] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L754] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t498; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t497={5:0}, t498={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L841] FCALL, FORK 0 pthread_create(&t498, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t498, ((void *)0), P1, ((void *)0))=-1, t497={5:0}, t498={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 pthread_t t499; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t497={5:0}, t498={6:0}, t499={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L843] FCALL, FORK 0 pthread_create(&t499, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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, pthread_create(&t499, ((void *)0), P2, ((void *)0))=0, t497={5:0}, t498={6:0}, t499={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L781] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L782] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L783] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L784] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 z$flush_delayed = weak$$choice2 [L803] 3 z$mem_tmp = z [L804] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L805] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L806] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L807] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L808] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L810] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EBX = z [L812] 3 z = z$flush_delayed ? z$mem_tmp : z [L813] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_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=49, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L818] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L819] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L820] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_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=49, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L761] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L762] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L763] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L764] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_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=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_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=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_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=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_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, t497={5:0}, t498={6:0}, t499={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_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=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_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, t497={5:0}, t498={6:0}, t499={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_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, t497={5:0}, t498={6:0}, t499={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_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=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_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=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 839]: 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: 843]: 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: 841]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 138 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.2s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 804 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 804 mSDsluCounter, 677 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 519 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1456 IncrementalHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 158 mSDtfsCounter, 1456 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3711occurred in iteration=7, InterpolantAutomatonStates: 109, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 12663 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 820 NumberOfCodeBlocks, 820 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 724 ConstructedInterpolants, 0 QuantifiedInterpolants, 3666 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-11 20:54:54,025 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...