/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix017.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 18:59:41,222 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 18:59:41,223 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 18:59:41,257 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 18:59:41,257 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 18:59:41,258 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 18:59:41,259 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 18:59:41,260 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 18:59:41,261 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 18:59:41,261 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 18:59:41,262 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 18:59:41,263 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 18:59:41,263 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 18:59:41,264 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 18:59:41,264 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 18:59:41,265 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 18:59:41,266 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 18:59:41,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 18:59:41,267 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 18:59:41,269 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 18:59:41,270 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 18:59:41,271 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 18:59:41,271 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 18:59:41,272 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 18:59:41,275 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 18:59:41,275 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 18:59:41,275 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 18:59:41,276 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 18:59:41,277 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 18:59:41,277 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 18:59:41,278 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 18:59:41,278 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 18:59:41,279 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 18:59:41,279 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 18:59:41,280 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 18:59:41,281 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 18:59:41,281 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 18:59:41,282 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 18:59:41,282 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 18:59:41,282 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 18:59:41,283 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 18:59:41,284 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 18:59:41,299 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 18:59:41,300 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 18:59:41,301 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 18:59:41,301 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 18:59:41,301 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 18:59:41,301 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 18:59:41,302 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 18:59:41,302 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 18:59:41,302 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 18:59:41,302 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 18:59:41,302 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 18:59:41,302 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 18:59:41,302 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 18:59:41,303 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 18:59:41,303 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 18:59:41,303 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 18:59:41,303 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 18:59:41,303 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 18:59:41,303 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 18:59:41,304 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 18:59:41,304 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 18:59:41,304 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 18:59:41,304 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 18:59:41,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 18:59:41,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 18:59:41,305 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 18:59:41,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 18:59:41,305 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 18:59:41,305 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 18:59:41,305 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 18:59:41,305 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 18:59:41,305 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 [2022-12-11 18:59:41,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 18:59:41,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 18:59:41,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 18:59:41,669 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 18:59:41,672 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 18:59:41,673 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017.oepc.i [2022-12-11 18:59:42,784 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 18:59:43,006 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 18:59:43,006 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017.oepc.i [2022-12-11 18:59:43,017 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f386d7ab4/3a87e8852e8a4f24867836a1831e96d6/FLAG92d31be04 [2022-12-11 18:59:43,043 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f386d7ab4/3a87e8852e8a4f24867836a1831e96d6 [2022-12-11 18:59:43,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 18:59:43,047 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 18:59:43,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 18:59:43,048 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 18:59:43,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 18:59:43,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 06:59:43" (1/1) ... [2022-12-11 18:59:43,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76ae805e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:59:43, skipping insertion in model container [2022-12-11 18:59:43,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 06:59:43" (1/1) ... [2022-12-11 18:59:43,055 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 18:59:43,107 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 18:59:43,246 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/mix017.oepc.i[945,958] [2022-12-11 18:59:43,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 18:59:43,445 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 18:59:43,453 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/mix017.oepc.i[945,958] [2022-12-11 18:59:43,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,484 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:59:43,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:59:43,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 18:59:43,542 INFO L208 MainTranslator]: Completed translation [2022-12-11 18:59:43,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:59:43 WrapperNode [2022-12-11 18:59:43,543 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 18:59:43,544 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 18:59:43,544 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 18:59:43,544 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 18:59:43,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:59:43" (1/1) ... [2022-12-11 18:59:43,604 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:59:43" (1/1) ... [2022-12-11 18:59:43,637 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-12-11 18:59:43,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 18:59:43,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 18:59:43,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 18:59:43,639 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 18:59:43,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:59:43" (1/1) ... [2022-12-11 18:59:43,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:59:43" (1/1) ... [2022-12-11 18:59:43,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:59:43" (1/1) ... [2022-12-11 18:59:43,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:59:43" (1/1) ... [2022-12-11 18:59:43,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:59:43" (1/1) ... [2022-12-11 18:59:43,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:59:43" (1/1) ... [2022-12-11 18:59:43,670 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:59:43" (1/1) ... [2022-12-11 18:59:43,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:59:43" (1/1) ... [2022-12-11 18:59:43,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 18:59:43,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 18:59:43,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 18:59:43,674 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 18:59:43,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:59:43" (1/1) ... [2022-12-11 18:59:43,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 18:59:43,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 18:59:43,724 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 18:59:43,744 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 18:59:43,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 18:59:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 18:59:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 18:59:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 18:59:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 18:59:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 18:59:43,755 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 18:59:43,755 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 18:59:43,755 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 18:59:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-11 18:59:43,756 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-11 18:59:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-11 18:59:43,756 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-11 18:59:43,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 18:59:43,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 18:59:43,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 18:59:43,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 18:59:43,758 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 18:59:43,848 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 18:59:43,850 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 18:59:44,177 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 18:59:44,284 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 18:59:44,284 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 18:59:44,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 06:59:44 BoogieIcfgContainer [2022-12-11 18:59:44,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 18:59:44,289 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 18:59:44,290 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 18:59:44,292 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 18:59:44,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 06:59:43" (1/3) ... [2022-12-11 18:59:44,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14dd71e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 06:59:44, skipping insertion in model container [2022-12-11 18:59:44,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:59:43" (2/3) ... [2022-12-11 18:59:44,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14dd71e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 06:59:44, skipping insertion in model container [2022-12-11 18:59:44,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 06:59:44" (3/3) ... [2022-12-11 18:59:44,293 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017.oepc.i [2022-12-11 18:59:44,305 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 18:59:44,306 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 18:59:44,306 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 18:59:44,376 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 18:59:44,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2022-12-11 18:59:44,452 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-12-11 18:59:44,452 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 18:59:44,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-11 18:59:44,458 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2022-12-11 18:59:44,465 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2022-12-11 18:59:44,475 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 18:59:44,479 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;@2b8534dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 18:59:44,479 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-11 18:59:44,485 INFO L130 PetriNetUnfolder]: 0/49 cut-off events. [2022-12-11 18:59:44,485 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 18:59:44,485 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:59:44,486 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] [2022-12-11 18:59:44,486 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 18:59:44,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:59:44,490 INFO L85 PathProgramCache]: Analyzing trace with hash 937134915, now seen corresponding path program 1 times [2022-12-11 18:59:44,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:59:44,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895292952] [2022-12-11 18:59:44,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:59:44,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:59:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:59:44,913 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 18:59:44,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:59:44,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895292952] [2022-12-11 18:59:44,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895292952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:59:44,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:59:44,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 18:59:44,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750238021] [2022-12-11 18:59:44,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:59:44,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 18:59:44,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:59:44,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 18:59:44,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 18:59:44,953 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 132 [2022-12-11 18:59:44,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 128 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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 18:59:44,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:59:44,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 132 [2022-12-11 18:59:44,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:59:45,198 INFO L130 PetriNetUnfolder]: 162/611 cut-off events. [2022-12-11 18:59:45,199 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-11 18:59:45,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 611 events. 162/611 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3400 event pairs, 132 based on Foata normal form. 50/623 useless extension candidates. Maximal degree in co-relation 861. Up to 191 conditions per place. [2022-12-11 18:59:45,209 INFO L137 encePairwiseOnDemand]: 127/132 looper letters, 18 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2022-12-11 18:59:45,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 132 transitions, 325 flow [2022-12-11 18:59:45,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 18:59:45,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 18:59:45,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2022-12-11 18:59:45,222 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9419191919191919 [2022-12-11 18:59:45,223 INFO L175 Difference]: Start difference. First operand has 139 places, 128 transitions, 268 flow. Second operand 3 states and 373 transitions. [2022-12-11 18:59:45,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 132 transitions, 325 flow [2022-12-11 18:59:45,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 132 transitions, 318 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-11 18:59:45,230 INFO L231 Difference]: Finished difference. Result has 135 places, 124 transitions, 260 flow [2022-12-11 18:59:45,232 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=135, PETRI_TRANSITIONS=124} [2022-12-11 18:59:45,235 INFO L295 CegarLoopForPetriNet]: 139 programPoint places, -4 predicate places. [2022-12-11 18:59:45,235 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 124 transitions, 260 flow [2022-12-11 18:59:45,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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 18:59:45,235 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:59:45,235 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] [2022-12-11 18:59:45,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 18:59:45,236 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 18:59:45,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:59:45,237 INFO L85 PathProgramCache]: Analyzing trace with hash 10607875, now seen corresponding path program 1 times [2022-12-11 18:59:45,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:59:45,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088881704] [2022-12-11 18:59:45,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:59:45,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:59:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:59:45,645 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 18:59:45,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:59:45,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088881704] [2022-12-11 18:59:45,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088881704] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:59:45,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:59:45,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 18:59:45,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664698640] [2022-12-11 18:59:45,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:59:45,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 18:59:45,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:59:45,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 18:59:45,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 18:59:45,650 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 132 [2022-12-11 18:59:45,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 124 transitions, 260 flow. Second operand has 7 states, 7 states have (on average 103.28571428571429) internal successors, (723), 7 states have internal predecessors, (723), 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 18:59:45,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:59:45,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 132 [2022-12-11 18:59:45,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:59:46,825 INFO L130 PetriNetUnfolder]: 4482/9878 cut-off events. [2022-12-11 18:59:46,825 INFO L131 PetriNetUnfolder]: For 427/427 co-relation queries the response was YES. [2022-12-11 18:59:46,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16611 conditions, 9878 events. 4482/9878 cut-off events. For 427/427 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 88516 event pairs, 642 based on Foata normal form. 0/9695 useless extension candidates. Maximal degree in co-relation 16552. Up to 3208 conditions per place. [2022-12-11 18:59:46,867 INFO L137 encePairwiseOnDemand]: 126/132 looper letters, 32 selfloop transitions, 2 changer transitions 72/192 dead transitions. [2022-12-11 18:59:46,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 192 transitions, 600 flow [2022-12-11 18:59:46,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 18:59:46,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 18:59:46,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1006 transitions. [2022-12-11 18:59:46,870 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8468013468013468 [2022-12-11 18:59:46,870 INFO L175 Difference]: Start difference. First operand has 135 places, 124 transitions, 260 flow. Second operand 9 states and 1006 transitions. [2022-12-11 18:59:46,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 192 transitions, 600 flow [2022-12-11 18:59:46,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 192 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-11 18:59:46,873 INFO L231 Difference]: Finished difference. Result has 148 places, 112 transitions, 252 flow [2022-12-11 18:59:46,874 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=252, PETRI_PLACES=148, PETRI_TRANSITIONS=112} [2022-12-11 18:59:46,874 INFO L295 CegarLoopForPetriNet]: 139 programPoint places, 9 predicate places. [2022-12-11 18:59:46,874 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 112 transitions, 252 flow [2022-12-11 18:59:46,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 103.28571428571429) internal successors, (723), 7 states have internal predecessors, (723), 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 18:59:46,875 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:59:46,875 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 18:59:46,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 18:59:46,875 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 18:59:46,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:59:46,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1016676755, now seen corresponding path program 1 times [2022-12-11 18:59:46,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:59:46,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603045388] [2022-12-11 18:59:46,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:59:46,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:59:46,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:59:47,062 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 18:59:47,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:59:47,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603045388] [2022-12-11 18:59:47,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603045388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:59:47,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:59:47,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 18:59:47,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910549567] [2022-12-11 18:59:47,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:59:47,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 18:59:47,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:59:47,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 18:59:47,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 18:59:47,066 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 132 [2022-12-11 18:59:47,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 112 transitions, 252 flow. Second operand has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 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 18:59:47,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:59:47,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 132 [2022-12-11 18:59:47,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:59:47,939 INFO L130 PetriNetUnfolder]: 4140/7241 cut-off events. [2022-12-11 18:59:47,940 INFO L131 PetriNetUnfolder]: For 325/325 co-relation queries the response was YES. [2022-12-11 18:59:47,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13930 conditions, 7241 events. 4140/7241 cut-off events. For 325/325 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 54107 event pairs, 187 based on Foata normal form. 0/7114 useless extension candidates. Maximal degree in co-relation 13868. Up to 2233 conditions per place. [2022-12-11 18:59:47,969 INFO L137 encePairwiseOnDemand]: 121/132 looper letters, 38 selfloop transitions, 7 changer transitions 60/194 dead transitions. [2022-12-11 18:59:47,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 194 transitions, 632 flow [2022-12-11 18:59:47,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 18:59:47,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 18:59:47,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1157 transitions. [2022-12-11 18:59:47,972 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8765151515151515 [2022-12-11 18:59:47,972 INFO L175 Difference]: Start difference. First operand has 148 places, 112 transitions, 252 flow. Second operand 10 states and 1157 transitions. [2022-12-11 18:59:47,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 194 transitions, 632 flow [2022-12-11 18:59:47,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 194 transitions, 616 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-12-11 18:59:47,993 INFO L231 Difference]: Finished difference. Result has 137 places, 115 transitions, 302 flow [2022-12-11 18:59:47,993 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=302, PETRI_PLACES=137, PETRI_TRANSITIONS=115} [2022-12-11 18:59:47,993 INFO L295 CegarLoopForPetriNet]: 139 programPoint places, -2 predicate places. [2022-12-11 18:59:47,994 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 115 transitions, 302 flow [2022-12-11 18:59:47,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 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 18:59:47,994 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:59:47,994 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 18:59:47,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 18:59:47,995 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 18:59:47,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:59:47,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1212700608, now seen corresponding path program 1 times [2022-12-11 18:59:47,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:59:47,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471003361] [2022-12-11 18:59:47,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:59:47,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:59:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:59:48,225 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 18:59:48,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:59:48,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471003361] [2022-12-11 18:59:48,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471003361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:59:48,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:59:48,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 18:59:48,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568714885] [2022-12-11 18:59:48,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:59:48,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 18:59:48,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:59:48,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 18:59:48,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 18:59:48,227 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 132 [2022-12-11 18:59:48,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 115 transitions, 302 flow. Second operand has 7 states, 7 states have (on average 107.14285714285714) internal successors, (750), 7 states have internal predecessors, (750), 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 18:59:48,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:59:48,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 132 [2022-12-11 18:59:48,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:59:48,760 INFO L130 PetriNetUnfolder]: 1872/3651 cut-off events. [2022-12-11 18:59:48,760 INFO L131 PetriNetUnfolder]: For 3475/3475 co-relation queries the response was YES. [2022-12-11 18:59:48,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10007 conditions, 3651 events. 1872/3651 cut-off events. For 3475/3475 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 25700 event pairs, 156 based on Foata normal form. 108/3737 useless extension candidates. Maximal degree in co-relation 9944. Up to 1002 conditions per place. [2022-12-11 18:59:48,776 INFO L137 encePairwiseOnDemand]: 122/132 looper letters, 46 selfloop transitions, 11 changer transitions 47/193 dead transitions. [2022-12-11 18:59:48,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 193 transitions, 839 flow [2022-12-11 18:59:48,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 18:59:48,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 18:59:48,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1156 transitions. [2022-12-11 18:59:48,778 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8757575757575757 [2022-12-11 18:59:48,778 INFO L175 Difference]: Start difference. First operand has 137 places, 115 transitions, 302 flow. Second operand 10 states and 1156 transitions. [2022-12-11 18:59:48,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 193 transitions, 839 flow [2022-12-11 18:59:48,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 193 transitions, 814 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-11 18:59:48,789 INFO L231 Difference]: Finished difference. Result has 141 places, 119 transitions, 390 flow [2022-12-11 18:59:48,789 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=390, PETRI_PLACES=141, PETRI_TRANSITIONS=119} [2022-12-11 18:59:48,790 INFO L295 CegarLoopForPetriNet]: 139 programPoint places, 2 predicate places. [2022-12-11 18:59:48,790 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 119 transitions, 390 flow [2022-12-11 18:59:48,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.14285714285714) internal successors, (750), 7 states have internal predecessors, (750), 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 18:59:48,791 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:59:48,791 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 18:59:48,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 18:59:48,791 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 18:59:48,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:59:48,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1271948103, now seen corresponding path program 1 times [2022-12-11 18:59:48,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:59:48,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090668325] [2022-12-11 18:59:48,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:59:48,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:59:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:59:49,270 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 18:59:49,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:59:49,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090668325] [2022-12-11 18:59:49,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090668325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:59:49,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:59:49,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 18:59:49,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197902126] [2022-12-11 18:59:49,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:59:49,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 18:59:49,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:59:49,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 18:59:49,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-11 18:59:49,274 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 132 [2022-12-11 18:59:49,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 119 transitions, 390 flow. Second operand has 8 states, 8 states have (on average 100.25) internal successors, (802), 8 states have internal predecessors, (802), 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 18:59:49,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:59:49,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 132 [2022-12-11 18:59:49,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:59:50,238 INFO L130 PetriNetUnfolder]: 2158/5642 cut-off events. [2022-12-11 18:59:50,238 INFO L131 PetriNetUnfolder]: For 9393/10269 co-relation queries the response was YES. [2022-12-11 18:59:50,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15371 conditions, 5642 events. 2158/5642 cut-off events. For 9393/10269 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 50827 event pairs, 706 based on Foata normal form. 135/5627 useless extension candidates. Maximal degree in co-relation 15296. Up to 1570 conditions per place. [2022-12-11 18:59:50,282 INFO L137 encePairwiseOnDemand]: 117/132 looper letters, 88 selfloop transitions, 33 changer transitions 7/217 dead transitions. [2022-12-11 18:59:50,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 217 transitions, 864 flow [2022-12-11 18:59:50,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-11 18:59:50,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-11 18:59:50,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1586 transitions. [2022-12-11 18:59:50,286 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8010101010101011 [2022-12-11 18:59:50,286 INFO L175 Difference]: Start difference. First operand has 141 places, 119 transitions, 390 flow. Second operand 15 states and 1586 transitions. [2022-12-11 18:59:50,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 217 transitions, 864 flow [2022-12-11 18:59:50,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 217 transitions, 795 flow, removed 25 selfloop flow, removed 9 redundant places. [2022-12-11 18:59:50,346 INFO L231 Difference]: Finished difference. Result has 155 places, 150 transitions, 577 flow [2022-12-11 18:59:50,346 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=577, PETRI_PLACES=155, PETRI_TRANSITIONS=150} [2022-12-11 18:59:50,346 INFO L295 CegarLoopForPetriNet]: 139 programPoint places, 16 predicate places. [2022-12-11 18:59:50,346 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 150 transitions, 577 flow [2022-12-11 18:59:50,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 100.25) internal successors, (802), 8 states have internal predecessors, (802), 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 18:59:50,347 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:59:50,347 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 18:59:50,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 18:59:50,348 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 18:59:50,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:59:50,348 INFO L85 PathProgramCache]: Analyzing trace with hash 932139639, now seen corresponding path program 2 times [2022-12-11 18:59:50,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:59:50,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235340798] [2022-12-11 18:59:50,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:59:50,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:59:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:59:50,564 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 18:59:50,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:59:50,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235340798] [2022-12-11 18:59:50,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235340798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:59:50,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:59:50,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 18:59:50,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535932308] [2022-12-11 18:59:50,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:59:50,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 18:59:50,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:59:50,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 18:59:50,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-11 18:59:50,567 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 132 [2022-12-11 18:59:50,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 150 transitions, 577 flow. Second operand has 8 states, 8 states have (on average 107.25) internal successors, (858), 8 states have internal predecessors, (858), 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 18:59:50,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:59:50,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 132 [2022-12-11 18:59:50,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:59:50,913 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L808-->L815: Formula: (let ((.cse0 (not (= (mod v_~a$w_buff0_used~0_127 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_26 256) 0))) (.cse1 (not (= (mod v_~a$r_buff1_thd3~0_20 256) 0)))) (let ((.cse3 (and (not (= (mod v_~a$w_buff1_used~0_111 256) 0)) .cse1)) (.cse4 (and (not (= (mod v_~a$w_buff0_used~0_128 256) 0)) .cse5)) (.cse2 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$r_buff0_thd3~0_25 256) 0))) (and (not (= (mod v_~a$w_buff1_used~0_110 256) 0)) .cse1)) 0 v_~a$r_buff1_thd3~0_20) v_~a$r_buff1_thd3~0_19) (= (ite (or .cse2 .cse3) 0 v_~a$w_buff1_used~0_111) v_~a$w_buff1_used~0_110) (= v_~a~0_58 (ite .cse4 v_~a$w_buff0~0_38 (ite .cse3 v_~a$w_buff1~0_35 v_~a~0_59))) (= (ite .cse4 0 v_~a$w_buff0_used~0_128) v_~a$w_buff0_used~0_127) (= v_~a$r_buff0_thd3~0_25 (ite .cse2 0 v_~a$r_buff0_thd3~0_26))))) InVars {~a~0=v_~a~0_59, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_38, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_128, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_26, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_111} OutVars{~a~0=v_~a~0_58, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_38, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_127, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_25, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_110} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][107], [Black: 184#(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)), Black: 245#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 222#(and (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 223#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1) (< 0 (+ (div ~a$w_buff0_used~0 256) 1))), 220#true, P1Thread1of1ForFork2InUse, 118#L778true, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork0InUse, 19#L788true, 45#L875-3true, 270#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 205#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 151#(= ~__unbuffered_p3_EAX~0 0), 136#L815true, Black: 235#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 224#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 229#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1))), Black: 233#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 11#L851true, Black: 243#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 239#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 237#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 182#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 225#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 180#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 231#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 241#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0))]) [2022-12-11 18:59:50,913 INFO L382 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-12-11 18:59:50,914 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 18:59:50,914 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 18:59:50,914 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 18:59:50,965 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L808-->L815: Formula: (let ((.cse0 (not (= (mod v_~a$w_buff0_used~0_127 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_26 256) 0))) (.cse1 (not (= (mod v_~a$r_buff1_thd3~0_20 256) 0)))) (let ((.cse3 (and (not (= (mod v_~a$w_buff1_used~0_111 256) 0)) .cse1)) (.cse4 (and (not (= (mod v_~a$w_buff0_used~0_128 256) 0)) .cse5)) (.cse2 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$r_buff0_thd3~0_25 256) 0))) (and (not (= (mod v_~a$w_buff1_used~0_110 256) 0)) .cse1)) 0 v_~a$r_buff1_thd3~0_20) v_~a$r_buff1_thd3~0_19) (= (ite (or .cse2 .cse3) 0 v_~a$w_buff1_used~0_111) v_~a$w_buff1_used~0_110) (= v_~a~0_58 (ite .cse4 v_~a$w_buff0~0_38 (ite .cse3 v_~a$w_buff1~0_35 v_~a~0_59))) (= (ite .cse4 0 v_~a$w_buff0_used~0_128) v_~a$w_buff0_used~0_127) (= v_~a$r_buff0_thd3~0_25 (ite .cse2 0 v_~a$r_buff0_thd3~0_26))))) InVars {~a~0=v_~a~0_59, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_38, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_128, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_26, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_111} OutVars{~a~0=v_~a~0_58, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_38, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_127, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_25, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_110} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][127], [Black: 184#(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)), Black: 245#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 222#(and (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 223#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1) (< 0 (+ (div ~a$w_buff0_used~0 256) 1))), 220#true, P1Thread1of1ForFork2InUse, 118#L778true, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork0InUse, Black: 205#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 19#L788true, 45#L875-3true, 272#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 120#L854true, Black: 151#(= ~__unbuffered_p3_EAX~0 0), 136#L815true, Black: 235#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 199#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 224#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 229#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1))), Black: 233#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 243#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 239#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 237#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 182#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 225#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 180#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 231#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 241#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0))]) [2022-12-11 18:59:50,966 INFO L382 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-12-11 18:59:50,966 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-11 18:59:50,966 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-11 18:59:50,966 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-11 18:59:51,165 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L808-->L815: Formula: (let ((.cse0 (not (= (mod v_~a$w_buff0_used~0_127 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_26 256) 0))) (.cse1 (not (= (mod v_~a$r_buff1_thd3~0_20 256) 0)))) (let ((.cse3 (and (not (= (mod v_~a$w_buff1_used~0_111 256) 0)) .cse1)) (.cse4 (and (not (= (mod v_~a$w_buff0_used~0_128 256) 0)) .cse5)) (.cse2 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$r_buff0_thd3~0_25 256) 0))) (and (not (= (mod v_~a$w_buff1_used~0_110 256) 0)) .cse1)) 0 v_~a$r_buff1_thd3~0_20) v_~a$r_buff1_thd3~0_19) (= (ite (or .cse2 .cse3) 0 v_~a$w_buff1_used~0_111) v_~a$w_buff1_used~0_110) (= v_~a~0_58 (ite .cse4 v_~a$w_buff0~0_38 (ite .cse3 v_~a$w_buff1~0_35 v_~a~0_59))) (= (ite .cse4 0 v_~a$w_buff0_used~0_128) v_~a$w_buff0_used~0_127) (= v_~a$r_buff0_thd3~0_25 (ite .cse2 0 v_~a$r_buff0_thd3~0_26))))) InVars {~a~0=v_~a~0_59, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_38, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_128, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_26, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_111} OutVars{~a~0=v_~a~0_58, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_38, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_127, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_25, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_110} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][127], [Black: 184#(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)), Black: 245#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 222#(and (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 223#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1) (< 0 (+ (div ~a$w_buff0_used~0 256) 1))), 220#true, P1Thread1of1ForFork2InUse, 118#L778true, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork0InUse, Black: 205#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 19#L788true, 272#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 120#L854true, Black: 151#(= ~__unbuffered_p3_EAX~0 0), 52#L878true, 136#L815true, Black: 235#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 224#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 229#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1))), Black: 233#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 243#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 239#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 237#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 182#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 225#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 180#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 231#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 241#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0))]) [2022-12-11 18:59:51,165 INFO L382 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-12-11 18:59:51,165 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 18:59:51,165 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 18:59:51,165 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 18:59:51,208 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L808-->L815: Formula: (let ((.cse0 (not (= (mod v_~a$w_buff0_used~0_127 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_26 256) 0))) (.cse1 (not (= (mod v_~a$r_buff1_thd3~0_20 256) 0)))) (let ((.cse3 (and (not (= (mod v_~a$w_buff1_used~0_111 256) 0)) .cse1)) (.cse4 (and (not (= (mod v_~a$w_buff0_used~0_128 256) 0)) .cse5)) (.cse2 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$r_buff0_thd3~0_25 256) 0))) (and (not (= (mod v_~a$w_buff1_used~0_110 256) 0)) .cse1)) 0 v_~a$r_buff1_thd3~0_20) v_~a$r_buff1_thd3~0_19) (= (ite (or .cse2 .cse3) 0 v_~a$w_buff1_used~0_111) v_~a$w_buff1_used~0_110) (= v_~a~0_58 (ite .cse4 v_~a$w_buff0~0_38 (ite .cse3 v_~a$w_buff1~0_35 v_~a~0_59))) (= (ite .cse4 0 v_~a$w_buff0_used~0_128) v_~a$w_buff0_used~0_127) (= v_~a$r_buff0_thd3~0_25 (ite .cse2 0 v_~a$r_buff0_thd3~0_26))))) InVars {~a~0=v_~a~0_59, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_38, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_128, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_26, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_111} OutVars{~a~0=v_~a~0_58, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_38, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_127, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_25, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_110} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][173], [Black: 184#(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)), Black: 245#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 222#(and (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 223#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1) (< 0 (+ (div ~a$w_buff0_used~0 256) 1))), 220#true, 274#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 91#L879true, P1Thread1of1ForFork2InUse, 118#L778true, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork0InUse, Black: 205#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 19#L788true, 120#L854true, Black: 151#(= ~__unbuffered_p3_EAX~0 0), 136#L815true, Black: 235#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 224#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 229#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1))), Black: 233#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 243#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 239#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 237#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 182#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 225#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 180#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 231#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 241#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0))]) [2022-12-11 18:59:51,209 INFO L382 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-12-11 18:59:51,209 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 18:59:51,209 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 18:59:51,209 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 18:59:51,265 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L808-->L815: Formula: (let ((.cse0 (not (= (mod v_~a$w_buff0_used~0_127 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_26 256) 0))) (.cse1 (not (= (mod v_~a$r_buff1_thd3~0_20 256) 0)))) (let ((.cse3 (and (not (= (mod v_~a$w_buff1_used~0_111 256) 0)) .cse1)) (.cse4 (and (not (= (mod v_~a$w_buff0_used~0_128 256) 0)) .cse5)) (.cse2 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$r_buff0_thd3~0_25 256) 0))) (and (not (= (mod v_~a$w_buff1_used~0_110 256) 0)) .cse1)) 0 v_~a$r_buff1_thd3~0_20) v_~a$r_buff1_thd3~0_19) (= (ite (or .cse2 .cse3) 0 v_~a$w_buff1_used~0_111) v_~a$w_buff1_used~0_110) (= v_~a~0_58 (ite .cse4 v_~a$w_buff0~0_38 (ite .cse3 v_~a$w_buff1~0_35 v_~a~0_59))) (= (ite .cse4 0 v_~a$w_buff0_used~0_128) v_~a$w_buff0_used~0_127) (= v_~a$r_buff0_thd3~0_25 (ite .cse2 0 v_~a$r_buff0_thd3~0_26))))) InVars {~a~0=v_~a~0_59, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_38, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_128, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_26, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_111} OutVars{~a~0=v_~a~0_58, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_38, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_127, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_25, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_110} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][173], [Black: 184#(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)), Black: 245#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 222#(and (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 223#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1) (< 0 (+ (div ~a$w_buff0_used~0 256) 1))), 220#true, 274#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, 118#L778true, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork0InUse, Black: 205#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 19#L788true, 120#L854true, 72#L2true, Black: 151#(= ~__unbuffered_p3_EAX~0 0), 136#L815true, Black: 235#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 224#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 229#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1))), Black: 233#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 243#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 239#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 237#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 182#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 225#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 180#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 231#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 241#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0))]) [2022-12-11 18:59:51,266 INFO L382 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-12-11 18:59:51,266 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 18:59:51,266 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 18:59:51,266 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 18:59:51,322 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L808-->L815: Formula: (let ((.cse0 (not (= (mod v_~a$w_buff0_used~0_127 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_26 256) 0))) (.cse1 (not (= (mod v_~a$r_buff1_thd3~0_20 256) 0)))) (let ((.cse3 (and (not (= (mod v_~a$w_buff1_used~0_111 256) 0)) .cse1)) (.cse4 (and (not (= (mod v_~a$w_buff0_used~0_128 256) 0)) .cse5)) (.cse2 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$r_buff0_thd3~0_25 256) 0))) (and (not (= (mod v_~a$w_buff1_used~0_110 256) 0)) .cse1)) 0 v_~a$r_buff1_thd3~0_20) v_~a$r_buff1_thd3~0_19) (= (ite (or .cse2 .cse3) 0 v_~a$w_buff1_used~0_111) v_~a$w_buff1_used~0_110) (= v_~a~0_58 (ite .cse4 v_~a$w_buff0~0_38 (ite .cse3 v_~a$w_buff1~0_35 v_~a~0_59))) (= (ite .cse4 0 v_~a$w_buff0_used~0_128) v_~a$w_buff0_used~0_127) (= v_~a$r_buff0_thd3~0_25 (ite .cse2 0 v_~a$r_buff0_thd3~0_26))))) InVars {~a~0=v_~a~0_59, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_38, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_128, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_26, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_111} OutVars{~a~0=v_~a~0_58, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_38, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_127, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_25, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_110} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][191], [Black: 184#(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)), Black: 245#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 222#(and (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 223#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1) (< 0 (+ (div ~a$w_buff0_used~0 256) 1))), 220#true, 276#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, 118#L778true, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork0InUse, Black: 205#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 19#L788true, 120#L854true, Black: 151#(= ~__unbuffered_p3_EAX~0 0), 62#L3true, 136#L815true, Black: 235#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 224#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 229#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1))), Black: 233#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 243#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 239#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 237#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 225#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 182#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 180#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 231#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 241#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0))]) [2022-12-11 18:59:51,322 INFO L382 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-12-11 18:59:51,322 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-11 18:59:51,322 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-11 18:59:51,322 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-11 18:59:51,433 INFO L130 PetriNetUnfolder]: 2306/5125 cut-off events. [2022-12-11 18:59:51,434 INFO L131 PetriNetUnfolder]: For 13082/13417 co-relation queries the response was YES. [2022-12-11 18:59:51,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17982 conditions, 5125 events. 2306/5125 cut-off events. For 13082/13417 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 42085 event pairs, 118 based on Foata normal form. 192/5200 useless extension candidates. Maximal degree in co-relation 17906. Up to 1132 conditions per place. [2022-12-11 18:59:51,472 INFO L137 encePairwiseOnDemand]: 122/132 looper letters, 125 selfloop transitions, 27 changer transitions 62/307 dead transitions. [2022-12-11 18:59:51,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 307 transitions, 2010 flow [2022-12-11 18:59:51,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 18:59:51,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 18:59:51,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1272 transitions. [2022-12-11 18:59:51,476 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8760330578512396 [2022-12-11 18:59:51,476 INFO L175 Difference]: Start difference. First operand has 155 places, 150 transitions, 577 flow. Second operand 11 states and 1272 transitions. [2022-12-11 18:59:51,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 307 transitions, 2010 flow [2022-12-11 18:59:51,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 307 transitions, 2010 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-11 18:59:51,498 INFO L231 Difference]: Finished difference. Result has 165 places, 159 transitions, 782 flow [2022-12-11 18:59:51,498 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=782, PETRI_PLACES=165, PETRI_TRANSITIONS=159} [2022-12-11 18:59:51,500 INFO L295 CegarLoopForPetriNet]: 139 programPoint places, 26 predicate places. [2022-12-11 18:59:51,500 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 159 transitions, 782 flow [2022-12-11 18:59:51,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.25) internal successors, (858), 8 states have internal predecessors, (858), 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 18:59:51,501 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:59:51,501 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 18:59:51,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 18:59:51,501 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 18:59:51,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:59:51,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1272054188, now seen corresponding path program 1 times [2022-12-11 18:59:51,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:59:51,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918449777] [2022-12-11 18:59:51,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:59:51,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:59:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:59:51,713 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 18:59:51,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:59:51,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918449777] [2022-12-11 18:59:51,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918449777] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:59:51,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:59:51,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 18:59:51,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400775522] [2022-12-11 18:59:51,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:59:51,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 18:59:51,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:59:51,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 18:59:51,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 18:59:51,716 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 132 [2022-12-11 18:59:51,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 159 transitions, 782 flow. Second operand has 7 states, 7 states have (on average 108.85714285714286) internal successors, (762), 7 states have internal predecessors, (762), 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 18:59:51,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:59:51,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 132 [2022-12-11 18:59:51,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:59:52,352 INFO L130 PetriNetUnfolder]: 1381/4629 cut-off events. [2022-12-11 18:59:52,353 INFO L131 PetriNetUnfolder]: For 11851/12389 co-relation queries the response was YES. [2022-12-11 18:59:52,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15433 conditions, 4629 events. 1381/4629 cut-off events. For 11851/12389 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 45945 event pairs, 184 based on Foata normal form. 30/4477 useless extension candidates. Maximal degree in co-relation 15350. Up to 1246 conditions per place. [2022-12-11 18:59:52,378 INFO L137 encePairwiseOnDemand]: 126/132 looper letters, 82 selfloop transitions, 2 changer transitions 26/233 dead transitions. [2022-12-11 18:59:52,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 233 transitions, 1456 flow [2022-12-11 18:59:52,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 18:59:52,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 18:59:52,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 809 transitions. [2022-12-11 18:59:52,380 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8755411255411255 [2022-12-11 18:59:52,380 INFO L175 Difference]: Start difference. First operand has 165 places, 159 transitions, 782 flow. Second operand 7 states and 809 transitions. [2022-12-11 18:59:52,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 233 transitions, 1456 flow [2022-12-11 18:59:52,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 233 transitions, 1236 flow, removed 96 selfloop flow, removed 9 redundant places. [2022-12-11 18:59:52,482 INFO L231 Difference]: Finished difference. Result has 161 places, 160 transitions, 597 flow [2022-12-11 18:59:52,482 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=597, PETRI_PLACES=161, PETRI_TRANSITIONS=160} [2022-12-11 18:59:52,482 INFO L295 CegarLoopForPetriNet]: 139 programPoint places, 22 predicate places. [2022-12-11 18:59:52,482 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 160 transitions, 597 flow [2022-12-11 18:59:52,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.85714285714286) internal successors, (762), 7 states have internal predecessors, (762), 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 18:59:52,483 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:59:52,483 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 18:59:52,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 18:59:52,483 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 18:59:52,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:59:52,484 INFO L85 PathProgramCache]: Analyzing trace with hash 435082936, now seen corresponding path program 2 times [2022-12-11 18:59:52,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:59:52,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733261722] [2022-12-11 18:59:52,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:59:52,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:59:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:59:52,680 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 18:59:52,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:59:52,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733261722] [2022-12-11 18:59:52,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733261722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:59:52,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:59:52,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 18:59:52,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252818095] [2022-12-11 18:59:52,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:59:52,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 18:59:52,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:59:52,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 18:59:52,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-11 18:59:52,682 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 132 [2022-12-11 18:59:52,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 160 transitions, 597 flow. Second operand has 9 states, 9 states have (on average 107.22222222222223) internal successors, (965), 9 states have internal predecessors, (965), 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 18:59:52,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:59:52,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 132 [2022-12-11 18:59:52,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:59:53,182 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L808-->L815: Formula: (let ((.cse0 (not (= (mod v_~a$w_buff0_used~0_127 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_26 256) 0))) (.cse1 (not (= (mod v_~a$r_buff1_thd3~0_20 256) 0)))) (let ((.cse3 (and (not (= (mod v_~a$w_buff1_used~0_111 256) 0)) .cse1)) (.cse4 (and (not (= (mod v_~a$w_buff0_used~0_128 256) 0)) .cse5)) (.cse2 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$r_buff0_thd3~0_25 256) 0))) (and (not (= (mod v_~a$w_buff1_used~0_110 256) 0)) .cse1)) 0 v_~a$r_buff1_thd3~0_20) v_~a$r_buff1_thd3~0_19) (= (ite (or .cse2 .cse3) 0 v_~a$w_buff1_used~0_111) v_~a$w_buff1_used~0_110) (= v_~a~0_58 (ite .cse4 v_~a$w_buff0~0_38 (ite .cse3 v_~a$w_buff1~0_35 v_~a~0_59))) (= (ite .cse4 0 v_~a$w_buff0_used~0_128) v_~a$w_buff0_used~0_127) (= v_~a$r_buff0_thd3~0_25 (ite .cse2 0 v_~a$r_buff0_thd3~0_26))))) InVars {~a~0=v_~a~0_59, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_38, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_128, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_26, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_111} OutVars{~a~0=v_~a~0_58, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_38, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_127, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_25, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_110} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][124], [Black: 245#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 184#(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)), Black: 222#(and (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 223#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1) (< 0 (+ (div ~a$w_buff0_used~0 256) 1))), 322#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 220#true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, 118#L778true, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork0InUse, Black: 276#(and (<= ~__unbuffered_cnt~0 2) (<= |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)), Black: 280#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 264#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 45#L875-3true, 19#L788true, 272#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 120#L854true, Black: 151#(= ~__unbuffered_p3_EAX~0 0), 286#(= ~x~0 1), Black: 297#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 292#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 136#L815true, Black: 300#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 295#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), 199#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 224#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 229#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1))), Black: 233#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 243#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 237#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 231#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 241#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0))]) [2022-12-11 18:59:53,182 INFO L382 tUnfolder$Statistics]: this new event has 85 ancestors and is not cut-off event [2022-12-11 18:59:53,182 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is not cut-off event [2022-12-11 18:59:53,182 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is not cut-off event [2022-12-11 18:59:53,182 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is not cut-off event [2022-12-11 18:59:53,366 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L808-->L815: Formula: (let ((.cse0 (not (= (mod v_~a$w_buff0_used~0_127 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_26 256) 0))) (.cse1 (not (= (mod v_~a$r_buff1_thd3~0_20 256) 0)))) (let ((.cse3 (and (not (= (mod v_~a$w_buff1_used~0_111 256) 0)) .cse1)) (.cse4 (and (not (= (mod v_~a$w_buff0_used~0_128 256) 0)) .cse5)) (.cse2 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$r_buff0_thd3~0_25 256) 0))) (and (not (= (mod v_~a$w_buff1_used~0_110 256) 0)) .cse1)) 0 v_~a$r_buff1_thd3~0_20) v_~a$r_buff1_thd3~0_19) (= (ite (or .cse2 .cse3) 0 v_~a$w_buff1_used~0_111) v_~a$w_buff1_used~0_110) (= v_~a~0_58 (ite .cse4 v_~a$w_buff0~0_38 (ite .cse3 v_~a$w_buff1~0_35 v_~a~0_59))) (= (ite .cse4 0 v_~a$w_buff0_used~0_128) v_~a$w_buff0_used~0_127) (= v_~a$r_buff0_thd3~0_25 (ite .cse2 0 v_~a$r_buff0_thd3~0_26))))) InVars {~a~0=v_~a~0_59, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_38, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_128, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_26, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_111} OutVars{~a~0=v_~a~0_58, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_38, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_127, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_25, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_110} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][124], [Black: 245#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 184#(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)), Black: 222#(and (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 223#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1) (< 0 (+ (div ~a$w_buff0_used~0 256) 1))), 322#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 220#true, P1Thread1of1ForFork2InUse, 118#L778true, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork0InUse, Black: 276#(and (<= ~__unbuffered_cnt~0 2) (<= |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)), Black: 280#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 264#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 19#L788true, 272#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 120#L854true, 286#(= ~x~0 1), Black: 151#(= ~__unbuffered_p3_EAX~0 0), 52#L878true, Black: 297#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 292#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 136#L815true, Black: 300#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 295#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 224#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 229#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1))), Black: 233#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 243#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 237#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 231#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 241#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0))]) [2022-12-11 18:59:53,366 INFO L382 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-12-11 18:59:53,367 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 18:59:53,367 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 18:59:53,367 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 18:59:53,414 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L808-->L815: Formula: (let ((.cse0 (not (= (mod v_~a$w_buff0_used~0_127 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_26 256) 0))) (.cse1 (not (= (mod v_~a$r_buff1_thd3~0_20 256) 0)))) (let ((.cse3 (and (not (= (mod v_~a$w_buff1_used~0_111 256) 0)) .cse1)) (.cse4 (and (not (= (mod v_~a$w_buff0_used~0_128 256) 0)) .cse5)) (.cse2 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$r_buff0_thd3~0_25 256) 0))) (and (not (= (mod v_~a$w_buff1_used~0_110 256) 0)) .cse1)) 0 v_~a$r_buff1_thd3~0_20) v_~a$r_buff1_thd3~0_19) (= (ite (or .cse2 .cse3) 0 v_~a$w_buff1_used~0_111) v_~a$w_buff1_used~0_110) (= v_~a~0_58 (ite .cse4 v_~a$w_buff0~0_38 (ite .cse3 v_~a$w_buff1~0_35 v_~a~0_59))) (= (ite .cse4 0 v_~a$w_buff0_used~0_128) v_~a$w_buff0_used~0_127) (= v_~a$r_buff0_thd3~0_25 (ite .cse2 0 v_~a$r_buff0_thd3~0_26))))) InVars {~a~0=v_~a~0_59, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_38, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_128, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_26, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_111} OutVars{~a~0=v_~a~0_58, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_38, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_127, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_25, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_110} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][167], [Black: 245#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 184#(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)), Black: 222#(and (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 223#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1) (< 0 (+ (div ~a$w_buff0_used~0 256) 1))), 220#true, 274#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 91#L879true, P1Thread1of1ForFork2InUse, 118#L778true, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork0InUse, Black: 276#(and (<= ~__unbuffered_cnt~0 2) (<= |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)), Black: 280#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 264#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 19#L788true, 120#L854true, 326#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 286#(= ~x~0 1), Black: 151#(= ~__unbuffered_p3_EAX~0 0), Black: 297#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 292#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 136#L815true, Black: 300#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 295#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 224#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 229#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1))), Black: 233#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 243#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 237#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 231#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 241#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0))]) [2022-12-11 18:59:53,414 INFO L382 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-12-11 18:59:53,414 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 18:59:53,415 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 18:59:53,415 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 18:59:53,464 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L808-->L815: Formula: (let ((.cse0 (not (= (mod v_~a$w_buff0_used~0_127 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_26 256) 0))) (.cse1 (not (= (mod v_~a$r_buff1_thd3~0_20 256) 0)))) (let ((.cse3 (and (not (= (mod v_~a$w_buff1_used~0_111 256) 0)) .cse1)) (.cse4 (and (not (= (mod v_~a$w_buff0_used~0_128 256) 0)) .cse5)) (.cse2 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$r_buff0_thd3~0_25 256) 0))) (and (not (= (mod v_~a$w_buff1_used~0_110 256) 0)) .cse1)) 0 v_~a$r_buff1_thd3~0_20) v_~a$r_buff1_thd3~0_19) (= (ite (or .cse2 .cse3) 0 v_~a$w_buff1_used~0_111) v_~a$w_buff1_used~0_110) (= v_~a~0_58 (ite .cse4 v_~a$w_buff0~0_38 (ite .cse3 v_~a$w_buff1~0_35 v_~a~0_59))) (= (ite .cse4 0 v_~a$w_buff0_used~0_128) v_~a$w_buff0_used~0_127) (= v_~a$r_buff0_thd3~0_25 (ite .cse2 0 v_~a$r_buff0_thd3~0_26))))) InVars {~a~0=v_~a~0_59, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_38, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_128, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_26, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_111} OutVars{~a~0=v_~a~0_58, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_38, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_127, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_25, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_110} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][167], [Black: 245#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 184#(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)), Black: 222#(and (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 223#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1) (< 0 (+ (div ~a$w_buff0_used~0 256) 1))), 220#true, 274#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, 118#L778true, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork0InUse, Black: 276#(and (<= ~__unbuffered_cnt~0 2) (<= |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)), Black: 280#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 264#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 19#L788true, 120#L854true, 326#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 72#L2true, 286#(= ~x~0 1), Black: 151#(= ~__unbuffered_p3_EAX~0 0), Black: 297#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 292#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 136#L815true, Black: 300#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 295#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 224#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 229#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1))), Black: 233#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 243#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 237#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 231#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 241#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0))]) [2022-12-11 18:59:53,464 INFO L382 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-12-11 18:59:53,464 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 18:59:53,464 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 18:59:53,464 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 18:59:53,521 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L808-->L815: Formula: (let ((.cse0 (not (= (mod v_~a$w_buff0_used~0_127 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_26 256) 0))) (.cse1 (not (= (mod v_~a$r_buff1_thd3~0_20 256) 0)))) (let ((.cse3 (and (not (= (mod v_~a$w_buff1_used~0_111 256) 0)) .cse1)) (.cse4 (and (not (= (mod v_~a$w_buff0_used~0_128 256) 0)) .cse5)) (.cse2 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$r_buff0_thd3~0_25 256) 0))) (and (not (= (mod v_~a$w_buff1_used~0_110 256) 0)) .cse1)) 0 v_~a$r_buff1_thd3~0_20) v_~a$r_buff1_thd3~0_19) (= (ite (or .cse2 .cse3) 0 v_~a$w_buff1_used~0_111) v_~a$w_buff1_used~0_110) (= v_~a~0_58 (ite .cse4 v_~a$w_buff0~0_38 (ite .cse3 v_~a$w_buff1~0_35 v_~a~0_59))) (= (ite .cse4 0 v_~a$w_buff0_used~0_128) v_~a$w_buff0_used~0_127) (= v_~a$r_buff0_thd3~0_25 (ite .cse2 0 v_~a$r_buff0_thd3~0_26))))) InVars {~a~0=v_~a~0_59, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_38, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_128, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_26, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_111} OutVars{~a~0=v_~a~0_58, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_38, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_127, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_25, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_110} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][184], [Black: 245#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 184#(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)), Black: 222#(and (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 223#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1) (< 0 (+ (div ~a$w_buff0_used~0 256) 1))), 220#true, 276#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, 118#L778true, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork0InUse, Black: 280#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 264#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 19#L788true, 120#L854true, 286#(= ~x~0 1), Black: 151#(= ~__unbuffered_p3_EAX~0 0), 328#(and (<= ~__unbuffered_cnt~0 2) (<= |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)), 62#L3true, Black: 297#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 292#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 136#L815true, Black: 300#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 295#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 224#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 229#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1))), Black: 233#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 243#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 237#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 231#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 241#(and (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= (div ~main$tmp_guard1~0 256) 0))]) [2022-12-11 18:59:53,522 INFO L382 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-12-11 18:59:53,522 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-11 18:59:53,522 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-11 18:59:53,522 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-11 18:59:53,679 INFO L130 PetriNetUnfolder]: 3518/7541 cut-off events. [2022-12-11 18:59:53,679 INFO L131 PetriNetUnfolder]: For 15380/16224 co-relation queries the response was YES. [2022-12-11 18:59:53,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24399 conditions, 7541 events. 3518/7541 cut-off events. For 15380/16224 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 65602 event pairs, 186 based on Foata normal form. 158/7469 useless extension candidates. Maximal degree in co-relation 24369. Up to 1665 conditions per place. [2022-12-11 18:59:53,712 INFO L137 encePairwiseOnDemand]: 122/132 looper letters, 92 selfloop transitions, 33 changer transitions 72/291 dead transitions. [2022-12-11 18:59:53,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 291 transitions, 1756 flow [2022-12-11 18:59:53,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-11 18:59:53,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-11 18:59:53,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1581 transitions. [2022-12-11 18:59:53,715 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8555194805194806 [2022-12-11 18:59:53,715 INFO L175 Difference]: Start difference. First operand has 161 places, 160 transitions, 597 flow. Second operand 14 states and 1581 transitions. [2022-12-11 18:59:53,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 291 transitions, 1756 flow [2022-12-11 18:59:53,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 291 transitions, 1659 flow, removed 47 selfloop flow, removed 8 redundant places. [2022-12-11 18:59:53,837 INFO L231 Difference]: Finished difference. Result has 169 places, 156 transitions, 651 flow [2022-12-11 18:59:53,838 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=651, PETRI_PLACES=169, PETRI_TRANSITIONS=156} [2022-12-11 18:59:53,840 INFO L295 CegarLoopForPetriNet]: 139 programPoint places, 30 predicate places. [2022-12-11 18:59:53,840 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 156 transitions, 651 flow [2022-12-11 18:59:53,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 107.22222222222223) internal successors, (965), 9 states have internal predecessors, (965), 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 18:59:53,842 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:59:53,842 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 18:59:53,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 18:59:53,842 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 18:59:53,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:59:53,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1239273794, now seen corresponding path program 1 times [2022-12-11 18:59:53,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:59:53,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888121200] [2022-12-11 18:59:53,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:59:53,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:59:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:59:54,244 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 18:59:54,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:59:54,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888121200] [2022-12-11 18:59:54,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888121200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:59:54,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:59:54,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 18:59:54,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210336938] [2022-12-11 18:59:54,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:59:54,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 18:59:54,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:59:54,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 18:59:54,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-11 18:59:54,246 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 132 [2022-12-11 18:59:54,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 156 transitions, 651 flow. Second operand has 10 states, 10 states have (on average 98.2) internal successors, (982), 10 states have internal predecessors, (982), 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 18:59:54,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:59:54,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 132 [2022-12-11 18:59:54,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:59:55,467 INFO L130 PetriNetUnfolder]: 2841/8757 cut-off events. [2022-12-11 18:59:55,467 INFO L131 PetriNetUnfolder]: For 14161/14391 co-relation queries the response was YES. [2022-12-11 18:59:55,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25274 conditions, 8757 events. 2841/8757 cut-off events. For 14161/14391 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 98358 event pairs, 174 based on Foata normal form. 1/8496 useless extension candidates. Maximal degree in co-relation 25184. Up to 1060 conditions per place. [2022-12-11 18:59:55,521 INFO L137 encePairwiseOnDemand]: 118/132 looper letters, 79 selfloop transitions, 18 changer transitions 55/259 dead transitions. [2022-12-11 18:59:55,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 259 transitions, 1528 flow [2022-12-11 18:59:55,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-11 18:59:55,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-11 18:59:55,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1438 transitions. [2022-12-11 18:59:55,525 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7781385281385281 [2022-12-11 18:59:55,525 INFO L175 Difference]: Start difference. First operand has 169 places, 156 transitions, 651 flow. Second operand 14 states and 1438 transitions. [2022-12-11 18:59:55,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 259 transitions, 1528 flow [2022-12-11 18:59:55,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 259 transitions, 1400 flow, removed 43 selfloop flow, removed 14 redundant places. [2022-12-11 18:59:55,787 INFO L231 Difference]: Finished difference. Result has 177 places, 167 transitions, 751 flow [2022-12-11 18:59:55,787 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=751, PETRI_PLACES=177, PETRI_TRANSITIONS=167} [2022-12-11 18:59:55,788 INFO L295 CegarLoopForPetriNet]: 139 programPoint places, 38 predicate places. [2022-12-11 18:59:55,788 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 167 transitions, 751 flow [2022-12-11 18:59:55,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 98.2) internal successors, (982), 10 states have internal predecessors, (982), 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 18:59:55,788 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:59:55,789 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 18:59:55,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 18:59:55,789 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 18:59:55,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:59:55,789 INFO L85 PathProgramCache]: Analyzing trace with hash 633611884, now seen corresponding path program 2 times [2022-12-11 18:59:55,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:59:55,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031085729] [2022-12-11 18:59:55,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:59:55,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:59:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:59:56,871 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 18:59:56,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:59:56,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031085729] [2022-12-11 18:59:56,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031085729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:59:56,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:59:56,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-12-11 18:59:56,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022908161] [2022-12-11 18:59:56,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:59:56,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-11 18:59:56,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:59:56,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-11 18:59:56,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-12-11 18:59:56,878 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 132 [2022-12-11 18:59:56,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 167 transitions, 751 flow. Second operand has 15 states, 15 states have (on average 92.46666666666667) internal successors, (1387), 15 states have internal predecessors, (1387), 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 18:59:56,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:59:56,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 132 [2022-12-11 18:59:56,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:59:58,169 INFO L130 PetriNetUnfolder]: 2204/7681 cut-off events. [2022-12-11 18:59:58,169 INFO L131 PetriNetUnfolder]: For 10276/10337 co-relation queries the response was YES. [2022-12-11 18:59:58,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20778 conditions, 7681 events. 2204/7681 cut-off events. For 10276/10337 co-relation queries the response was YES. Maximal size of possible extension queue 756. Compared 91929 event pairs, 118 based on Foata normal form. 19/7502 useless extension candidates. Maximal degree in co-relation 20746. Up to 738 conditions per place. [2022-12-11 18:59:58,212 INFO L137 encePairwiseOnDemand]: 115/132 looper letters, 77 selfloop transitions, 46 changer transitions 29/256 dead transitions. [2022-12-11 18:59:58,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 256 transitions, 1733 flow [2022-12-11 18:59:58,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-11 18:59:58,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-11 18:59:58,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1909 transitions. [2022-12-11 18:59:58,229 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7231060606060606 [2022-12-11 18:59:58,229 INFO L175 Difference]: Start difference. First operand has 177 places, 167 transitions, 751 flow. Second operand 20 states and 1909 transitions. [2022-12-11 18:59:58,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 256 transitions, 1733 flow [2022-12-11 18:59:58,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 256 transitions, 1651 flow, removed 40 selfloop flow, removed 7 redundant places. [2022-12-11 18:59:58,469 INFO L231 Difference]: Finished difference. Result has 196 places, 193 transitions, 1087 flow [2022-12-11 18:59:58,469 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1087, PETRI_PLACES=196, PETRI_TRANSITIONS=193} [2022-12-11 18:59:58,469 INFO L295 CegarLoopForPetriNet]: 139 programPoint places, 57 predicate places. [2022-12-11 18:59:58,469 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 193 transitions, 1087 flow [2022-12-11 18:59:58,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 92.46666666666667) internal successors, (1387), 15 states have internal predecessors, (1387), 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 18:59:58,470 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:59:58,470 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 18:59:58,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 18:59:58,470 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 18:59:58,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:59:58,471 INFO L85 PathProgramCache]: Analyzing trace with hash -10942900, now seen corresponding path program 3 times [2022-12-11 18:59:58,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:59:58,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580245673] [2022-12-11 18:59:58,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:59:58,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:59:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:59:58,672 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 18:59:58,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:59:58,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580245673] [2022-12-11 18:59:58,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580245673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:59:58,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:59:58,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 18:59:58,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673628827] [2022-12-11 18:59:58,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:59:58,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 18:59:58,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:59:58,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 18:59:58,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 18:59:58,675 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 132 [2022-12-11 18:59:58,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 193 transitions, 1087 flow. Second operand has 7 states, 7 states have (on average 108.14285714285714) internal successors, (757), 7 states have internal predecessors, (757), 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 18:59:58,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:59:58,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 132 [2022-12-11 18:59:58,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:59:59,695 INFO L130 PetriNetUnfolder]: 2803/9905 cut-off events. [2022-12-11 18:59:59,695 INFO L131 PetriNetUnfolder]: For 17032/17451 co-relation queries the response was YES. [2022-12-11 18:59:59,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27917 conditions, 9905 events. 2803/9905 cut-off events. For 17032/17451 co-relation queries the response was YES. Maximal size of possible extension queue 1036. Compared 126542 event pairs, 164 based on Foata normal form. 64/9632 useless extension candidates. Maximal degree in co-relation 27876. Up to 1018 conditions per place. [2022-12-11 18:59:59,753 INFO L137 encePairwiseOnDemand]: 126/132 looper letters, 37 selfloop transitions, 1 changer transitions 84/241 dead transitions. [2022-12-11 18:59:59,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 241 transitions, 1758 flow [2022-12-11 18:59:59,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 18:59:59,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 18:59:59,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 775 transitions. [2022-12-11 18:59:59,762 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8387445887445888 [2022-12-11 18:59:59,762 INFO L175 Difference]: Start difference. First operand has 196 places, 193 transitions, 1087 flow. Second operand 7 states and 775 transitions. [2022-12-11 18:59:59,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 241 transitions, 1758 flow [2022-12-11 19:00:00,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 241 transitions, 1731 flow, removed 10 selfloop flow, removed 9 redundant places. [2022-12-11 19:00:00,270 INFO L231 Difference]: Finished difference. Result has 192 places, 152 transitions, 680 flow [2022-12-11 19:00:00,270 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=680, PETRI_PLACES=192, PETRI_TRANSITIONS=152} [2022-12-11 19:00:00,271 INFO L295 CegarLoopForPetriNet]: 139 programPoint places, 53 predicate places. [2022-12-11 19:00:00,271 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 152 transitions, 680 flow [2022-12-11 19:00:00,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.14285714285714) internal successors, (757), 7 states have internal predecessors, (757), 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 19:00:00,271 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:00:00,271 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:00:00,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-11 19:00:00,271 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 19:00:00,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:00:00,272 INFO L85 PathProgramCache]: Analyzing trace with hash 2021268412, now seen corresponding path program 4 times [2022-12-11 19:00:00,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:00:00,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595066967] [2022-12-11 19:00:00,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:00:00,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:00:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 19:00:00,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 19:00:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 19:00:00,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 19:00:00,389 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 19:00:00,390 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-11 19:00:00,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-11 19:00:00,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-11 19:00:00,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-11 19:00:00,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-11 19:00:00,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-11 19:00:00,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-11 19:00:00,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-11 19:00:00,392 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1] [2022-12-11 19:00:00,396 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 19:00:00,396 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 19:00:00,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 07:00:00 BasicIcfg [2022-12-11 19:00:00,523 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 19:00:00,524 INFO L158 Benchmark]: Toolchain (without parser) took 17477.11ms. Allocated memory was 206.6MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 181.6MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 289.0MB. Max. memory is 8.0GB. [2022-12-11 19:00:00,524 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory was 111.0MB in the beginning and 110.9MB in the end (delta: 46.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 19:00:00,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.87ms. Allocated memory is still 206.6MB. Free memory was 181.3MB in the beginning and 153.2MB in the end (delta: 28.2MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-11 19:00:00,524 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.94ms. Allocated memory is still 206.6MB. Free memory was 153.2MB in the beginning and 182.8MB in the end (delta: -29.6MB). Peak memory consumption was 3.3MB. Max. memory is 8.0GB. [2022-12-11 19:00:00,524 INFO L158 Benchmark]: Boogie Preprocessor took 34.95ms. Allocated memory is still 206.6MB. Free memory was 182.8MB in the beginning and 180.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 19:00:00,525 INFO L158 Benchmark]: RCFGBuilder took 613.33ms. Allocated memory is still 206.6MB. Free memory was 180.7MB in the beginning and 142.9MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-11 19:00:00,525 INFO L158 Benchmark]: TraceAbstraction took 16234.03ms. Allocated memory was 206.6MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 141.9MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 249.0MB. Max. memory is 8.0GB. [2022-12-11 19:00:00,526 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 127.9MB. Free memory was 111.0MB in the beginning and 110.9MB in the end (delta: 46.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 495.87ms. Allocated memory is still 206.6MB. Free memory was 181.3MB in the beginning and 153.2MB in the end (delta: 28.2MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 93.94ms. Allocated memory is still 206.6MB. Free memory was 153.2MB in the beginning and 182.8MB in the end (delta: -29.6MB). Peak memory consumption was 3.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.95ms. Allocated memory is still 206.6MB. Free memory was 182.8MB in the beginning and 180.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 613.33ms. Allocated memory is still 206.6MB. Free memory was 180.7MB in the beginning and 142.9MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 16234.03ms. Allocated memory was 206.6MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 141.9MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 249.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L716] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L718] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L720] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L722] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L723] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0] [L724] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L725] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L726] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L727] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L728] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0] [L729] 0 _Bool a$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0] [L730] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0] [L731] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L732] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L733] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0] [L734] 0 _Bool a$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0] [L735] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0] [L736] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L737] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L738] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L739] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L740] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L741] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L742] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L744] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L746] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L748] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L749] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L750] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t433; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t433={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L869] FCALL, FORK 0 pthread_create(&t433, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t433, ((void *)0), P0, ((void *)0))=-3, t433={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t434; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t433={5:0}, t434={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] FCALL, FORK 0 pthread_create(&t434, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t434, ((void *)0), P1, ((void *)0))=-2, t433={5:0}, t434={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] 0 pthread_t t435; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t433={5:0}, t434={6:0}, t435={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] FCALL, FORK 0 pthread_create(&t435, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t435, ((void *)0), P2, ((void *)0))=-1, t433={5:0}, t434={6:0}, t435={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L874] 0 pthread_t t436; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t433={5:0}, t434={6:0}, t435={7:0}, t436={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] FCALL, FORK 0 pthread_create(&t436, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t436, ((void *)0), P3, ((void *)0))=0, t433={5:0}, t434={6:0}, t435={7:0}, t436={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=0, z=0] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L810] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L811] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L812] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L813] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L814] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L824] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L827] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 a$flush_delayed = weak$$choice2 [L833] 4 a$mem_tmp = a [L834] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L835] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L836] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L837] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L838] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L840] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EBX = a [L842] 4 a = a$flush_delayed ? a$mem_tmp : a [L843] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L846] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L847] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L848] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L849] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L850] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L853] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L877] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t433={5:0}, t434={6:0}, t435={7:0}, t436={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L879] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L879] RET 0 assume_abort_if_not(main$tmp_guard0) [L881] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L882] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L883] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L884] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L885] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t433={5:0}, t434={6:0}, t435={7:0}, t436={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L888] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t433={5:0}, t434={6:0}, t435={7:0}, t436={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L890] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 871]: 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: 875]: 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: 873]: 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: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 169 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 967 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 967 mSDsluCounter, 1010 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 834 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2358 IncrementalHoareTripleChecker+Invalid, 2432 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 176 mSDtfsCounter, 2358 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1087occurred in iteration=10, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1097 NumberOfCodeBlocks, 1097 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 983 ConstructedInterpolants, 0 QuantifiedInterpolants, 5427 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 19:00:00,540 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...