/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe028_rmo.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:53:41,166 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:53:41,168 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:53:41,206 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:53:41,207 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:53:41,208 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:53:41,212 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:53:41,216 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:53:41,220 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:53:41,224 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:53:41,225 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:53:41,228 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:53:41,228 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:53:41,230 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:53:41,231 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:53:41,234 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:53:41,235 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:53:41,235 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:53:41,237 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:53:41,242 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:53:41,243 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:53:41,244 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:53:41,245 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:53:41,245 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:53:41,252 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:53:41,252 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:53:41,252 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:53:41,253 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:53:41,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:53:41,254 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:53:41,254 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:53:41,259 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:53:41,260 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:53:41,261 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:53:41,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:53:41,261 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:53:41,262 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:53:41,262 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:53:41,262 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:53:41,263 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:53:41,264 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:53:41,266 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-RepeatedSemanticLbe.epf [2022-12-13 00:53:41,295 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:53:41,295 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:53:41,297 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:53:41,297 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:53:41,297 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:53:41,298 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:53:41,298 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:53:41,298 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:53:41,298 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:53:41,298 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:53:41,299 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:53:41,299 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:53:41,299 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:53:41,299 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:53:41,299 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:53:41,299 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:53:41,300 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:53:41,300 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:53:41,300 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:53:41,300 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:53:41,300 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:53:41,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:53:41,300 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:53:41,300 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:53:41,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:53:41,301 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:53:41,301 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:53:41,301 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:53:41,301 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-13 00:53:41,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:53:41,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:53:41,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:53:41,645 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:53:41,645 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:53:41,646 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe028_rmo.i [2022-12-13 00:53:42,690 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:53:42,998 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:53:42,998 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe028_rmo.i [2022-12-13 00:53:43,011 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d30a21ba/27cc2662924a47c8b9d255a62a8a7ef0/FLAG22a0547b5 [2022-12-13 00:53:43,025 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d30a21ba/27cc2662924a47c8b9d255a62a8a7ef0 [2022-12-13 00:53:43,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:53:43,029 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:53:43,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:53:43,031 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:53:43,033 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:53:43,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:53:43" (1/1) ... [2022-12-13 00:53:43,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@454e8ce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:43, skipping insertion in model container [2022-12-13 00:53:43,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:53:43" (1/1) ... [2022-12-13 00:53:43,041 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:53:43,082 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:53:43,215 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/safe028_rmo.i[988,1001] [2022-12-13 00:53:43,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:43,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:43,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:43,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:43,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:43,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:43,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:43,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:43,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:43,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:43,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:43,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:43,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:43,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:43,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:43,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:43,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:43,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:43,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:43,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:43,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:43,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:43,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:43,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:43,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:43,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:43,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:43,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:43,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:43,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:43,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:53:43,436 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:53:43,448 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/safe028_rmo.i[988,1001] [2022-12-13 00:53:43,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:43,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:43,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:43,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:43,484 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:43,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:43,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:43,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:43,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:43,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:43,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:43,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:43,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:43,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:43,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:43,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:43,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:43,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:43,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:43,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:43,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:43,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:43,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:43,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:43,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:43,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:43,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:43,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:43,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:53:43,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:53:43,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:53:43,556 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:53:43,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:43 WrapperNode [2022-12-13 00:53:43,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:53:43,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:53:43,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:53:43,558 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:53:43,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:43" (1/1) ... [2022-12-13 00:53:43,594 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:43" (1/1) ... [2022-12-13 00:53:43,630 INFO L138 Inliner]: procedures = 176, calls = 75, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 136 [2022-12-13 00:53:43,630 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:53:43,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:53:43,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:53:43,631 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:53:43,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:43" (1/1) ... [2022-12-13 00:53:43,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:43" (1/1) ... [2022-12-13 00:53:43,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:43" (1/1) ... [2022-12-13 00:53:43,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:43" (1/1) ... [2022-12-13 00:53:43,677 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:43" (1/1) ... [2022-12-13 00:53:43,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:43" (1/1) ... [2022-12-13 00:53:43,680 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:43" (1/1) ... [2022-12-13 00:53:43,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:43" (1/1) ... [2022-12-13 00:53:43,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:53:43,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:53:43,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:53:43,686 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:53:43,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:43" (1/1) ... [2022-12-13 00:53:43,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:53:43,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:53:43,725 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-13 00:53:43,750 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-13 00:53:43,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 00:53:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:53:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:53:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:53:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:53:43,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:53:43,768 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:53:43,768 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:53:43,768 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:53:43,768 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:53:43,769 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:53:43,769 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:53:43,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:53:43,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:53:43,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:53:43,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:53:43,771 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:53:43,926 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:53:43,931 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:53:44,341 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:53:44,642 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:53:44,642 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:53:44,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:53:44 BoogieIcfgContainer [2022-12-13 00:53:44,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:53:44,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:53:44,648 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:53:44,652 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:53:44,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:53:43" (1/3) ... [2022-12-13 00:53:44,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b30b48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:53:44, skipping insertion in model container [2022-12-13 00:53:44,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:53:43" (2/3) ... [2022-12-13 00:53:44,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b30b48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:53:44, skipping insertion in model container [2022-12-13 00:53:44,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:53:44" (3/3) ... [2022-12-13 00:53:44,655 INFO L112 eAbstractionObserver]: Analyzing ICFG safe028_rmo.i [2022-12-13 00:53:44,673 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:53:44,673 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 00:53:44,673 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:53:44,761 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:53:44,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2022-12-13 00:53:44,861 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-12-13 00:53:44,861 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:53:44,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2022-12-13 00:53:44,867 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 124 transitions, 263 flow [2022-12-13 00:53:44,872 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 109 transitions, 227 flow [2022-12-13 00:53:44,873 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:44,898 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 109 transitions, 227 flow [2022-12-13 00:53:44,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 109 transitions, 227 flow [2022-12-13 00:53:44,950 INFO L130 PetriNetUnfolder]: 1/109 cut-off events. [2022-12-13 00:53:44,951 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:53:44,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 1/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 39 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2022-12-13 00:53:44,955 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 109 transitions, 227 flow [2022-12-13 00:53:44,955 INFO L226 LiptonReduction]: Number of co-enabled transitions 1138 [2022-12-13 00:53:51,221 INFO L241 LiptonReduction]: Total number of compositions: 91 [2022-12-13 00:53:51,234 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:53:51,240 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=REPEATED_LIPTON_PN, 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;@1d1cefd5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:53:51,240 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 00:53:51,245 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-13 00:53:51,246 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:53:51,246 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:51,247 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:51,247 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:53:51,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:51,251 INFO L85 PathProgramCache]: Analyzing trace with hash -861805348, now seen corresponding path program 1 times [2022-12-13 00:53:51,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:51,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946143521] [2022-12-13 00:53:51,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:51,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:51,495 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-13 00:53:51,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:51,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946143521] [2022-12-13 00:53:51,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946143521] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:51,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:51,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:53:51,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835147522] [2022-12-13 00:53:51,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:51,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 00:53:51,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:51,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 00:53:51,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 00:53:51,532 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2022-12-13 00:53:51,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 67 flow. Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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-13 00:53:51,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:51,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2022-12-13 00:53:51,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:51,908 INFO L130 PetriNetUnfolder]: 1164/1786 cut-off events. [2022-12-13 00:53:51,908 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-13 00:53:51,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3578 conditions, 1786 events. 1164/1786 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 8039 event pairs, 1164 based on Foata normal form. 0/1439 useless extension candidates. Maximal degree in co-relation 3567. Up to 1726 conditions per place. [2022-12-13 00:53:51,927 INFO L137 encePairwiseOnDemand]: 28/29 looper letters, 21 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2022-12-13 00:53:51,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 28 transitions, 107 flow [2022-12-13 00:53:51,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 00:53:51,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 00:53:51,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2022-12-13 00:53:51,937 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6206896551724138 [2022-12-13 00:53:51,938 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 67 flow. Second operand 2 states and 36 transitions. [2022-12-13 00:53:51,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 28 transitions, 107 flow [2022-12-13 00:53:51,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 28 transitions, 104 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:53:51,944 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 62 flow [2022-12-13 00:53:51,945 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2022-12-13 00:53:51,948 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2022-12-13 00:53:51,949 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:51,949 INFO L89 Accepts]: Start accepts. Operand has 36 places, 28 transitions, 62 flow [2022-12-13 00:53:51,951 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:51,952 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:51,952 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 28 transitions, 62 flow [2022-12-13 00:53:51,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 28 transitions, 62 flow [2022-12-13 00:53:51,966 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-13 00:53:51,966 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:53:51,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 63 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-13 00:53:51,968 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 28 transitions, 62 flow [2022-12-13 00:53:51,968 INFO L226 LiptonReduction]: Number of co-enabled transitions 426 [2022-12-13 00:53:52,181 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:53:52,184 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 235 [2022-12-13 00:53:52,184 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 62 flow [2022-12-13 00:53:52,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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-13 00:53:52,185 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:52,185 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:52,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:53:52,188 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:53:52,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:52,189 INFO L85 PathProgramCache]: Analyzing trace with hash 733731568, now seen corresponding path program 1 times [2022-12-13 00:53:52,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:52,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137774608] [2022-12-13 00:53:52,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:52,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:52,624 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-13 00:53:52,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:52,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137774608] [2022-12-13 00:53:52,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137774608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:52,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:52,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:53:52,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407347061] [2022-12-13 00:53:52,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:52,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:53:52,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:52,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:53:52,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:53:52,629 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2022-12-13 00:53:52,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-13 00:53:52,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:52,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2022-12-13 00:53:52,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:52,927 INFO L130 PetriNetUnfolder]: 1099/1816 cut-off events. [2022-12-13 00:53:52,928 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:53:52,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3515 conditions, 1816 events. 1099/1816 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9162 event pairs, 259 based on Foata normal form. 25/1529 useless extension candidates. Maximal degree in co-relation 3507. Up to 1316 conditions per place. [2022-12-13 00:53:52,939 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 29 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2022-12-13 00:53:52,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 38 transitions, 144 flow [2022-12-13 00:53:52,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:53:52,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:53:52,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-13 00:53:52,941 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2022-12-13 00:53:52,941 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 62 flow. Second operand 3 states and 53 transitions. [2022-12-13 00:53:52,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 38 transitions, 144 flow [2022-12-13 00:53:52,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 38 transitions, 144 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:53:52,943 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 70 flow [2022-12-13 00:53:52,943 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2022-12-13 00:53:52,944 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2022-12-13 00:53:52,944 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:52,945 INFO L89 Accepts]: Start accepts. Operand has 38 places, 28 transitions, 70 flow [2022-12-13 00:53:52,945 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:52,945 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:52,945 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 28 transitions, 70 flow [2022-12-13 00:53:52,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 28 transitions, 70 flow [2022-12-13 00:53:52,952 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-13 00:53:52,952 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:53:52,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 63 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:53:52,953 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 28 transitions, 70 flow [2022-12-13 00:53:52,953 INFO L226 LiptonReduction]: Number of co-enabled transitions 422 [2022-12-13 00:53:52,955 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:53:52,956 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 00:53:52,956 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 70 flow [2022-12-13 00:53:52,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-13 00:53:52,957 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:52,957 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:52,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:53:52,958 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:53:52,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:52,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1270842945, now seen corresponding path program 1 times [2022-12-13 00:53:52,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:52,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443979139] [2022-12-13 00:53:52,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:52,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:53,961 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-13 00:53:53,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:53,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443979139] [2022-12-13 00:53:53,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443979139] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:53,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:53,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:53:53,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421930849] [2022-12-13 00:53:53,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:53,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:53:53,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:53,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:53:53,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:53:53,967 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2022-12-13 00:53:53,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 70 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-13 00:53:53,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:53,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2022-12-13 00:53:53,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:54,362 INFO L130 PetriNetUnfolder]: 1077/1792 cut-off events. [2022-12-13 00:53:54,362 INFO L131 PetriNetUnfolder]: For 148/148 co-relation queries the response was YES. [2022-12-13 00:53:54,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3706 conditions, 1792 events. 1077/1792 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 9106 event pairs, 563 based on Foata normal form. 8/1490 useless extension candidates. Maximal degree in co-relation 3695. Up to 1533 conditions per place. [2022-12-13 00:53:54,372 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 33 selfloop transitions, 6 changer transitions 0/46 dead transitions. [2022-12-13 00:53:54,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 46 transitions, 191 flow [2022-12-13 00:53:54,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:53:54,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:53:54,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-13 00:53:54,375 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-13 00:53:54,375 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 70 flow. Second operand 4 states and 68 transitions. [2022-12-13 00:53:54,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 46 transitions, 191 flow [2022-12-13 00:53:54,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 46 transitions, 185 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:53:54,379 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 104 flow [2022-12-13 00:53:54,379 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2022-12-13 00:53:54,380 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2022-12-13 00:53:54,380 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:54,380 INFO L89 Accepts]: Start accepts. Operand has 41 places, 33 transitions, 104 flow [2022-12-13 00:53:54,381 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:54,381 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:54,381 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 33 transitions, 104 flow [2022-12-13 00:53:54,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 33 transitions, 104 flow [2022-12-13 00:53:54,390 INFO L130 PetriNetUnfolder]: 4/52 cut-off events. [2022-12-13 00:53:54,390 INFO L131 PetriNetUnfolder]: For 3/4 co-relation queries the response was YES. [2022-12-13 00:53:54,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 52 events. 4/52 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 206 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 77. Up to 9 conditions per place. [2022-12-13 00:53:54,391 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 33 transitions, 104 flow [2022-12-13 00:53:54,391 INFO L226 LiptonReduction]: Number of co-enabled transitions 484 [2022-12-13 00:53:54,579 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:53:54,580 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 200 [2022-12-13 00:53:54,581 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 104 flow [2022-12-13 00:53:54,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-13 00:53:54,581 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:54,581 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:54,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:53:54,581 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:53:54,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:54,582 INFO L85 PathProgramCache]: Analyzing trace with hash 741378398, now seen corresponding path program 1 times [2022-12-13 00:53:54,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:54,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542032645] [2022-12-13 00:53:54,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:54,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:54,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:53:54,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:54,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542032645] [2022-12-13 00:53:54,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542032645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:54,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:54,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:53:54,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099585581] [2022-12-13 00:53:54,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:54,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:53:54,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:54,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:53:54,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:53:54,742 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 00:53:54,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-13 00:53:54,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:54,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 00:53:54,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:55,215 INFO L130 PetriNetUnfolder]: 1952/3029 cut-off events. [2022-12-13 00:53:55,215 INFO L131 PetriNetUnfolder]: For 589/589 co-relation queries the response was YES. [2022-12-13 00:53:55,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7072 conditions, 3029 events. 1952/3029 cut-off events. For 589/589 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 16166 event pairs, 136 based on Foata normal form. 216/2259 useless extension candidates. Maximal degree in co-relation 7059. Up to 1681 conditions per place. [2022-12-13 00:53:55,231 INFO L137 encePairwiseOnDemand]: 16/28 looper letters, 56 selfloop transitions, 11 changer transitions 1/72 dead transitions. [2022-12-13 00:53:55,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 72 transitions, 348 flow [2022-12-13 00:53:55,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:53:55,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:53:55,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-12-13 00:53:55,233 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6875 [2022-12-13 00:53:55,233 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 104 flow. Second operand 4 states and 77 transitions. [2022-12-13 00:53:55,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 72 transitions, 348 flow [2022-12-13 00:53:55,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 72 transitions, 348 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:53:55,238 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 186 flow [2022-12-13 00:53:55,239 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2022-12-13 00:53:55,242 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2022-12-13 00:53:55,242 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:55,242 INFO L89 Accepts]: Start accepts. Operand has 46 places, 42 transitions, 186 flow [2022-12-13 00:53:55,244 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:55,245 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:55,245 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 42 transitions, 186 flow [2022-12-13 00:53:55,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 42 transitions, 186 flow [2022-12-13 00:53:55,300 INFO L130 PetriNetUnfolder]: 246/519 cut-off events. [2022-12-13 00:53:55,300 INFO L131 PetriNetUnfolder]: For 139/148 co-relation queries the response was YES. [2022-12-13 00:53:55,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1230 conditions, 519 events. 246/519 cut-off events. For 139/148 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 3221 event pairs, 117 based on Foata normal form. 0/278 useless extension candidates. Maximal degree in co-relation 1216. Up to 406 conditions per place. [2022-12-13 00:53:55,305 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 42 transitions, 186 flow [2022-12-13 00:53:55,306 INFO L226 LiptonReduction]: Number of co-enabled transitions 544 [2022-12-13 00:53:55,483 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:53:55,484 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 242 [2022-12-13 00:53:55,484 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 186 flow [2022-12-13 00:53:55,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-13 00:53:55,484 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:55,484 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:55,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:53:55,485 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:53:55,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:55,485 INFO L85 PathProgramCache]: Analyzing trace with hash 416117700, now seen corresponding path program 1 times [2022-12-13 00:53:55,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:55,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762472786] [2022-12-13 00:53:55,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:55,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:56,989 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-13 00:53:56,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:56,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762472786] [2022-12-13 00:53:56,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762472786] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:56,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:56,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 00:53:56,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836440670] [2022-12-13 00:53:56,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:56,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 00:53:56,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:56,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 00:53:56,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 00:53:56,992 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2022-12-13 00:53:56,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 186 flow. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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-13 00:53:56,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:56,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2022-12-13 00:53:56,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:57,752 INFO L130 PetriNetUnfolder]: 2594/4228 cut-off events. [2022-12-13 00:53:57,752 INFO L131 PetriNetUnfolder]: For 2302/2451 co-relation queries the response was YES. [2022-12-13 00:53:57,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12647 conditions, 4228 events. 2594/4228 cut-off events. For 2302/2451 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 26544 event pairs, 735 based on Foata normal form. 116/3395 useless extension candidates. Maximal degree in co-relation 12630. Up to 2659 conditions per place. [2022-12-13 00:53:57,785 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 57 selfloop transitions, 10 changer transitions 4/81 dead transitions. [2022-12-13 00:53:57,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 81 transitions, 503 flow [2022-12-13 00:53:57,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:53:57,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:53:57,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-12-13 00:53:57,789 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6142857142857143 [2022-12-13 00:53:57,789 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 186 flow. Second operand 5 states and 86 transitions. [2022-12-13 00:53:57,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 81 transitions, 503 flow [2022-12-13 00:53:57,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 81 transitions, 469 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 00:53:57,800 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 223 flow [2022-12-13 00:53:57,800 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=223, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2022-12-13 00:53:57,802 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places. [2022-12-13 00:53:57,802 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:57,802 INFO L89 Accepts]: Start accepts. Operand has 50 places, 46 transitions, 223 flow [2022-12-13 00:53:57,803 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:57,803 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:57,803 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 46 transitions, 223 flow [2022-12-13 00:53:57,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 46 transitions, 223 flow [2022-12-13 00:53:57,943 INFO L130 PetriNetUnfolder]: 908/1543 cut-off events. [2022-12-13 00:53:57,943 INFO L131 PetriNetUnfolder]: For 281/295 co-relation queries the response was YES. [2022-12-13 00:53:57,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3274 conditions, 1543 events. 908/1543 cut-off events. For 281/295 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 9874 event pairs, 360 based on Foata normal form. 6/704 useless extension candidates. Maximal degree in co-relation 3258. Up to 1381 conditions per place. [2022-12-13 00:53:57,957 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 46 transitions, 223 flow [2022-12-13 00:53:57,957 INFO L226 LiptonReduction]: Number of co-enabled transitions 644 [2022-12-13 00:53:58,112 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:53:58,115 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 313 [2022-12-13 00:53:58,115 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 223 flow [2022-12-13 00:53:58,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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-13 00:53:58,115 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:58,115 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:58,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:53:58,116 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:53:58,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:58,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1982332939, now seen corresponding path program 1 times [2022-12-13 00:53:58,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:58,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673831971] [2022-12-13 00:53:58,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:58,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:58,337 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-13 00:53:58,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:58,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673831971] [2022-12-13 00:53:58,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673831971] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:58,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:58,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:53:58,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23981355] [2022-12-13 00:53:58,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:58,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:53:58,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:58,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:53:58,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:53:58,340 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 00:53:58,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 223 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-13 00:53:58,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:58,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 00:53:58,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:58,944 INFO L130 PetriNetUnfolder]: 2315/3980 cut-off events. [2022-12-13 00:53:58,945 INFO L131 PetriNetUnfolder]: For 2654/2654 co-relation queries the response was YES. [2022-12-13 00:53:58,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12508 conditions, 3980 events. 2315/3980 cut-off events. For 2654/2654 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 26287 event pairs, 44 based on Foata normal form. 399/2941 useless extension candidates. Maximal degree in co-relation 12489. Up to 2386 conditions per place. [2022-12-13 00:53:58,966 INFO L137 encePairwiseOnDemand]: 16/28 looper letters, 74 selfloop transitions, 20 changer transitions 3/101 dead transitions. [2022-12-13 00:53:58,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 101 transitions, 674 flow [2022-12-13 00:53:58,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:53:58,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:53:58,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2022-12-13 00:53:58,968 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7 [2022-12-13 00:53:58,968 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 223 flow. Second operand 5 states and 98 transitions. [2022-12-13 00:53:58,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 101 transitions, 674 flow [2022-12-13 00:53:58,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 101 transitions, 650 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 00:53:58,976 INFO L231 Difference]: Finished difference. Result has 54 places, 55 transitions, 339 flow [2022-12-13 00:53:58,976 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=339, PETRI_PLACES=54, PETRI_TRANSITIONS=55} [2022-12-13 00:53:58,978 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places. [2022-12-13 00:53:58,978 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:58,978 INFO L89 Accepts]: Start accepts. Operand has 54 places, 55 transitions, 339 flow [2022-12-13 00:53:58,979 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:58,979 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:58,979 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 55 transitions, 339 flow [2022-12-13 00:53:58,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 55 transitions, 339 flow [2022-12-13 00:53:59,107 INFO L130 PetriNetUnfolder]: 662/1345 cut-off events. [2022-12-13 00:53:59,107 INFO L131 PetriNetUnfolder]: For 643/1238 co-relation queries the response was YES. [2022-12-13 00:53:59,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4510 conditions, 1345 events. 662/1345 cut-off events. For 643/1238 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 9596 event pairs, 81 based on Foata normal form. 16/721 useless extension candidates. Maximal degree in co-relation 4492. Up to 1087 conditions per place. [2022-12-13 00:53:59,120 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 55 transitions, 339 flow [2022-12-13 00:53:59,120 INFO L226 LiptonReduction]: Number of co-enabled transitions 632 [2022-12-13 00:53:59,162 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:53:59,163 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-13 00:53:59,163 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 55 transitions, 339 flow [2022-12-13 00:53:59,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-13 00:53:59,164 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:59,164 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:59,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:53:59,164 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:53:59,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:59,164 INFO L85 PathProgramCache]: Analyzing trace with hash 821932867, now seen corresponding path program 1 times [2022-12-13 00:53:59,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:59,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369458129] [2022-12-13 00:53:59,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:59,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:59,409 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-13 00:53:59,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:59,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369458129] [2022-12-13 00:53:59,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369458129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:59,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:59,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:53:59,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076190788] [2022-12-13 00:53:59,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:59,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:53:59,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:59,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:53:59,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:53:59,411 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-13 00:53:59,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 55 transitions, 339 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-13 00:53:59,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:59,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-13 00:53:59,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:59,737 INFO L130 PetriNetUnfolder]: 1079/2138 cut-off events. [2022-12-13 00:53:59,737 INFO L131 PetriNetUnfolder]: For 2154/2154 co-relation queries the response was YES. [2022-12-13 00:53:59,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8789 conditions, 2138 events. 1079/2138 cut-off events. For 2154/2154 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 14234 event pairs, 44 based on Foata normal form. 261/1633 useless extension candidates. Maximal degree in co-relation 8768. Up to 1198 conditions per place. [2022-12-13 00:53:59,754 INFO L137 encePairwiseOnDemand]: 16/28 looper letters, 48 selfloop transitions, 29 changer transitions 2/83 dead transitions. [2022-12-13 00:53:59,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 83 transitions, 627 flow [2022-12-13 00:53:59,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:53:59,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:53:59,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-12-13 00:53:59,755 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2022-12-13 00:53:59,756 INFO L175 Difference]: Start difference. First operand has 54 places, 55 transitions, 339 flow. Second operand 6 states and 87 transitions. [2022-12-13 00:53:59,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 83 transitions, 627 flow [2022-12-13 00:53:59,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 83 transitions, 562 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-12-13 00:53:59,784 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 371 flow [2022-12-13 00:53:59,785 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=371, PETRI_PLACES=56, PETRI_TRANSITIONS=55} [2022-12-13 00:53:59,785 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 18 predicate places. [2022-12-13 00:53:59,786 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:59,786 INFO L89 Accepts]: Start accepts. Operand has 56 places, 55 transitions, 371 flow [2022-12-13 00:53:59,787 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:59,787 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:59,788 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 55 transitions, 371 flow [2022-12-13 00:53:59,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 55 transitions, 371 flow [2022-12-13 00:53:59,865 INFO L130 PetriNetUnfolder]: 356/850 cut-off events. [2022-12-13 00:53:59,866 INFO L131 PetriNetUnfolder]: For 988/1361 co-relation queries the response was YES. [2022-12-13 00:53:59,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3523 conditions, 850 events. 356/850 cut-off events. For 988/1361 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 5817 event pairs, 0 based on Foata normal form. 0/408 useless extension candidates. Maximal degree in co-relation 3505. Up to 631 conditions per place. [2022-12-13 00:53:59,872 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 55 transitions, 371 flow [2022-12-13 00:53:59,872 INFO L226 LiptonReduction]: Number of co-enabled transitions 530 [2022-12-13 00:53:59,899 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [567] L780-->L785: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [645] L856-3-->L859: Formula: (= (ite (= (ite (= v_~__unbuffered_cnt~0_163 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_18) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_163} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_17|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_163, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet30#1, ~main$tmp_guard0~0] [2022-12-13 00:53:59,911 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [654] L780-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.offset_21| 0) (= |v_P0Thread1of1ForFork1_#res.base_21| 0) (= v_~__unbuffered_cnt~0_191 (+ v_~__unbuffered_cnt~0_192 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_192} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_21|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_191} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] and [645] L856-3-->L859: Formula: (= (ite (= (ite (= v_~__unbuffered_cnt~0_163 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_18) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_163} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_17|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_163, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet30#1, ~main$tmp_guard0~0] [2022-12-13 00:53:59,934 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [608] L780-->P0FINAL: Formula: (and (= v_~__unbuffered_cnt~0_55 (+ v_~__unbuffered_cnt~0_56 1)) (= |v_P0Thread1of1ForFork1_#res.offset_5| 0) (= |v_P0Thread1of1ForFork1_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] and [645] L856-3-->L859: Formula: (= (ite (= (ite (= v_~__unbuffered_cnt~0_163 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_18) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_163} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_17|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_163, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet30#1, ~main$tmp_guard0~0] [2022-12-13 00:54:01,706 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [573] L799-->L802: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [691] L856-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse8 (= (mod v_~x$r_buff0_thd0~0_162 256) 0))) (let ((.cse14 (not (= (mod v_~x$w_buff0_used~0_609 256) 0))) (.cse4 (not .cse8)) (.cse9 (= (mod v_~x$r_buff1_thd0~0_160 256) 0)) (.cse10 (= (mod v_~x$w_buff1_used~0_586 256) 0)) (.cse7 (= (mod v_~x$w_buff0_used~0_610 256) 0))) (let ((.cse5 (not .cse7)) (.cse0 (select |v_#memory_int_691| |v_~#x~0.base_319|)) (.cse1 (not .cse10)) (.cse2 (not .cse9)) (.cse3 (and .cse14 .cse4))) (and (= (store |v_#memory_int_691| |v_~#x~0.base_319| (store .cse0 |v_~#x~0.offset_315| |v_ULTIMATE.start_main_#t~ite33#1_132|)) |v_#memory_int_690|) (= (ite (or (and .cse1 .cse2) .cse3) 0 v_~x$w_buff1_used~0_586) v_~x$w_buff1_used~0_585) (= (ite (and .cse4 .cse5) 0 v_~x$w_buff0_used~0_610) v_~x$w_buff0_used~0_609) (let ((.cse6 (= |v_ULTIMATE.start_main_#t~mem31#1_172| |v_ULTIMATE.start_main_#t~mem31#1_170|))) (or (and (= |v_ULTIMATE.start_main_#t~ite33#1_132| v_~x$w_buff0~0_331) .cse6 (= |v_ULTIMATE.start_main_#t~ite32#1_169| |v_ULTIMATE.start_main_#t~ite32#1_167|) .cse4 .cse5) (and (= |v_ULTIMATE.start_main_#t~ite33#1_132| |v_ULTIMATE.start_main_#t~ite32#1_167|) (or .cse7 .cse8) (or (and (= |v_ULTIMATE.start_main_#t~mem31#1_170| (select .cse0 |v_~#x~0.offset_315|)) (= |v_ULTIMATE.start_main_#t~mem31#1_170| |v_ULTIMATE.start_main_#t~ite32#1_167|) (or .cse9 .cse10)) (and .cse1 .cse2 .cse6 (= v_~x$w_buff1~0_333 |v_ULTIMATE.start_main_#t~ite32#1_167|)))))) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~mem35#1_142| |v_ULTIMATE.start_main_#t~mem35#1_140|)) (.cse11 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_89 256) 0))) (or (and (not .cse11) (= |v_ULTIMATE.start_main_#t~ite36#1_139| v_~__unbuffered_p2_EAX~0_151) (let ((.cse13 (= (mod v_~weak$$choice1~0_71 256) 0))) (or (and .cse12 .cse13 (= |v_ULTIMATE.start_main_#t~ite36#1_139| v_~__unbuffered_p2_EAX~0_152)) (and (= |v_ULTIMATE.start_main_#t~mem35#1_140| |v_ULTIMATE.start_main_#t~ite36#1_139|) (not .cse13) (= (select (select |v_#memory_int_690| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_98) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_98) |v_ULTIMATE.start_main_#t~mem35#1_140|))))) (and .cse12 (= v_~__unbuffered_p2_EAX~0_152 v_~__unbuffered_p2_EAX~0_151) .cse11 (= |v_ULTIMATE.start_main_#t~ite36#1_141| |v_ULTIMATE.start_main_#t~ite36#1_139|)))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| 0)) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_57 0) (= v_~__unbuffered_p0_EAX~0_135 0) (= v_~__unbuffered_p2_EAX~0_151 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_58) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_485 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_120) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53| (mod v_~main$tmp_guard0~0_120 256)) (= v_~x$r_buff1_thd0~0_159 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_585 256) 0))) (and .cse14 (not (= (mod v_~x$r_buff0_thd0~0_161 256) 0)))) 0 v_~x$r_buff1_thd0~0_160)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= |v_ULTIMATE.start_main_#t~nondet34#1_91| v_~weak$$choice1~0_71) (= v_~x$r_buff0_thd0~0_161 (ite .cse3 0 v_~x$r_buff0_thd0~0_162)) (= (mod v_~main$tmp_guard1~0_58 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_331, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_162, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_141|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ~#x~0.offset=|v_~#x~0.offset_315|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_98, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_98, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_91|, ~x$w_buff1~0=v_~x$w_buff1~0_333, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_586, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_160, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_89, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_135, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_172|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_169|, #memory_int=|v_#memory_int_691|, ULTIMATE.start_main_#t~mem35#1=|v_ULTIMATE.start_main_#t~mem35#1_142|, ~#x~0.base=|v_~#x~0.base_319|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_152, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_485} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_331, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_98, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_98, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_58, ULTIMATE.start_main_#t~ite37#1=|v_ULTIMATE.start_main_#t~ite37#1_80|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_135, ~weak$$choice1~0=v_~weak$$choice1~0_71, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_83|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_59|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_151, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_161, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_95|, ~#x~0.offset=|v_~#x~0.offset_315|, ~x$w_buff1~0=v_~x$w_buff1~0_333, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_585, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_120, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_159, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_89, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_609, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43|, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_131|, #memory_int=|v_#memory_int_690|, ~#x~0.base=|v_~#x~0.base_319|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_485, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|} AuxVars[|v_ULTIMATE.start_main_#t~ite36#1_139|, |v_ULTIMATE.start_main_#t~ite32#1_167|, |v_ULTIMATE.start_main_#t~mem31#1_170|, |v_ULTIMATE.start_main_#t~ite33#1_132|, |v_ULTIMATE.start_main_#t~mem35#1_140|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet34#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite37#1, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~mem31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite33#1, ULTIMATE.start_main_#t~ite32#1, #memory_int, ULTIMATE.start_main_#t~mem35#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:54:02,521 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [598] L799-->P1FINAL: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_14 1) v_~__unbuffered_cnt~0_13) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [691] L856-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse8 (= (mod v_~x$r_buff0_thd0~0_162 256) 0))) (let ((.cse14 (not (= (mod v_~x$w_buff0_used~0_609 256) 0))) (.cse4 (not .cse8)) (.cse9 (= (mod v_~x$r_buff1_thd0~0_160 256) 0)) (.cse10 (= (mod v_~x$w_buff1_used~0_586 256) 0)) (.cse7 (= (mod v_~x$w_buff0_used~0_610 256) 0))) (let ((.cse5 (not .cse7)) (.cse0 (select |v_#memory_int_691| |v_~#x~0.base_319|)) (.cse1 (not .cse10)) (.cse2 (not .cse9)) (.cse3 (and .cse14 .cse4))) (and (= (store |v_#memory_int_691| |v_~#x~0.base_319| (store .cse0 |v_~#x~0.offset_315| |v_ULTIMATE.start_main_#t~ite33#1_132|)) |v_#memory_int_690|) (= (ite (or (and .cse1 .cse2) .cse3) 0 v_~x$w_buff1_used~0_586) v_~x$w_buff1_used~0_585) (= (ite (and .cse4 .cse5) 0 v_~x$w_buff0_used~0_610) v_~x$w_buff0_used~0_609) (let ((.cse6 (= |v_ULTIMATE.start_main_#t~mem31#1_172| |v_ULTIMATE.start_main_#t~mem31#1_170|))) (or (and (= |v_ULTIMATE.start_main_#t~ite33#1_132| v_~x$w_buff0~0_331) .cse6 (= |v_ULTIMATE.start_main_#t~ite32#1_169| |v_ULTIMATE.start_main_#t~ite32#1_167|) .cse4 .cse5) (and (= |v_ULTIMATE.start_main_#t~ite33#1_132| |v_ULTIMATE.start_main_#t~ite32#1_167|) (or .cse7 .cse8) (or (and (= |v_ULTIMATE.start_main_#t~mem31#1_170| (select .cse0 |v_~#x~0.offset_315|)) (= |v_ULTIMATE.start_main_#t~mem31#1_170| |v_ULTIMATE.start_main_#t~ite32#1_167|) (or .cse9 .cse10)) (and .cse1 .cse2 .cse6 (= v_~x$w_buff1~0_333 |v_ULTIMATE.start_main_#t~ite32#1_167|)))))) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~mem35#1_142| |v_ULTIMATE.start_main_#t~mem35#1_140|)) (.cse11 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_89 256) 0))) (or (and (not .cse11) (= |v_ULTIMATE.start_main_#t~ite36#1_139| v_~__unbuffered_p2_EAX~0_151) (let ((.cse13 (= (mod v_~weak$$choice1~0_71 256) 0))) (or (and .cse12 .cse13 (= |v_ULTIMATE.start_main_#t~ite36#1_139| v_~__unbuffered_p2_EAX~0_152)) (and (= |v_ULTIMATE.start_main_#t~mem35#1_140| |v_ULTIMATE.start_main_#t~ite36#1_139|) (not .cse13) (= (select (select |v_#memory_int_690| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_98) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_98) |v_ULTIMATE.start_main_#t~mem35#1_140|))))) (and .cse12 (= v_~__unbuffered_p2_EAX~0_152 v_~__unbuffered_p2_EAX~0_151) .cse11 (= |v_ULTIMATE.start_main_#t~ite36#1_141| |v_ULTIMATE.start_main_#t~ite36#1_139|)))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| 0)) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_57 0) (= v_~__unbuffered_p0_EAX~0_135 0) (= v_~__unbuffered_p2_EAX~0_151 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_58) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_485 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_120) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53| (mod v_~main$tmp_guard0~0_120 256)) (= v_~x$r_buff1_thd0~0_159 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_585 256) 0))) (and .cse14 (not (= (mod v_~x$r_buff0_thd0~0_161 256) 0)))) 0 v_~x$r_buff1_thd0~0_160)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= |v_ULTIMATE.start_main_#t~nondet34#1_91| v_~weak$$choice1~0_71) (= v_~x$r_buff0_thd0~0_161 (ite .cse3 0 v_~x$r_buff0_thd0~0_162)) (= (mod v_~main$tmp_guard1~0_58 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_331, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_162, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_141|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ~#x~0.offset=|v_~#x~0.offset_315|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_98, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_98, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_91|, ~x$w_buff1~0=v_~x$w_buff1~0_333, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_586, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_160, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_89, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_135, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_172|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_169|, #memory_int=|v_#memory_int_691|, ULTIMATE.start_main_#t~mem35#1=|v_ULTIMATE.start_main_#t~mem35#1_142|, ~#x~0.base=|v_~#x~0.base_319|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_152, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_485} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_331, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_98, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_98, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_58, ULTIMATE.start_main_#t~ite37#1=|v_ULTIMATE.start_main_#t~ite37#1_80|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_135, ~weak$$choice1~0=v_~weak$$choice1~0_71, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_83|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_59|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_151, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_161, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_95|, ~#x~0.offset=|v_~#x~0.offset_315|, ~x$w_buff1~0=v_~x$w_buff1~0_333, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_585, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_120, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_159, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_89, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_609, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43|, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_131|, #memory_int=|v_#memory_int_690|, ~#x~0.base=|v_~#x~0.base_319|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_485, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|} AuxVars[|v_ULTIMATE.start_main_#t~ite36#1_139|, |v_ULTIMATE.start_main_#t~ite32#1_167|, |v_ULTIMATE.start_main_#t~mem31#1_170|, |v_ULTIMATE.start_main_#t~ite33#1_132|, |v_ULTIMATE.start_main_#t~mem35#1_140|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet34#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite37#1, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~mem31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite33#1, ULTIMATE.start_main_#t~ite32#1, #memory_int, ULTIMATE.start_main_#t~mem35#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:54:03,287 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [567] L780-->L785: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [691] L856-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse8 (= (mod v_~x$r_buff0_thd0~0_162 256) 0))) (let ((.cse14 (not (= (mod v_~x$w_buff0_used~0_609 256) 0))) (.cse4 (not .cse8)) (.cse9 (= (mod v_~x$r_buff1_thd0~0_160 256) 0)) (.cse10 (= (mod v_~x$w_buff1_used~0_586 256) 0)) (.cse7 (= (mod v_~x$w_buff0_used~0_610 256) 0))) (let ((.cse5 (not .cse7)) (.cse0 (select |v_#memory_int_691| |v_~#x~0.base_319|)) (.cse1 (not .cse10)) (.cse2 (not .cse9)) (.cse3 (and .cse14 .cse4))) (and (= (store |v_#memory_int_691| |v_~#x~0.base_319| (store .cse0 |v_~#x~0.offset_315| |v_ULTIMATE.start_main_#t~ite33#1_132|)) |v_#memory_int_690|) (= (ite (or (and .cse1 .cse2) .cse3) 0 v_~x$w_buff1_used~0_586) v_~x$w_buff1_used~0_585) (= (ite (and .cse4 .cse5) 0 v_~x$w_buff0_used~0_610) v_~x$w_buff0_used~0_609) (let ((.cse6 (= |v_ULTIMATE.start_main_#t~mem31#1_172| |v_ULTIMATE.start_main_#t~mem31#1_170|))) (or (and (= |v_ULTIMATE.start_main_#t~ite33#1_132| v_~x$w_buff0~0_331) .cse6 (= |v_ULTIMATE.start_main_#t~ite32#1_169| |v_ULTIMATE.start_main_#t~ite32#1_167|) .cse4 .cse5) (and (= |v_ULTIMATE.start_main_#t~ite33#1_132| |v_ULTIMATE.start_main_#t~ite32#1_167|) (or .cse7 .cse8) (or (and (= |v_ULTIMATE.start_main_#t~mem31#1_170| (select .cse0 |v_~#x~0.offset_315|)) (= |v_ULTIMATE.start_main_#t~mem31#1_170| |v_ULTIMATE.start_main_#t~ite32#1_167|) (or .cse9 .cse10)) (and .cse1 .cse2 .cse6 (= v_~x$w_buff1~0_333 |v_ULTIMATE.start_main_#t~ite32#1_167|)))))) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~mem35#1_142| |v_ULTIMATE.start_main_#t~mem35#1_140|)) (.cse11 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_89 256) 0))) (or (and (not .cse11) (= |v_ULTIMATE.start_main_#t~ite36#1_139| v_~__unbuffered_p2_EAX~0_151) (let ((.cse13 (= (mod v_~weak$$choice1~0_71 256) 0))) (or (and .cse12 .cse13 (= |v_ULTIMATE.start_main_#t~ite36#1_139| v_~__unbuffered_p2_EAX~0_152)) (and (= |v_ULTIMATE.start_main_#t~mem35#1_140| |v_ULTIMATE.start_main_#t~ite36#1_139|) (not .cse13) (= (select (select |v_#memory_int_690| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_98) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_98) |v_ULTIMATE.start_main_#t~mem35#1_140|))))) (and .cse12 (= v_~__unbuffered_p2_EAX~0_152 v_~__unbuffered_p2_EAX~0_151) .cse11 (= |v_ULTIMATE.start_main_#t~ite36#1_141| |v_ULTIMATE.start_main_#t~ite36#1_139|)))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| 0)) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_57 0) (= v_~__unbuffered_p0_EAX~0_135 0) (= v_~__unbuffered_p2_EAX~0_151 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_58) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_485 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_120) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53| (mod v_~main$tmp_guard0~0_120 256)) (= v_~x$r_buff1_thd0~0_159 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_585 256) 0))) (and .cse14 (not (= (mod v_~x$r_buff0_thd0~0_161 256) 0)))) 0 v_~x$r_buff1_thd0~0_160)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= |v_ULTIMATE.start_main_#t~nondet34#1_91| v_~weak$$choice1~0_71) (= v_~x$r_buff0_thd0~0_161 (ite .cse3 0 v_~x$r_buff0_thd0~0_162)) (= (mod v_~main$tmp_guard1~0_58 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_331, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_162, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_141|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ~#x~0.offset=|v_~#x~0.offset_315|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_98, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_98, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_91|, ~x$w_buff1~0=v_~x$w_buff1~0_333, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_586, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_160, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_89, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_135, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_172|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_169|, #memory_int=|v_#memory_int_691|, ULTIMATE.start_main_#t~mem35#1=|v_ULTIMATE.start_main_#t~mem35#1_142|, ~#x~0.base=|v_~#x~0.base_319|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_152, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_485} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_331, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_98, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_98, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_58, ULTIMATE.start_main_#t~ite37#1=|v_ULTIMATE.start_main_#t~ite37#1_80|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_135, ~weak$$choice1~0=v_~weak$$choice1~0_71, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_83|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_59|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_151, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_161, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_95|, ~#x~0.offset=|v_~#x~0.offset_315|, ~x$w_buff1~0=v_~x$w_buff1~0_333, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_585, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_120, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_159, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_89, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_609, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43|, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_131|, #memory_int=|v_#memory_int_690|, ~#x~0.base=|v_~#x~0.base_319|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_485, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|} AuxVars[|v_ULTIMATE.start_main_#t~ite36#1_139|, |v_ULTIMATE.start_main_#t~ite32#1_167|, |v_ULTIMATE.start_main_#t~mem31#1_170|, |v_ULTIMATE.start_main_#t~ite33#1_132|, |v_ULTIMATE.start_main_#t~mem35#1_140|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet34#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite37#1, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~mem31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite33#1, ULTIMATE.start_main_#t~ite32#1, #memory_int, ULTIMATE.start_main_#t~mem35#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:54:04,013 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [654] L780-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.offset_21| 0) (= |v_P0Thread1of1ForFork1_#res.base_21| 0) (= v_~__unbuffered_cnt~0_191 (+ v_~__unbuffered_cnt~0_192 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_192} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_21|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_191} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] and [691] L856-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse8 (= (mod v_~x$r_buff0_thd0~0_162 256) 0))) (let ((.cse14 (not (= (mod v_~x$w_buff0_used~0_609 256) 0))) (.cse4 (not .cse8)) (.cse9 (= (mod v_~x$r_buff1_thd0~0_160 256) 0)) (.cse10 (= (mod v_~x$w_buff1_used~0_586 256) 0)) (.cse7 (= (mod v_~x$w_buff0_used~0_610 256) 0))) (let ((.cse5 (not .cse7)) (.cse0 (select |v_#memory_int_691| |v_~#x~0.base_319|)) (.cse1 (not .cse10)) (.cse2 (not .cse9)) (.cse3 (and .cse14 .cse4))) (and (= (store |v_#memory_int_691| |v_~#x~0.base_319| (store .cse0 |v_~#x~0.offset_315| |v_ULTIMATE.start_main_#t~ite33#1_132|)) |v_#memory_int_690|) (= (ite (or (and .cse1 .cse2) .cse3) 0 v_~x$w_buff1_used~0_586) v_~x$w_buff1_used~0_585) (= (ite (and .cse4 .cse5) 0 v_~x$w_buff0_used~0_610) v_~x$w_buff0_used~0_609) (let ((.cse6 (= |v_ULTIMATE.start_main_#t~mem31#1_172| |v_ULTIMATE.start_main_#t~mem31#1_170|))) (or (and (= |v_ULTIMATE.start_main_#t~ite33#1_132| v_~x$w_buff0~0_331) .cse6 (= |v_ULTIMATE.start_main_#t~ite32#1_169| |v_ULTIMATE.start_main_#t~ite32#1_167|) .cse4 .cse5) (and (= |v_ULTIMATE.start_main_#t~ite33#1_132| |v_ULTIMATE.start_main_#t~ite32#1_167|) (or .cse7 .cse8) (or (and (= |v_ULTIMATE.start_main_#t~mem31#1_170| (select .cse0 |v_~#x~0.offset_315|)) (= |v_ULTIMATE.start_main_#t~mem31#1_170| |v_ULTIMATE.start_main_#t~ite32#1_167|) (or .cse9 .cse10)) (and .cse1 .cse2 .cse6 (= v_~x$w_buff1~0_333 |v_ULTIMATE.start_main_#t~ite32#1_167|)))))) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~mem35#1_142| |v_ULTIMATE.start_main_#t~mem35#1_140|)) (.cse11 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_89 256) 0))) (or (and (not .cse11) (= |v_ULTIMATE.start_main_#t~ite36#1_139| v_~__unbuffered_p2_EAX~0_151) (let ((.cse13 (= (mod v_~weak$$choice1~0_71 256) 0))) (or (and .cse12 .cse13 (= |v_ULTIMATE.start_main_#t~ite36#1_139| v_~__unbuffered_p2_EAX~0_152)) (and (= |v_ULTIMATE.start_main_#t~mem35#1_140| |v_ULTIMATE.start_main_#t~ite36#1_139|) (not .cse13) (= (select (select |v_#memory_int_690| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_98) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_98) |v_ULTIMATE.start_main_#t~mem35#1_140|))))) (and .cse12 (= v_~__unbuffered_p2_EAX~0_152 v_~__unbuffered_p2_EAX~0_151) .cse11 (= |v_ULTIMATE.start_main_#t~ite36#1_141| |v_ULTIMATE.start_main_#t~ite36#1_139|)))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| 0)) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_57 0) (= v_~__unbuffered_p0_EAX~0_135 0) (= v_~__unbuffered_p2_EAX~0_151 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_58) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_485 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_120) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53| (mod v_~main$tmp_guard0~0_120 256)) (= v_~x$r_buff1_thd0~0_159 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_585 256) 0))) (and .cse14 (not (= (mod v_~x$r_buff0_thd0~0_161 256) 0)))) 0 v_~x$r_buff1_thd0~0_160)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= |v_ULTIMATE.start_main_#t~nondet34#1_91| v_~weak$$choice1~0_71) (= v_~x$r_buff0_thd0~0_161 (ite .cse3 0 v_~x$r_buff0_thd0~0_162)) (= (mod v_~main$tmp_guard1~0_58 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_331, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_162, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_141|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ~#x~0.offset=|v_~#x~0.offset_315|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_98, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_98, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_91|, ~x$w_buff1~0=v_~x$w_buff1~0_333, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_586, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_160, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_89, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_135, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_172|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_169|, #memory_int=|v_#memory_int_691|, ULTIMATE.start_main_#t~mem35#1=|v_ULTIMATE.start_main_#t~mem35#1_142|, ~#x~0.base=|v_~#x~0.base_319|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_152, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_485} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_331, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_98, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_98, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_58, ULTIMATE.start_main_#t~ite37#1=|v_ULTIMATE.start_main_#t~ite37#1_80|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_135, ~weak$$choice1~0=v_~weak$$choice1~0_71, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_83|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_59|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_151, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_161, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_95|, ~#x~0.offset=|v_~#x~0.offset_315|, ~x$w_buff1~0=v_~x$w_buff1~0_333, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_585, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_120, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_159, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_89, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_609, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43|, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_131|, #memory_int=|v_#memory_int_690|, ~#x~0.base=|v_~#x~0.base_319|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_485, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|} AuxVars[|v_ULTIMATE.start_main_#t~ite36#1_139|, |v_ULTIMATE.start_main_#t~ite32#1_167|, |v_ULTIMATE.start_main_#t~mem31#1_170|, |v_ULTIMATE.start_main_#t~ite33#1_132|, |v_ULTIMATE.start_main_#t~mem35#1_140|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet34#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite37#1, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~mem31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite33#1, ULTIMATE.start_main_#t~ite32#1, #memory_int, ULTIMATE.start_main_#t~mem35#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:54:04,764 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [608] L780-->P0FINAL: Formula: (and (= v_~__unbuffered_cnt~0_55 (+ v_~__unbuffered_cnt~0_56 1)) (= |v_P0Thread1of1ForFork1_#res.offset_5| 0) (= |v_P0Thread1of1ForFork1_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] and [691] L856-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse8 (= (mod v_~x$r_buff0_thd0~0_162 256) 0))) (let ((.cse14 (not (= (mod v_~x$w_buff0_used~0_609 256) 0))) (.cse4 (not .cse8)) (.cse9 (= (mod v_~x$r_buff1_thd0~0_160 256) 0)) (.cse10 (= (mod v_~x$w_buff1_used~0_586 256) 0)) (.cse7 (= (mod v_~x$w_buff0_used~0_610 256) 0))) (let ((.cse5 (not .cse7)) (.cse0 (select |v_#memory_int_691| |v_~#x~0.base_319|)) (.cse1 (not .cse10)) (.cse2 (not .cse9)) (.cse3 (and .cse14 .cse4))) (and (= (store |v_#memory_int_691| |v_~#x~0.base_319| (store .cse0 |v_~#x~0.offset_315| |v_ULTIMATE.start_main_#t~ite33#1_132|)) |v_#memory_int_690|) (= (ite (or (and .cse1 .cse2) .cse3) 0 v_~x$w_buff1_used~0_586) v_~x$w_buff1_used~0_585) (= (ite (and .cse4 .cse5) 0 v_~x$w_buff0_used~0_610) v_~x$w_buff0_used~0_609) (let ((.cse6 (= |v_ULTIMATE.start_main_#t~mem31#1_172| |v_ULTIMATE.start_main_#t~mem31#1_170|))) (or (and (= |v_ULTIMATE.start_main_#t~ite33#1_132| v_~x$w_buff0~0_331) .cse6 (= |v_ULTIMATE.start_main_#t~ite32#1_169| |v_ULTIMATE.start_main_#t~ite32#1_167|) .cse4 .cse5) (and (= |v_ULTIMATE.start_main_#t~ite33#1_132| |v_ULTIMATE.start_main_#t~ite32#1_167|) (or .cse7 .cse8) (or (and (= |v_ULTIMATE.start_main_#t~mem31#1_170| (select .cse0 |v_~#x~0.offset_315|)) (= |v_ULTIMATE.start_main_#t~mem31#1_170| |v_ULTIMATE.start_main_#t~ite32#1_167|) (or .cse9 .cse10)) (and .cse1 .cse2 .cse6 (= v_~x$w_buff1~0_333 |v_ULTIMATE.start_main_#t~ite32#1_167|)))))) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~mem35#1_142| |v_ULTIMATE.start_main_#t~mem35#1_140|)) (.cse11 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_89 256) 0))) (or (and (not .cse11) (= |v_ULTIMATE.start_main_#t~ite36#1_139| v_~__unbuffered_p2_EAX~0_151) (let ((.cse13 (= (mod v_~weak$$choice1~0_71 256) 0))) (or (and .cse12 .cse13 (= |v_ULTIMATE.start_main_#t~ite36#1_139| v_~__unbuffered_p2_EAX~0_152)) (and (= |v_ULTIMATE.start_main_#t~mem35#1_140| |v_ULTIMATE.start_main_#t~ite36#1_139|) (not .cse13) (= (select (select |v_#memory_int_690| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_98) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_98) |v_ULTIMATE.start_main_#t~mem35#1_140|))))) (and .cse12 (= v_~__unbuffered_p2_EAX~0_152 v_~__unbuffered_p2_EAX~0_151) .cse11 (= |v_ULTIMATE.start_main_#t~ite36#1_141| |v_ULTIMATE.start_main_#t~ite36#1_139|)))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| 0)) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_57 0) (= v_~__unbuffered_p0_EAX~0_135 0) (= v_~__unbuffered_p2_EAX~0_151 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_58) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_485 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_120) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53| (mod v_~main$tmp_guard0~0_120 256)) (= v_~x$r_buff1_thd0~0_159 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_585 256) 0))) (and .cse14 (not (= (mod v_~x$r_buff0_thd0~0_161 256) 0)))) 0 v_~x$r_buff1_thd0~0_160)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= |v_ULTIMATE.start_main_#t~nondet34#1_91| v_~weak$$choice1~0_71) (= v_~x$r_buff0_thd0~0_161 (ite .cse3 0 v_~x$r_buff0_thd0~0_162)) (= (mod v_~main$tmp_guard1~0_58 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_331, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_162, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_141|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ~#x~0.offset=|v_~#x~0.offset_315|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_98, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_98, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_91|, ~x$w_buff1~0=v_~x$w_buff1~0_333, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_586, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_160, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_89, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_135, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_172|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_169|, #memory_int=|v_#memory_int_691|, ULTIMATE.start_main_#t~mem35#1=|v_ULTIMATE.start_main_#t~mem35#1_142|, ~#x~0.base=|v_~#x~0.base_319|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_152, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_485} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_331, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_98, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_98, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_58, ULTIMATE.start_main_#t~ite37#1=|v_ULTIMATE.start_main_#t~ite37#1_80|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_135, ~weak$$choice1~0=v_~weak$$choice1~0_71, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_83|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_59|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_151, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_161, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_95|, ~#x~0.offset=|v_~#x~0.offset_315|, ~x$w_buff1~0=v_~x$w_buff1~0_333, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_585, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_120, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_159, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_89, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_609, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43|, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_131|, #memory_int=|v_#memory_int_690|, ~#x~0.base=|v_~#x~0.base_319|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_485, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|} AuxVars[|v_ULTIMATE.start_main_#t~ite36#1_139|, |v_ULTIMATE.start_main_#t~ite32#1_167|, |v_ULTIMATE.start_main_#t~mem31#1_170|, |v_ULTIMATE.start_main_#t~ite33#1_132|, |v_ULTIMATE.start_main_#t~mem35#1_140|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet34#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite37#1, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~mem31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite33#1, ULTIMATE.start_main_#t~ite32#1, #memory_int, ULTIMATE.start_main_#t~mem35#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:54:05,503 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [580] L834-->L837: Formula: (= (+ v_~__unbuffered_cnt~0_6 1) v_~__unbuffered_cnt~0_5) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_6} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_5} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [691] L856-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse8 (= (mod v_~x$r_buff0_thd0~0_162 256) 0))) (let ((.cse14 (not (= (mod v_~x$w_buff0_used~0_609 256) 0))) (.cse4 (not .cse8)) (.cse9 (= (mod v_~x$r_buff1_thd0~0_160 256) 0)) (.cse10 (= (mod v_~x$w_buff1_used~0_586 256) 0)) (.cse7 (= (mod v_~x$w_buff0_used~0_610 256) 0))) (let ((.cse5 (not .cse7)) (.cse0 (select |v_#memory_int_691| |v_~#x~0.base_319|)) (.cse1 (not .cse10)) (.cse2 (not .cse9)) (.cse3 (and .cse14 .cse4))) (and (= (store |v_#memory_int_691| |v_~#x~0.base_319| (store .cse0 |v_~#x~0.offset_315| |v_ULTIMATE.start_main_#t~ite33#1_132|)) |v_#memory_int_690|) (= (ite (or (and .cse1 .cse2) .cse3) 0 v_~x$w_buff1_used~0_586) v_~x$w_buff1_used~0_585) (= (ite (and .cse4 .cse5) 0 v_~x$w_buff0_used~0_610) v_~x$w_buff0_used~0_609) (let ((.cse6 (= |v_ULTIMATE.start_main_#t~mem31#1_172| |v_ULTIMATE.start_main_#t~mem31#1_170|))) (or (and (= |v_ULTIMATE.start_main_#t~ite33#1_132| v_~x$w_buff0~0_331) .cse6 (= |v_ULTIMATE.start_main_#t~ite32#1_169| |v_ULTIMATE.start_main_#t~ite32#1_167|) .cse4 .cse5) (and (= |v_ULTIMATE.start_main_#t~ite33#1_132| |v_ULTIMATE.start_main_#t~ite32#1_167|) (or .cse7 .cse8) (or (and (= |v_ULTIMATE.start_main_#t~mem31#1_170| (select .cse0 |v_~#x~0.offset_315|)) (= |v_ULTIMATE.start_main_#t~mem31#1_170| |v_ULTIMATE.start_main_#t~ite32#1_167|) (or .cse9 .cse10)) (and .cse1 .cse2 .cse6 (= v_~x$w_buff1~0_333 |v_ULTIMATE.start_main_#t~ite32#1_167|)))))) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~mem35#1_142| |v_ULTIMATE.start_main_#t~mem35#1_140|)) (.cse11 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_89 256) 0))) (or (and (not .cse11) (= |v_ULTIMATE.start_main_#t~ite36#1_139| v_~__unbuffered_p2_EAX~0_151) (let ((.cse13 (= (mod v_~weak$$choice1~0_71 256) 0))) (or (and .cse12 .cse13 (= |v_ULTIMATE.start_main_#t~ite36#1_139| v_~__unbuffered_p2_EAX~0_152)) (and (= |v_ULTIMATE.start_main_#t~mem35#1_140| |v_ULTIMATE.start_main_#t~ite36#1_139|) (not .cse13) (= (select (select |v_#memory_int_690| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_98) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_98) |v_ULTIMATE.start_main_#t~mem35#1_140|))))) (and .cse12 (= v_~__unbuffered_p2_EAX~0_152 v_~__unbuffered_p2_EAX~0_151) .cse11 (= |v_ULTIMATE.start_main_#t~ite36#1_141| |v_ULTIMATE.start_main_#t~ite36#1_139|)))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| 0)) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_57 0) (= v_~__unbuffered_p0_EAX~0_135 0) (= v_~__unbuffered_p2_EAX~0_151 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_58) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_485 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_120) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53| (mod v_~main$tmp_guard0~0_120 256)) (= v_~x$r_buff1_thd0~0_159 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_585 256) 0))) (and .cse14 (not (= (mod v_~x$r_buff0_thd0~0_161 256) 0)))) 0 v_~x$r_buff1_thd0~0_160)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= |v_ULTIMATE.start_main_#t~nondet34#1_91| v_~weak$$choice1~0_71) (= v_~x$r_buff0_thd0~0_161 (ite .cse3 0 v_~x$r_buff0_thd0~0_162)) (= (mod v_~main$tmp_guard1~0_58 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_331, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_162, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_141|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ~#x~0.offset=|v_~#x~0.offset_315|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_98, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_98, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_91|, ~x$w_buff1~0=v_~x$w_buff1~0_333, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_586, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_160, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_89, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_135, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_172|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_169|, #memory_int=|v_#memory_int_691|, ULTIMATE.start_main_#t~mem35#1=|v_ULTIMATE.start_main_#t~mem35#1_142|, ~#x~0.base=|v_~#x~0.base_319|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_152, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_485} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_331, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_98, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_98, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_58, ULTIMATE.start_main_#t~ite37#1=|v_ULTIMATE.start_main_#t~ite37#1_80|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_135, ~weak$$choice1~0=v_~weak$$choice1~0_71, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_83|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_59|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_151, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_161, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_95|, ~#x~0.offset=|v_~#x~0.offset_315|, ~x$w_buff1~0=v_~x$w_buff1~0_333, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_585, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_120, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_159, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_89, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_609, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43|, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_131|, #memory_int=|v_#memory_int_690|, ~#x~0.base=|v_~#x~0.base_319|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_485, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|} AuxVars[|v_ULTIMATE.start_main_#t~ite36#1_139|, |v_ULTIMATE.start_main_#t~ite32#1_167|, |v_ULTIMATE.start_main_#t~mem31#1_170|, |v_ULTIMATE.start_main_#t~ite33#1_132|, |v_ULTIMATE.start_main_#t~mem35#1_140|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet34#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite37#1, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~mem31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite33#1, ULTIMATE.start_main_#t~ite32#1, #memory_int, ULTIMATE.start_main_#t~mem35#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:54:06,286 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L834-->P2FINAL: Formula: (and (= (+ v_~__unbuffered_cnt~0_26 1) v_~__unbuffered_cnt~0_25) (= |v_P2Thread1of1ForFork0_#res.offset_7| 0) (= |v_P2Thread1of1ForFork0_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] and [691] L856-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse8 (= (mod v_~x$r_buff0_thd0~0_162 256) 0))) (let ((.cse14 (not (= (mod v_~x$w_buff0_used~0_609 256) 0))) (.cse4 (not .cse8)) (.cse9 (= (mod v_~x$r_buff1_thd0~0_160 256) 0)) (.cse10 (= (mod v_~x$w_buff1_used~0_586 256) 0)) (.cse7 (= (mod v_~x$w_buff0_used~0_610 256) 0))) (let ((.cse5 (not .cse7)) (.cse0 (select |v_#memory_int_691| |v_~#x~0.base_319|)) (.cse1 (not .cse10)) (.cse2 (not .cse9)) (.cse3 (and .cse14 .cse4))) (and (= (store |v_#memory_int_691| |v_~#x~0.base_319| (store .cse0 |v_~#x~0.offset_315| |v_ULTIMATE.start_main_#t~ite33#1_132|)) |v_#memory_int_690|) (= (ite (or (and .cse1 .cse2) .cse3) 0 v_~x$w_buff1_used~0_586) v_~x$w_buff1_used~0_585) (= (ite (and .cse4 .cse5) 0 v_~x$w_buff0_used~0_610) v_~x$w_buff0_used~0_609) (let ((.cse6 (= |v_ULTIMATE.start_main_#t~mem31#1_172| |v_ULTIMATE.start_main_#t~mem31#1_170|))) (or (and (= |v_ULTIMATE.start_main_#t~ite33#1_132| v_~x$w_buff0~0_331) .cse6 (= |v_ULTIMATE.start_main_#t~ite32#1_169| |v_ULTIMATE.start_main_#t~ite32#1_167|) .cse4 .cse5) (and (= |v_ULTIMATE.start_main_#t~ite33#1_132| |v_ULTIMATE.start_main_#t~ite32#1_167|) (or .cse7 .cse8) (or (and (= |v_ULTIMATE.start_main_#t~mem31#1_170| (select .cse0 |v_~#x~0.offset_315|)) (= |v_ULTIMATE.start_main_#t~mem31#1_170| |v_ULTIMATE.start_main_#t~ite32#1_167|) (or .cse9 .cse10)) (and .cse1 .cse2 .cse6 (= v_~x$w_buff1~0_333 |v_ULTIMATE.start_main_#t~ite32#1_167|)))))) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~mem35#1_142| |v_ULTIMATE.start_main_#t~mem35#1_140|)) (.cse11 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_89 256) 0))) (or (and (not .cse11) (= |v_ULTIMATE.start_main_#t~ite36#1_139| v_~__unbuffered_p2_EAX~0_151) (let ((.cse13 (= (mod v_~weak$$choice1~0_71 256) 0))) (or (and .cse12 .cse13 (= |v_ULTIMATE.start_main_#t~ite36#1_139| v_~__unbuffered_p2_EAX~0_152)) (and (= |v_ULTIMATE.start_main_#t~mem35#1_140| |v_ULTIMATE.start_main_#t~ite36#1_139|) (not .cse13) (= (select (select |v_#memory_int_690| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_98) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_98) |v_ULTIMATE.start_main_#t~mem35#1_140|))))) (and .cse12 (= v_~__unbuffered_p2_EAX~0_152 v_~__unbuffered_p2_EAX~0_151) .cse11 (= |v_ULTIMATE.start_main_#t~ite36#1_141| |v_ULTIMATE.start_main_#t~ite36#1_139|)))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| 0)) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_57 0) (= v_~__unbuffered_p0_EAX~0_135 0) (= v_~__unbuffered_p2_EAX~0_151 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_58) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_485 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_120) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53| (mod v_~main$tmp_guard0~0_120 256)) (= v_~x$r_buff1_thd0~0_159 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_585 256) 0))) (and .cse14 (not (= (mod v_~x$r_buff0_thd0~0_161 256) 0)))) 0 v_~x$r_buff1_thd0~0_160)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= |v_ULTIMATE.start_main_#t~nondet34#1_91| v_~weak$$choice1~0_71) (= v_~x$r_buff0_thd0~0_161 (ite .cse3 0 v_~x$r_buff0_thd0~0_162)) (= (mod v_~main$tmp_guard1~0_58 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_331, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_162, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_141|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ~#x~0.offset=|v_~#x~0.offset_315|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_98, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_98, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_91|, ~x$w_buff1~0=v_~x$w_buff1~0_333, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_586, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_160, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_89, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_135, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_172|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_169|, #memory_int=|v_#memory_int_691|, ULTIMATE.start_main_#t~mem35#1=|v_ULTIMATE.start_main_#t~mem35#1_142|, ~#x~0.base=|v_~#x~0.base_319|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_152, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_485} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_331, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_98, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_98, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_58, ULTIMATE.start_main_#t~ite37#1=|v_ULTIMATE.start_main_#t~ite37#1_80|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_135, ~weak$$choice1~0=v_~weak$$choice1~0_71, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_83|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_59|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_151, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_161, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_95|, ~#x~0.offset=|v_~#x~0.offset_315|, ~x$w_buff1~0=v_~x$w_buff1~0_333, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_585, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_120, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_159, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_89, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_609, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43|, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_131|, #memory_int=|v_#memory_int_690|, ~#x~0.base=|v_~#x~0.base_319|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_485, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|} AuxVars[|v_ULTIMATE.start_main_#t~ite36#1_139|, |v_ULTIMATE.start_main_#t~ite32#1_167|, |v_ULTIMATE.start_main_#t~mem31#1_170|, |v_ULTIMATE.start_main_#t~ite33#1_132|, |v_ULTIMATE.start_main_#t~mem35#1_140|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet34#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite37#1, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~mem31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite33#1, ULTIMATE.start_main_#t~ite32#1, #memory_int, ULTIMATE.start_main_#t~mem35#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:54:07,125 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [607] L834-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_29 (+ v_~__unbuffered_cnt~0_30 1)) (= |v_P2Thread1of1ForFork0_#res.offset_9| 0) (= |v_P2Thread1of1ForFork0_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] and [691] L856-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse8 (= (mod v_~x$r_buff0_thd0~0_162 256) 0))) (let ((.cse14 (not (= (mod v_~x$w_buff0_used~0_609 256) 0))) (.cse4 (not .cse8)) (.cse9 (= (mod v_~x$r_buff1_thd0~0_160 256) 0)) (.cse10 (= (mod v_~x$w_buff1_used~0_586 256) 0)) (.cse7 (= (mod v_~x$w_buff0_used~0_610 256) 0))) (let ((.cse5 (not .cse7)) (.cse0 (select |v_#memory_int_691| |v_~#x~0.base_319|)) (.cse1 (not .cse10)) (.cse2 (not .cse9)) (.cse3 (and .cse14 .cse4))) (and (= (store |v_#memory_int_691| |v_~#x~0.base_319| (store .cse0 |v_~#x~0.offset_315| |v_ULTIMATE.start_main_#t~ite33#1_132|)) |v_#memory_int_690|) (= (ite (or (and .cse1 .cse2) .cse3) 0 v_~x$w_buff1_used~0_586) v_~x$w_buff1_used~0_585) (= (ite (and .cse4 .cse5) 0 v_~x$w_buff0_used~0_610) v_~x$w_buff0_used~0_609) (let ((.cse6 (= |v_ULTIMATE.start_main_#t~mem31#1_172| |v_ULTIMATE.start_main_#t~mem31#1_170|))) (or (and (= |v_ULTIMATE.start_main_#t~ite33#1_132| v_~x$w_buff0~0_331) .cse6 (= |v_ULTIMATE.start_main_#t~ite32#1_169| |v_ULTIMATE.start_main_#t~ite32#1_167|) .cse4 .cse5) (and (= |v_ULTIMATE.start_main_#t~ite33#1_132| |v_ULTIMATE.start_main_#t~ite32#1_167|) (or .cse7 .cse8) (or (and (= |v_ULTIMATE.start_main_#t~mem31#1_170| (select .cse0 |v_~#x~0.offset_315|)) (= |v_ULTIMATE.start_main_#t~mem31#1_170| |v_ULTIMATE.start_main_#t~ite32#1_167|) (or .cse9 .cse10)) (and .cse1 .cse2 .cse6 (= v_~x$w_buff1~0_333 |v_ULTIMATE.start_main_#t~ite32#1_167|)))))) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~mem35#1_142| |v_ULTIMATE.start_main_#t~mem35#1_140|)) (.cse11 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_89 256) 0))) (or (and (not .cse11) (= |v_ULTIMATE.start_main_#t~ite36#1_139| v_~__unbuffered_p2_EAX~0_151) (let ((.cse13 (= (mod v_~weak$$choice1~0_71 256) 0))) (or (and .cse12 .cse13 (= |v_ULTIMATE.start_main_#t~ite36#1_139| v_~__unbuffered_p2_EAX~0_152)) (and (= |v_ULTIMATE.start_main_#t~mem35#1_140| |v_ULTIMATE.start_main_#t~ite36#1_139|) (not .cse13) (= (select (select |v_#memory_int_690| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_98) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_98) |v_ULTIMATE.start_main_#t~mem35#1_140|))))) (and .cse12 (= v_~__unbuffered_p2_EAX~0_152 v_~__unbuffered_p2_EAX~0_151) .cse11 (= |v_ULTIMATE.start_main_#t~ite36#1_141| |v_ULTIMATE.start_main_#t~ite36#1_139|)))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| 0)) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_57 0) (= v_~__unbuffered_p0_EAX~0_135 0) (= v_~__unbuffered_p2_EAX~0_151 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_58) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_485 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_120) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53| (mod v_~main$tmp_guard0~0_120 256)) (= v_~x$r_buff1_thd0~0_159 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_585 256) 0))) (and .cse14 (not (= (mod v_~x$r_buff0_thd0~0_161 256) 0)))) 0 v_~x$r_buff1_thd0~0_160)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= |v_ULTIMATE.start_main_#t~nondet34#1_91| v_~weak$$choice1~0_71) (= v_~x$r_buff0_thd0~0_161 (ite .cse3 0 v_~x$r_buff0_thd0~0_162)) (= (mod v_~main$tmp_guard1~0_58 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_331, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_162, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_141|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ~#x~0.offset=|v_~#x~0.offset_315|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_98, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_98, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_91|, ~x$w_buff1~0=v_~x$w_buff1~0_333, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_586, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_160, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_89, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_135, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_172|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_169|, #memory_int=|v_#memory_int_691|, ULTIMATE.start_main_#t~mem35#1=|v_ULTIMATE.start_main_#t~mem35#1_142|, ~#x~0.base=|v_~#x~0.base_319|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_152, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_485} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_331, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_98, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_98, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_58, ULTIMATE.start_main_#t~ite37#1=|v_ULTIMATE.start_main_#t~ite37#1_80|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_135, ~weak$$choice1~0=v_~weak$$choice1~0_71, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_83|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_59|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_151, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_161, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_95|, ~#x~0.offset=|v_~#x~0.offset_315|, ~x$w_buff1~0=v_~x$w_buff1~0_333, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_585, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_120, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_159, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_89, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_609, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43|, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_131|, #memory_int=|v_#memory_int_690|, ~#x~0.base=|v_~#x~0.base_319|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_485, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|} AuxVars[|v_ULTIMATE.start_main_#t~ite36#1_139|, |v_ULTIMATE.start_main_#t~ite32#1_167|, |v_ULTIMATE.start_main_#t~mem31#1_170|, |v_ULTIMATE.start_main_#t~ite33#1_132|, |v_ULTIMATE.start_main_#t~mem35#1_140|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet34#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite37#1, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~mem31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite33#1, ULTIMATE.start_main_#t~ite32#1, #memory_int, ULTIMATE.start_main_#t~mem35#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:54:07,880 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [599] L799-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.offset_9| 0) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= |v_P1Thread1of1ForFork2_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [691] L856-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse8 (= (mod v_~x$r_buff0_thd0~0_162 256) 0))) (let ((.cse14 (not (= (mod v_~x$w_buff0_used~0_609 256) 0))) (.cse4 (not .cse8)) (.cse9 (= (mod v_~x$r_buff1_thd0~0_160 256) 0)) (.cse10 (= (mod v_~x$w_buff1_used~0_586 256) 0)) (.cse7 (= (mod v_~x$w_buff0_used~0_610 256) 0))) (let ((.cse5 (not .cse7)) (.cse0 (select |v_#memory_int_691| |v_~#x~0.base_319|)) (.cse1 (not .cse10)) (.cse2 (not .cse9)) (.cse3 (and .cse14 .cse4))) (and (= (store |v_#memory_int_691| |v_~#x~0.base_319| (store .cse0 |v_~#x~0.offset_315| |v_ULTIMATE.start_main_#t~ite33#1_132|)) |v_#memory_int_690|) (= (ite (or (and .cse1 .cse2) .cse3) 0 v_~x$w_buff1_used~0_586) v_~x$w_buff1_used~0_585) (= (ite (and .cse4 .cse5) 0 v_~x$w_buff0_used~0_610) v_~x$w_buff0_used~0_609) (let ((.cse6 (= |v_ULTIMATE.start_main_#t~mem31#1_172| |v_ULTIMATE.start_main_#t~mem31#1_170|))) (or (and (= |v_ULTIMATE.start_main_#t~ite33#1_132| v_~x$w_buff0~0_331) .cse6 (= |v_ULTIMATE.start_main_#t~ite32#1_169| |v_ULTIMATE.start_main_#t~ite32#1_167|) .cse4 .cse5) (and (= |v_ULTIMATE.start_main_#t~ite33#1_132| |v_ULTIMATE.start_main_#t~ite32#1_167|) (or .cse7 .cse8) (or (and (= |v_ULTIMATE.start_main_#t~mem31#1_170| (select .cse0 |v_~#x~0.offset_315|)) (= |v_ULTIMATE.start_main_#t~mem31#1_170| |v_ULTIMATE.start_main_#t~ite32#1_167|) (or .cse9 .cse10)) (and .cse1 .cse2 .cse6 (= v_~x$w_buff1~0_333 |v_ULTIMATE.start_main_#t~ite32#1_167|)))))) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~mem35#1_142| |v_ULTIMATE.start_main_#t~mem35#1_140|)) (.cse11 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_89 256) 0))) (or (and (not .cse11) (= |v_ULTIMATE.start_main_#t~ite36#1_139| v_~__unbuffered_p2_EAX~0_151) (let ((.cse13 (= (mod v_~weak$$choice1~0_71 256) 0))) (or (and .cse12 .cse13 (= |v_ULTIMATE.start_main_#t~ite36#1_139| v_~__unbuffered_p2_EAX~0_152)) (and (= |v_ULTIMATE.start_main_#t~mem35#1_140| |v_ULTIMATE.start_main_#t~ite36#1_139|) (not .cse13) (= (select (select |v_#memory_int_690| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_98) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_98) |v_ULTIMATE.start_main_#t~mem35#1_140|))))) (and .cse12 (= v_~__unbuffered_p2_EAX~0_152 v_~__unbuffered_p2_EAX~0_151) .cse11 (= |v_ULTIMATE.start_main_#t~ite36#1_141| |v_ULTIMATE.start_main_#t~ite36#1_139|)))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| 0)) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_57 0) (= v_~__unbuffered_p0_EAX~0_135 0) (= v_~__unbuffered_p2_EAX~0_151 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_58) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_485 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_120) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53| (mod v_~main$tmp_guard0~0_120 256)) (= v_~x$r_buff1_thd0~0_159 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_585 256) 0))) (and .cse14 (not (= (mod v_~x$r_buff0_thd0~0_161 256) 0)))) 0 v_~x$r_buff1_thd0~0_160)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= |v_ULTIMATE.start_main_#t~nondet34#1_91| v_~weak$$choice1~0_71) (= v_~x$r_buff0_thd0~0_161 (ite .cse3 0 v_~x$r_buff0_thd0~0_162)) (= (mod v_~main$tmp_guard1~0_58 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_331, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_162, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_141|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ~#x~0.offset=|v_~#x~0.offset_315|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_98, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_98, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_91|, ~x$w_buff1~0=v_~x$w_buff1~0_333, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_586, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_160, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_89, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_135, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_172|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_169|, #memory_int=|v_#memory_int_691|, ULTIMATE.start_main_#t~mem35#1=|v_ULTIMATE.start_main_#t~mem35#1_142|, ~#x~0.base=|v_~#x~0.base_319|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_152, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_485} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_331, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_98, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_98, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_58, ULTIMATE.start_main_#t~ite37#1=|v_ULTIMATE.start_main_#t~ite37#1_80|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_135, ~weak$$choice1~0=v_~weak$$choice1~0_71, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_83|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_59|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_151, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_161, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_95|, ~#x~0.offset=|v_~#x~0.offset_315|, ~x$w_buff1~0=v_~x$w_buff1~0_333, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_585, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_120, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_159, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_89, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_609, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43|, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_131|, #memory_int=|v_#memory_int_690|, ~#x~0.base=|v_~#x~0.base_319|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_485, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|} AuxVars[|v_ULTIMATE.start_main_#t~ite36#1_139|, |v_ULTIMATE.start_main_#t~ite32#1_167|, |v_ULTIMATE.start_main_#t~mem31#1_170|, |v_ULTIMATE.start_main_#t~ite33#1_132|, |v_ULTIMATE.start_main_#t~mem35#1_140|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet34#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite37#1, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~mem31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite33#1, ULTIMATE.start_main_#t~ite32#1, #memory_int, ULTIMATE.start_main_#t~mem35#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:54:08,702 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 00:54:08,703 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8917 [2022-12-13 00:54:08,703 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 379 flow [2022-12-13 00:54:08,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-13 00:54:08,704 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:08,704 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:08,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:54:08,704 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:54:08,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:08,704 INFO L85 PathProgramCache]: Analyzing trace with hash 999976607, now seen corresponding path program 1 times [2022-12-13 00:54:08,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:08,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517765574] [2022-12-13 00:54:08,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:08,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:08,898 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-13 00:54:08,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:08,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517765574] [2022-12-13 00:54:08,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517765574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:08,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:08,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:54:08,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942029176] [2022-12-13 00:54:08,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:08,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:54:08,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:08,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:54:08,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:54:08,900 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2022-12-13 00:54:08,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 379 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-13 00:54:08,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:08,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2022-12-13 00:54:08,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:09,249 INFO L130 PetriNetUnfolder]: 539/1154 cut-off events. [2022-12-13 00:54:09,250 INFO L131 PetriNetUnfolder]: For 3352/3433 co-relation queries the response was YES. [2022-12-13 00:54:09,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5542 conditions, 1154 events. 539/1154 cut-off events. For 3352/3433 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 7844 event pairs, 73 based on Foata normal form. 78/904 useless extension candidates. Maximal degree in co-relation 5521. Up to 688 conditions per place. [2022-12-13 00:54:09,257 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 45 selfloop transitions, 1 changer transitions 29/83 dead transitions. [2022-12-13 00:54:09,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 83 transitions, 756 flow [2022-12-13 00:54:09,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:54:09,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:54:09,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-12-13 00:54:09,259 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2022-12-13 00:54:09,259 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 379 flow. Second operand 4 states and 81 transitions. [2022-12-13 00:54:09,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 83 transitions, 756 flow [2022-12-13 00:54:09,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 83 transitions, 540 flow, removed 27 selfloop flow, removed 8 redundant places. [2022-12-13 00:54:09,277 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 233 flow [2022-12-13 00:54:09,277 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=233, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2022-12-13 00:54:09,279 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2022-12-13 00:54:09,279 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:09,279 INFO L89 Accepts]: Start accepts. Operand has 49 places, 44 transitions, 233 flow [2022-12-13 00:54:09,280 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:09,280 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:09,280 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 44 transitions, 233 flow [2022-12-13 00:54:09,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 44 transitions, 233 flow [2022-12-13 00:54:09,367 INFO L130 PetriNetUnfolder]: 130/356 cut-off events. [2022-12-13 00:54:09,367 INFO L131 PetriNetUnfolder]: For 338/338 co-relation queries the response was YES. [2022-12-13 00:54:09,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 356 events. 130/356 cut-off events. For 338/338 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 2390 event pairs, 1 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 1044. Up to 166 conditions per place. [2022-12-13 00:54:09,370 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 44 transitions, 233 flow [2022-12-13 00:54:09,370 INFO L226 LiptonReduction]: Number of co-enabled transitions 322 [2022-12-13 00:54:10,514 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:54:10,515 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1236 [2022-12-13 00:54:10,515 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 234 flow [2022-12-13 00:54:10,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-13 00:54:10,515 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:10,515 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:10,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:54:10,515 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:54:10,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:10,516 INFO L85 PathProgramCache]: Analyzing trace with hash 280669202, now seen corresponding path program 1 times [2022-12-13 00:54:10,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:10,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174205459] [2022-12-13 00:54:10,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:10,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:11,904 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-13 00:54:11,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:11,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174205459] [2022-12-13 00:54:11,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174205459] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:11,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:11,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 00:54:11,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195682195] [2022-12-13 00:54:11,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:11,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 00:54:11,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:11,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 00:54:11,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-13 00:54:11,907 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2022-12-13 00:54:11,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 234 flow. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 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-13 00:54:11,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:11,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2022-12-13 00:54:11,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:12,327 INFO L130 PetriNetUnfolder]: 230/606 cut-off events. [2022-12-13 00:54:12,328 INFO L131 PetriNetUnfolder]: For 1025/1042 co-relation queries the response was YES. [2022-12-13 00:54:12,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2003 conditions, 606 events. 230/606 cut-off events. For 1025/1042 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4209 event pairs, 32 based on Foata normal form. 66/489 useless extension candidates. Maximal degree in co-relation 1985. Up to 272 conditions per place. [2022-12-13 00:54:12,330 INFO L137 encePairwiseOnDemand]: 21/33 looper letters, 25 selfloop transitions, 11 changer transitions 23/65 dead transitions. [2022-12-13 00:54:12,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 65 transitions, 432 flow [2022-12-13 00:54:12,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:54:12,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:54:12,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2022-12-13 00:54:12,332 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.509090909090909 [2022-12-13 00:54:12,332 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 234 flow. Second operand 5 states and 84 transitions. [2022-12-13 00:54:12,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 65 transitions, 432 flow [2022-12-13 00:54:12,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 65 transitions, 403 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-13 00:54:12,335 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 193 flow [2022-12-13 00:54:12,335 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2022-12-13 00:54:12,336 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2022-12-13 00:54:12,336 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:12,336 INFO L89 Accepts]: Start accepts. Operand has 48 places, 36 transitions, 193 flow [2022-12-13 00:54:12,337 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:12,337 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:12,337 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 36 transitions, 193 flow [2022-12-13 00:54:12,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 193 flow [2022-12-13 00:54:12,381 INFO L130 PetriNetUnfolder]: 63/156 cut-off events. [2022-12-13 00:54:12,381 INFO L131 PetriNetUnfolder]: For 146/146 co-relation queries the response was YES. [2022-12-13 00:54:12,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 466 conditions, 156 events. 63/156 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 842 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 452. Up to 82 conditions per place. [2022-12-13 00:54:12,382 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 36 transitions, 193 flow [2022-12-13 00:54:12,382 INFO L226 LiptonReduction]: Number of co-enabled transitions 70 [2022-12-13 00:54:33,292 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [718] $Ultimate##0-->L837: Formula: (let ((.cse11 (= (mod v_~x$w_buff1_used~0_709 256) 0)) (.cse8 (= (mod v_~x$r_buff1_thd3~0_300 256) 0)) (.cse26 (= (mod v_~x$r_buff0_thd3~0_307 256) 0)) (.cse28 (= (mod v_~x$w_buff0_used~0_733 256) 0))) (let ((.cse10 (not .cse28)) (.cse9 (not .cse26)) (.cse25 (and .cse8 .cse26)) (.cse27 (and .cse11 .cse26)) (.cse6 (= (mod v_~weak$$choice2~0_178 256) 0))) (let ((.cse5 (not .cse6)) (.cse13 (or .cse25 .cse27 .cse28)) (.cse7 (and .cse10 .cse9))) (let ((.cse16 (ite .cse5 v_~x$w_buff0_used~0_733 (ite .cse13 v_~x$w_buff0_used~0_733 (ite .cse7 0 v_~x$w_buff0_used~0_733))))) (let ((.cse21 (= (mod .cse16 256) 0))) (let ((.cse4 (ite .cse5 v_~x$w_buff1_used~0_709 (ite (or .cse25 .cse27 .cse21) v_~x$w_buff1_used~0_709 0)))) (let ((.cse19 (= (mod .cse4 256) 0)) (.cse14 (not .cse21))) (let ((.cse1 (ite .cse5 v_~x$r_buff0_thd3~0_307 (ite (or .cse25 (and .cse19 .cse26) .cse21) v_~x$r_buff0_thd3~0_307 (ite (and .cse14 .cse9) 0 v_~x$r_buff0_thd3~0_307))))) (let ((.cse20 (= (mod .cse1 256) 0))) (let ((.cse23 (ite .cse5 v_~x$r_buff1_thd3~0_300 (ite (or (and .cse19 .cse20) (and .cse8 .cse20) .cse21) v_~x$r_buff1_thd3~0_300 0)))) (let ((.cse18 (= (mod .cse23 256) 0)) (.cse24 (select |v_#memory_int_820| |v_~#x~0.base_377|)) (.cse22 (not (= (mod v_~x$w_buff0_used~0_731 256) 0))) (.cse15 (not .cse20))) (let ((.cse0 (and .cse22 .cse15)) (.cse12 (select .cse24 |v_~#x~0.offset_373|)) (.cse2 (not .cse19)) (.cse3 (not .cse18))) (and (= (ite .cse0 0 .cse1) v_~x$r_buff0_thd3~0_305) (= v_~__unbuffered_p2_EBX~0_99 v_~y~0_53) (= v_~x$flush_delayed~0_150 0) (= v_~__unbuffered_p2_EAX$read_delayed_var~0.base_130 |v_~#x~0.base_377|) (= v_~__unbuffered_cnt~0_583 (+ v_~__unbuffered_cnt~0_584 1)) (= v_~weak$$choice2~0_178 |v_P2Thread1of1ForFork0_#t~nondet15_30|) (= (ite (or .cse0 (and .cse2 .cse3)) 0 .cse4) v_~x$w_buff1_used~0_707) (or (and .cse5 (= |v_P2Thread1of1ForFork0_#t~mem20_30| |v_P2_#t~mem20_47|) (= |v_P2_#t~ite21_48| v_~x$mem_tmp~0_120)) (and (= |v_P2_#t~mem20_47| v_~__unbuffered_p2_EAX~0_215) (= |v_P2_#t~ite21_48| |v_P2_#t~mem20_47|) .cse6)) (or (and (= (ite .cse7 v_~x$w_buff0~0_394 v_~x$w_buff1~0_396) v_~__unbuffered_p2_EAX~0_215) (= |v_P2Thread1of1ForFork0_#t~mem17_30| |v_P2_#t~mem17_61|) (or (not .cse8) .cse9) .cse10 (or (not .cse11) .cse9)) (and (= |v_P2_#t~mem17_61| v_~__unbuffered_p2_EAX~0_215) (= .cse12 |v_P2_#t~mem17_61|) .cse13)) (= (ite (and .cse14 .cse15) 0 .cse16) v_~x$w_buff0_used~0_731) (= |v_P2Thread1of1ForFork0_#in~arg.base_15| v_P2Thread1of1ForFork0_~arg.base_15) (= .cse12 v_~x$mem_tmp~0_120) (= v_~x$w_buff0~0_394 v_~x$w_buff0~0_393) (let ((.cse17 (= |v_P2Thread1of1ForFork0_#t~mem22_150| |v_P2_#t~mem22_115|))) (or (and (or (and .cse2 .cse3 (= v_~x$w_buff1~0_395 |v_P2_#t~ite23_110|) .cse17) (and (or .cse18 .cse19) (= |v_P2_#t~mem22_115| |v_P2_#t~ite23_110|) (= |v_P2_#t~ite21_48| |v_P2_#t~mem22_115|))) (= |v_P2_#t~ite23_110| |v_P2_#t~ite24_104|) (or .cse20 .cse21)) (and (= v_~x$w_buff0~0_393 |v_P2_#t~ite24_104|) (= |v_P2Thread1of1ForFork0_#t~ite23_150| |v_P2_#t~ite23_110|) .cse14 .cse17 .cse15))) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_707 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_305 256) 0)) .cse22)) 0 .cse23) v_~x$r_buff1_thd3~0_298) (= |v_P2Thread1of1ForFork0_#in~arg.offset_15| v_P2Thread1of1ForFork0_~arg.offset_15) (= v_~x$w_buff1~0_396 v_~x$w_buff1~0_395) (= (store |v_#memory_int_820| |v_~#x~0.base_377| (store .cse24 |v_~#x~0.offset_373| |v_P2_#t~ite24_104|)) |v_#memory_int_818|) (= v_~__unbuffered_p2_EAX$read_delayed~0_121 1) (= |v_~#x~0.offset_373| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_130) (= |v_P2Thread1of1ForFork0_#t~nondet14_30| v_~weak$$choice0~0_116)))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_394, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_15|, ~#x~0.offset=|v_~#x~0.offset_373|, ~x$w_buff1~0=v_~x$w_buff1~0_396, P2Thread1of1ForFork0_#t~mem17=|v_P2Thread1of1ForFork0_#t~mem17_30|, P2Thread1of1ForFork0_#t~nondet15=|v_P2Thread1of1ForFork0_#t~nondet15_30|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_300, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_709, P2Thread1of1ForFork0_#t~nondet14=|v_P2Thread1of1ForFork0_#t~nondet14_30|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_307, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_733, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_150|, #memory_int=|v_#memory_int_820|, ~#x~0.base=|v_~#x~0.base_377|, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_150|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_584, ~y~0=v_~y~0_53, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_15|, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_30|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_393, P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_17|, P2Thread1of1ForFork0_#t~mem16=|v_P2Thread1of1ForFork0_#t~mem16_17|, ~x$flush_delayed~0=v_~x$flush_delayed~0_150, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_130, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_130, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_298, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_305, ~x$mem_tmp~0=v_~x$mem_tmp~0_120, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_15, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_17|, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_77|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_215, ~y~0=v_~y~0_53, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_99, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_15|, ~#x~0.offset=|v_~#x~0.offset_373|, ~x$w_buff1~0=v_~x$w_buff1~0_395, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_707, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_731, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_121, ~weak$$choice0~0=v_~weak$$choice0~0_116, #memory_int=|v_#memory_int_818|, ~#x~0.base=|v_~#x~0.base_377|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_583, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_17|, ~weak$$choice2~0=v_~weak$$choice2~0_178, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_15|} AuxVars[|v_P2_#t~ite23_110|, |v_P2_#t~mem22_115|, |v_P2_#t~mem20_47|, |v_P2_#t~ite21_48|, |v_P2_#t~ite24_104|, |v_P2_#t~mem17_61|] AssignedVars[~x$w_buff0~0, P2Thread1of1ForFork0_#t~mem19, P2Thread1of1ForFork0_#t~mem16, ~x$flush_delayed~0, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, ~__unbuffered_p2_EAX$read_delayed_var~0.base, P2Thread1of1ForFork0_#t~mem17, ~x$r_buff1_thd3~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~nondet15, ~x$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet14, ~x$w_buff0_used~0, ~__unbuffered_p2_EAX$read_delayed~0, ~weak$$choice0~0, #memory_int, P2Thread1of1ForFork0_#t~mem22, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~mem20] and [701] $Ultimate##0-->L780: Formula: (let ((.cse16 (= (mod v_~x$w_buff0_used~0_658 256) 0)) (.cse14 (= (mod v_~x$w_buff1_used~0_634 256) 0)) (.cse4 (= (mod v_~x$r_buff0_thd1~0_181 256) 0)) (.cse12 (= (mod v_~x$r_buff1_thd1~0_184 256) 0))) (let ((.cse2 (and .cse4 .cse12)) (.cse9 (and .cse4 .cse14)) (.cse13 (select |v_#memory_int_739| |v_~#x~0.base_343|)) (.cse6 (not .cse4)) (.cse15 (not .cse16)) (.cse10 (= (mod v_~weak$$choice2~0_174 256) 0))) (let ((.cse1 (not .cse10)) (.cse5 (= (mod v_~x$w_buff1_used~0_633 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_657 256) 0)) (.cse8 (and .cse6 .cse15)) (.cse0 (select .cse13 |v_~#x~0.offset_339|)) (.cse7 (or .cse2 .cse9 .cse16))) (and (= .cse0 v_~x$mem_tmp~0_116) (= v_~x$w_buff0~0_356 v_~x$w_buff0~0_355) (= v_~x$flush_delayed~0_146 0) (= v_~weak$$choice2~0_174 |v_P0Thread1of1ForFork1_#t~nondet4_118|) (= v_~x$r_buff0_thd1~0_180 (ite .cse1 v_~x$r_buff0_thd1~0_181 (ite (or .cse2 .cse3 (and .cse4 .cse5)) v_~x$r_buff0_thd1~0_181 (ite (and .cse6 (not .cse3)) 0 v_~x$r_buff0_thd1~0_181)))) (= (ite .cse1 v_~x$w_buff0_used~0_658 (ite .cse7 v_~x$w_buff0_used~0_658 (ite .cse8 0 v_~x$w_buff0_used~0_658))) v_~x$w_buff0_used~0_657) (= v_~x$w_buff1~0_358 v_~x$w_buff1~0_357) (= v_~x$w_buff1_used~0_633 (ite .cse1 v_~x$w_buff1_used~0_634 (ite (or .cse2 .cse3 .cse9) v_~x$w_buff1_used~0_634 0))) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_19) (or (and (= v_~__unbuffered_p0_EAX~0_155 |v_P0_#t~mem9_87|) (= |v_P0_#t~ite10_88| |v_P0_#t~mem9_87|) .cse10) (and (= |v_P0Thread1of1ForFork1_#t~mem9_118| |v_P0_#t~mem9_87|) .cse1 (= |v_P0_#t~ite10_88| v_~x$mem_tmp~0_116))) (= (ite .cse1 v_~x$r_buff1_thd1~0_184 (ite (let ((.cse11 (= (mod v_~x$r_buff0_thd1~0_180 256) 0))) (or (and .cse11 .cse5) .cse3 (and .cse11 .cse12))) v_~x$r_buff1_thd1~0_184 0)) v_~x$r_buff1_thd1~0_183) (= (store |v_#memory_int_739| |v_~#x~0.base_343| (store .cse13 |v_~#x~0.offset_339| |v_P0_#t~ite10_88|)) |v_#memory_int_738|) (= v_~weak$$choice0~0_112 |v_P0Thread1of1ForFork1_#t~nondet3_118|) (= v_~y~0_43 1) (or (and (or .cse6 (not .cse14)) (or .cse6 (not .cse12)) (= |v_P0Thread1of1ForFork1_#t~mem6_118| |v_P0_#t~mem6_107|) (= (ite .cse8 v_~x$w_buff0~0_356 v_~x$w_buff1~0_358) v_~__unbuffered_p0_EAX~0_155) .cse15) (and (= v_~__unbuffered_p0_EAX~0_155 |v_P0_#t~mem6_107|) (= .cse0 |v_P0_#t~mem6_107|) .cse7)) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_19|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_356, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_181, ~#x~0.offset=|v_~#x~0.offset_339|, ~x$w_buff1~0=v_~x$w_buff1~0_358, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_634, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_184, P0Thread1of1ForFork1_#t~mem9=|v_P0Thread1of1ForFork1_#t~mem9_118|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_658, P0Thread1of1ForFork1_#t~mem6=|v_P0Thread1of1ForFork1_#t~mem6_118|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, #memory_int=|v_#memory_int_739|, ~#x~0.base=|v_~#x~0.base_343|, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_118|, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_118|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_355, P0Thread1of1ForFork1_#t~ite10=|v_P0Thread1of1ForFork1_#t~ite10_61|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_180, ~x$flush_delayed~0=v_~x$flush_delayed~0_146, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_183, ~x$mem_tmp~0=v_~x$mem_tmp~0_116, P0Thread1of1ForFork1_#t~mem8=|v_P0Thread1of1ForFork1_#t~mem8_61|, P0Thread1of1ForFork1_#t~mem5=|v_P0Thread1of1ForFork1_#t~mem5_61|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_155, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, ~y~0=v_~y~0_43, ~#x~0.offset=|v_~#x~0.offset_339|, ~x$w_buff1~0=v_~x$w_buff1~0_357, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_633, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_657, ~weak$$choice0~0=v_~weak$$choice0~0_112, P0Thread1of1ForFork1_#t~ite7=|v_P0Thread1of1ForFork1_#t~ite7_61|, #memory_int=|v_#memory_int_738|, ~#x~0.base=|v_~#x~0.base_343|, ~weak$$choice2~0=v_~weak$$choice2~0_174} AuxVars[|v_P0_#t~mem9_87|, |v_P0_#t~ite10_88|, |v_P0_#t~mem6_107|] AssignedVars[~x$w_buff0~0, P0Thread1of1ForFork1_#t~ite10, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~mem9, ~x$mem_tmp~0, P0Thread1of1ForFork1_#t~mem8, P0Thread1of1ForFork1_#t~mem5, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, P0Thread1of1ForFork1_#t~mem6, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#t~ite7, #memory_int, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4] [2022-12-13 00:54:36,448 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [719] $Ultimate##0-->P2FINAL: Formula: (let ((.cse15 (= (mod v_~x$r_buff1_thd3~0_306 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_715 256) 0)) (.cse25 (= (mod v_~x$r_buff0_thd3~0_313 256) 0)) (.cse28 (= (mod v_~x$w_buff0_used~0_739 256) 0))) (let ((.cse11 (not .cse28)) (.cse14 (not .cse25)) (.cse27 (and .cse13 .cse25)) (.cse26 (and .cse25 .cse15)) (.cse9 (= (mod v_~weak$$choice2~0_180 256) 0))) (let ((.cse10 (not .cse9)) (.cse16 (or .cse27 .cse26 .cse28)) (.cse12 (and .cse11 .cse14))) (let ((.cse2 (ite .cse10 v_~x$w_buff0_used~0_739 (ite .cse16 v_~x$w_buff0_used~0_739 (ite .cse12 0 v_~x$w_buff0_used~0_739))))) (let ((.cse19 (= (mod .cse2 256) 0))) (let ((.cse18 (ite .cse10 v_~x$w_buff1_used~0_715 (ite (or .cse19 .cse27 .cse26) v_~x$w_buff1_used~0_715 0)))) (let ((.cse23 (= (mod .cse18 256) 0)) (.cse1 (not .cse19))) (let ((.cse8 (ite .cse10 v_~x$r_buff0_thd3~0_313 (ite (or .cse19 (and .cse23 .cse25) .cse26) v_~x$r_buff0_thd3~0_313 (ite (and .cse1 .cse14) 0 v_~x$r_buff0_thd3~0_313))))) (let ((.cse20 (= (mod .cse8 256) 0))) (let ((.cse5 (ite .cse10 v_~x$r_buff1_thd3~0_306 (ite (or .cse19 (and .cse20 .cse15) (and .cse20 .cse23)) v_~x$r_buff1_thd3~0_306 0)))) (let ((.cse22 (= (mod .cse5 256) 0)) (.cse0 (not .cse20)) (.cse3 (not (= (mod v_~x$w_buff0_used~0_737 256) 0))) (.cse24 (select |v_#memory_int_826| |v_~#x~0.base_379|))) (let ((.cse6 (select .cse24 |v_~#x~0.offset_375|)) (.cse7 (and .cse0 .cse3)) (.cse4 (not .cse22)) (.cse17 (not .cse23))) (and (= |v_P2Thread1of1ForFork0_#t~nondet14_34| v_~weak$$choice0~0_118) (= (ite (and .cse0 .cse1) 0 .cse2) v_~x$w_buff0_used~0_737) (= v_~weak$$choice2~0_180 |v_P2Thread1of1ForFork0_#t~nondet15_34|) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_311 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_713 256) 0)) .cse4)) 0 .cse5) v_~x$r_buff1_thd3~0_304) (= .cse6 v_~x$mem_tmp~0_122) (= v_~x$w_buff0~0_398 v_~x$w_buff0~0_397) (= v_~x$r_buff0_thd3~0_311 (ite .cse7 0 .cse8)) (= |v_P2Thread1of1ForFork0_#in~arg.base_17| v_P2Thread1of1ForFork0_~arg.base_17) (= |v_~#x~0.offset_375| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_132) (or (and (= |v_P2_#t~mem20_49| v_~__unbuffered_p2_EAX~0_217) (= |v_P2_#t~ite21_50| |v_P2_#t~mem20_49|) .cse9) (and (= |v_P2_#t~ite21_50| v_~x$mem_tmp~0_122) (= |v_P2Thread1of1ForFork0_#t~mem20_34| |v_P2_#t~mem20_49|) .cse10)) (= |v_P2Thread1of1ForFork0_#res.base_75| 0) (= |v_P2Thread1of1ForFork0_#res.offset_75| 0) (or (and .cse11 (= |v_P2Thread1of1ForFork0_#t~mem17_34| |v_P2_#t~mem17_63|) (= (ite .cse12 v_~x$w_buff0~0_398 v_~x$w_buff1~0_400) v_~__unbuffered_p2_EAX~0_217) (or (not .cse13) .cse14) (or (not .cse15) .cse14)) (and (= |v_P2_#t~mem17_63| .cse6) .cse16 (= |v_P2_#t~mem17_63| v_~__unbuffered_p2_EAX~0_217))) (= v_~x$flush_delayed~0_152 0) (= v_~__unbuffered_p2_EAX$read_delayed_var~0.base_132 |v_~#x~0.base_379|) (= v_~x$w_buff1_used~0_713 (ite (or .cse7 (and .cse4 .cse17)) 0 .cse18)) (= v_~x$w_buff1~0_400 v_~x$w_buff1~0_399) (= v_~__unbuffered_p2_EBX~0_101 v_~y~0_55) (let ((.cse21 (= |v_P2Thread1of1ForFork0_#t~mem22_154| |v_P2_#t~mem22_117|))) (or (and (= |v_P2_#t~ite23_112| |v_P2_#t~ite24_106|) (or .cse19 .cse20) (or (and (= v_~x$w_buff1~0_399 |v_P2_#t~ite23_112|) .cse4 .cse21 .cse17) (and (or .cse22 .cse23) (= |v_P2_#t~mem22_117| |v_P2_#t~ite23_112|) (= |v_P2_#t~ite21_50| |v_P2_#t~mem22_117|)))) (and .cse0 (= |v_P2Thread1of1ForFork0_#t~ite23_154| |v_P2_#t~ite23_112|) .cse1 (= v_~x$w_buff0~0_397 |v_P2_#t~ite24_106|) .cse21))) (= v_~__unbuffered_p2_EAX$read_delayed~0_123 1) (= (store |v_#memory_int_826| |v_~#x~0.base_379| (store .cse24 |v_~#x~0.offset_375| |v_P2_#t~ite24_106|)) |v_#memory_int_824|) (= v_~__unbuffered_cnt~0_587 (+ v_~__unbuffered_cnt~0_588 1)) (= |v_P2Thread1of1ForFork0_#in~arg.offset_17| v_P2Thread1of1ForFork0_~arg.offset_17)))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_398, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_17|, ~#x~0.offset=|v_~#x~0.offset_375|, ~x$w_buff1~0=v_~x$w_buff1~0_400, P2Thread1of1ForFork0_#t~mem17=|v_P2Thread1of1ForFork0_#t~mem17_34|, P2Thread1of1ForFork0_#t~nondet15=|v_P2Thread1of1ForFork0_#t~nondet15_34|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_306, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_715, P2Thread1of1ForFork0_#t~nondet14=|v_P2Thread1of1ForFork0_#t~nondet14_34|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_313, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_739, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_154|, #memory_int=|v_#memory_int_826|, ~#x~0.base=|v_~#x~0.base_379|, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_154|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_588, ~y~0=v_~y~0_55, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_17|, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_34|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_397, P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_19|, P2Thread1of1ForFork0_#t~mem16=|v_P2Thread1of1ForFork0_#t~mem16_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_152, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_132, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_132, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_304, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_311, ~x$mem_tmp~0=v_~x$mem_tmp~0_122, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_17, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_19|, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_79|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_217, ~y~0=v_~y~0_55, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_75|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_101, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_17|, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_75|, ~#x~0.offset=|v_~#x~0.offset_375|, ~x$w_buff1~0=v_~x$w_buff1~0_399, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_713, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_737, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_123, ~weak$$choice0~0=v_~weak$$choice0~0_118, #memory_int=|v_#memory_int_824|, ~#x~0.base=|v_~#x~0.base_379|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_587, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_19|, ~weak$$choice2~0=v_~weak$$choice2~0_180, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_17|} AuxVars[|v_P2_#t~ite21_50|, |v_P2_#t~mem22_117|, |v_P2_#t~ite23_112|, |v_P2_#t~mem20_49|, |v_P2_#t~mem17_63|, |v_P2_#t~ite24_106|] AssignedVars[~x$w_buff0~0, P2Thread1of1ForFork0_#t~mem19, P2Thread1of1ForFork0_#t~mem16, ~x$flush_delayed~0, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, ~__unbuffered_p2_EAX$read_delayed_var~0.base, P2Thread1of1ForFork0_#t~mem17, ~x$r_buff1_thd3~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#res.offset, ~__unbuffered_p2_EBX~0, P2Thread1of1ForFork0_#res.base, ~x$w_buff1~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~nondet15, ~x$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet14, ~x$w_buff0_used~0, ~__unbuffered_p2_EAX$read_delayed~0, ~weak$$choice0~0, #memory_int, P2Thread1of1ForFork0_#t~mem22, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~mem20] and [701] $Ultimate##0-->L780: Formula: (let ((.cse16 (= (mod v_~x$w_buff0_used~0_658 256) 0)) (.cse14 (= (mod v_~x$w_buff1_used~0_634 256) 0)) (.cse4 (= (mod v_~x$r_buff0_thd1~0_181 256) 0)) (.cse12 (= (mod v_~x$r_buff1_thd1~0_184 256) 0))) (let ((.cse2 (and .cse4 .cse12)) (.cse9 (and .cse4 .cse14)) (.cse13 (select |v_#memory_int_739| |v_~#x~0.base_343|)) (.cse6 (not .cse4)) (.cse15 (not .cse16)) (.cse10 (= (mod v_~weak$$choice2~0_174 256) 0))) (let ((.cse1 (not .cse10)) (.cse5 (= (mod v_~x$w_buff1_used~0_633 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_657 256) 0)) (.cse8 (and .cse6 .cse15)) (.cse0 (select .cse13 |v_~#x~0.offset_339|)) (.cse7 (or .cse2 .cse9 .cse16))) (and (= .cse0 v_~x$mem_tmp~0_116) (= v_~x$w_buff0~0_356 v_~x$w_buff0~0_355) (= v_~x$flush_delayed~0_146 0) (= v_~weak$$choice2~0_174 |v_P0Thread1of1ForFork1_#t~nondet4_118|) (= v_~x$r_buff0_thd1~0_180 (ite .cse1 v_~x$r_buff0_thd1~0_181 (ite (or .cse2 .cse3 (and .cse4 .cse5)) v_~x$r_buff0_thd1~0_181 (ite (and .cse6 (not .cse3)) 0 v_~x$r_buff0_thd1~0_181)))) (= (ite .cse1 v_~x$w_buff0_used~0_658 (ite .cse7 v_~x$w_buff0_used~0_658 (ite .cse8 0 v_~x$w_buff0_used~0_658))) v_~x$w_buff0_used~0_657) (= v_~x$w_buff1~0_358 v_~x$w_buff1~0_357) (= v_~x$w_buff1_used~0_633 (ite .cse1 v_~x$w_buff1_used~0_634 (ite (or .cse2 .cse3 .cse9) v_~x$w_buff1_used~0_634 0))) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_19) (or (and (= v_~__unbuffered_p0_EAX~0_155 |v_P0_#t~mem9_87|) (= |v_P0_#t~ite10_88| |v_P0_#t~mem9_87|) .cse10) (and (= |v_P0Thread1of1ForFork1_#t~mem9_118| |v_P0_#t~mem9_87|) .cse1 (= |v_P0_#t~ite10_88| v_~x$mem_tmp~0_116))) (= (ite .cse1 v_~x$r_buff1_thd1~0_184 (ite (let ((.cse11 (= (mod v_~x$r_buff0_thd1~0_180 256) 0))) (or (and .cse11 .cse5) .cse3 (and .cse11 .cse12))) v_~x$r_buff1_thd1~0_184 0)) v_~x$r_buff1_thd1~0_183) (= (store |v_#memory_int_739| |v_~#x~0.base_343| (store .cse13 |v_~#x~0.offset_339| |v_P0_#t~ite10_88|)) |v_#memory_int_738|) (= v_~weak$$choice0~0_112 |v_P0Thread1of1ForFork1_#t~nondet3_118|) (= v_~y~0_43 1) (or (and (or .cse6 (not .cse14)) (or .cse6 (not .cse12)) (= |v_P0Thread1of1ForFork1_#t~mem6_118| |v_P0_#t~mem6_107|) (= (ite .cse8 v_~x$w_buff0~0_356 v_~x$w_buff1~0_358) v_~__unbuffered_p0_EAX~0_155) .cse15) (and (= v_~__unbuffered_p0_EAX~0_155 |v_P0_#t~mem6_107|) (= .cse0 |v_P0_#t~mem6_107|) .cse7)) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_19|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_356, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_181, ~#x~0.offset=|v_~#x~0.offset_339|, ~x$w_buff1~0=v_~x$w_buff1~0_358, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_634, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_184, P0Thread1of1ForFork1_#t~mem9=|v_P0Thread1of1ForFork1_#t~mem9_118|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_658, P0Thread1of1ForFork1_#t~mem6=|v_P0Thread1of1ForFork1_#t~mem6_118|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, #memory_int=|v_#memory_int_739|, ~#x~0.base=|v_~#x~0.base_343|, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_118|, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_118|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_355, P0Thread1of1ForFork1_#t~ite10=|v_P0Thread1of1ForFork1_#t~ite10_61|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_180, ~x$flush_delayed~0=v_~x$flush_delayed~0_146, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_183, ~x$mem_tmp~0=v_~x$mem_tmp~0_116, P0Thread1of1ForFork1_#t~mem8=|v_P0Thread1of1ForFork1_#t~mem8_61|, P0Thread1of1ForFork1_#t~mem5=|v_P0Thread1of1ForFork1_#t~mem5_61|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_155, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, ~y~0=v_~y~0_43, ~#x~0.offset=|v_~#x~0.offset_339|, ~x$w_buff1~0=v_~x$w_buff1~0_357, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_633, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_657, ~weak$$choice0~0=v_~weak$$choice0~0_112, P0Thread1of1ForFork1_#t~ite7=|v_P0Thread1of1ForFork1_#t~ite7_61|, #memory_int=|v_#memory_int_738|, ~#x~0.base=|v_~#x~0.base_343|, ~weak$$choice2~0=v_~weak$$choice2~0_174} AuxVars[|v_P0_#t~mem9_87|, |v_P0_#t~ite10_88|, |v_P0_#t~mem6_107|] AssignedVars[~x$w_buff0~0, P0Thread1of1ForFork1_#t~ite10, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~mem9, ~x$mem_tmp~0, P0Thread1of1ForFork1_#t~mem8, P0Thread1of1ForFork1_#t~mem5, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, P0Thread1of1ForFork1_#t~mem6, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#t~ite7, #memory_int, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4] [2022-12-13 00:54:39,522 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [720] $Ultimate##0-->L834: Formula: (let ((.cse18 (= (mod v_~x$r_buff1_thd3~0_312 256) 0)) (.cse19 (= (mod v_~x$w_buff1_used~0_721 256) 0)) (.cse25 (= (mod v_~x$r_buff0_thd3~0_319 256) 0)) (.cse28 (= (mod v_~x$w_buff0_used~0_745 256) 0))) (let ((.cse15 (not .cse28)) (.cse17 (not .cse25)) (.cse27 (and .cse25 .cse19)) (.cse26 (and .cse18 .cse25)) (.cse10 (= (mod v_~weak$$choice2~0_182 256) 0))) (let ((.cse11 (not .cse10)) (.cse14 (or .cse27 .cse28 .cse26)) (.cse16 (and .cse15 .cse17))) (let ((.cse9 (ite .cse11 v_~x$w_buff0_used~0_745 (ite .cse14 v_~x$w_buff0_used~0_745 (ite .cse16 0 v_~x$w_buff0_used~0_745))))) (let ((.cse4 (= (mod .cse9 256) 0))) (let ((.cse21 (ite .cse11 v_~x$w_buff1_used~0_721 (ite (or .cse4 .cse27 .cse26) v_~x$w_buff1_used~0_721 0)))) (let ((.cse6 (= (mod .cse21 256) 0)) (.cse2 (not .cse4))) (let ((.cse22 (ite .cse11 v_~x$r_buff0_thd3~0_319 (ite (or (and .cse25 .cse6) .cse4 .cse26) v_~x$r_buff0_thd3~0_319 (ite (and .cse17 .cse2) 0 v_~x$r_buff0_thd3~0_319))))) (let ((.cse3 (= (mod .cse22 256) 0))) (let ((.cse24 (ite .cse11 v_~x$r_buff1_thd3~0_312 (ite (or (and .cse3 .cse6) .cse4 (and .cse18 .cse3)) v_~x$r_buff1_thd3~0_312 0)))) (let ((.cse5 (= (mod .cse24 256) 0)) (.cse23 (not (= (mod v_~x$w_buff0_used~0_743 256) 0))) (.cse0 (not .cse3)) (.cse13 (select |v_#memory_int_832| |v_~#x~0.base_381|))) (let ((.cse12 (select .cse13 |v_~#x~0.offset_377|)) (.cse7 (not .cse6)) (.cse20 (and .cse23 .cse0)) (.cse8 (not .cse5))) (and (let ((.cse1 (= |v_P2Thread1of1ForFork0_#t~mem22_158| |v_P2_#t~mem22_119|))) (or (and (= |v_P2Thread1of1ForFork0_#t~ite23_158| |v_P2_#t~ite23_114|) .cse0 .cse1 (= v_~x$w_buff0~0_401 |v_P2_#t~ite24_108|) .cse2) (and (or .cse3 .cse4) (= |v_P2_#t~ite23_114| |v_P2_#t~ite24_108|) (or (and (= |v_P2_#t~mem22_119| |v_P2_#t~ite23_114|) (or .cse5 .cse6) (= |v_P2_#t~ite21_52| |v_P2_#t~mem22_119|)) (and (= v_~x$w_buff1~0_403 |v_P2_#t~ite23_114|) .cse1 .cse7 .cse8))))) (= |v_P2Thread1of1ForFork0_#in~arg.base_19| v_P2Thread1of1ForFork0_~arg.base_19) (= (ite (and .cse0 .cse2) 0 .cse9) v_~x$w_buff0_used~0_743) (= v_~weak$$choice2~0_182 |v_P2Thread1of1ForFork0_#t~nondet15_38|) (or (and .cse10 (= |v_P2_#t~mem20_51| v_~__unbuffered_p2_EAX~0_219) (= |v_P2_#t~ite21_52| |v_P2_#t~mem20_51|)) (and .cse11 (= |v_P2Thread1of1ForFork0_#t~mem20_38| |v_P2_#t~mem20_51|) (= |v_P2_#t~ite21_52| v_~x$mem_tmp~0_124))) (= v_~x$w_buff0~0_402 v_~x$w_buff0~0_401) (= .cse12 v_~x$mem_tmp~0_124) (= (store |v_#memory_int_832| |v_~#x~0.base_381| (store .cse13 |v_~#x~0.offset_377| |v_P2_#t~ite24_108|)) |v_#memory_int_830|) (= v_~__unbuffered_p2_EBX~0_103 v_~y~0_57) (= |v_P2Thread1of1ForFork0_#in~arg.offset_19| v_P2Thread1of1ForFork0_~arg.offset_19) (= |v_P2Thread1of1ForFork0_#t~nondet14_38| v_~weak$$choice0~0_120) (or (and (= .cse12 |v_P2_#t~mem17_65|) (= |v_P2_#t~mem17_65| v_~__unbuffered_p2_EAX~0_219) .cse14) (and .cse15 (= |v_P2Thread1of1ForFork0_#t~mem17_38| |v_P2_#t~mem17_65|) (= (ite .cse16 v_~x$w_buff0~0_402 v_~x$w_buff1~0_404) v_~__unbuffered_p2_EAX~0_219) (or .cse17 (not .cse18)) (or .cse17 (not .cse19)))) (= v_~x$w_buff1~0_403 v_~x$w_buff1~0_404) (= v_~__unbuffered_p2_EAX$read_delayed_var~0.base_134 |v_~#x~0.base_381|) (= |v_~#x~0.offset_377| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_134) (= v_~x$flush_delayed~0_154 0) (= v_~x$w_buff1_used~0_719 (ite (or .cse20 (and .cse7 .cse8)) 0 .cse21)) (= v_~__unbuffered_p2_EAX$read_delayed~0_125 1) (= (ite .cse20 0 .cse22) v_~x$r_buff0_thd3~0_317) (= v_~x$r_buff1_thd3~0_310 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_719 256) 0)) .cse8) (and .cse23 (not (= (mod v_~x$r_buff0_thd3~0_317 256) 0)))) 0 .cse24))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_402, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_19|, ~#x~0.offset=|v_~#x~0.offset_377|, ~x$w_buff1~0=v_~x$w_buff1~0_404, P2Thread1of1ForFork0_#t~mem17=|v_P2Thread1of1ForFork0_#t~mem17_38|, P2Thread1of1ForFork0_#t~nondet15=|v_P2Thread1of1ForFork0_#t~nondet15_38|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_312, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_721, P2Thread1of1ForFork0_#t~nondet14=|v_P2Thread1of1ForFork0_#t~nondet14_38|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_319, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_745, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_158|, #memory_int=|v_#memory_int_832|, ~#x~0.base=|v_~#x~0.base_381|, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_158|, ~y~0=v_~y~0_57, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_19|, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_38|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_401, P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_21|, P2Thread1of1ForFork0_#t~mem16=|v_P2Thread1of1ForFork0_#t~mem16_21|, ~x$flush_delayed~0=v_~x$flush_delayed~0_154, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_134, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_134, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_310, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_317, ~x$mem_tmp~0=v_~x$mem_tmp~0_124, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_19, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_21|, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_81|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_219, ~y~0=v_~y~0_57, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_103, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_19|, ~#x~0.offset=|v_~#x~0.offset_377|, ~x$w_buff1~0=v_~x$w_buff1~0_403, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_719, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_743, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_125, ~weak$$choice0~0=v_~weak$$choice0~0_120, #memory_int=|v_#memory_int_830|, ~#x~0.base=|v_~#x~0.base_381|, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_21|, ~weak$$choice2~0=v_~weak$$choice2~0_182, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_19|} AuxVars[|v_P2_#t~ite23_114|, |v_P2_#t~mem22_119|, |v_P2_#t~ite21_52|, |v_P2_#t~ite24_108|, |v_P2_#t~mem17_65|, |v_P2_#t~mem20_51|] AssignedVars[~x$w_buff0~0, P2Thread1of1ForFork0_#t~mem19, P2Thread1of1ForFork0_#t~mem16, ~x$flush_delayed~0, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, ~__unbuffered_p2_EAX$read_delayed_var~0.base, P2Thread1of1ForFork0_#t~mem17, ~x$r_buff1_thd3~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~nondet15, ~x$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet14, ~x$w_buff0_used~0, ~__unbuffered_p2_EAX$read_delayed~0, ~weak$$choice0~0, #memory_int, P2Thread1of1ForFork0_#t~mem22, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~mem20] and [701] $Ultimate##0-->L780: Formula: (let ((.cse16 (= (mod v_~x$w_buff0_used~0_658 256) 0)) (.cse14 (= (mod v_~x$w_buff1_used~0_634 256) 0)) (.cse4 (= (mod v_~x$r_buff0_thd1~0_181 256) 0)) (.cse12 (= (mod v_~x$r_buff1_thd1~0_184 256) 0))) (let ((.cse2 (and .cse4 .cse12)) (.cse9 (and .cse4 .cse14)) (.cse13 (select |v_#memory_int_739| |v_~#x~0.base_343|)) (.cse6 (not .cse4)) (.cse15 (not .cse16)) (.cse10 (= (mod v_~weak$$choice2~0_174 256) 0))) (let ((.cse1 (not .cse10)) (.cse5 (= (mod v_~x$w_buff1_used~0_633 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_657 256) 0)) (.cse8 (and .cse6 .cse15)) (.cse0 (select .cse13 |v_~#x~0.offset_339|)) (.cse7 (or .cse2 .cse9 .cse16))) (and (= .cse0 v_~x$mem_tmp~0_116) (= v_~x$w_buff0~0_356 v_~x$w_buff0~0_355) (= v_~x$flush_delayed~0_146 0) (= v_~weak$$choice2~0_174 |v_P0Thread1of1ForFork1_#t~nondet4_118|) (= v_~x$r_buff0_thd1~0_180 (ite .cse1 v_~x$r_buff0_thd1~0_181 (ite (or .cse2 .cse3 (and .cse4 .cse5)) v_~x$r_buff0_thd1~0_181 (ite (and .cse6 (not .cse3)) 0 v_~x$r_buff0_thd1~0_181)))) (= (ite .cse1 v_~x$w_buff0_used~0_658 (ite .cse7 v_~x$w_buff0_used~0_658 (ite .cse8 0 v_~x$w_buff0_used~0_658))) v_~x$w_buff0_used~0_657) (= v_~x$w_buff1~0_358 v_~x$w_buff1~0_357) (= v_~x$w_buff1_used~0_633 (ite .cse1 v_~x$w_buff1_used~0_634 (ite (or .cse2 .cse3 .cse9) v_~x$w_buff1_used~0_634 0))) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_19) (or (and (= v_~__unbuffered_p0_EAX~0_155 |v_P0_#t~mem9_87|) (= |v_P0_#t~ite10_88| |v_P0_#t~mem9_87|) .cse10) (and (= |v_P0Thread1of1ForFork1_#t~mem9_118| |v_P0_#t~mem9_87|) .cse1 (= |v_P0_#t~ite10_88| v_~x$mem_tmp~0_116))) (= (ite .cse1 v_~x$r_buff1_thd1~0_184 (ite (let ((.cse11 (= (mod v_~x$r_buff0_thd1~0_180 256) 0))) (or (and .cse11 .cse5) .cse3 (and .cse11 .cse12))) v_~x$r_buff1_thd1~0_184 0)) v_~x$r_buff1_thd1~0_183) (= (store |v_#memory_int_739| |v_~#x~0.base_343| (store .cse13 |v_~#x~0.offset_339| |v_P0_#t~ite10_88|)) |v_#memory_int_738|) (= v_~weak$$choice0~0_112 |v_P0Thread1of1ForFork1_#t~nondet3_118|) (= v_~y~0_43 1) (or (and (or .cse6 (not .cse14)) (or .cse6 (not .cse12)) (= |v_P0Thread1of1ForFork1_#t~mem6_118| |v_P0_#t~mem6_107|) (= (ite .cse8 v_~x$w_buff0~0_356 v_~x$w_buff1~0_358) v_~__unbuffered_p0_EAX~0_155) .cse15) (and (= v_~__unbuffered_p0_EAX~0_155 |v_P0_#t~mem6_107|) (= .cse0 |v_P0_#t~mem6_107|) .cse7)) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_19|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_356, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_181, ~#x~0.offset=|v_~#x~0.offset_339|, ~x$w_buff1~0=v_~x$w_buff1~0_358, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_634, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_184, P0Thread1of1ForFork1_#t~mem9=|v_P0Thread1of1ForFork1_#t~mem9_118|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_658, P0Thread1of1ForFork1_#t~mem6=|v_P0Thread1of1ForFork1_#t~mem6_118|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, #memory_int=|v_#memory_int_739|, ~#x~0.base=|v_~#x~0.base_343|, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_118|, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_118|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_355, P0Thread1of1ForFork1_#t~ite10=|v_P0Thread1of1ForFork1_#t~ite10_61|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_180, ~x$flush_delayed~0=v_~x$flush_delayed~0_146, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_183, ~x$mem_tmp~0=v_~x$mem_tmp~0_116, P0Thread1of1ForFork1_#t~mem8=|v_P0Thread1of1ForFork1_#t~mem8_61|, P0Thread1of1ForFork1_#t~mem5=|v_P0Thread1of1ForFork1_#t~mem5_61|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_155, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, ~y~0=v_~y~0_43, ~#x~0.offset=|v_~#x~0.offset_339|, ~x$w_buff1~0=v_~x$w_buff1~0_357, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_633, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_657, ~weak$$choice0~0=v_~weak$$choice0~0_112, P0Thread1of1ForFork1_#t~ite7=|v_P0Thread1of1ForFork1_#t~ite7_61|, #memory_int=|v_#memory_int_738|, ~#x~0.base=|v_~#x~0.base_343|, ~weak$$choice2~0=v_~weak$$choice2~0_174} AuxVars[|v_P0_#t~mem9_87|, |v_P0_#t~ite10_88|, |v_P0_#t~mem6_107|] AssignedVars[~x$w_buff0~0, P0Thread1of1ForFork1_#t~ite10, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~mem9, ~x$mem_tmp~0, P0Thread1of1ForFork1_#t~mem8, P0Thread1of1ForFork1_#t~mem5, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, P0Thread1of1ForFork1_#t~mem6, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#t~ite7, #memory_int, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4] [2022-12-13 00:54:42,340 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [721] $Ultimate##0-->P2EXIT: Formula: (let ((.cse15 (= (mod v_~x$r_buff1_thd3~0_318 256) 0)) (.cse14 (= (mod v_~x$w_buff1_used~0_727 256) 0)) (.cse28 (= (mod v_~x$w_buff0_used~0_751 256) 0)) (.cse25 (= (mod v_~x$r_buff0_thd3~0_325 256) 0))) (let ((.cse13 (not .cse25)) (.cse17 (not .cse28)) (.cse27 (and .cse25 .cse14)) (.cse26 (and .cse25 .cse15)) (.cse18 (= (mod v_~weak$$choice2~0_184 256) 0))) (let ((.cse19 (not .cse18)) (.cse12 (or .cse28 .cse27 .cse26)) (.cse16 (and .cse13 .cse17))) (let ((.cse11 (ite .cse19 v_~x$w_buff0_used~0_751 (ite .cse12 v_~x$w_buff0_used~0_751 (ite .cse16 0 v_~x$w_buff0_used~0_751))))) (let ((.cse23 (= (mod .cse11 256) 0))) (let ((.cse3 (ite .cse19 v_~x$w_buff1_used~0_727 (ite (or .cse23 .cse27 .cse26) v_~x$w_buff1_used~0_727 0)))) (let ((.cse22 (= (mod .cse3 256) 0)) (.cse10 (not .cse23))) (let ((.cse6 (ite .cse19 v_~x$r_buff0_thd3~0_325 (ite (or .cse23 (and .cse25 .cse22) .cse26) v_~x$r_buff0_thd3~0_325 (ite (and .cse13 .cse10) 0 v_~x$r_buff0_thd3~0_325))))) (let ((.cse24 (= (mod .cse6 256) 0))) (let ((.cse8 (ite .cse19 v_~x$r_buff1_thd3~0_318 (ite (or .cse23 (and .cse15 .cse24) (and .cse22 .cse24)) v_~x$r_buff1_thd3~0_318 0)))) (let ((.cse21 (= (mod .cse8 256) 0)) (.cse4 (select |v_#memory_int_838| |v_~#x~0.base_383|)) (.cse7 (not (= (mod v_~x$w_buff0_used~0_749 256) 0))) (.cse9 (not .cse24))) (let ((.cse0 (and .cse7 .cse9)) (.cse5 (select .cse4 |v_~#x~0.offset_379|)) (.cse1 (not .cse21)) (.cse2 (not .cse22))) (and (= |v_P2Thread1of1ForFork0_#t~nondet14_42| v_~weak$$choice0~0_122) (= v_~__unbuffered_p2_EAX$read_delayed_var~0.base_136 |v_~#x~0.base_383|) (= v_~x$w_buff1_used~0_725 (ite (or .cse0 (and .cse1 .cse2)) 0 .cse3)) (= v_~weak$$choice2~0_184 |v_P2Thread1of1ForFork0_#t~nondet15_42|) (= v_~x$w_buff1~0_408 v_~x$w_buff1~0_407) (= v_~__unbuffered_p2_EAX$read_delayed~0_127 1) (= |v_P2Thread1of1ForFork0_#in~arg.offset_21| v_P2Thread1of1ForFork0_~arg.offset_21) (= (store |v_#memory_int_838| |v_~#x~0.base_383| (store .cse4 |v_~#x~0.offset_379| |v_P2_#t~ite24_110|)) |v_#memory_int_836|) (= |v_P2Thread1of1ForFork0_#res.base_77| 0) (= .cse5 v_~x$mem_tmp~0_126) (= |v_~#x~0.offset_379| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_136) (= (ite .cse0 0 .cse6) v_~x$r_buff0_thd3~0_323) (= v_~x$flush_delayed~0_156 0) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_725 256) 0)) .cse1) (and (not (= (mod v_~x$r_buff0_thd3~0_323 256) 0)) .cse7)) 0 .cse8) v_~x$r_buff1_thd3~0_316) (= v_~x$w_buff0~0_406 v_~x$w_buff0~0_405) (= |v_P2Thread1of1ForFork0_#in~arg.base_21| v_P2Thread1of1ForFork0_~arg.base_21) (= (ite (and .cse9 .cse10) 0 .cse11) v_~x$w_buff0_used~0_749) (or (and (= .cse5 |v_P2_#t~mem17_67|) (= |v_P2_#t~mem17_67| v_~__unbuffered_p2_EAX~0_221) .cse12) (and (or .cse13 (not .cse14)) (= |v_P2Thread1of1ForFork0_#t~mem17_42| |v_P2_#t~mem17_67|) (or (not .cse15) .cse13) (= (ite .cse16 v_~x$w_buff0~0_406 v_~x$w_buff1~0_408) v_~__unbuffered_p2_EAX~0_221) .cse17)) (or (and (= |v_P2_#t~mem20_53| v_~__unbuffered_p2_EAX~0_221) .cse18 (= |v_P2_#t~ite21_54| |v_P2_#t~mem20_53|)) (and (= |v_P2_#t~ite21_54| v_~x$mem_tmp~0_126) (= |v_P2Thread1of1ForFork0_#t~mem20_42| |v_P2_#t~mem20_53|) .cse19)) (= |v_P2Thread1of1ForFork0_#res.offset_77| 0) (= v_~__unbuffered_cnt~0_591 (+ v_~__unbuffered_cnt~0_592 1)) (= v_~__unbuffered_p2_EBX~0_105 v_~y~0_59) (let ((.cse20 (= |v_P2Thread1of1ForFork0_#t~mem22_162| |v_P2_#t~mem22_121|))) (or (and (= v_~x$w_buff0~0_405 |v_P2_#t~ite24_110|) .cse20 (= |v_P2Thread1of1ForFork0_#t~ite23_162| |v_P2_#t~ite23_116|) .cse9 .cse10) (and (= |v_P2_#t~ite23_116| |v_P2_#t~ite24_110|) (or (and .cse20 (= v_~x$w_buff1~0_407 |v_P2_#t~ite23_116|) .cse1 .cse2) (and (= |v_P2_#t~mem22_121| |v_P2_#t~ite23_116|) (= |v_P2_#t~ite21_54| |v_P2_#t~mem22_121|) (or .cse21 .cse22))) (or .cse23 .cse24))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_406, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_21|, ~#x~0.offset=|v_~#x~0.offset_379|, ~x$w_buff1~0=v_~x$w_buff1~0_408, P2Thread1of1ForFork0_#t~mem17=|v_P2Thread1of1ForFork0_#t~mem17_42|, P2Thread1of1ForFork0_#t~nondet15=|v_P2Thread1of1ForFork0_#t~nondet15_42|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_318, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_727, P2Thread1of1ForFork0_#t~nondet14=|v_P2Thread1of1ForFork0_#t~nondet14_42|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_325, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_751, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_162|, #memory_int=|v_#memory_int_838|, ~#x~0.base=|v_~#x~0.base_383|, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_162|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_592, ~y~0=v_~y~0_59, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_21|, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_42|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_405, P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_23|, P2Thread1of1ForFork0_#t~mem16=|v_P2Thread1of1ForFork0_#t~mem16_23|, ~x$flush_delayed~0=v_~x$flush_delayed~0_156, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_136, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_136, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_316, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_323, ~x$mem_tmp~0=v_~x$mem_tmp~0_126, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_21, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_23|, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_83|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_221, ~y~0=v_~y~0_59, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_77|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_105, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_21|, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_77|, ~#x~0.offset=|v_~#x~0.offset_379|, ~x$w_buff1~0=v_~x$w_buff1~0_407, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_725, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_749, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_122, #memory_int=|v_#memory_int_836|, ~#x~0.base=|v_~#x~0.base_383|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_591, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_23|, ~weak$$choice2~0=v_~weak$$choice2~0_184, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_21|} AuxVars[|v_P2_#t~ite24_110|, |v_P2_#t~ite21_54|, |v_P2_#t~mem17_67|, |v_P2_#t~ite23_116|, |v_P2_#t~mem22_121|, |v_P2_#t~mem20_53|] AssignedVars[~x$w_buff0~0, P2Thread1of1ForFork0_#t~mem19, P2Thread1of1ForFork0_#t~mem16, ~x$flush_delayed~0, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, ~__unbuffered_p2_EAX$read_delayed_var~0.base, P2Thread1of1ForFork0_#t~mem17, ~x$r_buff1_thd3~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#res.offset, ~__unbuffered_p2_EBX~0, P2Thread1of1ForFork0_#res.base, ~x$w_buff1~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~nondet15, ~x$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet14, ~x$w_buff0_used~0, ~__unbuffered_p2_EAX$read_delayed~0, ~weak$$choice0~0, #memory_int, P2Thread1of1ForFork0_#t~mem22, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~mem20] and [701] $Ultimate##0-->L780: Formula: (let ((.cse16 (= (mod v_~x$w_buff0_used~0_658 256) 0)) (.cse14 (= (mod v_~x$w_buff1_used~0_634 256) 0)) (.cse4 (= (mod v_~x$r_buff0_thd1~0_181 256) 0)) (.cse12 (= (mod v_~x$r_buff1_thd1~0_184 256) 0))) (let ((.cse2 (and .cse4 .cse12)) (.cse9 (and .cse4 .cse14)) (.cse13 (select |v_#memory_int_739| |v_~#x~0.base_343|)) (.cse6 (not .cse4)) (.cse15 (not .cse16)) (.cse10 (= (mod v_~weak$$choice2~0_174 256) 0))) (let ((.cse1 (not .cse10)) (.cse5 (= (mod v_~x$w_buff1_used~0_633 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_657 256) 0)) (.cse8 (and .cse6 .cse15)) (.cse0 (select .cse13 |v_~#x~0.offset_339|)) (.cse7 (or .cse2 .cse9 .cse16))) (and (= .cse0 v_~x$mem_tmp~0_116) (= v_~x$w_buff0~0_356 v_~x$w_buff0~0_355) (= v_~x$flush_delayed~0_146 0) (= v_~weak$$choice2~0_174 |v_P0Thread1of1ForFork1_#t~nondet4_118|) (= v_~x$r_buff0_thd1~0_180 (ite .cse1 v_~x$r_buff0_thd1~0_181 (ite (or .cse2 .cse3 (and .cse4 .cse5)) v_~x$r_buff0_thd1~0_181 (ite (and .cse6 (not .cse3)) 0 v_~x$r_buff0_thd1~0_181)))) (= (ite .cse1 v_~x$w_buff0_used~0_658 (ite .cse7 v_~x$w_buff0_used~0_658 (ite .cse8 0 v_~x$w_buff0_used~0_658))) v_~x$w_buff0_used~0_657) (= v_~x$w_buff1~0_358 v_~x$w_buff1~0_357) (= v_~x$w_buff1_used~0_633 (ite .cse1 v_~x$w_buff1_used~0_634 (ite (or .cse2 .cse3 .cse9) v_~x$w_buff1_used~0_634 0))) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_19) (or (and (= v_~__unbuffered_p0_EAX~0_155 |v_P0_#t~mem9_87|) (= |v_P0_#t~ite10_88| |v_P0_#t~mem9_87|) .cse10) (and (= |v_P0Thread1of1ForFork1_#t~mem9_118| |v_P0_#t~mem9_87|) .cse1 (= |v_P0_#t~ite10_88| v_~x$mem_tmp~0_116))) (= (ite .cse1 v_~x$r_buff1_thd1~0_184 (ite (let ((.cse11 (= (mod v_~x$r_buff0_thd1~0_180 256) 0))) (or (and .cse11 .cse5) .cse3 (and .cse11 .cse12))) v_~x$r_buff1_thd1~0_184 0)) v_~x$r_buff1_thd1~0_183) (= (store |v_#memory_int_739| |v_~#x~0.base_343| (store .cse13 |v_~#x~0.offset_339| |v_P0_#t~ite10_88|)) |v_#memory_int_738|) (= v_~weak$$choice0~0_112 |v_P0Thread1of1ForFork1_#t~nondet3_118|) (= v_~y~0_43 1) (or (and (or .cse6 (not .cse14)) (or .cse6 (not .cse12)) (= |v_P0Thread1of1ForFork1_#t~mem6_118| |v_P0_#t~mem6_107|) (= (ite .cse8 v_~x$w_buff0~0_356 v_~x$w_buff1~0_358) v_~__unbuffered_p0_EAX~0_155) .cse15) (and (= v_~__unbuffered_p0_EAX~0_155 |v_P0_#t~mem6_107|) (= .cse0 |v_P0_#t~mem6_107|) .cse7)) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_19|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_356, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_181, ~#x~0.offset=|v_~#x~0.offset_339|, ~x$w_buff1~0=v_~x$w_buff1~0_358, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_634, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_184, P0Thread1of1ForFork1_#t~mem9=|v_P0Thread1of1ForFork1_#t~mem9_118|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_658, P0Thread1of1ForFork1_#t~mem6=|v_P0Thread1of1ForFork1_#t~mem6_118|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, #memory_int=|v_#memory_int_739|, ~#x~0.base=|v_~#x~0.base_343|, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_118|, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_118|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_355, P0Thread1of1ForFork1_#t~ite10=|v_P0Thread1of1ForFork1_#t~ite10_61|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_180, ~x$flush_delayed~0=v_~x$flush_delayed~0_146, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_183, ~x$mem_tmp~0=v_~x$mem_tmp~0_116, P0Thread1of1ForFork1_#t~mem8=|v_P0Thread1of1ForFork1_#t~mem8_61|, P0Thread1of1ForFork1_#t~mem5=|v_P0Thread1of1ForFork1_#t~mem5_61|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_155, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, ~y~0=v_~y~0_43, ~#x~0.offset=|v_~#x~0.offset_339|, ~x$w_buff1~0=v_~x$w_buff1~0_357, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_633, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_657, ~weak$$choice0~0=v_~weak$$choice0~0_112, P0Thread1of1ForFork1_#t~ite7=|v_P0Thread1of1ForFork1_#t~ite7_61|, #memory_int=|v_#memory_int_738|, ~#x~0.base=|v_~#x~0.base_343|, ~weak$$choice2~0=v_~weak$$choice2~0_174} AuxVars[|v_P0_#t~mem9_87|, |v_P0_#t~ite10_88|, |v_P0_#t~mem6_107|] AssignedVars[~x$w_buff0~0, P0Thread1of1ForFork1_#t~ite10, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~mem9, ~x$mem_tmp~0, P0Thread1of1ForFork1_#t~mem8, P0Thread1of1ForFork1_#t~mem5, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, P0Thread1of1ForFork1_#t~mem6, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#t~ite7, #memory_int, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4] [2022-12-13 00:54:45,614 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 00:54:45,616 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33280 [2022-12-13 00:54:45,616 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 261 flow [2022-12-13 00:54:45,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 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-13 00:54:45,616 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:45,617 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:45,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:54:45,617 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:54:45,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:45,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1273361002, now seen corresponding path program 1 times [2022-12-13 00:54:45,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:45,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577242017] [2022-12-13 00:54:45,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:45,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:54:45,672 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:54:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:54:45,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:54:45,740 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:54:45,741 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 00:54:45,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 00:54:45,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 00:54:45,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 00:54:45,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:54:45,743 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:45,747 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:54:45,747 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:54:45,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:54:45 BasicIcfg [2022-12-13 00:54:45,826 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:54:45,826 INFO L158 Benchmark]: Toolchain (without parser) took 62797.43ms. Allocated memory was 188.7MB in the beginning and 519.0MB in the end (delta: 330.3MB). Free memory was 162.7MB in the beginning and 428.7MB in the end (delta: -266.0MB). Peak memory consumption was 64.6MB. Max. memory is 8.0GB. [2022-12-13 00:54:45,826 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 188.7MB. Free memory is still 166.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:54:45,826 INFO L158 Benchmark]: CACSL2BoogieTranslator took 525.60ms. Allocated memory is still 188.7MB. Free memory was 162.7MB in the beginning and 135.1MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 00:54:45,827 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.13ms. Allocated memory is still 188.7MB. Free memory was 135.1MB in the beginning and 132.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:54:45,827 INFO L158 Benchmark]: Boogie Preprocessor took 53.78ms. Allocated memory is still 188.7MB. Free memory was 132.6MB in the beginning and 130.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:54:45,827 INFO L158 Benchmark]: RCFGBuilder took 959.45ms. Allocated memory is still 188.7MB. Free memory was 130.5MB in the beginning and 66.0MB in the end (delta: 64.5MB). Peak memory consumption was 65.0MB. Max. memory is 8.0GB. [2022-12-13 00:54:45,827 INFO L158 Benchmark]: TraceAbstraction took 61178.05ms. Allocated memory was 188.7MB in the beginning and 519.0MB in the end (delta: 330.3MB). Free memory was 64.9MB in the beginning and 428.7MB in the end (delta: -363.7MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:54:45,828 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 188.7MB. Free memory is still 166.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 525.60ms. Allocated memory is still 188.7MB. Free memory was 162.7MB in the beginning and 135.1MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 73.13ms. Allocated memory is still 188.7MB. Free memory was 135.1MB in the beginning and 132.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.78ms. Allocated memory is still 188.7MB. Free memory was 132.6MB in the beginning and 130.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 959.45ms. Allocated memory is still 188.7MB. Free memory was 130.5MB in the beginning and 66.0MB in the end (delta: 64.5MB). Peak memory consumption was 65.0MB. Max. memory is 8.0GB. * TraceAbstraction took 61178.05ms. Allocated memory was 188.7MB in the beginning and 519.0MB in the end (delta: 330.3MB). Free memory was 64.9MB in the beginning and 428.7MB in the end (delta: -363.7MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.3s, 118 PlacesBefore, 38 PlacesAfterwards, 109 TransitionsBefore, 29 TransitionsAfterwards, 1138 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 57 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 91 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1251, independent: 1182, independent conditional: 1182, independent unconditional: 0, dependent: 69, dependent conditional: 69, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1251, independent: 1182, independent conditional: 0, independent unconditional: 1182, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1251, independent: 1182, independent conditional: 0, independent unconditional: 1182, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1251, independent: 1182, independent conditional: 0, independent unconditional: 1182, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 957, independent: 923, independent conditional: 0, independent unconditional: 923, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 957, independent: 883, independent conditional: 0, independent unconditional: 883, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 74, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 350, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 280, dependent conditional: 0, dependent unconditional: 280, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1251, independent: 259, independent conditional: 0, independent unconditional: 259, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 957, unknown conditional: 0, unknown unconditional: 957] , Statistics on independence cache: Total cache size (in pairs): 1345, Positive cache size: 1311, Positive conditional cache size: 0, Positive unconditional cache size: 1311, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 35 PlacesBefore, 35 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 426 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 160, independent: 130, independent conditional: 130, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 160, independent: 130, independent conditional: 0, independent unconditional: 130, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 160, independent: 130, independent conditional: 0, independent unconditional: 130, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 160, independent: 130, independent conditional: 0, independent unconditional: 130, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 140, independent: 118, independent conditional: 0, independent unconditional: 118, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 140, independent: 100, independent conditional: 0, independent unconditional: 100, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 40, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 209, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 192, dependent conditional: 0, dependent unconditional: 192, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 160, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 140, unknown conditional: 0, unknown unconditional: 140] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 118, Positive conditional cache size: 0, Positive unconditional cache size: 118, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 422 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 154, independent: 126, independent conditional: 126, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 154, independent: 126, independent conditional: 7, independent unconditional: 119, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 154, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 154, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 154, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 118, Positive conditional cache size: 0, Positive unconditional cache size: 118, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 41 PlacesBefore, 41 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 157, independent: 134, independent conditional: 134, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 157, independent: 134, independent conditional: 23, independent unconditional: 111, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 157, independent: 134, independent conditional: 23, independent unconditional: 111, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 157, independent: 134, independent conditional: 23, independent unconditional: 111, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 10, independent conditional: 4, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 185, independent: 114, independent conditional: 114, independent unconditional: 0, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 157, independent: 124, independent conditional: 19, independent unconditional: 105, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 16, unknown conditional: 4, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 128, Positive conditional cache size: 4, Positive unconditional cache size: 124, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 46 PlacesBefore, 46 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 544 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 112, independent: 88, independent conditional: 88, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 112, independent: 88, independent conditional: 39, independent unconditional: 49, dependent: 24, dependent conditional: 4, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 112, independent: 88, independent conditional: 28, independent unconditional: 60, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 112, independent: 88, independent conditional: 28, independent unconditional: 60, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 8, independent conditional: 5, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 171, independent: 62, independent conditional: 62, independent unconditional: 0, dependent: 109, dependent conditional: 0, dependent unconditional: 109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 112, independent: 80, independent conditional: 23, independent unconditional: 57, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 13, unknown conditional: 5, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 169, Positive cache size: 136, Positive conditional cache size: 9, Positive unconditional cache size: 127, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 50 PlacesBefore, 50 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 644 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 274, independent: 258, independent conditional: 258, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 274, independent: 258, independent conditional: 172, independent unconditional: 86, dependent: 16, dependent conditional: 4, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 274, independent: 258, independent conditional: 141, independent unconditional: 117, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 274, independent: 258, independent conditional: 141, independent unconditional: 117, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 55, independent: 54, independent conditional: 33, independent unconditional: 21, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 55, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 140, independent: 138, independent conditional: 138, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 274, independent: 204, independent conditional: 108, independent unconditional: 96, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 55, unknown conditional: 33, unknown unconditional: 22] , Statistics on independence cache: Total cache size (in pairs): 224, Positive cache size: 190, Positive conditional cache size: 42, Positive unconditional cache size: 148, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 35, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 632 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 290, independent: 271, independent conditional: 271, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 290, independent: 271, independent conditional: 218, independent unconditional: 53, dependent: 19, dependent conditional: 4, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 294, independent: 271, independent conditional: 208, independent unconditional: 63, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 294, independent: 271, independent conditional: 208, independent unconditional: 63, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 294, independent: 271, independent conditional: 208, independent unconditional: 63, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 190, Positive conditional cache size: 42, Positive unconditional cache size: 148, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.8s, 56 PlacesBefore, 52 PlacesAfterwards, 55 TransitionsBefore, 48 TransitionsAfterwards, 530 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 334, independent: 294, independent conditional: 294, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 334, independent: 294, independent conditional: 197, independent unconditional: 97, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 334, independent: 294, independent conditional: 197, independent unconditional: 97, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 334, independent: 294, independent conditional: 197, independent unconditional: 97, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 39, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 39, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 334, independent: 257, independent conditional: 160, independent unconditional: 97, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 39, unknown conditional: 37, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 316, Positive cache size: 279, Positive conditional cache size: 94, Positive unconditional cache size: 185, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 48 PlacesBefore, 47 PlacesAfterwards, 44 TransitionsBefore, 43 TransitionsAfterwards, 322 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 46, independent: 46, independent conditional: 32, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 46, independent conditional: 32, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 46, independent conditional: 32, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, independent: 46, independent conditional: 32, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 330, Positive cache size: 293, Positive conditional cache size: 94, Positive unconditional cache size: 199, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 33.2s, 45 PlacesBefore, 41 PlacesAfterwards, 36 TransitionsBefore, 32 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 161, independent: 161, independent conditional: 161, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 161, independent: 161, independent conditional: 161, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 161, independent: 161, independent conditional: 161, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 161, independent: 161, independent conditional: 161, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 161, independent: 156, independent conditional: 156, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 369, Positive cache size: 332, Positive conditional cache size: 99, Positive unconditional cache size: 233, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 int __unbuffered_p2_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L851] 0 pthread_t t2461; [L852] FCALL, FORK 0 pthread_create(&t2461, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2461, ((void *)0), P0, ((void *)0))=-2, t2461={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2462; [L854] FCALL, FORK 0 pthread_create(&t2462, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2462, ((void *)0), P1, ((void *)0))=-1, t2461={7:0}, t2462={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L855] 0 pthread_t t2463; [L856] FCALL, FORK 0 pthread_create(&t2463, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2463, ((void *)0), P2, ((void *)0))=0, t2461={7:0}, t2462={5:0}, t2463={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L808] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 3 x$flush_delayed = weak$$choice2 [L811] EXPR 3 \read(x) [L811] 3 x$mem_tmp = x [L812] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L812] EXPR 3 \read(x) [L812] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L812] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L813] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L814] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L815] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L816] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L818] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L820] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L821] EXPR 3 \read(x) [L821] 3 __unbuffered_p2_EAX = x [L822] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L822] 3 x = x$flush_delayed ? x$mem_tmp : x [L823] 3 x$flush_delayed = (_Bool)0 [L826] 3 __unbuffered_p2_EBX = y [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L829] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L829] EXPR 3 \read(x) [L829] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L829] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L830] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L831] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L832] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L833] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L761] 3 y = 1 [L766] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 3 x$flush_delayed = weak$$choice2 [L769] EXPR 3 \read(x) [L769] 3 x$mem_tmp = x [L770] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] EXPR 3 \read(x) [L770] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] 3 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L771] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L772] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L773] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L774] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 3 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L776] 3 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 3 \read(x) [L777] 3 __unbuffered_p0_EAX = x [L778] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L778] EXPR 3 \read(x) [L778] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L778] 3 x = x$flush_delayed ? x$mem_tmp : x [L779] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L836] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L791] 2 x = 1 [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L794] EXPR 2 \read(x) [L794] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L795] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L796] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L797] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L798] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 2 main$tmp_guard0 = __unbuffered_cnt == 3 [L860] CALL 2 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 2 !(!cond) [L860] RET 2 assume_abort_if_not(main$tmp_guard0) [L862] EXPR 2 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] EXPR 2 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L862] EXPR 2 \read(x) [L862] EXPR 2 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L862] EXPR 2 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] 2 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L863] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L864] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L865] 2 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L866] 2 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L869] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L870] EXPR 2 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] EXPR 2 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L870] EXPR 2 \read(*__unbuffered_p2_EAX$read_delayed_var) [L870] EXPR 2 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L870] EXPR 2 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] 2 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L871] 2 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] CALL 2 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 2 !expression [L19] 2 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - UnprovableResult [Line: 856]: 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: 854]: 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: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 148 locations, 4 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: 61.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 395 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 395 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 714 IncrementalHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 0 mSDtfsCounter, 714 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=379occurred in iteration=7, InterpolantAutomatonStates: 38, 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.5s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 1154 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 00:54:45,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...